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/dll2n_insert_equal_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 22:01:40,195 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 22:01:40,197 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 22:01:40,211 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 22:01:40,213 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 22:01:40,214 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 22:01:40,215 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 22:01:40,217 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 22:01:40,220 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 22:01:40,221 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 22:01:40,224 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 22:01:40,224 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 22:01:40,226 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 22:01:40,227 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 22:01:40,235 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 22:01:40,236 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 22:01:40,237 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 22:01:40,241 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 22:01:40,246 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 22:01:40,247 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 22:01:40,250 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 22:01:40,252 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 22:01:40,256 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 22:01:40,256 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 22:01:40,256 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 22:01:40,257 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 22:01:40,258 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 22:01:40,259 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 22:01:40,260 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 22:01:40,261 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 22:01:40,261 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 22:01:40,262 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 22:01:40,262 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 22:01:40,262 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 22:01:40,263 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 22:01:40,264 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 22:01:40,264 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:01:40,291 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 22:01:40,291 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 22:01:40,292 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 22:01:40,293 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 22:01:40,297 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 22:01:40,297 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 22:01:40,299 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 22:01:40,299 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 22:01:40,299 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 22:01:40,299 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 22:01:40,299 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 22:01:40,299 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 22:01:40,300 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 22:01:40,301 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 22:01:40,301 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 22:01:40,301 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 22:01:40,301 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 22:01:40,301 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 22:01:40,302 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 22:01:40,302 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 22:01:40,302 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 22:01:40,302 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 22:01:40,302 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 22:01:40,304 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 22:01:40,304 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:01:40,304 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 22:01:40,305 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 22:01:40,305 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 22:01:40,305 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 22:01:40,305 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 22:01:40,305 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 22:01:40,306 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 22:01:40,306 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 22:01:40,360 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 22:01:40,373 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 22:01:40,377 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 22:01:40,379 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 22:01:40,379 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 22:01:40,380 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_insert_equal_true-unreach-call_true-valid-memsafety.i [2018-11-18 22:01:40,442 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb8080f6a/98017caca5c747d888f5472b8617394a/FLAGb1d2cacbb [2018-11-18 22:01:41,020 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 22:01:41,021 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_insert_equal_true-unreach-call_true-valid-memsafety.i [2018-11-18 22:01:41,035 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb8080f6a/98017caca5c747d888f5472b8617394a/FLAGb1d2cacbb [2018-11-18 22:01:41,247 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb8080f6a/98017caca5c747d888f5472b8617394a [2018-11-18 22:01:41,257 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 22:01:41,259 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 22:01:41,260 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 22:01:41,260 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 22:01:41,264 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 22:01:41,266 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:01:41" (1/1) ... [2018-11-18 22:01:41,269 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a91b385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:01:41, skipping insertion in model container [2018-11-18 22:01:41,269 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:01:41" (1/1) ... [2018-11-18 22:01:41,279 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 22:01:41,347 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 22:01:41,817 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:01:41,840 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 22:01:41,949 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:01:42,111 INFO L195 MainTranslator]: Completed translation [2018-11-18 22:01:42,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:01:42 WrapperNode [2018-11-18 22:01:42,112 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 22:01:42,113 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 22:01:42,113 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 22:01:42,113 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 22:01:42,129 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:01:42" (1/1) ... [2018-11-18 22:01:42,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:01:42" (1/1) ... [2018-11-18 22:01:42,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:01:42" (1/1) ... [2018-11-18 22:01:42,167 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:01:42" (1/1) ... [2018-11-18 22:01:42,228 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:01:42" (1/1) ... [2018-11-18 22:01:42,240 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:01:42" (1/1) ... [2018-11-18 22:01:42,250 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:01:42" (1/1) ... [2018-11-18 22:01:42,268 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 22:01:42,268 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 22:01:42,268 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 22:01:42,269 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 22:01:42,269 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:01:42" (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:01:42,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 22:01:42,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 22:01:42,338 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-18 22:01:42,338 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-18 22:01:42,338 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-18 22:01:42,338 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-18 22:01:42,338 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-11-18 22:01:42,339 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2018-11-18 22:01:42,339 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert [2018-11-18 22:01:42,339 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 22:01:42,339 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 22:01:42,339 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-18 22:01:42,340 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-18 22:01:42,340 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-18 22:01:42,340 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-18 22:01:42,341 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-18 22:01:42,341 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-18 22:01:42,341 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-18 22:01:42,341 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-18 22:01:42,341 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-18 22:01:42,342 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-18 22:01:42,342 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-18 22:01:42,342 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-18 22:01:42,342 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-18 22:01:42,342 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-18 22:01:42,343 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-18 22:01:42,343 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-18 22:01:42,343 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-18 22:01:42,343 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-18 22:01:42,344 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-18 22:01:42,344 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-18 22:01:42,344 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-18 22:01:42,344 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-18 22:01:42,345 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-18 22:01:42,345 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-18 22:01:42,345 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-18 22:01:42,345 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-18 22:01:42,345 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-18 22:01:42,345 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-18 22:01:42,346 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-18 22:01:42,346 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-18 22:01:42,346 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-18 22:01:42,346 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-18 22:01:42,346 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-18 22:01:42,346 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-18 22:01:42,347 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-18 22:01:42,347 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-18 22:01:42,347 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-18 22:01:42,347 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-18 22:01:42,347 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-18 22:01:42,348 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-18 22:01:42,348 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-18 22:01:42,348 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-18 22:01:42,348 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-18 22:01:42,348 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-18 22:01:42,348 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-18 22:01:42,349 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-18 22:01:42,349 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-18 22:01:42,349 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-18 22:01:42,349 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-18 22:01:42,349 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-18 22:01:42,349 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-18 22:01:42,350 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-18 22:01:42,350 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-18 22:01:42,350 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-18 22:01:42,350 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-18 22:01:42,350 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-18 22:01:42,350 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-18 22:01:42,350 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-18 22:01:42,351 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-18 22:01:42,351 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-18 22:01:42,351 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-18 22:01:42,351 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-18 22:01:42,351 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-18 22:01:42,351 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-18 22:01:42,352 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-18 22:01:42,352 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 22:01:42,352 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-18 22:01:42,352 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-18 22:01:42,352 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-18 22:01:42,352 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-18 22:01:42,352 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-18 22:01:42,353 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-18 22:01:42,353 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-18 22:01:42,353 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-18 22:01:42,353 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-18 22:01:42,353 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-18 22:01:42,353 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-18 22:01:42,353 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-18 22:01:42,354 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-18 22:01:42,354 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-18 22:01:42,354 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-18 22:01:42,354 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-18 22:01:42,354 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-18 22:01:42,354 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-18 22:01:42,354 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-18 22:01:42,355 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-18 22:01:42,355 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-18 22:01:42,355 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-18 22:01:42,355 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-18 22:01:42,355 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-18 22:01:42,355 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-18 22:01:42,356 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-18 22:01:42,356 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-18 22:01:42,356 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-18 22:01:42,356 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-18 22:01:42,356 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-18 22:01:42,356 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-18 22:01:42,356 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-18 22:01:42,357 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-18 22:01:42,357 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-18 22:01:42,357 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-18 22:01:42,357 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-18 22:01:42,357 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-18 22:01:42,357 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-18 22:01:42,358 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-18 22:01:42,358 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-18 22:01:42,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 22:01:42,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 22:01:42,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-18 22:01:42,358 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-11-18 22:01:42,359 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2018-11-18 22:01:42,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 22:01:42,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 22:01:42,359 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert [2018-11-18 22:01:42,359 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 22:01:42,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-18 22:01:42,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 22:01:42,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 22:01:42,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-18 22:01:43,721 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 22:01:43,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:01:43 BoogieIcfgContainer [2018-11-18 22:01:43,722 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 22:01:43,723 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 22:01:43,723 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 22:01:43,726 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 22:01:43,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:01:41" (1/3) ... [2018-11-18 22:01:43,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f097f09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:01:43, skipping insertion in model container [2018-11-18 22:01:43,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:01:42" (2/3) ... [2018-11-18 22:01:43,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f097f09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:01:43, skipping insertion in model container [2018-11-18 22:01:43,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:01:43" (3/3) ... [2018-11-18 22:01:43,730 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_insert_equal_true-unreach-call_true-valid-memsafety.i [2018-11-18 22:01:43,741 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 22:01:43,749 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 22:01:43,767 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 22:01:43,801 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 22:01:43,802 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 22:01:43,803 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 22:01:43,803 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 22:01:43,803 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 22:01:43,803 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 22:01:43,803 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 22:01:43,803 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 22:01:43,804 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 22:01:43,822 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2018-11-18 22:01:43,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 22:01:43,831 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:01:43,832 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:01:43,834 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:01:43,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:01:43,841 INFO L82 PathProgramCache]: Analyzing trace with hash 734736689, now seen corresponding path program 1 times [2018-11-18 22:01:43,846 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:01:43,847 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:01:43,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:01:43,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:01:44,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:01:44,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:01:44,177 INFO L256 TraceCheckUtils]: 0: Hoare triple {60#true} call ULTIMATE.init(); {60#true} is VALID [2018-11-18 22:01:44,181 INFO L273 TraceCheckUtils]: 1: Hoare triple {60#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {60#true} is VALID [2018-11-18 22:01:44,182 INFO L273 TraceCheckUtils]: 2: Hoare triple {60#true} assume true; {60#true} is VALID [2018-11-18 22:01:44,182 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {60#true} {60#true} #151#return; {60#true} is VALID [2018-11-18 22:01:44,183 INFO L256 TraceCheckUtils]: 4: Hoare triple {60#true} call #t~ret19 := main(); {60#true} is VALID [2018-11-18 22:01:44,183 INFO L273 TraceCheckUtils]: 5: Hoare triple {60#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); {60#true} is VALID [2018-11-18 22:01:44,183 INFO L256 TraceCheckUtils]: 6: Hoare triple {60#true} call #t~ret13.base, #t~ret13.offset := dll_create(~len~0, ~data~0); {60#true} is VALID [2018-11-18 22:01:44,184 INFO L273 TraceCheckUtils]: 7: Hoare triple {60#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {60#true} is VALID [2018-11-18 22:01:44,185 INFO L273 TraceCheckUtils]: 8: Hoare triple {60#true} assume !true; {61#false} is VALID [2018-11-18 22:01:44,186 INFO L273 TraceCheckUtils]: 9: Hoare triple {61#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {61#false} is VALID [2018-11-18 22:01:44,186 INFO L273 TraceCheckUtils]: 10: Hoare triple {61#false} assume true; {61#false} is VALID [2018-11-18 22:01:44,186 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {61#false} {60#true} #143#return; {61#false} is VALID [2018-11-18 22:01:44,186 INFO L273 TraceCheckUtils]: 12: Hoare triple {61#false} call write~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret13.base, #t~ret13.offset; {61#false} is VALID [2018-11-18 22:01:44,187 INFO L256 TraceCheckUtils]: 13: Hoare triple {61#false} call dll_insert(~#s~0.base, ~#s~0.offset, ~data~0, ~bvsdiv32(~len~0, 2bv32)); {61#false} is VALID [2018-11-18 22:01:44,187 INFO L273 TraceCheckUtils]: 14: Hoare triple {61#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {61#false} is VALID [2018-11-18 22:01:44,187 INFO L256 TraceCheckUtils]: 15: Hoare triple {61#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {61#false} is VALID [2018-11-18 22:01:44,188 INFO L273 TraceCheckUtils]: 16: Hoare triple {61#false} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {61#false} is VALID [2018-11-18 22:01:44,188 INFO L273 TraceCheckUtils]: 17: Hoare triple {61#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {61#false} is VALID [2018-11-18 22:01:44,188 INFO L273 TraceCheckUtils]: 18: Hoare triple {61#false} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {61#false} is VALID [2018-11-18 22:01:44,189 INFO L273 TraceCheckUtils]: 19: Hoare triple {61#false} assume true; {61#false} is VALID [2018-11-18 22:01:44,189 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {61#false} {61#false} #139#return; {61#false} is VALID [2018-11-18 22:01:44,189 INFO L273 TraceCheckUtils]: 21: Hoare triple {61#false} ~new_node~0.base, ~new_node~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0bv32, 0bv32;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~last~0.base, ~last~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {61#false} is VALID [2018-11-18 22:01:44,190 INFO L273 TraceCheckUtils]: 22: Hoare triple {61#false} assume !true; {61#false} is VALID [2018-11-18 22:01:44,190 INFO L273 TraceCheckUtils]: 23: Hoare triple {61#false} assume ~snd_to_last~0.base != 0bv32 || ~snd_to_last~0.offset != 0bv32;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~snd_to_last~0.base, ~bvadd32(4bv32, ~snd_to_last~0.offset), 4bv32);call write~$Pointer$(~snd_to_last~0.base, ~snd_to_last~0.offset, ~new_node~0.base, ~bvadd32(8bv32, ~new_node~0.offset), 4bv32);call write~$Pointer$(~last~0.base, ~last~0.offset, ~new_node~0.base, ~bvadd32(4bv32, ~new_node~0.offset), 4bv32); {61#false} is VALID [2018-11-18 22:01:44,190 INFO L273 TraceCheckUtils]: 24: Hoare triple {61#false} assume ~last~0.base != 0bv32 || ~last~0.offset != 0bv32;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~last~0.base, ~bvadd32(8bv32, ~last~0.offset), 4bv32); {61#false} is VALID [2018-11-18 22:01:44,190 INFO L273 TraceCheckUtils]: 25: Hoare triple {61#false} assume true; {61#false} is VALID [2018-11-18 22:01:44,191 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {61#false} {61#false} #145#return; {61#false} is VALID [2018-11-18 22:01:44,191 INFO L273 TraceCheckUtils]: 27: Hoare triple {61#false} call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset;~count~0 := 0bv32; {61#false} is VALID [2018-11-18 22:01:44,191 INFO L273 TraceCheckUtils]: 28: Hoare triple {61#false} assume !true; {61#false} is VALID [2018-11-18 22:01:44,191 INFO L273 TraceCheckUtils]: 29: Hoare triple {61#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {61#false} is VALID [2018-11-18 22:01:44,192 INFO L273 TraceCheckUtils]: 30: Hoare triple {61#false} assume !false; {61#false} is VALID [2018-11-18 22:01:44,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:01:44,199 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:01:44,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:01:44,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 22:01:44,212 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 31 [2018-11-18 22:01:44,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:01:44,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 22:01:44,365 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:01:44,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 22:01:44,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 22:01:44,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 22:01:44,382 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 2 states. [2018-11-18 22:01:45,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:01:45,181 INFO L93 Difference]: Finished difference Result 99 states and 125 transitions. [2018-11-18 22:01:45,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 22:01:45,181 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 31 [2018-11-18 22:01:45,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:01:45,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:01:45,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 125 transitions. [2018-11-18 22:01:45,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:01:45,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 125 transitions. [2018-11-18 22:01:45,206 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 125 transitions. [2018-11-18 22:01:45,650 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:01:45,664 INFO L225 Difference]: With dead ends: 99 [2018-11-18 22:01:45,665 INFO L226 Difference]: Without dead ends: 42 [2018-11-18 22:01:45,669 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 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:01:45,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-18 22:01:45,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-18 22:01:45,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:01:45,721 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2018-11-18 22:01:45,722 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-18 22:01:45,722 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-18 22:01:45,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:01:45,728 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2018-11-18 22:01:45,728 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-11-18 22:01:45,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:01:45,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:01:45,729 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-18 22:01:45,729 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-18 22:01:45,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:01:45,735 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2018-11-18 22:01:45,735 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-11-18 22:01:45,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:01:45,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:01:45,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:01:45,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:01:45,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-18 22:01:45,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2018-11-18 22:01:45,741 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 31 [2018-11-18 22:01:45,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:01:45,742 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2018-11-18 22:01:45,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 22:01:45,742 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-11-18 22:01:45,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 22:01:45,744 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:01:45,744 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:01:45,744 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:01:45,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:01:45,745 INFO L82 PathProgramCache]: Analyzing trace with hash 64953785, now seen corresponding path program 1 times [2018-11-18 22:01:45,745 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:01:45,746 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:01:45,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:01:45,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:01:45,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:01:45,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:01:46,007 INFO L256 TraceCheckUtils]: 0: Hoare triple {425#true} call ULTIMATE.init(); {425#true} is VALID [2018-11-18 22:01:46,008 INFO L273 TraceCheckUtils]: 1: Hoare triple {425#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {425#true} is VALID [2018-11-18 22:01:46,008 INFO L273 TraceCheckUtils]: 2: Hoare triple {425#true} assume true; {425#true} is VALID [2018-11-18 22:01:46,008 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {425#true} {425#true} #151#return; {425#true} is VALID [2018-11-18 22:01:46,009 INFO L256 TraceCheckUtils]: 4: Hoare triple {425#true} call #t~ret19 := main(); {425#true} is VALID [2018-11-18 22:01:46,009 INFO L273 TraceCheckUtils]: 5: Hoare triple {425#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); {425#true} is VALID [2018-11-18 22:01:46,009 INFO L256 TraceCheckUtils]: 6: Hoare triple {425#true} call #t~ret13.base, #t~ret13.offset := dll_create(~len~0, ~data~0); {425#true} is VALID [2018-11-18 22:01:46,009 INFO L273 TraceCheckUtils]: 7: Hoare triple {425#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {425#true} is VALID [2018-11-18 22:01:46,010 INFO L273 TraceCheckUtils]: 8: Hoare triple {425#true} assume true; {425#true} is VALID [2018-11-18 22:01:46,010 INFO L273 TraceCheckUtils]: 9: Hoare triple {425#true} assume !~bvsgt32(~len, 0bv32); {425#true} is VALID [2018-11-18 22:01:46,010 INFO L273 TraceCheckUtils]: 10: Hoare triple {425#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {425#true} is VALID [2018-11-18 22:01:46,011 INFO L273 TraceCheckUtils]: 11: Hoare triple {425#true} assume true; {425#true} is VALID [2018-11-18 22:01:46,011 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {425#true} {425#true} #143#return; {425#true} is VALID [2018-11-18 22:01:46,011 INFO L273 TraceCheckUtils]: 13: Hoare triple {425#true} call write~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret13.base, #t~ret13.offset; {425#true} is VALID [2018-11-18 22:01:46,012 INFO L256 TraceCheckUtils]: 14: Hoare triple {425#true} call dll_insert(~#s~0.base, ~#s~0.offset, ~data~0, ~bvsdiv32(~len~0, 2bv32)); {425#true} is VALID [2018-11-18 22:01:46,012 INFO L273 TraceCheckUtils]: 15: Hoare triple {425#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {425#true} is VALID [2018-11-18 22:01:46,012 INFO L256 TraceCheckUtils]: 16: Hoare triple {425#true} call #t~ret6.base, #t~ret6.offset := node_create(~data); {425#true} is VALID [2018-11-18 22:01:46,013 INFO L273 TraceCheckUtils]: 17: Hoare triple {425#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {425#true} is VALID [2018-11-18 22:01:46,013 INFO L273 TraceCheckUtils]: 18: Hoare triple {425#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {425#true} is VALID [2018-11-18 22:01:46,013 INFO L273 TraceCheckUtils]: 19: Hoare triple {425#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {425#true} is VALID [2018-11-18 22:01:46,014 INFO L273 TraceCheckUtils]: 20: Hoare triple {425#true} assume true; {425#true} is VALID [2018-11-18 22:01:46,014 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {425#true} {425#true} #139#return; {425#true} is VALID [2018-11-18 22:01:46,022 INFO L273 TraceCheckUtils]: 22: Hoare triple {425#true} ~new_node~0.base, ~new_node~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0bv32, 0bv32;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~last~0.base, ~last~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {496#(and (= dll_insert_~snd_to_last~0.offset (_ bv0 32)) (= dll_insert_~snd_to_last~0.base (_ bv0 32)))} is VALID [2018-11-18 22:01:46,023 INFO L273 TraceCheckUtils]: 23: Hoare triple {496#(and (= dll_insert_~snd_to_last~0.offset (_ bv0 32)) (= dll_insert_~snd_to_last~0.base (_ bv0 32)))} assume true; {496#(and (= dll_insert_~snd_to_last~0.offset (_ bv0 32)) (= dll_insert_~snd_to_last~0.base (_ bv0 32)))} is VALID [2018-11-18 22:01:46,023 INFO L273 TraceCheckUtils]: 24: Hoare triple {496#(and (= dll_insert_~snd_to_last~0.offset (_ bv0 32)) (= dll_insert_~snd_to_last~0.base (_ bv0 32)))} assume !~bvsgt32(~index, 0bv32); {496#(and (= dll_insert_~snd_to_last~0.offset (_ bv0 32)) (= dll_insert_~snd_to_last~0.base (_ bv0 32)))} is VALID [2018-11-18 22:01:46,024 INFO L273 TraceCheckUtils]: 25: Hoare triple {496#(and (= dll_insert_~snd_to_last~0.offset (_ bv0 32)) (= dll_insert_~snd_to_last~0.base (_ bv0 32)))} assume ~snd_to_last~0.base != 0bv32 || ~snd_to_last~0.offset != 0bv32;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~snd_to_last~0.base, ~bvadd32(4bv32, ~snd_to_last~0.offset), 4bv32);call write~$Pointer$(~snd_to_last~0.base, ~snd_to_last~0.offset, ~new_node~0.base, ~bvadd32(8bv32, ~new_node~0.offset), 4bv32);call write~$Pointer$(~last~0.base, ~last~0.offset, ~new_node~0.base, ~bvadd32(4bv32, ~new_node~0.offset), 4bv32); {426#false} is VALID [2018-11-18 22:01:46,025 INFO L273 TraceCheckUtils]: 26: Hoare triple {426#false} assume ~last~0.base != 0bv32 || ~last~0.offset != 0bv32;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~last~0.base, ~bvadd32(8bv32, ~last~0.offset), 4bv32); {426#false} is VALID [2018-11-18 22:01:46,025 INFO L273 TraceCheckUtils]: 27: Hoare triple {426#false} assume true; {426#false} is VALID [2018-11-18 22:01:46,025 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {426#false} {425#true} #145#return; {426#false} is VALID [2018-11-18 22:01:46,025 INFO L273 TraceCheckUtils]: 29: Hoare triple {426#false} call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset;~count~0 := 0bv32; {426#false} is VALID [2018-11-18 22:01:46,026 INFO L273 TraceCheckUtils]: 30: Hoare triple {426#false} assume true; {426#false} is VALID [2018-11-18 22:01:46,026 INFO L273 TraceCheckUtils]: 31: Hoare triple {426#false} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {426#false} is VALID [2018-11-18 22:01:46,026 INFO L273 TraceCheckUtils]: 32: Hoare triple {426#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {426#false} is VALID [2018-11-18 22:01:46,027 INFO L273 TraceCheckUtils]: 33: Hoare triple {426#false} assume !false; {426#false} is VALID [2018-11-18 22:01:46,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:01:46,030 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:01:46,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:01:46,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 22:01:46,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-18 22:01:46,036 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:01:46,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 22:01:46,136 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:01:46,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 22:01:46,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 22:01:46,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 22:01:46,137 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 3 states. [2018-11-18 22:01:46,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:01:46,638 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2018-11-18 22:01:46,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 22:01:46,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-18 22:01:46,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:01:46,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:01:46,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2018-11-18 22:01:46,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:01:46,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2018-11-18 22:01:46,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 68 transitions. [2018-11-18 22:01:47,017 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:01:47,021 INFO L225 Difference]: With dead ends: 57 [2018-11-18 22:01:47,021 INFO L226 Difference]: Without dead ends: 47 [2018-11-18 22:01:47,022 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 22:01:47,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-18 22:01:47,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-11-18 22:01:47,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:01:47,064 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 45 states. [2018-11-18 22:01:47,064 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 45 states. [2018-11-18 22:01:47,064 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 45 states. [2018-11-18 22:01:47,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:01:47,068 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2018-11-18 22:01:47,069 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-11-18 22:01:47,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:01:47,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:01:47,070 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 47 states. [2018-11-18 22:01:47,070 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 47 states. [2018-11-18 22:01:47,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:01:47,074 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2018-11-18 22:01:47,074 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-11-18 22:01:47,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:01:47,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:01:47,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:01:47,076 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:01:47,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-18 22:01:47,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2018-11-18 22:01:47,079 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 34 [2018-11-18 22:01:47,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:01:47,079 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2018-11-18 22:01:47,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 22:01:47,080 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2018-11-18 22:01:47,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 22:01:47,081 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:01:47,081 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:01:47,082 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:01:47,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:01:47,082 INFO L82 PathProgramCache]: Analyzing trace with hash -974925891, now seen corresponding path program 1 times [2018-11-18 22:01:47,083 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:01:47,083 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:01:47,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:01:47,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:01:47,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:01:47,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:01:47,364 INFO L256 TraceCheckUtils]: 0: Hoare triple {757#true} call ULTIMATE.init(); {757#true} is VALID [2018-11-18 22:01:47,365 INFO L273 TraceCheckUtils]: 1: Hoare triple {757#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {757#true} is VALID [2018-11-18 22:01:47,366 INFO L273 TraceCheckUtils]: 2: Hoare triple {757#true} assume true; {757#true} is VALID [2018-11-18 22:01:47,366 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {757#true} {757#true} #151#return; {757#true} is VALID [2018-11-18 22:01:47,366 INFO L256 TraceCheckUtils]: 4: Hoare triple {757#true} call #t~ret19 := main(); {757#true} is VALID [2018-11-18 22:01:47,367 INFO L273 TraceCheckUtils]: 5: Hoare triple {757#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); {777#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:01:47,367 INFO L256 TraceCheckUtils]: 6: Hoare triple {777#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := dll_create(~len~0, ~data~0); {757#true} is VALID [2018-11-18 22:01:47,368 INFO L273 TraceCheckUtils]: 7: Hoare triple {757#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {784#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-18 22:01:47,368 INFO L273 TraceCheckUtils]: 8: Hoare triple {784#(= dll_create_~len |dll_create_#in~len|)} assume true; {784#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-18 22:01:47,369 INFO L273 TraceCheckUtils]: 9: Hoare triple {784#(= dll_create_~len |dll_create_#in~len|)} assume !~bvsgt32(~len, 0bv32); {791#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-18 22:01:47,373 INFO L273 TraceCheckUtils]: 10: Hoare triple {791#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {791#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-18 22:01:47,373 INFO L273 TraceCheckUtils]: 11: Hoare triple {791#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} assume true; {791#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-18 22:01:47,375 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {791#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} {777#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #143#return; {758#false} is VALID [2018-11-18 22:01:47,375 INFO L273 TraceCheckUtils]: 13: Hoare triple {758#false} call write~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret13.base, #t~ret13.offset; {758#false} is VALID [2018-11-18 22:01:47,376 INFO L256 TraceCheckUtils]: 14: Hoare triple {758#false} call dll_insert(~#s~0.base, ~#s~0.offset, ~data~0, ~bvsdiv32(~len~0, 2bv32)); {758#false} is VALID [2018-11-18 22:01:47,376 INFO L273 TraceCheckUtils]: 15: Hoare triple {758#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {758#false} is VALID [2018-11-18 22:01:47,376 INFO L256 TraceCheckUtils]: 16: Hoare triple {758#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {758#false} is VALID [2018-11-18 22:01:47,376 INFO L273 TraceCheckUtils]: 17: Hoare triple {758#false} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {758#false} is VALID [2018-11-18 22:01:47,377 INFO L273 TraceCheckUtils]: 18: Hoare triple {758#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {758#false} is VALID [2018-11-18 22:01:47,377 INFO L273 TraceCheckUtils]: 19: Hoare triple {758#false} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {758#false} is VALID [2018-11-18 22:01:47,377 INFO L273 TraceCheckUtils]: 20: Hoare triple {758#false} assume true; {758#false} is VALID [2018-11-18 22:01:47,378 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {758#false} {758#false} #139#return; {758#false} is VALID [2018-11-18 22:01:47,378 INFO L273 TraceCheckUtils]: 22: Hoare triple {758#false} ~new_node~0.base, ~new_node~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0bv32, 0bv32;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~last~0.base, ~last~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {758#false} is VALID [2018-11-18 22:01:47,379 INFO L273 TraceCheckUtils]: 23: Hoare triple {758#false} assume true; {758#false} is VALID [2018-11-18 22:01:47,379 INFO L273 TraceCheckUtils]: 24: Hoare triple {758#false} assume !~bvsgt32(~index, 0bv32); {758#false} is VALID [2018-11-18 22:01:47,379 INFO L273 TraceCheckUtils]: 25: Hoare triple {758#false} assume !(~snd_to_last~0.base != 0bv32 || ~snd_to_last~0.offset != 0bv32);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem10.base, #t~mem10.offset, ~new_node~0.base, ~bvadd32(4bv32, ~new_node~0.offset), 4bv32);havoc #t~mem10.base, #t~mem10.offset;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {758#false} is VALID [2018-11-18 22:01:47,380 INFO L273 TraceCheckUtils]: 26: Hoare triple {758#false} assume #t~mem11.base != 0bv32 || #t~mem11.offset != 0bv32;havoc #t~mem11.base, #t~mem11.offset;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, #t~mem12.base, ~bvadd32(8bv32, #t~mem12.offset), 4bv32);havoc #t~mem12.base, #t~mem12.offset; {758#false} is VALID [2018-11-18 22:01:47,380 INFO L273 TraceCheckUtils]: 27: Hoare triple {758#false} call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~head.base, ~head.offset, 4bv32); {758#false} is VALID [2018-11-18 22:01:47,380 INFO L273 TraceCheckUtils]: 28: Hoare triple {758#false} assume true; {758#false} is VALID [2018-11-18 22:01:47,381 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {758#false} {758#false} #145#return; {758#false} is VALID [2018-11-18 22:01:47,381 INFO L273 TraceCheckUtils]: 30: Hoare triple {758#false} call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset;~count~0 := 0bv32; {758#false} is VALID [2018-11-18 22:01:47,381 INFO L273 TraceCheckUtils]: 31: Hoare triple {758#false} assume true; {758#false} is VALID [2018-11-18 22:01:47,382 INFO L273 TraceCheckUtils]: 32: Hoare triple {758#false} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {758#false} is VALID [2018-11-18 22:01:47,382 INFO L273 TraceCheckUtils]: 33: Hoare triple {758#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {758#false} is VALID [2018-11-18 22:01:47,382 INFO L273 TraceCheckUtils]: 34: Hoare triple {758#false} assume !false; {758#false} is VALID [2018-11-18 22:01:47,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:01:47,385 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:01:47,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:01:47,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 22:01:47,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-11-18 22:01:47,388 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:01:47,388 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 22:01:47,475 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:01:47,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 22:01:47,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 22:01:47,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:01:47,477 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand 5 states. [2018-11-18 22:01:48,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:01:48,146 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2018-11-18 22:01:48,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 22:01:48,146 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-11-18 22:01:48,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:01:48,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:01:48,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2018-11-18 22:01:48,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:01:48,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2018-11-18 22:01:48,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 90 transitions. [2018-11-18 22:01:48,416 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:01:48,419 INFO L225 Difference]: With dead ends: 82 [2018-11-18 22:01:48,419 INFO L226 Difference]: Without dead ends: 51 [2018-11-18 22:01:48,420 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:01:48,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-18 22:01:48,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-11-18 22:01:48,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:01:48,456 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 47 states. [2018-11-18 22:01:48,456 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 47 states. [2018-11-18 22:01:48,456 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 47 states. [2018-11-18 22:01:48,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:01:48,460 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2018-11-18 22:01:48,460 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2018-11-18 22:01:48,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:01:48,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:01:48,461 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 51 states. [2018-11-18 22:01:48,462 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 51 states. [2018-11-18 22:01:48,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:01:48,465 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2018-11-18 22:01:48,465 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2018-11-18 22:01:48,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:01:48,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:01:48,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:01:48,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:01:48,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-18 22:01:48,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2018-11-18 22:01:48,469 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 35 [2018-11-18 22:01:48,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:01:48,469 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2018-11-18 22:01:48,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 22:01:48,470 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-11-18 22:01:48,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-18 22:01:48,471 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:01:48,471 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2018-11-18 22:01:48,471 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:01:48,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:01:48,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1052010897, now seen corresponding path program 1 times [2018-11-18 22:01:48,472 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:01:48,472 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 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 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:01:48,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:01:48,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:01:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:01:48,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:01:48,754 INFO L256 TraceCheckUtils]: 0: Hoare triple {1139#true} call ULTIMATE.init(); {1139#true} is VALID [2018-11-18 22:01:48,754 INFO L273 TraceCheckUtils]: 1: Hoare triple {1139#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1139#true} is VALID [2018-11-18 22:01:48,755 INFO L273 TraceCheckUtils]: 2: Hoare triple {1139#true} assume true; {1139#true} is VALID [2018-11-18 22:01:48,755 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1139#true} {1139#true} #151#return; {1139#true} is VALID [2018-11-18 22:01:48,756 INFO L256 TraceCheckUtils]: 4: Hoare triple {1139#true} call #t~ret19 := main(); {1139#true} is VALID [2018-11-18 22:01:48,756 INFO L273 TraceCheckUtils]: 5: Hoare triple {1139#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); {1139#true} is VALID [2018-11-18 22:01:48,757 INFO L256 TraceCheckUtils]: 6: Hoare triple {1139#true} call #t~ret13.base, #t~ret13.offset := dll_create(~len~0, ~data~0); {1139#true} is VALID [2018-11-18 22:01:48,761 INFO L273 TraceCheckUtils]: 7: Hoare triple {1139#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1165#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} is VALID [2018-11-18 22:01:48,762 INFO L273 TraceCheckUtils]: 8: Hoare triple {1165#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} assume true; {1165#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} is VALID [2018-11-18 22:01:48,763 INFO L273 TraceCheckUtils]: 9: Hoare triple {1165#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1165#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} is VALID [2018-11-18 22:01:48,764 INFO L273 TraceCheckUtils]: 10: Hoare triple {1165#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1165#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} is VALID [2018-11-18 22:01:48,765 INFO L273 TraceCheckUtils]: 11: Hoare triple {1165#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {1165#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} is VALID [2018-11-18 22:01:48,767 INFO L273 TraceCheckUtils]: 12: Hoare triple {1165#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} assume ~head~0.base != 0bv32 || ~head~0.offset != 0bv32;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32); {1140#false} is VALID [2018-11-18 22:01:48,767 INFO L273 TraceCheckUtils]: 13: Hoare triple {1140#false} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1140#false} is VALID [2018-11-18 22:01:48,768 INFO L273 TraceCheckUtils]: 14: Hoare triple {1140#false} assume true; {1140#false} is VALID [2018-11-18 22:01:48,768 INFO L273 TraceCheckUtils]: 15: Hoare triple {1140#false} assume !~bvsgt32(~len, 0bv32); {1140#false} is VALID [2018-11-18 22:01:48,769 INFO L273 TraceCheckUtils]: 16: Hoare triple {1140#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1140#false} is VALID [2018-11-18 22:01:48,769 INFO L273 TraceCheckUtils]: 17: Hoare triple {1140#false} assume true; {1140#false} is VALID [2018-11-18 22:01:48,770 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1140#false} {1139#true} #143#return; {1140#false} is VALID [2018-11-18 22:01:48,770 INFO L273 TraceCheckUtils]: 19: Hoare triple {1140#false} call write~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret13.base, #t~ret13.offset; {1140#false} is VALID [2018-11-18 22:01:48,771 INFO L256 TraceCheckUtils]: 20: Hoare triple {1140#false} call dll_insert(~#s~0.base, ~#s~0.offset, ~data~0, ~bvsdiv32(~len~0, 2bv32)); {1140#false} is VALID [2018-11-18 22:01:48,771 INFO L273 TraceCheckUtils]: 21: Hoare triple {1140#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1140#false} is VALID [2018-11-18 22:01:48,772 INFO L256 TraceCheckUtils]: 22: Hoare triple {1140#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1140#false} is VALID [2018-11-18 22:01:48,772 INFO L273 TraceCheckUtils]: 23: Hoare triple {1140#false} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1140#false} is VALID [2018-11-18 22:01:48,772 INFO L273 TraceCheckUtils]: 24: Hoare triple {1140#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1140#false} is VALID [2018-11-18 22:01:48,773 INFO L273 TraceCheckUtils]: 25: Hoare triple {1140#false} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1140#false} is VALID [2018-11-18 22:01:48,773 INFO L273 TraceCheckUtils]: 26: Hoare triple {1140#false} assume true; {1140#false} is VALID [2018-11-18 22:01:48,773 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1140#false} {1140#false} #139#return; {1140#false} is VALID [2018-11-18 22:01:48,774 INFO L273 TraceCheckUtils]: 28: Hoare triple {1140#false} ~new_node~0.base, ~new_node~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0bv32, 0bv32;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~last~0.base, ~last~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {1140#false} is VALID [2018-11-18 22:01:48,774 INFO L273 TraceCheckUtils]: 29: Hoare triple {1140#false} assume true; {1140#false} is VALID [2018-11-18 22:01:48,774 INFO L273 TraceCheckUtils]: 30: Hoare triple {1140#false} assume !~bvsgt32(~index, 0bv32); {1140#false} is VALID [2018-11-18 22:01:48,775 INFO L273 TraceCheckUtils]: 31: Hoare triple {1140#false} assume !(~snd_to_last~0.base != 0bv32 || ~snd_to_last~0.offset != 0bv32);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem10.base, #t~mem10.offset, ~new_node~0.base, ~bvadd32(4bv32, ~new_node~0.offset), 4bv32);havoc #t~mem10.base, #t~mem10.offset;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {1140#false} is VALID [2018-11-18 22:01:48,775 INFO L273 TraceCheckUtils]: 32: Hoare triple {1140#false} assume #t~mem11.base != 0bv32 || #t~mem11.offset != 0bv32;havoc #t~mem11.base, #t~mem11.offset;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, #t~mem12.base, ~bvadd32(8bv32, #t~mem12.offset), 4bv32);havoc #t~mem12.base, #t~mem12.offset; {1140#false} is VALID [2018-11-18 22:01:48,775 INFO L273 TraceCheckUtils]: 33: Hoare triple {1140#false} call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~head.base, ~head.offset, 4bv32); {1140#false} is VALID [2018-11-18 22:01:48,775 INFO L273 TraceCheckUtils]: 34: Hoare triple {1140#false} assume true; {1140#false} is VALID [2018-11-18 22:01:48,776 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1140#false} {1140#false} #145#return; {1140#false} is VALID [2018-11-18 22:01:48,776 INFO L273 TraceCheckUtils]: 36: Hoare triple {1140#false} call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset;~count~0 := 0bv32; {1140#false} is VALID [2018-11-18 22:01:48,776 INFO L273 TraceCheckUtils]: 37: Hoare triple {1140#false} assume true; {1140#false} is VALID [2018-11-18 22:01:48,777 INFO L273 TraceCheckUtils]: 38: Hoare triple {1140#false} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {1140#false} is VALID [2018-11-18 22:01:48,777 INFO L273 TraceCheckUtils]: 39: Hoare triple {1140#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {1140#false} is VALID [2018-11-18 22:01:48,777 INFO L273 TraceCheckUtils]: 40: Hoare triple {1140#false} assume !false; {1140#false} is VALID [2018-11-18 22:01:48,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:01:48,781 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:01:48,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:01:48,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 22:01:48,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-11-18 22:01:48,786 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:01:48,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 22:01:48,992 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:01:48,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 22:01:48,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 22:01:48,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 22:01:48,994 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 3 states. [2018-11-18 22:01:49,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:01:49,504 INFO L93 Difference]: Finished difference Result 88 states and 105 transitions. [2018-11-18 22:01:49,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 22:01:49,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-11-18 22:01:49,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:01:49,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:01:49,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2018-11-18 22:01:49,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:01:49,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2018-11-18 22:01:49,511 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 97 transitions. [2018-11-18 22:01:49,793 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:01:49,795 INFO L225 Difference]: With dead ends: 88 [2018-11-18 22:01:49,795 INFO L226 Difference]: Without dead ends: 51 [2018-11-18 22:01:49,796 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 22:01:49,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-18 22:01:49,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-11-18 22:01:49,817 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:01:49,817 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 50 states. [2018-11-18 22:01:49,817 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 50 states. [2018-11-18 22:01:49,818 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 50 states. [2018-11-18 22:01:49,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:01:49,821 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2018-11-18 22:01:49,821 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2018-11-18 22:01:49,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:01:49,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:01:49,822 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 51 states. [2018-11-18 22:01:49,822 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 51 states. [2018-11-18 22:01:49,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:01:49,825 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2018-11-18 22:01:49,825 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2018-11-18 22:01:49,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:01:49,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:01:49,826 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:01:49,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:01:49,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-18 22:01:49,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2018-11-18 22:01:49,829 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 41 [2018-11-18 22:01:49,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:01:49,830 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2018-11-18 22:01:49,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 22:01:49,830 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2018-11-18 22:01:49,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-18 22:01:49,831 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:01:49,831 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2018-11-18 22:01:49,832 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:01:49,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:01:49,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1856753005, now seen corresponding path program 1 times [2018-11-18 22:01:49,833 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:01:49,833 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:01:49,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:01:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:01:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:01:49,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:01:50,093 INFO L256 TraceCheckUtils]: 0: Hoare triple {1545#true} call ULTIMATE.init(); {1545#true} is VALID [2018-11-18 22:01:50,093 INFO L273 TraceCheckUtils]: 1: Hoare triple {1545#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1545#true} is VALID [2018-11-18 22:01:50,094 INFO L273 TraceCheckUtils]: 2: Hoare triple {1545#true} assume true; {1545#true} is VALID [2018-11-18 22:01:50,094 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1545#true} {1545#true} #151#return; {1545#true} is VALID [2018-11-18 22:01:50,094 INFO L256 TraceCheckUtils]: 4: Hoare triple {1545#true} call #t~ret19 := main(); {1545#true} is VALID [2018-11-18 22:01:50,096 INFO L273 TraceCheckUtils]: 5: Hoare triple {1545#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); {1565#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:01:50,096 INFO L256 TraceCheckUtils]: 6: Hoare triple {1565#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := dll_create(~len~0, ~data~0); {1545#true} is VALID [2018-11-18 22:01:50,096 INFO L273 TraceCheckUtils]: 7: Hoare triple {1545#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1572#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-18 22:01:50,097 INFO L273 TraceCheckUtils]: 8: Hoare triple {1572#(= dll_create_~len |dll_create_#in~len|)} assume true; {1572#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-18 22:01:50,097 INFO L273 TraceCheckUtils]: 9: Hoare triple {1572#(= dll_create_~len |dll_create_#in~len|)} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1572#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-18 22:01:50,098 INFO L273 TraceCheckUtils]: 10: Hoare triple {1572#(= dll_create_~len |dll_create_#in~len|)} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1572#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-18 22:01:50,099 INFO L273 TraceCheckUtils]: 11: Hoare triple {1572#(= dll_create_~len |dll_create_#in~len|)} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {1572#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-18 22:01:50,099 INFO L273 TraceCheckUtils]: 12: Hoare triple {1572#(= dll_create_~len |dll_create_#in~len|)} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {1572#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-18 22:01:50,101 INFO L273 TraceCheckUtils]: 13: Hoare triple {1572#(= dll_create_~len |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1591#(= (bvadd dll_create_~len (_ bv1 32)) |dll_create_#in~len|)} is VALID [2018-11-18 22:01:50,101 INFO L273 TraceCheckUtils]: 14: Hoare triple {1591#(= (bvadd dll_create_~len (_ bv1 32)) |dll_create_#in~len|)} assume true; {1591#(= (bvadd dll_create_~len (_ bv1 32)) |dll_create_#in~len|)} is VALID [2018-11-18 22:01:50,102 INFO L273 TraceCheckUtils]: 15: Hoare triple {1591#(= (bvadd dll_create_~len (_ bv1 32)) |dll_create_#in~len|)} assume !~bvsgt32(~len, 0bv32); {1598#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:01:50,103 INFO L273 TraceCheckUtils]: 16: Hoare triple {1598#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1598#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:01:50,104 INFO L273 TraceCheckUtils]: 17: Hoare triple {1598#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {1598#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:01:50,107 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1598#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {1565#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #143#return; {1546#false} is VALID [2018-11-18 22:01:50,108 INFO L273 TraceCheckUtils]: 19: Hoare triple {1546#false} call write~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret13.base, #t~ret13.offset; {1546#false} is VALID [2018-11-18 22:01:50,108 INFO L256 TraceCheckUtils]: 20: Hoare triple {1546#false} call dll_insert(~#s~0.base, ~#s~0.offset, ~data~0, ~bvsdiv32(~len~0, 2bv32)); {1546#false} is VALID [2018-11-18 22:01:50,108 INFO L273 TraceCheckUtils]: 21: Hoare triple {1546#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1546#false} is VALID [2018-11-18 22:01:50,109 INFO L256 TraceCheckUtils]: 22: Hoare triple {1546#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1546#false} is VALID [2018-11-18 22:01:50,109 INFO L273 TraceCheckUtils]: 23: Hoare triple {1546#false} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1546#false} is VALID [2018-11-18 22:01:50,109 INFO L273 TraceCheckUtils]: 24: Hoare triple {1546#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1546#false} is VALID [2018-11-18 22:01:50,109 INFO L273 TraceCheckUtils]: 25: Hoare triple {1546#false} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1546#false} is VALID [2018-11-18 22:01:50,110 INFO L273 TraceCheckUtils]: 26: Hoare triple {1546#false} assume true; {1546#false} is VALID [2018-11-18 22:01:50,110 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1546#false} {1546#false} #139#return; {1546#false} is VALID [2018-11-18 22:01:50,110 INFO L273 TraceCheckUtils]: 28: Hoare triple {1546#false} ~new_node~0.base, ~new_node~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0bv32, 0bv32;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~last~0.base, ~last~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {1546#false} is VALID [2018-11-18 22:01:50,111 INFO L273 TraceCheckUtils]: 29: Hoare triple {1546#false} assume true; {1546#false} is VALID [2018-11-18 22:01:50,111 INFO L273 TraceCheckUtils]: 30: Hoare triple {1546#false} assume !~bvsgt32(~index, 0bv32); {1546#false} is VALID [2018-11-18 22:01:50,111 INFO L273 TraceCheckUtils]: 31: Hoare triple {1546#false} assume !(~snd_to_last~0.base != 0bv32 || ~snd_to_last~0.offset != 0bv32);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem10.base, #t~mem10.offset, ~new_node~0.base, ~bvadd32(4bv32, ~new_node~0.offset), 4bv32);havoc #t~mem10.base, #t~mem10.offset;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {1546#false} is VALID [2018-11-18 22:01:50,111 INFO L273 TraceCheckUtils]: 32: Hoare triple {1546#false} assume #t~mem11.base != 0bv32 || #t~mem11.offset != 0bv32;havoc #t~mem11.base, #t~mem11.offset;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, #t~mem12.base, ~bvadd32(8bv32, #t~mem12.offset), 4bv32);havoc #t~mem12.base, #t~mem12.offset; {1546#false} is VALID [2018-11-18 22:01:50,112 INFO L273 TraceCheckUtils]: 33: Hoare triple {1546#false} call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~head.base, ~head.offset, 4bv32); {1546#false} is VALID [2018-11-18 22:01:50,112 INFO L273 TraceCheckUtils]: 34: Hoare triple {1546#false} assume true; {1546#false} is VALID [2018-11-18 22:01:50,112 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1546#false} {1546#false} #145#return; {1546#false} is VALID [2018-11-18 22:01:50,112 INFO L273 TraceCheckUtils]: 36: Hoare triple {1546#false} call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset;~count~0 := 0bv32; {1546#false} is VALID [2018-11-18 22:01:50,112 INFO L273 TraceCheckUtils]: 37: Hoare triple {1546#false} assume true; {1546#false} is VALID [2018-11-18 22:01:50,113 INFO L273 TraceCheckUtils]: 38: Hoare triple {1546#false} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {1546#false} is VALID [2018-11-18 22:01:50,113 INFO L273 TraceCheckUtils]: 39: Hoare triple {1546#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {1546#false} is VALID [2018-11-18 22:01:50,113 INFO L273 TraceCheckUtils]: 40: Hoare triple {1546#false} assume !false; {1546#false} is VALID [2018-11-18 22:01:50,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:01:50,116 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:01:50,501 INFO L273 TraceCheckUtils]: 40: Hoare triple {1546#false} assume !false; {1546#false} is VALID [2018-11-18 22:01:50,502 INFO L273 TraceCheckUtils]: 39: Hoare triple {1546#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {1546#false} is VALID [2018-11-18 22:01:50,502 INFO L273 TraceCheckUtils]: 38: Hoare triple {1546#false} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {1546#false} is VALID [2018-11-18 22:01:50,503 INFO L273 TraceCheckUtils]: 37: Hoare triple {1546#false} assume true; {1546#false} is VALID [2018-11-18 22:01:50,503 INFO L273 TraceCheckUtils]: 36: Hoare triple {1546#false} call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset;~count~0 := 0bv32; {1546#false} is VALID [2018-11-18 22:01:50,503 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1545#true} {1546#false} #145#return; {1546#false} is VALID [2018-11-18 22:01:50,503 INFO L273 TraceCheckUtils]: 34: Hoare triple {1545#true} assume true; {1545#true} is VALID [2018-11-18 22:01:50,503 INFO L273 TraceCheckUtils]: 33: Hoare triple {1545#true} call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~head.base, ~head.offset, 4bv32); {1545#true} is VALID [2018-11-18 22:01:50,506 INFO L273 TraceCheckUtils]: 32: Hoare triple {1545#true} assume #t~mem11.base != 0bv32 || #t~mem11.offset != 0bv32;havoc #t~mem11.base, #t~mem11.offset;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, #t~mem12.base, ~bvadd32(8bv32, #t~mem12.offset), 4bv32);havoc #t~mem12.base, #t~mem12.offset; {1545#true} is VALID [2018-11-18 22:01:50,506 INFO L273 TraceCheckUtils]: 31: Hoare triple {1545#true} assume !(~snd_to_last~0.base != 0bv32 || ~snd_to_last~0.offset != 0bv32);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem10.base, #t~mem10.offset, ~new_node~0.base, ~bvadd32(4bv32, ~new_node~0.offset), 4bv32);havoc #t~mem10.base, #t~mem10.offset;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {1545#true} is VALID [2018-11-18 22:01:50,506 INFO L273 TraceCheckUtils]: 30: Hoare triple {1545#true} assume !~bvsgt32(~index, 0bv32); {1545#true} is VALID [2018-11-18 22:01:50,511 INFO L273 TraceCheckUtils]: 29: Hoare triple {1545#true} assume true; {1545#true} is VALID [2018-11-18 22:01:50,511 INFO L273 TraceCheckUtils]: 28: Hoare triple {1545#true} ~new_node~0.base, ~new_node~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0bv32, 0bv32;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~last~0.base, ~last~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {1545#true} is VALID [2018-11-18 22:01:50,512 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1545#true} {1545#true} #139#return; {1545#true} is VALID [2018-11-18 22:01:50,512 INFO L273 TraceCheckUtils]: 26: Hoare triple {1545#true} assume true; {1545#true} is VALID [2018-11-18 22:01:50,512 INFO L273 TraceCheckUtils]: 25: Hoare triple {1545#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1545#true} is VALID [2018-11-18 22:01:50,512 INFO L273 TraceCheckUtils]: 24: Hoare triple {1545#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1545#true} is VALID [2018-11-18 22:01:50,513 INFO L273 TraceCheckUtils]: 23: Hoare triple {1545#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1545#true} is VALID [2018-11-18 22:01:50,513 INFO L256 TraceCheckUtils]: 22: Hoare triple {1545#true} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1545#true} is VALID [2018-11-18 22:01:50,514 INFO L273 TraceCheckUtils]: 21: Hoare triple {1545#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1545#true} is VALID [2018-11-18 22:01:50,514 INFO L256 TraceCheckUtils]: 20: Hoare triple {1546#false} call dll_insert(~#s~0.base, ~#s~0.offset, ~data~0, ~bvsdiv32(~len~0, 2bv32)); {1545#true} is VALID [2018-11-18 22:01:50,514 INFO L273 TraceCheckUtils]: 19: Hoare triple {1546#false} call write~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret13.base, #t~ret13.offset; {1546#false} is VALID [2018-11-18 22:01:50,535 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1598#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {1740#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} #143#return; {1546#false} is VALID [2018-11-18 22:01:50,545 INFO L273 TraceCheckUtils]: 17: Hoare triple {1598#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {1598#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:01:50,546 INFO L273 TraceCheckUtils]: 16: Hoare triple {1598#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1598#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:01:50,547 INFO L273 TraceCheckUtils]: 15: Hoare triple {1753#(or (bvsgt dll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume !~bvsgt32(~len, 0bv32); {1598#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:01:50,550 INFO L273 TraceCheckUtils]: 14: Hoare triple {1753#(or (bvsgt dll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume true; {1753#(or (bvsgt dll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-18 22:01:50,552 INFO L273 TraceCheckUtils]: 13: Hoare triple {1760#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1753#(or (bvsgt dll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-18 22:01:50,554 INFO L273 TraceCheckUtils]: 12: Hoare triple {1760#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {1760#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-18 22:01:50,554 INFO L273 TraceCheckUtils]: 11: Hoare triple {1760#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {1760#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-18 22:01:50,555 INFO L273 TraceCheckUtils]: 10: Hoare triple {1760#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1760#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-18 22:01:50,555 INFO L273 TraceCheckUtils]: 9: Hoare triple {1760#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1760#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-18 22:01:50,556 INFO L273 TraceCheckUtils]: 8: Hoare triple {1760#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume true; {1760#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-18 22:01:50,558 INFO L273 TraceCheckUtils]: 7: Hoare triple {1545#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1760#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-18 22:01:50,558 INFO L256 TraceCheckUtils]: 6: Hoare triple {1740#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := dll_create(~len~0, ~data~0); {1545#true} is VALID [2018-11-18 22:01:50,560 INFO L273 TraceCheckUtils]: 5: Hoare triple {1545#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); {1740#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:01:50,560 INFO L256 TraceCheckUtils]: 4: Hoare triple {1545#true} call #t~ret19 := main(); {1545#true} is VALID [2018-11-18 22:01:50,560 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1545#true} {1545#true} #151#return; {1545#true} is VALID [2018-11-18 22:01:50,561 INFO L273 TraceCheckUtils]: 2: Hoare triple {1545#true} assume true; {1545#true} is VALID [2018-11-18 22:01:50,561 INFO L273 TraceCheckUtils]: 1: Hoare triple {1545#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1545#true} is VALID [2018-11-18 22:01:50,561 INFO L256 TraceCheckUtils]: 0: Hoare triple {1545#true} call ULTIMATE.init(); {1545#true} is VALID [2018-11-18 22:01:50,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:01:50,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:01:50,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-18 22:01:50,570 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-11-18 22:01:50,571 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:01:50,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 22:01:50,801 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:01:50,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 22:01:50,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 22:01:50,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:01:50,802 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand 9 states. [2018-11-18 22:01:51,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:01:51,962 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2018-11-18 22:01:51,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 22:01:51,963 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-11-18 22:01:51,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:01:51,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:01:51,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2018-11-18 22:01:51,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:01:51,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2018-11-18 22:01:51,970 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 96 transitions. [2018-11-18 22:01:52,309 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:01:52,311 INFO L225 Difference]: With dead ends: 88 [2018-11-18 22:01:52,311 INFO L226 Difference]: Without dead ends: 57 [2018-11-18 22:01:52,312 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-18 22:01:52,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-18 22:01:52,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-11-18 22:01:52,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:01:52,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 53 states. [2018-11-18 22:01:52,335 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 53 states. [2018-11-18 22:01:52,335 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 53 states. [2018-11-18 22:01:52,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:01:52,339 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2018-11-18 22:01:52,339 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2018-11-18 22:01:52,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:01:52,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:01:52,340 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 57 states. [2018-11-18 22:01:52,340 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 57 states. [2018-11-18 22:01:52,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:01:52,343 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2018-11-18 22:01:52,343 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2018-11-18 22:01:52,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:01:52,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:01:52,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:01:52,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:01:52,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-18 22:01:52,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2018-11-18 22:01:52,347 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 41 [2018-11-18 22:01:52,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:01:52,347 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-11-18 22:01:52,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 22:01:52,348 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2018-11-18 22:01:52,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 22:01:52,348 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:01:52,349 INFO L375 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:01:52,349 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:01:52,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:01:52,349 INFO L82 PathProgramCache]: Analyzing trace with hash 289985511, now seen corresponding path program 1 times [2018-11-18 22:01:52,350 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:01:52,350 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 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 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:01:52,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:01:52,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:01:52,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:01:52,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:01:52,794 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:01:52,803 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:01:52,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:01:52,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:01:52,824 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:01:52,824 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-11-18 22:01:52,833 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:01:52,955 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 16 treesize of output 12 [2018-11-18 22:01:53,016 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-18 22:01:53,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:01:53,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:01:53,105 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:01:53,106 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-11-18 22:01:53,119 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:01:53,177 INFO L256 TraceCheckUtils]: 0: Hoare triple {2100#true} call ULTIMATE.init(); {2100#true} is VALID [2018-11-18 22:01:53,178 INFO L273 TraceCheckUtils]: 1: Hoare triple {2100#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2100#true} is VALID [2018-11-18 22:01:53,178 INFO L273 TraceCheckUtils]: 2: Hoare triple {2100#true} assume true; {2100#true} is VALID [2018-11-18 22:01:53,178 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2100#true} {2100#true} #151#return; {2100#true} is VALID [2018-11-18 22:01:53,178 INFO L256 TraceCheckUtils]: 4: Hoare triple {2100#true} call #t~ret19 := main(); {2100#true} is VALID [2018-11-18 22:01:53,179 INFO L273 TraceCheckUtils]: 5: Hoare triple {2100#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); {2120#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-18 22:01:53,179 INFO L256 TraceCheckUtils]: 6: Hoare triple {2120#(= |main_~#s~0.offset| (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := dll_create(~len~0, ~data~0); {2100#true} is VALID [2018-11-18 22:01:53,179 INFO L273 TraceCheckUtils]: 7: Hoare triple {2100#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {2100#true} is VALID [2018-11-18 22:01:53,180 INFO L273 TraceCheckUtils]: 8: Hoare triple {2100#true} assume true; {2100#true} is VALID [2018-11-18 22:01:53,180 INFO L273 TraceCheckUtils]: 9: Hoare triple {2100#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2100#true} is VALID [2018-11-18 22:01:53,180 INFO L273 TraceCheckUtils]: 10: Hoare triple {2100#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2100#true} is VALID [2018-11-18 22:01:53,180 INFO L273 TraceCheckUtils]: 11: Hoare triple {2100#true} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {2100#true} is VALID [2018-11-18 22:01:53,180 INFO L273 TraceCheckUtils]: 12: Hoare triple {2100#true} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {2100#true} is VALID [2018-11-18 22:01:53,180 INFO L273 TraceCheckUtils]: 13: Hoare triple {2100#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {2100#true} is VALID [2018-11-18 22:01:53,181 INFO L273 TraceCheckUtils]: 14: Hoare triple {2100#true} assume true; {2100#true} is VALID [2018-11-18 22:01:53,181 INFO L273 TraceCheckUtils]: 15: Hoare triple {2100#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2100#true} is VALID [2018-11-18 22:01:53,181 INFO L273 TraceCheckUtils]: 16: Hoare triple {2100#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2100#true} is VALID [2018-11-18 22:01:53,181 INFO L273 TraceCheckUtils]: 17: Hoare triple {2100#true} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {2100#true} is VALID [2018-11-18 22:01:53,181 INFO L273 TraceCheckUtils]: 18: Hoare triple {2100#true} assume ~head~0.base != 0bv32 || ~head~0.offset != 0bv32;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32); {2100#true} is VALID [2018-11-18 22:01:53,181 INFO L273 TraceCheckUtils]: 19: Hoare triple {2100#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {2100#true} is VALID [2018-11-18 22:01:53,182 INFO L273 TraceCheckUtils]: 20: Hoare triple {2100#true} assume true; {2100#true} is VALID [2018-11-18 22:01:53,182 INFO L273 TraceCheckUtils]: 21: Hoare triple {2100#true} assume !~bvsgt32(~len, 0bv32); {2100#true} is VALID [2018-11-18 22:01:53,182 INFO L273 TraceCheckUtils]: 22: Hoare triple {2100#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2100#true} is VALID [2018-11-18 22:01:53,182 INFO L273 TraceCheckUtils]: 23: Hoare triple {2100#true} assume true; {2100#true} is VALID [2018-11-18 22:01:53,183 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {2100#true} {2120#(= |main_~#s~0.offset| (_ bv0 32))} #143#return; {2120#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-18 22:01:53,184 INFO L273 TraceCheckUtils]: 25: Hoare triple {2120#(= |main_~#s~0.offset| (_ bv0 32))} call write~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret13.base, #t~ret13.offset; {2120#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-18 22:01:53,184 INFO L256 TraceCheckUtils]: 26: Hoare triple {2120#(= |main_~#s~0.offset| (_ bv0 32))} call dll_insert(~#s~0.base, ~#s~0.offset, ~data~0, ~bvsdiv32(~len~0, 2bv32)); {2100#true} is VALID [2018-11-18 22:01:53,184 INFO L273 TraceCheckUtils]: 27: Hoare triple {2100#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {2187#(and (= |dll_insert_#in~head.base| dll_insert_~head.base) (= dll_insert_~head.offset |dll_insert_#in~head.offset|))} is VALID [2018-11-18 22:01:53,185 INFO L256 TraceCheckUtils]: 28: Hoare triple {2187#(and (= |dll_insert_#in~head.base| dll_insert_~head.base) (= dll_insert_~head.offset |dll_insert_#in~head.offset|))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {2100#true} is VALID [2018-11-18 22:01:53,185 INFO L273 TraceCheckUtils]: 29: Hoare triple {2100#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2194#(not (= (_ bv0 32) node_create_~temp~0.base))} is VALID [2018-11-18 22:01:53,188 INFO L273 TraceCheckUtils]: 30: Hoare triple {2194#(not (= (_ bv0 32) node_create_~temp~0.base))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2194#(not (= (_ bv0 32) node_create_~temp~0.base))} is VALID [2018-11-18 22:01:53,191 INFO L273 TraceCheckUtils]: 31: Hoare triple {2194#(not (= (_ bv0 32) node_create_~temp~0.base))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2201#(not (= (_ bv0 32) |node_create_#res.base|))} is VALID [2018-11-18 22:01:53,195 INFO L273 TraceCheckUtils]: 32: Hoare triple {2201#(not (= (_ bv0 32) |node_create_#res.base|))} assume true; {2201#(not (= (_ bv0 32) |node_create_#res.base|))} is VALID [2018-11-18 22:01:53,215 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {2201#(not (= (_ bv0 32) |node_create_#res.base|))} {2187#(and (= |dll_insert_#in~head.base| dll_insert_~head.base) (= dll_insert_~head.offset |dll_insert_#in~head.offset|))} #139#return; {2208#(and (= |dll_insert_#in~head.base| dll_insert_~head.base) (not (= (_ bv0 32) |dll_insert_#t~ret6.base|)) (= dll_insert_~head.offset |dll_insert_#in~head.offset|))} is VALID [2018-11-18 22:01:53,229 INFO L273 TraceCheckUtils]: 34: Hoare triple {2208#(and (= |dll_insert_#in~head.base| dll_insert_~head.base) (not (= (_ bv0 32) |dll_insert_#t~ret6.base|)) (= dll_insert_~head.offset |dll_insert_#in~head.offset|))} ~new_node~0.base, ~new_node~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0bv32, 0bv32;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~last~0.base, ~last~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {2212#(and (not (= dll_insert_~new_node~0.base (_ bv0 32))) (= |dll_insert_#in~head.base| dll_insert_~head.base) (= dll_insert_~head.offset |dll_insert_#in~head.offset|))} is VALID [2018-11-18 22:01:53,243 INFO L273 TraceCheckUtils]: 35: Hoare triple {2212#(and (not (= dll_insert_~new_node~0.base (_ bv0 32))) (= |dll_insert_#in~head.base| dll_insert_~head.base) (= dll_insert_~head.offset |dll_insert_#in~head.offset|))} assume true; {2212#(and (not (= dll_insert_~new_node~0.base (_ bv0 32))) (= |dll_insert_#in~head.base| dll_insert_~head.base) (= dll_insert_~head.offset |dll_insert_#in~head.offset|))} is VALID [2018-11-18 22:01:53,252 INFO L273 TraceCheckUtils]: 36: Hoare triple {2212#(and (not (= dll_insert_~new_node~0.base (_ bv0 32))) (= |dll_insert_#in~head.base| dll_insert_~head.base) (= dll_insert_~head.offset |dll_insert_#in~head.offset|))} assume !~bvsgt32(~index, 0bv32); {2212#(and (not (= dll_insert_~new_node~0.base (_ bv0 32))) (= |dll_insert_#in~head.base| dll_insert_~head.base) (= dll_insert_~head.offset |dll_insert_#in~head.offset|))} is VALID [2018-11-18 22:01:53,265 INFO L273 TraceCheckUtils]: 37: Hoare triple {2212#(and (not (= dll_insert_~new_node~0.base (_ bv0 32))) (= |dll_insert_#in~head.base| dll_insert_~head.base) (= dll_insert_~head.offset |dll_insert_#in~head.offset|))} assume !(~snd_to_last~0.base != 0bv32 || ~snd_to_last~0.offset != 0bv32);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem10.base, #t~mem10.offset, ~new_node~0.base, ~bvadd32(4bv32, ~new_node~0.offset), 4bv32);havoc #t~mem10.base, #t~mem10.offset;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {2212#(and (not (= dll_insert_~new_node~0.base (_ bv0 32))) (= |dll_insert_#in~head.base| dll_insert_~head.base) (= dll_insert_~head.offset |dll_insert_#in~head.offset|))} is VALID [2018-11-18 22:01:53,280 INFO L273 TraceCheckUtils]: 38: Hoare triple {2212#(and (not (= dll_insert_~new_node~0.base (_ bv0 32))) (= |dll_insert_#in~head.base| dll_insert_~head.base) (= dll_insert_~head.offset |dll_insert_#in~head.offset|))} assume #t~mem11.base != 0bv32 || #t~mem11.offset != 0bv32;havoc #t~mem11.base, #t~mem11.offset;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, #t~mem12.base, ~bvadd32(8bv32, #t~mem12.offset), 4bv32);havoc #t~mem12.base, #t~mem12.offset; {2212#(and (not (= dll_insert_~new_node~0.base (_ bv0 32))) (= |dll_insert_#in~head.base| dll_insert_~head.base) (= dll_insert_~head.offset |dll_insert_#in~head.offset|))} is VALID [2018-11-18 22:01:53,289 INFO L273 TraceCheckUtils]: 39: Hoare triple {2212#(and (not (= dll_insert_~new_node~0.base (_ bv0 32))) (= |dll_insert_#in~head.base| dll_insert_~head.base) (= dll_insert_~head.offset |dll_insert_#in~head.offset|))} call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~head.base, ~head.offset, 4bv32); {2228#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)))} is VALID [2018-11-18 22:01:53,302 INFO L273 TraceCheckUtils]: 40: Hoare triple {2228#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)))} assume true; {2228#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)))} is VALID [2018-11-18 22:01:53,327 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {2228#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)))} {2120#(= |main_~#s~0.offset| (_ bv0 32))} #145#return; {2235#(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:01:53,336 INFO L273 TraceCheckUtils]: 42: Hoare triple {2235#(and (= |main_~#s~0.offset| (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset;~count~0 := 0bv32; {2239#(not (= (_ bv0 32) main_~ptr~0.base))} is VALID [2018-11-18 22:01:53,349 INFO L273 TraceCheckUtils]: 43: Hoare triple {2239#(not (= (_ bv0 32) main_~ptr~0.base))} assume true; {2239#(not (= (_ bv0 32) main_~ptr~0.base))} is VALID [2018-11-18 22:01:53,362 INFO L273 TraceCheckUtils]: 44: Hoare triple {2239#(not (= (_ bv0 32) main_~ptr~0.base))} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {2101#false} is VALID [2018-11-18 22:01:53,362 INFO L273 TraceCheckUtils]: 45: Hoare triple {2101#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {2101#false} is VALID [2018-11-18 22:01:53,362 INFO L273 TraceCheckUtils]: 46: Hoare triple {2101#false} assume !false; {2101#false} is VALID [2018-11-18 22:01:53,366 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-18 22:01:53,366 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (7)] Exception during sending of exit command (exit): Broken pipe [2018-11-18 22:01:53,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:01:53,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 22:01:53,371 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-11-18 22:01:53,371 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:01:53,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-18 22:01:53,525 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:01:53,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 22:01:53,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 22:01:53,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-11-18 22:01:53,527 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 11 states. [2018-11-18 22:01:56,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:01:56,350 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2018-11-18 22:01:56,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 22:01:56,350 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-11-18 22:01:56,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:01:56,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 22:01:56,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 67 transitions. [2018-11-18 22:01:56,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 22:01:56,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 67 transitions. [2018-11-18 22:01:56,355 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 67 transitions. [2018-11-18 22:01:56,514 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:01:56,516 INFO L225 Difference]: With dead ends: 70 [2018-11-18 22:01:56,516 INFO L226 Difference]: Without dead ends: 67 [2018-11-18 22:01:56,517 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-18 22:01:56,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-18 22:01:56,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2018-11-18 22:01:56,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:01:56,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 58 states. [2018-11-18 22:01:56,574 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 58 states. [2018-11-18 22:01:56,574 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 58 states. [2018-11-18 22:01:56,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:01:56,577 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2018-11-18 22:01:56,577 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2018-11-18 22:01:56,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:01:56,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:01:56,578 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 67 states. [2018-11-18 22:01:56,578 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 67 states. [2018-11-18 22:01:56,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:01:56,580 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2018-11-18 22:01:56,581 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2018-11-18 22:01:56,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:01:56,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:01:56,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:01:56,581 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:01:56,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-18 22:01:56,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-11-18 22:01:56,584 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 47 [2018-11-18 22:01:56,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:01:56,584 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-11-18 22:01:56,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 22:01:56,584 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-11-18 22:01:56,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 22:01:56,585 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:01:56,585 INFO L375 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:01:56,585 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:01:56,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:01:56,586 INFO L82 PathProgramCache]: Analyzing trace with hash 289987185, now seen corresponding path program 1 times [2018-11-18 22:01:56,586 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:01:56,586 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 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 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:01:56,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:01:56,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:01:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:01:56,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:01:56,868 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:01:56,882 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:01:56,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:01:56,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:01:56,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:01:56,895 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-18 22:01:57,071 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:01:57,078 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:01:57,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:01:57,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:01:57,108 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:01:57,120 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:01:57,121 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 22:01:57,125 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:01:57,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:01:57,141 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-11-18 22:01:57,238 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:01:57,340 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 15 treesize of output 11 [2018-11-18 22:01:57,348 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 11 treesize of output 3 [2018-11-18 22:01:57,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:01:57,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:01:57,370 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 19 treesize of output 15 [2018-11-18 22:01:57,381 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 15 treesize of output 7 [2018-11-18 22:01:57,382 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 22:01:57,384 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:01:57,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:01:57,395 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:16 [2018-11-18 22:01:57,401 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:01:57,447 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 15 treesize of output 11 [2018-11-18 22:01:57,453 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 11 treesize of output 3 [2018-11-18 22:01:57,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:01:57,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:01:57,463 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:01:57,464 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:9 [2018-11-18 22:01:57,469 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:01:57,501 INFO L256 TraceCheckUtils]: 0: Hoare triple {2559#true} call ULTIMATE.init(); {2559#true} is VALID [2018-11-18 22:01:57,502 INFO L273 TraceCheckUtils]: 1: Hoare triple {2559#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2559#true} is VALID [2018-11-18 22:01:57,502 INFO L273 TraceCheckUtils]: 2: Hoare triple {2559#true} assume true; {2559#true} is VALID [2018-11-18 22:01:57,502 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2559#true} {2559#true} #151#return; {2559#true} is VALID [2018-11-18 22:01:57,502 INFO L256 TraceCheckUtils]: 4: Hoare triple {2559#true} call #t~ret19 := main(); {2559#true} is VALID [2018-11-18 22:01:57,503 INFO L273 TraceCheckUtils]: 5: Hoare triple {2559#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); {2579#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:01:57,504 INFO L256 TraceCheckUtils]: 6: Hoare triple {2579#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret13.base, #t~ret13.offset := dll_create(~len~0, ~data~0); {2559#true} is VALID [2018-11-18 22:01:57,504 INFO L273 TraceCheckUtils]: 7: Hoare triple {2559#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {2559#true} is VALID [2018-11-18 22:01:57,505 INFO L273 TraceCheckUtils]: 8: Hoare triple {2559#true} assume true; {2559#true} is VALID [2018-11-18 22:01:57,505 INFO L273 TraceCheckUtils]: 9: Hoare triple {2559#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2559#true} is VALID [2018-11-18 22:01:57,505 INFO L273 TraceCheckUtils]: 10: Hoare triple {2559#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2559#true} is VALID [2018-11-18 22:01:57,505 INFO L273 TraceCheckUtils]: 11: Hoare triple {2559#true} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {2559#true} is VALID [2018-11-18 22:01:57,506 INFO L273 TraceCheckUtils]: 12: Hoare triple {2559#true} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {2559#true} is VALID [2018-11-18 22:01:57,506 INFO L273 TraceCheckUtils]: 13: Hoare triple {2559#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {2559#true} is VALID [2018-11-18 22:01:57,506 INFO L273 TraceCheckUtils]: 14: Hoare triple {2559#true} assume true; {2559#true} is VALID [2018-11-18 22:01:57,506 INFO L273 TraceCheckUtils]: 15: Hoare triple {2559#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2559#true} is VALID [2018-11-18 22:01:57,506 INFO L273 TraceCheckUtils]: 16: Hoare triple {2559#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2559#true} is VALID [2018-11-18 22:01:57,507 INFO L273 TraceCheckUtils]: 17: Hoare triple {2559#true} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {2559#true} is VALID [2018-11-18 22:01:57,507 INFO L273 TraceCheckUtils]: 18: Hoare triple {2559#true} assume ~head~0.base != 0bv32 || ~head~0.offset != 0bv32;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32); {2559#true} is VALID [2018-11-18 22:01:57,507 INFO L273 TraceCheckUtils]: 19: Hoare triple {2559#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {2559#true} is VALID [2018-11-18 22:01:57,507 INFO L273 TraceCheckUtils]: 20: Hoare triple {2559#true} assume true; {2559#true} is VALID [2018-11-18 22:01:57,508 INFO L273 TraceCheckUtils]: 21: Hoare triple {2559#true} assume !~bvsgt32(~len, 0bv32); {2559#true} is VALID [2018-11-18 22:01:57,508 INFO L273 TraceCheckUtils]: 22: Hoare triple {2559#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2559#true} is VALID [2018-11-18 22:01:57,508 INFO L273 TraceCheckUtils]: 23: Hoare triple {2559#true} assume true; {2559#true} is VALID [2018-11-18 22:01:57,513 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {2559#true} {2579#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} #143#return; {2579#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:01:57,514 INFO L273 TraceCheckUtils]: 25: Hoare triple {2579#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} call write~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret13.base, #t~ret13.offset; {2579#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:01:57,514 INFO L256 TraceCheckUtils]: 26: Hoare triple {2579#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} call dll_insert(~#s~0.base, ~#s~0.offset, ~data~0, ~bvsdiv32(~len~0, 2bv32)); {2559#true} is VALID [2018-11-18 22:01:57,515 INFO L273 TraceCheckUtils]: 27: Hoare triple {2559#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {2646#(and (= |dll_insert_#in~data| dll_insert_~data) (= |dll_insert_#in~head.base| dll_insert_~head.base) (= dll_insert_~head.offset |dll_insert_#in~head.offset|))} is VALID [2018-11-18 22:01:57,515 INFO L256 TraceCheckUtils]: 28: Hoare triple {2646#(and (= |dll_insert_#in~data| dll_insert_~data) (= |dll_insert_#in~head.base| dll_insert_~head.base) (= dll_insert_~head.offset |dll_insert_#in~head.offset|))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {2559#true} is VALID [2018-11-18 22:01:57,516 INFO L273 TraceCheckUtils]: 29: Hoare triple {2559#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2653#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)))} is VALID [2018-11-18 22:01:57,517 INFO L273 TraceCheckUtils]: 30: Hoare triple {2653#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2653#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)))} is VALID [2018-11-18 22:01:57,520 INFO L273 TraceCheckUtils]: 31: Hoare triple {2653#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2660#(and (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-18 22:01:57,521 INFO L273 TraceCheckUtils]: 32: Hoare triple {2660#(and (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)) (= |node_create_#res.offset| (_ bv0 32)))} assume true; {2660#(and (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-18 22:01:57,522 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {2660#(and (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)) (= |node_create_#res.offset| (_ bv0 32)))} {2646#(and (= |dll_insert_#in~data| dll_insert_~data) (= |dll_insert_#in~head.base| dll_insert_~head.base) (= dll_insert_~head.offset |dll_insert_#in~head.offset|))} #139#return; {2667#(and (= (_ bv0 32) |dll_insert_#t~ret6.offset|) (= |dll_insert_#in~head.base| dll_insert_~head.base) (= |dll_insert_#in~data| (select (select |#memory_int| |dll_insert_#t~ret6.base|) (_ bv0 32))) (= dll_insert_~head.offset |dll_insert_#in~head.offset|))} is VALID [2018-11-18 22:01:57,523 INFO L273 TraceCheckUtils]: 34: Hoare triple {2667#(and (= (_ bv0 32) |dll_insert_#t~ret6.offset|) (= |dll_insert_#in~head.base| dll_insert_~head.base) (= |dll_insert_#in~data| (select (select |#memory_int| |dll_insert_#t~ret6.base|) (_ bv0 32))) (= dll_insert_~head.offset |dll_insert_#in~head.offset|))} ~new_node~0.base, ~new_node~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0bv32, 0bv32;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~last~0.base, ~last~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {2671#(and (= |dll_insert_#in~head.base| dll_insert_~head.base) (= |dll_insert_#in~data| (select (select |#memory_int| dll_insert_~new_node~0.base) (_ bv0 32))) (= dll_insert_~head.offset |dll_insert_#in~head.offset|) (= (_ bv0 32) dll_insert_~new_node~0.offset))} is VALID [2018-11-18 22:01:57,523 INFO L273 TraceCheckUtils]: 35: Hoare triple {2671#(and (= |dll_insert_#in~head.base| dll_insert_~head.base) (= |dll_insert_#in~data| (select (select |#memory_int| dll_insert_~new_node~0.base) (_ bv0 32))) (= dll_insert_~head.offset |dll_insert_#in~head.offset|) (= (_ bv0 32) dll_insert_~new_node~0.offset))} assume true; {2671#(and (= |dll_insert_#in~head.base| dll_insert_~head.base) (= |dll_insert_#in~data| (select (select |#memory_int| dll_insert_~new_node~0.base) (_ bv0 32))) (= dll_insert_~head.offset |dll_insert_#in~head.offset|) (= (_ bv0 32) dll_insert_~new_node~0.offset))} is VALID [2018-11-18 22:01:57,524 INFO L273 TraceCheckUtils]: 36: Hoare triple {2671#(and (= |dll_insert_#in~head.base| dll_insert_~head.base) (= |dll_insert_#in~data| (select (select |#memory_int| dll_insert_~new_node~0.base) (_ bv0 32))) (= dll_insert_~head.offset |dll_insert_#in~head.offset|) (= (_ bv0 32) dll_insert_~new_node~0.offset))} assume !~bvsgt32(~index, 0bv32); {2671#(and (= |dll_insert_#in~head.base| dll_insert_~head.base) (= |dll_insert_#in~data| (select (select |#memory_int| dll_insert_~new_node~0.base) (_ bv0 32))) (= dll_insert_~head.offset |dll_insert_#in~head.offset|) (= (_ bv0 32) dll_insert_~new_node~0.offset))} is VALID [2018-11-18 22:01:57,524 INFO L273 TraceCheckUtils]: 37: Hoare triple {2671#(and (= |dll_insert_#in~head.base| dll_insert_~head.base) (= |dll_insert_#in~data| (select (select |#memory_int| dll_insert_~new_node~0.base) (_ bv0 32))) (= dll_insert_~head.offset |dll_insert_#in~head.offset|) (= (_ bv0 32) dll_insert_~new_node~0.offset))} assume !(~snd_to_last~0.base != 0bv32 || ~snd_to_last~0.offset != 0bv32);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem10.base, #t~mem10.offset, ~new_node~0.base, ~bvadd32(4bv32, ~new_node~0.offset), 4bv32);havoc #t~mem10.base, #t~mem10.offset;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {2671#(and (= |dll_insert_#in~head.base| dll_insert_~head.base) (= |dll_insert_#in~data| (select (select |#memory_int| dll_insert_~new_node~0.base) (_ bv0 32))) (= dll_insert_~head.offset |dll_insert_#in~head.offset|) (= (_ bv0 32) dll_insert_~new_node~0.offset))} is VALID [2018-11-18 22:01:57,525 INFO L273 TraceCheckUtils]: 38: Hoare triple {2671#(and (= |dll_insert_#in~head.base| dll_insert_~head.base) (= |dll_insert_#in~data| (select (select |#memory_int| dll_insert_~new_node~0.base) (_ bv0 32))) (= dll_insert_~head.offset |dll_insert_#in~head.offset|) (= (_ bv0 32) dll_insert_~new_node~0.offset))} assume #t~mem11.base != 0bv32 || #t~mem11.offset != 0bv32;havoc #t~mem11.base, #t~mem11.offset;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, #t~mem12.base, ~bvadd32(8bv32, #t~mem12.offset), 4bv32);havoc #t~mem12.base, #t~mem12.offset; {2671#(and (= |dll_insert_#in~head.base| dll_insert_~head.base) (= |dll_insert_#in~data| (select (select |#memory_int| dll_insert_~new_node~0.base) (_ bv0 32))) (= dll_insert_~head.offset |dll_insert_#in~head.offset|) (= (_ bv0 32) dll_insert_~new_node~0.offset))} is VALID [2018-11-18 22:01:57,527 INFO L273 TraceCheckUtils]: 39: Hoare triple {2671#(and (= |dll_insert_#in~head.base| dll_insert_~head.base) (= |dll_insert_#in~data| (select (select |#memory_int| dll_insert_~new_node~0.base) (_ bv0 32))) (= dll_insert_~head.offset |dll_insert_#in~head.offset|) (= (_ bv0 32) dll_insert_~new_node~0.offset))} call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~head.base, ~head.offset, 4bv32); {2687#(and (= |dll_insert_#in~data| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv0 32)))} is VALID [2018-11-18 22:01:57,528 INFO L273 TraceCheckUtils]: 40: Hoare triple {2687#(and (= |dll_insert_#in~data| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv0 32)))} assume true; {2687#(and (= |dll_insert_#in~data| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv0 32)))} is VALID [2018-11-18 22:01:57,545 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {2687#(and (= |dll_insert_#in~data| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv0 32)))} {2579#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} #145#return; {2694#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) main_~data~0) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:01:57,546 INFO L273 TraceCheckUtils]: 42: Hoare triple {2694#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) main_~data~0) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset;~count~0 := 0bv32; {2698#(and (= main_~data~0 (select (select |#memory_int| main_~ptr~0.base) (_ bv0 32))) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~ptr~0.offset (_ bv0 32)))} is VALID [2018-11-18 22:01:57,565 INFO L273 TraceCheckUtils]: 43: Hoare triple {2698#(and (= main_~data~0 (select (select |#memory_int| main_~ptr~0.base) (_ bv0 32))) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~ptr~0.offset (_ bv0 32)))} assume true; {2698#(and (= main_~data~0 (select (select |#memory_int| main_~ptr~0.base) (_ bv0 32))) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~ptr~0.offset (_ bv0 32)))} is VALID [2018-11-18 22:01:57,567 INFO L273 TraceCheckUtils]: 44: Hoare triple {2698#(and (= main_~data~0 (select (select |#memory_int| main_~ptr~0.base) (_ bv0 32))) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~ptr~0.offset (_ bv0 32)))} assume !!(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32);call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32);~temp~2.base, ~temp~2.offset := #t~mem15.base, #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset;call #t~mem16 := read~intINTTYPE4(~ptr~0.base, ~ptr~0.offset, 4bv32); {2705#(and (= |main_#t~mem16| main_~data~0) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:01:57,568 INFO L273 TraceCheckUtils]: 45: Hoare triple {2705#(and (= |main_#t~mem16| main_~data~0) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~data~0 != #t~mem16;havoc #t~mem16; {2560#false} is VALID [2018-11-18 22:01:57,568 INFO L273 TraceCheckUtils]: 46: Hoare triple {2560#false} assume !false; {2560#false} is VALID [2018-11-18 22:01:57,573 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-18 22:01:57,573 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:01:57,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:01:57,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-18 22:01:57,576 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2018-11-18 22:01:57,576 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:01:57,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-18 22:01:57,659 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:01:57,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 22:01:57,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 22:01:57,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:01:57,660 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 12 states. [2018-11-18 22:02:01,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:02:01,287 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2018-11-18 22:02:01,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 22:02:01,287 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2018-11-18 22:02:01,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:02:01,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:02:01,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 64 transitions. [2018-11-18 22:02:01,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:02:01,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 64 transitions. [2018-11-18 22:02:01,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 64 transitions. [2018-11-18 22:02:01,504 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:02:01,507 INFO L225 Difference]: With dead ends: 67 [2018-11-18 22:02:01,507 INFO L226 Difference]: Without dead ends: 65 [2018-11-18 22:02:01,508 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2018-11-18 22:02:01,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-18 22:02:01,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2018-11-18 22:02:01,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:02:01,569 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 59 states. [2018-11-18 22:02:01,569 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 59 states. [2018-11-18 22:02:01,569 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 59 states. [2018-11-18 22:02:01,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:02:01,571 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2018-11-18 22:02:01,572 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2018-11-18 22:02:01,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:02:01,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:02:01,572 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 65 states. [2018-11-18 22:02:01,572 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 65 states. [2018-11-18 22:02:01,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:02:01,575 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2018-11-18 22:02:01,575 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2018-11-18 22:02:01,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:02:01,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:02:01,576 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:02:01,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:02:01,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-18 22:02:01,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2018-11-18 22:02:01,578 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 47 [2018-11-18 22:02:01,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:02:01,578 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2018-11-18 22:02:01,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 22:02:01,578 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2018-11-18 22:02:01,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-18 22:02:01,579 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:02:01,579 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:02:01,580 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:02:01,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:02:01,580 INFO L82 PathProgramCache]: Analyzing trace with hash -557633239, now seen corresponding path program 1 times [2018-11-18 22:02:01,580 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:02:01,581 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 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 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:02:01,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:02:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:02:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:02:01,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:02:01,968 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:02:01,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:01,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:01,980 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 22:02:01,983 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:02:02,125 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 18 treesize of output 15 [2018-11-18 22:02:02,130 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-18 22:02:02,147 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:02,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-18 22:02:02,153 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:02,164 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:02,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:02,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:02,203 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:48, output treesize:48 [2018-11-18 22:02:02,324 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:02,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 79 [2018-11-18 22:02:02,349 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 16 treesize of output 15 [2018-11-18 22:02:02,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:02,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:02,426 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:02:02,426 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:82, output treesize:72 [2018-11-18 22:02:02,449 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:02:04,729 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 33 [2018-11-18 22:02:06,949 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 33 [2018-11-18 22:02:07,190 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:07,193 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:07,196 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:07,198 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 35 treesize of output 56 [2018-11-18 22:02:07,221 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 36 treesize of output 48 [2018-11-18 22:02:07,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:07,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:07,308 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:02:07,308 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:71 [2018-11-18 22:02:07,318 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:02:07,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 61 [2018-11-18 22:02:07,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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:02:07,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:07,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:07,716 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:02:07,740 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:02:07,741 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:07,748 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:07,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:02:07,807 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:92, output treesize:119 [2018-11-18 22:02:14,148 WARN L180 SmtUtils]: Spent 2.12 s on a formula simplification that was a NOOP. DAG size: 42 [2018-11-18 22:02:16,253 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_insert_~new_node~0.base (_ BitVec 32)) (dll_insert_~last~0.offset (_ BitVec 32)) (dll_insert_~new_node~0.offset (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| dll_insert_~new_node~0.base)) (= |c_#memory_$Pointer$.base| (let ((.cse4 (store |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))))) (let ((.cse3 (select (select .cse4 |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|))) (let ((.cse5 (select .cse4 .cse3)) (.cse6 (bvadd (select (select (store |c_old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |c_old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|) (_ bv4 32)))) (let ((.cse1 (select .cse5 .cse6))) (let ((.cse0 (let ((.cse2 (store .cse4 .cse3 (store .cse5 .cse6 dll_insert_~new_node~0.base)))) (store .cse2 dll_insert_~new_node~0.base (store (store (select .cse2 dll_insert_~new_node~0.base) (bvadd dll_insert_~new_node~0.offset (_ bv8 32)) .cse3) (bvadd dll_insert_~new_node~0.offset (_ bv4 32)) .cse1))))) (store .cse0 .cse1 (store (select .cse0 .cse1) (bvadd dll_insert_~last~0.offset (_ bv8 32)) dll_insert_~new_node~0.base)))))))))) is different from true [2018-11-18 22:02:39,103 WARN L180 SmtUtils]: Spent 20.66 s on a formula simplification. DAG size of input: 171 DAG size of output: 71 [2018-11-18 22:02:39,185 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:39,223 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:39,249 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:39,249 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:02:39,250 INFO L303 Elim1Store]: Index analysis took 130 ms [2018-11-18 22:02:39,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 61 [2018-11-18 22:02:39,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:39,868 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:39,883 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:02:40,371 INFO L303 Elim1Store]: Index analysis took 577 ms [2018-11-18 22:02:40,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 424 treesize of output 265 [2018-11-18 22:02:40,393 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-18 22:02:40,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2018-11-18 22:02:40,408 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:40,516 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:40,859 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:40,998 INFO L303 Elim1Store]: Index analysis took 217 ms [2018-11-18 22:02:40,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 306 treesize of output 204 [2018-11-18 22:02:41,684 WARN L180 SmtUtils]: Spent 651.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2018-11-18 22:02:41,705 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:02:41,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 99 [2018-11-18 22:02:41,734 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:02:41,950 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:42,056 INFO L303 Elim1Store]: Index analysis took 139 ms [2018-11-18 22:02:42,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 129 [2018-11-18 22:02:42,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 44 [2018-11-18 22:02:42,219 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:42,220 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:02:42,223 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:42,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2018-11-18 22:02:42,232 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:42,397 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:42,400 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:42,403 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:42,406 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:42,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 69 [2018-11-18 22:02:42,416 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:42,754 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:42,758 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:42,762 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:42,773 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:42,777 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:42,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 83 [2018-11-18 22:02:42,821 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-11-18 22:02:43,054 INFO L267 ElimStorePlain]: Start of recursive call 9: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-18 22:02:43,460 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:43,660 INFO L303 Elim1Store]: Index analysis took 241 ms [2018-11-18 22:02:43,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 153 [2018-11-18 22:02:43,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 55 [2018-11-18 22:02:43,799 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-11-18 22:02:44,027 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 22:02:44,054 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:44,080 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:44,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 152 [2018-11-18 22:02:44,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 55 [2018-11-18 22:02:44,200 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-11-18 22:02:44,409 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 22:02:44,442 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:44,475 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:44,493 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:44,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 167 [2018-11-18 22:02:44,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 55 [2018-11-18 22:02:44,668 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-11-18 22:02:44,876 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 22:02:44,901 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:44,933 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:44,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 159 [2018-11-18 22:02:45,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 55 [2018-11-18 22:02:45,062 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-11-18 22:02:45,245 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 22:02:45,931 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 8 xjuncts. [2018-11-18 22:02:46,550 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 8 xjuncts. [2018-11-18 22:02:47,293 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 8 xjuncts. [2018-11-18 22:02:48,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 153 [2018-11-18 22:02:48,221 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 21 treesize of output 17 [2018-11-18 22:02:48,246 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:48,361 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:48,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 129 [2018-11-18 22:02:48,391 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 21 treesize of output 17 [2018-11-18 22:02:48,395 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:48,474 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:48,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 141 [2018-11-18 22:02:48,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-18 22:02:48,500 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:48,589 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:48,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 134 [2018-11-18 22:02:48,642 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 21 treesize of output 17 [2018-11-18 22:02:48,643 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:48,729 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:48,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 143 [2018-11-18 22:02:48,757 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 21 treesize of output 17 [2018-11-18 22:02:48,759 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:48,866 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:48,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 141 [2018-11-18 22:02:48,891 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 21 treesize of output 17 [2018-11-18 22:02:48,892 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:48,985 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:48,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 131 [2018-11-18 22:02:49,014 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 21 treesize of output 17 [2018-11-18 22:02:49,016 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:49,111 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:49,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 122 [2018-11-18 22:02:49,157 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 21 treesize of output 17 [2018-11-18 22:02:49,160 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:49,228 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:50,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 14 dim-0 vars, and 8 xjuncts. [2018-11-18 22:02:50,248 INFO L202 ElimStorePlain]: Needed 36 recursive calls to eliminate 7 variables, input treesize:693, output treesize:1647 [2018-11-18 22:02:52,755 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:02:54,410 WARN L180 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 148 DAG size of output: 91 [2018-11-18 22:02:54,635 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:54,645 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:54,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 89 [2018-11-18 22:02:54,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-11-18 22:02:54,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:54,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 29 [2018-11-18 22:02:54,795 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:54,829 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 9 treesize of output 1 [2018-11-18 22:02:54,830 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:54,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-18 22:02:54,854 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:54,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:55,330 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:55,405 INFO L303 Elim1Store]: Index analysis took 109 ms [2018-11-18 22:02:55,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 105 [2018-11-18 22:02:55,426 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:55,432 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:55,436 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:55,446 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:55,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 59 [2018-11-18 22:02:55,461 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-18 22:02:55,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 53 treesize of output 43 [2018-11-18 22:02:55,590 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:55,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2018-11-18 22:02:55,598 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:55,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2018-11-18 22:02:55,722 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:55,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2018-11-18 22:02:55,731 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:55,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2018-11-18 22:02:55,781 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:55,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2018-11-18 22:02:55,786 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:55,824 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 22:02:56,518 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:56,521 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:56,524 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:56,530 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:56,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 98 [2018-11-18 22:02:56,582 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:56,600 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:56,732 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 91 [2018-11-18 22:02:56,732 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-18 22:02:57,190 INFO L267 ElimStorePlain]: Start of recursive call 16: 26 dim-0 vars, End of recursive call: 26 dim-0 vars, and 16 xjuncts. [2018-11-18 22:02:57,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 29 treesize of output 19 [2018-11-18 22:02:57,379 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:57,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-11-18 22:02:57,413 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:57,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-18 22:02:57,430 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:57,439 INFO L267 ElimStorePlain]: Start of recursive call 15: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:57,648 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:57,675 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:57,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 94 [2018-11-18 22:02:57,811 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:02:57,869 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 55 [2018-11-18 22:02:57,916 INFO L267 ElimStorePlain]: Start of recursive call 21: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-11-18 22:02:57,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 26 treesize of output 15 [2018-11-18 22:02:57,968 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:57,998 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 9 treesize of output 1 [2018-11-18 22:02:57,999 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:58,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-18 22:02:58,027 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-18 22:02:58,043 INFO L267 ElimStorePlain]: Start of recursive call 20: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:58,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:02:58,145 INFO L202 ElimStorePlain]: Needed 24 recursive calls to eliminate 13 variables, input treesize:699, output treesize:4 [2018-11-18 22:02:58,183 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:02:58,308 INFO L256 TraceCheckUtils]: 0: Hoare triple {3018#true} call ULTIMATE.init(); {3018#true} is VALID [2018-11-18 22:02:58,309 INFO L273 TraceCheckUtils]: 1: Hoare triple {3018#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3018#true} is VALID [2018-11-18 22:02:58,309 INFO L273 TraceCheckUtils]: 2: Hoare triple {3018#true} assume true; {3018#true} is VALID [2018-11-18 22:02:58,309 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3018#true} {3018#true} #151#return; {3018#true} is VALID [2018-11-18 22:02:58,309 INFO L256 TraceCheckUtils]: 4: Hoare triple {3018#true} call #t~ret19 := main(); {3018#true} is VALID [2018-11-18 22:02:58,322 INFO L273 TraceCheckUtils]: 5: Hoare triple {3018#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); {3038#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} is VALID [2018-11-18 22:02:58,323 INFO L256 TraceCheckUtils]: 6: Hoare triple {3038#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} call #t~ret13.base, #t~ret13.offset := dll_create(~len~0, ~data~0); {3042#(= |#valid| |old(#valid)|)} is VALID [2018-11-18 22:02:58,323 INFO L273 TraceCheckUtils]: 7: Hoare triple {3042#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {3042#(= |#valid| |old(#valid)|)} is VALID [2018-11-18 22:02:58,324 INFO L273 TraceCheckUtils]: 8: Hoare triple {3042#(= |#valid| |old(#valid)|)} assume true; {3042#(= |#valid| |old(#valid)|)} is VALID [2018-11-18 22:02:58,325 INFO L273 TraceCheckUtils]: 9: Hoare triple {3042#(= |#valid| |old(#valid)|)} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {3052#(and (= (select |old(#valid)| dll_create_~new_head~0.base) (_ bv0 1)) (= |#valid| (store |old(#valid)| dll_create_~new_head~0.base (_ bv1 1))))} is VALID [2018-11-18 22:02:58,325 INFO L273 TraceCheckUtils]: 10: Hoare triple {3052#(and (= (select |old(#valid)| dll_create_~new_head~0.base) (_ bv0 1)) (= |#valid| (store |old(#valid)| dll_create_~new_head~0.base (_ bv1 1))))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {3052#(and (= (select |old(#valid)| dll_create_~new_head~0.base) (_ bv0 1)) (= |#valid| (store |old(#valid)| dll_create_~new_head~0.base (_ bv1 1))))} is VALID [2018-11-18 22:02:58,326 INFO L273 TraceCheckUtils]: 11: Hoare triple {3052#(and (= (select |old(#valid)| dll_create_~new_head~0.base) (_ bv0 1)) (= |#valid| (store |old(#valid)| dll_create_~new_head~0.base (_ bv1 1))))} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {3052#(and (= (select |old(#valid)| dll_create_~new_head~0.base) (_ bv0 1)) (= |#valid| (store |old(#valid)| dll_create_~new_head~0.base (_ bv1 1))))} is VALID [2018-11-18 22:02:58,326 INFO L273 TraceCheckUtils]: 12: Hoare triple {3052#(and (= (select |old(#valid)| dll_create_~new_head~0.base) (_ bv0 1)) (= |#valid| (store |old(#valid)| dll_create_~new_head~0.base (_ bv1 1))))} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {3052#(and (= (select |old(#valid)| dll_create_~new_head~0.base) (_ bv0 1)) (= |#valid| (store |old(#valid)| dll_create_~new_head~0.base (_ bv1 1))))} is VALID [2018-11-18 22:02:58,329 INFO L273 TraceCheckUtils]: 13: Hoare triple {3052#(and (= (select |old(#valid)| dll_create_~new_head~0.base) (_ bv0 1)) (= |#valid| (store |old(#valid)| dll_create_~new_head~0.base (_ bv1 1))))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {3065#(and (= |#valid| (store |old(#valid)| dll_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| dll_create_~head~0.base)))} is VALID [2018-11-18 22:02:58,331 INFO L273 TraceCheckUtils]: 14: Hoare triple {3065#(and (= |#valid| (store |old(#valid)| dll_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| dll_create_~head~0.base)))} assume true; {3065#(and (= |#valid| (store |old(#valid)| dll_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| dll_create_~head~0.base)))} is VALID [2018-11-18 22:02:58,333 INFO L273 TraceCheckUtils]: 15: Hoare triple {3065#(and (= |#valid| (store |old(#valid)| dll_create_~head~0.base (_ bv1 1))) (= (_ bv0 1) (select |old(#valid)| dll_create_~head~0.base)))} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {3072#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (= (_ bv0 1) (select (store |old(#valid)| dll_create_~head~0.base (_ bv1 1)) dll_create_~new_head~0.base)) (= |#valid| (store (store |old(#valid)| dll_create_~head~0.base (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (not (= dll_create_~new_head~0.base (_ bv0 32))) (= (_ bv0 1) (select |old(#valid)| dll_create_~head~0.base)))} is VALID [2018-11-18 22:02:58,334 INFO L273 TraceCheckUtils]: 16: Hoare triple {3072#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (= (_ bv0 1) (select (store |old(#valid)| dll_create_~head~0.base (_ bv1 1)) dll_create_~new_head~0.base)) (= |#valid| (store (store |old(#valid)| dll_create_~head~0.base (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (not (= dll_create_~new_head~0.base (_ bv0 32))) (= (_ bv0 1) (select |old(#valid)| dll_create_~head~0.base)))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {3072#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (= (_ bv0 1) (select (store |old(#valid)| dll_create_~head~0.base (_ bv1 1)) dll_create_~new_head~0.base)) (= |#valid| (store (store |old(#valid)| dll_create_~head~0.base (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (not (= dll_create_~new_head~0.base (_ bv0 32))) (= (_ bv0 1) (select |old(#valid)| dll_create_~head~0.base)))} is VALID [2018-11-18 22:02:58,336 INFO L273 TraceCheckUtils]: 17: Hoare triple {3072#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (= (_ bv0 1) (select (store |old(#valid)| dll_create_~head~0.base (_ bv1 1)) dll_create_~new_head~0.base)) (= |#valid| (store (store |old(#valid)| dll_create_~head~0.base (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (not (= dll_create_~new_head~0.base (_ bv0 32))) (= (_ bv0 1) (select |old(#valid)| dll_create_~head~0.base)))} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {3079#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (= (_ bv0 1) (select (store |old(#valid)| dll_create_~head~0.base (_ bv1 1)) dll_create_~new_head~0.base)) (= |#valid| (store (store |old(#valid)| dll_create_~head~0.base (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (not (= dll_create_~new_head~0.base (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32))) dll_create_~head~0.base) (= (_ bv0 1) (select |old(#valid)| dll_create_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv8 32)))))} is VALID [2018-11-18 22:02:58,339 INFO L273 TraceCheckUtils]: 18: Hoare triple {3079#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (= (_ bv0 1) (select (store |old(#valid)| dll_create_~head~0.base (_ bv1 1)) dll_create_~new_head~0.base)) (= |#valid| (store (store |old(#valid)| dll_create_~head~0.base (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (not (= dll_create_~new_head~0.base (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32))) dll_create_~head~0.base) (= (_ bv0 1) (select |old(#valid)| dll_create_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv8 32)))))} assume ~head~0.base != 0bv32 || ~head~0.offset != 0bv32;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32); {3083#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (exists ((dll_create_~head~0.offset (_ BitVec 32))) (= dll_create_~new_head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32)))) (bvadd dll_create_~head~0.offset (_ bv8 32))))) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32))) (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (= (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32))) (_ bv1 1)) dll_create_~new_head~0.base) (_ bv0 1)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32)))) (_ bv0 1)) (not (= dll_create_~new_head~0.base (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv8 32)))))} is VALID [2018-11-18 22:02:58,342 INFO L273 TraceCheckUtils]: 19: Hoare triple {3083#(and (= (_ bv0 32) dll_create_~new_head~0.offset) (exists ((dll_create_~head~0.offset (_ BitVec 32))) (= dll_create_~new_head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32)))) (bvadd dll_create_~head~0.offset (_ bv8 32))))) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32))) (_ bv1 1)) dll_create_~new_head~0.base (_ bv1 1))) (= (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32))) (_ bv1 1)) dll_create_~new_head~0.base) (_ bv0 1)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32)))) (_ bv0 1)) (not (= dll_create_~new_head~0.base (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv8 32)))))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {3087#(and (= (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) (_ bv1 1)) dll_create_~head~0.base) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv8 32)))) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) (_ bv1 1)) dll_create_~head~0.base (_ bv1 1))) (= (_ bv0 32) dll_create_~head~0.offset) (not (= (_ bv0 32) dll_create_~head~0.base)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (_ bv0 1)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))) dll_create_~head~0.base)))} is VALID [2018-11-18 22:02:58,345 INFO L273 TraceCheckUtils]: 20: Hoare triple {3087#(and (= (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) (_ bv1 1)) dll_create_~head~0.base) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv8 32)))) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) (_ bv1 1)) dll_create_~head~0.base (_ bv1 1))) (= (_ bv0 32) dll_create_~head~0.offset) (not (= (_ bv0 32) dll_create_~head~0.base)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (_ bv0 1)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))) dll_create_~head~0.base)))} assume true; {3087#(and (= (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) (_ bv1 1)) dll_create_~head~0.base) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv8 32)))) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) (_ bv1 1)) dll_create_~head~0.base (_ bv1 1))) (= (_ bv0 32) dll_create_~head~0.offset) (not (= (_ bv0 32) dll_create_~head~0.base)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (_ bv0 1)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))) dll_create_~head~0.base)))} is VALID [2018-11-18 22:02:58,347 INFO L273 TraceCheckUtils]: 21: Hoare triple {3087#(and (= (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) (_ bv1 1)) dll_create_~head~0.base) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv8 32)))) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) (_ bv1 1)) dll_create_~head~0.base (_ bv1 1))) (= (_ bv0 32) dll_create_~head~0.offset) (not (= (_ bv0 32) dll_create_~head~0.base)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (_ bv0 1)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))) dll_create_~head~0.base)))} assume !~bvsgt32(~len, 0bv32); {3087#(and (= (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) (_ bv1 1)) dll_create_~head~0.base) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv8 32)))) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) (_ bv1 1)) dll_create_~head~0.base (_ bv1 1))) (= (_ bv0 32) dll_create_~head~0.offset) (not (= (_ bv0 32) dll_create_~head~0.base)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (_ bv0 1)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))) dll_create_~head~0.base)))} is VALID [2018-11-18 22:02:58,350 INFO L273 TraceCheckUtils]: 22: Hoare triple {3087#(and (= (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) (_ bv1 1)) dll_create_~head~0.base) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv8 32)))) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32))) (_ bv1 1)) dll_create_~head~0.base (_ bv1 1))) (= (_ bv0 32) dll_create_~head~0.offset) (not (= (_ bv0 32) dll_create_~head~0.base)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (_ bv0 1)) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))) dll_create_~head~0.base)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {3097#(and (= (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))) (_ bv1 1)) |dll_create_#res.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))) (_ bv1 1)) |dll_create_#res.base| (_ bv1 1))) (= |dll_create_#res.offset| (_ bv0 32)) (not (= |dll_create_#res.base| (_ bv0 32))) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv8 32)))) (exists ((v_subst_1 (_ BitVec 32))) (= |dll_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))))))} is VALID [2018-11-18 22:02:58,352 INFO L273 TraceCheckUtils]: 23: Hoare triple {3097#(and (= (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))) (_ bv1 1)) |dll_create_#res.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))) (_ bv1 1)) |dll_create_#res.base| (_ bv1 1))) (= |dll_create_#res.offset| (_ bv0 32)) (not (= |dll_create_#res.base| (_ bv0 32))) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv8 32)))) (exists ((v_subst_1 (_ BitVec 32))) (= |dll_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))))))} assume true; {3097#(and (= (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))) (_ bv1 1)) |dll_create_#res.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))) (_ bv1 1)) |dll_create_#res.base| (_ bv1 1))) (= |dll_create_#res.offset| (_ bv0 32)) (not (= |dll_create_#res.base| (_ bv0 32))) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv8 32)))) (exists ((v_subst_1 (_ BitVec 32))) (= |dll_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))))))} is VALID [2018-11-18 22:02:58,360 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {3097#(and (= (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))) (_ bv1 1)) |dll_create_#res.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))) (_ bv1 1)) |dll_create_#res.base| (_ bv1 1))) (= |dll_create_#res.offset| (_ bv0 32)) (not (= |dll_create_#res.base| (_ bv0 32))) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv8 32)))) (exists ((v_subst_1 (_ BitVec 32))) (= |dll_create_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_create_#res.base|) (bvadd |dll_create_#res.offset| (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))))))} {3038#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} #143#return; {3104#(and (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv4 32)) |main_#t~ret13.base|)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd (select |#valid| |main_#t~ret13.base|) (_ bv1 1)) (_ bv0 1)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv4 32)))) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv4 32)))) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) |main_#t~ret13.base|)) (not (= (select |#valid| |main_~#s~0.base|) (_ bv0 1))) (not (= |main_~#s~0.base| |main_#t~ret13.base|)) (not (= (_ bv0 32) |main_#t~ret13.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv8 32))) (= |main_#t~ret13.offset| (_ bv0 32)))} is VALID [2018-11-18 22:02:58,364 INFO L273 TraceCheckUtils]: 25: Hoare triple {3104#(and (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv4 32)) |main_#t~ret13.base|)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd (select |#valid| |main_#t~ret13.base|) (_ bv1 1)) (_ bv0 1)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv4 32)))) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv4 32)))) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))) |main_#t~ret13.base|)) (not (= (select |#valid| |main_~#s~0.base|) (_ bv0 1))) (not (= |main_~#s~0.base| |main_#t~ret13.base|)) (not (= (_ bv0 32) |main_#t~ret13.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv8 32))) (= |main_#t~ret13.offset| (_ bv0 32)))} call write~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret13.base, #t~ret13.offset; {3108#(and (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv1 1)) (_ bv0 1)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) |main_~#s~0.base|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv1 1)) (_ bv0 1)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv8 32)) (_ bv0 32)) (not (= (select |#valid| |main_~#s~0.base|) (_ bv0 1))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-18 22:02:58,365 INFO L256 TraceCheckUtils]: 26: Hoare triple {3108#(and (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv1 1)) (_ bv0 1)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) |main_~#s~0.base|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv1 1)) (_ bv0 1)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv8 32)) (_ bv0 32)) (not (= (select |#valid| |main_~#s~0.base|) (_ bv0 1))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} call dll_insert(~#s~0.base, ~#s~0.offset, ~data~0, ~bvsdiv32(~len~0, 2bv32)); {3112#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-18 22:02:58,366 INFO L273 TraceCheckUtils]: 27: Hoare triple {3112#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {3116#(and (= |dll_insert_#in~head.base| dll_insert_~head.base) (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= dll_insert_~head.offset |dll_insert_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-18 22:02:58,367 INFO L256 TraceCheckUtils]: 28: Hoare triple {3116#(and (= |dll_insert_#in~head.base| dll_insert_~head.base) (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= dll_insert_~head.offset |dll_insert_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {3112#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-18 22:02:58,368 INFO L273 TraceCheckUtils]: 29: Hoare triple {3112#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {3123#(and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-18 22:02:58,369 INFO L273 TraceCheckUtils]: 30: Hoare triple {3123#(and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= node_create_~temp~0.offset (_ bv0 32)) (= |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); {3123#(and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-18 22:02:58,370 INFO L273 TraceCheckUtils]: 31: Hoare triple {3123#(and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= node_create_~temp~0.offset (_ bv0 32)) (= |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, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {3130#(and (= (store |old(#memory_$Pointer$.offset)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.offset)| |node_create_#res.base|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |#memory_$Pointer$.offset|) (= (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)))} is VALID [2018-11-18 22:02:58,371 INFO L273 TraceCheckUtils]: 32: Hoare triple {3130#(and (= (store |old(#memory_$Pointer$.offset)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.offset)| |node_create_#res.base|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |#memory_$Pointer$.offset|) (= (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)))} assume true; {3130#(and (= (store |old(#memory_$Pointer$.offset)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.offset)| |node_create_#res.base|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |#memory_$Pointer$.offset|) (= (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)))} is VALID [2018-11-18 22:02:58,373 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {3130#(and (= (store |old(#memory_$Pointer$.offset)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.offset)| |node_create_#res.base|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |#memory_$Pointer$.offset|) (= (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)))} {3116#(and (= |dll_insert_#in~head.base| dll_insert_~head.base) (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= dll_insert_~head.offset |dll_insert_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} #139#return; {3137#(and (= |dll_insert_#in~head.base| dll_insert_~head.base) (= (store |old(#memory_$Pointer$.offset)| |dll_insert_#t~ret6.base| (store (store (select |old(#memory_$Pointer$.offset)| |dll_insert_#t~ret6.base|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |#memory_$Pointer$.offset|) (= (_ bv0 1) (select |old(#valid)| |dll_insert_#t~ret6.base|)) (= dll_insert_~head.offset |dll_insert_#in~head.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |dll_insert_#t~ret6.base| (store (store (select |old(#memory_$Pointer$.base)| |dll_insert_#t~ret6.base|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)))))} is VALID [2018-11-18 22:02:58,378 INFO L273 TraceCheckUtils]: 34: Hoare triple {3137#(and (= |dll_insert_#in~head.base| dll_insert_~head.base) (= (store |old(#memory_$Pointer$.offset)| |dll_insert_#t~ret6.base| (store (store (select |old(#memory_$Pointer$.offset)| |dll_insert_#t~ret6.base|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |#memory_$Pointer$.offset|) (= (_ bv0 1) (select |old(#valid)| |dll_insert_#t~ret6.base|)) (= dll_insert_~head.offset |dll_insert_#in~head.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |dll_insert_#t~ret6.base| (store (store (select |old(#memory_$Pointer$.base)| |dll_insert_#t~ret6.base|) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)))))} ~new_node~0.base, ~new_node~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0bv32, 0bv32;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~last~0.base, ~last~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {3141#(and (= dll_insert_~last~0.base (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| dll_insert_~new_node~0.base)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)))) (= (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) dll_insert_~last~0.offset))} is VALID [2018-11-18 22:02:58,380 INFO L273 TraceCheckUtils]: 35: Hoare triple {3141#(and (= dll_insert_~last~0.base (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| dll_insert_~new_node~0.base)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)))) (= (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) dll_insert_~last~0.offset))} assume true; {3141#(and (= dll_insert_~last~0.base (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| dll_insert_~new_node~0.base)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)))) (= (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) dll_insert_~last~0.offset))} is VALID [2018-11-18 22:02:58,382 INFO L273 TraceCheckUtils]: 36: Hoare triple {3141#(and (= dll_insert_~last~0.base (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| dll_insert_~new_node~0.base)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)))) (= (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) dll_insert_~last~0.offset))} assume !!~bvsgt32(~index, 0bv32);~snd_to_last~0.base, ~snd_to_last~0.offset := ~last~0.base, ~last~0.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~last~0.base, ~bvadd32(4bv32, ~last~0.offset), 4bv32);~last~0.base, ~last~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;#t~post9 := ~index;~index := ~bvsub32(#t~post9, 1bv32);havoc #t~post9; {3148#(and (= dll_insert_~snd_to_last~0.base (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (= (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) dll_insert_~snd_to_last~0.offset) (= (_ bv0 1) (select |old(#valid)| dll_insert_~new_node~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32))) dll_insert_~last~0.base) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)))))} is VALID [2018-11-18 22:02:58,383 INFO L273 TraceCheckUtils]: 37: Hoare triple {3148#(and (= dll_insert_~snd_to_last~0.base (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (= (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) dll_insert_~snd_to_last~0.offset) (= (_ bv0 1) (select |old(#valid)| dll_insert_~new_node~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32))) dll_insert_~last~0.base) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)))))} assume true; {3148#(and (= dll_insert_~snd_to_last~0.base (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (= (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) dll_insert_~snd_to_last~0.offset) (= (_ bv0 1) (select |old(#valid)| dll_insert_~new_node~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32))) dll_insert_~last~0.base) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)))))} is VALID [2018-11-18 22:02:58,385 INFO L273 TraceCheckUtils]: 38: Hoare triple {3148#(and (= dll_insert_~snd_to_last~0.base (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (= (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) dll_insert_~snd_to_last~0.offset) (= (_ bv0 1) (select |old(#valid)| dll_insert_~new_node~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32))) dll_insert_~last~0.base) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)))))} assume !~bvsgt32(~index, 0bv32); {3148#(and (= dll_insert_~snd_to_last~0.base (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (= (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) dll_insert_~snd_to_last~0.offset) (= (_ bv0 1) (select |old(#valid)| dll_insert_~new_node~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32))) dll_insert_~last~0.base) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)))))} is VALID [2018-11-18 22:02:58,395 INFO L273 TraceCheckUtils]: 39: Hoare triple {3148#(and (= dll_insert_~snd_to_last~0.base (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (= (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) dll_insert_~snd_to_last~0.offset) (= (_ bv0 1) (select |old(#valid)| dll_insert_~new_node~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32))) dll_insert_~last~0.base) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32)))))} assume ~snd_to_last~0.base != 0bv32 || ~snd_to_last~0.offset != 0bv32;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~snd_to_last~0.base, ~bvadd32(4bv32, ~snd_to_last~0.offset), 4bv32);call write~$Pointer$(~snd_to_last~0.base, ~snd_to_last~0.offset, ~new_node~0.base, ~bvadd32(8bv32, ~new_node~0.offset), 4bv32);call write~$Pointer$(~last~0.base, ~last~0.offset, ~new_node~0.base, ~bvadd32(4bv32, ~new_node~0.offset), 4bv32); {3158#(and (exists ((dll_insert_~new_node~0.offset (_ BitVec 32))) (= |#memory_$Pointer$.base| (store (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base (store (store (select (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base) (bvadd dll_insert_~new_node~0.offset (_ bv8 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd dll_insert_~new_node~0.offset (_ bv4 32)) dll_insert_~last~0.base)))) (= dll_insert_~last~0.base (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)))) (= (_ bv0 1) (select |old(#valid)| dll_insert_~new_node~0.base)))} is VALID [2018-11-18 22:02:58,407 INFO L273 TraceCheckUtils]: 40: Hoare triple {3158#(and (exists ((dll_insert_~new_node~0.offset (_ BitVec 32))) (= |#memory_$Pointer$.base| (store (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base (store (store (select (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base) (bvadd dll_insert_~new_node~0.offset (_ bv8 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd dll_insert_~new_node~0.offset (_ bv4 32)) dll_insert_~last~0.base)))) (= dll_insert_~last~0.base (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)))) (= (_ bv0 1) (select |old(#valid)| dll_insert_~new_node~0.base)))} assume ~last~0.base != 0bv32 || ~last~0.offset != 0bv32;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~last~0.base, ~bvadd32(8bv32, ~last~0.offset), 4bv32); {3162#(exists ((dll_insert_~new_node~0.base (_ BitVec 32)) (dll_insert_~last~0.offset (_ BitVec 32)) (dll_insert_~new_node~0.offset (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| dll_insert_~new_node~0.base)) (= |#memory_$Pointer$.base| (store (store (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base (store (store (select (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base) (bvadd dll_insert_~new_node~0.offset (_ bv8 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd dll_insert_~new_node~0.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32))))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32))) (store (select (store (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base (store (store (select (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base) (bvadd dll_insert_~new_node~0.offset (_ bv8 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd dll_insert_~new_node~0.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32))))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)))) (bvadd dll_insert_~last~0.offset (_ bv8 32)) dll_insert_~new_node~0.base)))))} is VALID [2018-11-18 22:02:58,408 INFO L273 TraceCheckUtils]: 41: Hoare triple {3162#(exists ((dll_insert_~new_node~0.base (_ BitVec 32)) (dll_insert_~last~0.offset (_ BitVec 32)) (dll_insert_~new_node~0.offset (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| dll_insert_~new_node~0.base)) (= |#memory_$Pointer$.base| (store (store (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base (store (store (select (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base) (bvadd dll_insert_~new_node~0.offset (_ bv8 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd dll_insert_~new_node~0.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32))))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32))) (store (select (store (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base (store (store (select (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base) (bvadd dll_insert_~new_node~0.offset (_ bv8 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd dll_insert_~new_node~0.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32))))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)))) (bvadd dll_insert_~last~0.offset (_ bv8 32)) dll_insert_~new_node~0.base)))))} assume true; {3162#(exists ((dll_insert_~new_node~0.base (_ BitVec 32)) (dll_insert_~last~0.offset (_ BitVec 32)) (dll_insert_~new_node~0.offset (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| dll_insert_~new_node~0.base)) (= |#memory_$Pointer$.base| (store (store (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base (store (store (select (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base) (bvadd dll_insert_~new_node~0.offset (_ bv8 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd dll_insert_~new_node~0.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32))))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32))) (store (select (store (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base (store (store (select (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base) (bvadd dll_insert_~new_node~0.offset (_ bv8 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd dll_insert_~new_node~0.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32))))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)))) (bvadd dll_insert_~last~0.offset (_ bv8 32)) dll_insert_~new_node~0.base)))))} is VALID [2018-11-18 22:02:58,458 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {3162#(exists ((dll_insert_~new_node~0.base (_ BitVec 32)) (dll_insert_~last~0.offset (_ BitVec 32)) (dll_insert_~new_node~0.offset (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| dll_insert_~new_node~0.base)) (= |#memory_$Pointer$.base| (store (store (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base (store (store (select (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base) (bvadd dll_insert_~new_node~0.offset (_ bv8 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd dll_insert_~new_node~0.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32))))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32))) (store (select (store (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base (store (store (select (store (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (store (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)) dll_insert_~new_node~0.base)) dll_insert_~new_node~0.base) (bvadd dll_insert_~new_node~0.offset (_ bv8 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd dll_insert_~new_node~0.offset (_ bv4 32)) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32))))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) (select (select (store |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|)) (bvadd (select (select (store |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (select |old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |dll_insert_#in~head.base|) |dll_insert_#in~head.offset|) (_ bv4 32)))) (bvadd dll_insert_~last~0.offset (_ bv8 32)) dll_insert_~new_node~0.base)))))} {3108#(and (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (_ bv1 1)) (_ bv0 1)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) |main_~#s~0.base|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv1 1)) (_ bv0 1)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv8 32)) (_ bv0 32)) (not (= (select |#valid| |main_~#s~0.base|) (_ bv0 1))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv4 32))) (bvadd v_subst_1 (_ bv8 32))))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} #145#return; {3169#(or (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv12 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv8 32)))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32))))) (exists ((v_prenex_10 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv8 32))) (bvadd v_prenex_10 (_ bv8 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32))) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv8 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv8 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv8 32)))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv8 32))) (= |main_~#s~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv8 32)) (_ bv0 32)) (exists ((dll_insert_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv0 32))) (bvadd dll_insert_~last~0.offset (_ bv8 32))))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv0 32)))) (not (= (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))) (and (exists ((v_prenex_7 (_ BitVec 32)) (dll_insert_~new_node~0.offset (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd dll_insert_~new_node~0.offset (_ bv4 32))))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd dll_insert_~new_node~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd dll_insert_~new_node~0.offset (_ bv8 32))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd dll_insert_~new_node~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd dll_insert_~new_node~0.offset (_ bv4 32)))) (bvadd v_prenex_7 (_ bv8 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv8 32))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32))) (= |main_~#s~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv8 32)) (_ bv0 32)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))) (and (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv8 32))) (= |main_~#s~0.offset| (_ bv0 32)) (exists ((v_prenex_11 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32))) (bvadd v_prenex_11 (_ bv8 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv8 32)) (_ bv0 32)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32)))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32)))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))))} is VALID [2018-11-18 22:02:58,463 INFO L273 TraceCheckUtils]: 43: Hoare triple {3169#(or (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv12 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv8 32)))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32))))) (exists ((v_prenex_10 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv8 32))) (bvadd v_prenex_10 (_ bv8 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32))) (= |main_~#s~0.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv8 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv8 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv8 32)))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv8 32))) (= |main_~#s~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv8 32)) (_ bv0 32)) (exists ((dll_insert_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv0 32))) (bvadd dll_insert_~last~0.offset (_ bv8 32))))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv0 32)))) (not (= (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))) (and (exists ((v_prenex_7 (_ BitVec 32)) (dll_insert_~new_node~0.offset (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd dll_insert_~new_node~0.offset (_ bv4 32))))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd dll_insert_~new_node~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd dll_insert_~new_node~0.offset (_ bv8 32))) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd dll_insert_~new_node~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (bvadd dll_insert_~new_node~0.offset (_ bv4 32)))) (bvadd v_prenex_7 (_ bv8 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv8 32))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32))) (= |main_~#s~0.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv8 32)) (_ bv0 32)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))) (and (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv8 32))) (= |main_~#s~0.offset| (_ bv0 32)) (exists ((v_prenex_11 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32))) (bvadd v_prenex_11 (_ bv8 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32))))) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv8 32)) (_ bv0 32)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32)))) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (bvadd |main_~#s~0.offset| (_ bv4 32)))) (_ bv4 32)))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))))} call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset;~count~0 := 0bv32; {3173#(not (= (_ bv0 32) main_~ptr~0.base))} is VALID [2018-11-18 22:02:58,464 INFO L273 TraceCheckUtils]: 44: Hoare triple {3173#(not (= (_ bv0 32) main_~ptr~0.base))} assume true; {3173#(not (= (_ bv0 32) main_~ptr~0.base))} is VALID [2018-11-18 22:02:58,464 INFO L273 TraceCheckUtils]: 45: Hoare triple {3173#(not (= (_ bv0 32) main_~ptr~0.base))} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {3019#false} is VALID [2018-11-18 22:02:58,464 INFO L273 TraceCheckUtils]: 46: Hoare triple {3019#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {3019#false} is VALID [2018-11-18 22:02:58,465 INFO L273 TraceCheckUtils]: 47: Hoare triple {3019#false} assume !false; {3019#false} is VALID [2018-11-18 22:02:58,484 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:02:58,484 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:02:58,961 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-11-18 22:02:59,094 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-18 22:03:00,531 WARN L180 SmtUtils]: Spent 1.42 s on a formula simplification that was a NOOP. DAG size: 86 [2018-11-18 22:03:01,320 WARN L180 SmtUtils]: Spent 733.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-11-18 22:03:02,684 WARN L180 SmtUtils]: Spent 1.35 s on a formula simplification that was a NOOP. DAG size: 71 [2018-11-18 22:03:04,457 WARN L180 SmtUtils]: Spent 1.77 s on a formula simplification that was a NOOP. DAG size: 65 [2018-11-18 22:03:10,480 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-11-18 22:03:10,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:03:10,488 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:03:10,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:03:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:03:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:03:10,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:03:10,687 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:03:10,696 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:10,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:03:10,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 22:03:10,705 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:03:12,738 WARN L854 $PredicateComparison]: unable to prove that (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1))) (= (select |c_old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)))) is different from true [2018-11-18 22:03:18,982 WARN L180 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 19 [2018-11-18 22:03:19,053 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:03:19,056 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:03:19,058 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:03:19,059 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 27 treesize of output 44 [2018-11-18 22:03:19,077 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 32 treesize of output 36 [2018-11-18 22:03:19,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:19,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:03:19,126 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:03:19,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:36 [2018-11-18 22:03:21,140 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:03:21,417 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:03:21,430 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:03:21,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:21,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:03:21,469 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:03:21,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:54 [2018-11-18 22:03:21,481 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:03:34,983 WARN L180 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 36 [2018-11-18 22:03:37,045 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_insert_~last~0.base (_ BitVec 32)) (dll_insert_~snd_to_last~0.offset (_ BitVec 32)) (dll_insert_~new_node~0.base (_ BitVec 32)) (dll_insert_~last~0.offset (_ BitVec 32)) (dll_insert_~new_node~0.offset (_ BitVec 32))) (and (not (= dll_insert_~new_node~0.base (_ bv0 32))) (= (let ((.cse0 (let ((.cse3 (store |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (select |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))))) (let ((.cse2 (select (select .cse3 |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|))) (let ((.cse1 (store .cse3 .cse2 (store (select .cse3 .cse2) (bvadd dll_insert_~snd_to_last~0.offset (_ bv4 32)) dll_insert_~new_node~0.base)))) (store .cse1 dll_insert_~new_node~0.base (store (store (select .cse1 dll_insert_~new_node~0.base) (bvadd dll_insert_~new_node~0.offset (_ bv8 32)) .cse2) (bvadd dll_insert_~new_node~0.offset (_ bv4 32)) dll_insert_~last~0.base))))))) (store .cse0 dll_insert_~last~0.base (store (select .cse0 dll_insert_~last~0.base) (bvadd dll_insert_~last~0.offset (_ bv8 32)) dll_insert_~new_node~0.base))) |c_#memory_$Pointer$.base|) (= (_ bv0 1) (select |c_old(#valid)| dll_insert_~new_node~0.base)))) is different from true [2018-11-18 22:03:42,807 WARN L180 SmtUtils]: Spent 5.64 s on a formula simplification. DAG size of input: 103 DAG size of output: 61 [2018-11-18 22:03:42,844 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:03:42,859 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:03:42,881 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:03:42,881 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:03:42,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-11-18 22:03:42,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:43,247 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:03:43,262 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:03:43,387 INFO L303 Elim1Store]: Index analysis took 166 ms [2018-11-18 22:03:43,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 244 treesize of output 162 [2018-11-18 22:03:43,407 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-18 22:03:43,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2018-11-18 22:03:43,434 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:43,516 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:03:43,879 INFO L303 Elim1Store]: Index analysis took 107 ms [2018-11-18 22:03:43,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 119 [2018-11-18 22:03:44,276 WARN L180 SmtUtils]: Spent 376.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-11-18 22:03:44,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-18 22:03:44,294 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:44,941 INFO L303 Elim1Store]: Index analysis took 245 ms [2018-11-18 22:03:44,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 99 [2018-11-18 22:03:45,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 44 [2018-11-18 22:03:45,060 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-18 22:03:45,061 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:45,284 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:03:45,284 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:03:45,291 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:03:45,310 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 32 treesize of output 57 [2018-11-18 22:03:45,312 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:45,530 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:03:45,533 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:03:45,538 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:03:45,542 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:03:45,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 69 [2018-11-18 22:03:45,561 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:45,765 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:03:45,770 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:03:45,780 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:03:45,795 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:03:45,801 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:03:45,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 83 [2018-11-18 22:03:45,866 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-18 22:03:46,110 INFO L267 ElimStorePlain]: Start of recursive call 9: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-18 22:03:46,487 INFO L303 Elim1Store]: Index analysis took 110 ms [2018-11-18 22:03:46,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 127 [2018-11-18 22:03:46,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 128 [2018-11-18 22:03:46,694 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-11-18 22:03:47,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 93 [2018-11-18 22:03:47,432 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:47,991 INFO L267 ElimStorePlain]: Start of recursive call 14: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 22:03:48,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 93 treesize of output 125 [2018-11-18 22:03:48,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 126 [2018-11-18 22:03:48,299 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-11-18 22:03:49,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 91 [2018-11-18 22:03:49,306 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:49,845 INFO L267 ElimStorePlain]: Start of recursive call 17: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 22:03:50,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 93 treesize of output 125 [2018-11-18 22:03:50,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 106 [2018-11-18 22:03:50,657 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:51,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 91 [2018-11-18 22:03:51,945 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:52,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 108 [2018-11-18 22:03:52,785 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-11-18 22:03:53,036 INFO L267 ElimStorePlain]: Start of recursive call 20: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 22:03:53,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 118 [2018-11-18 22:03:53,359 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-18 22:03:53,360 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:54,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 101 [2018-11-18 22:03:54,433 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2018-11-18 22:03:55,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 84 [2018-11-18 22:03:55,618 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-18 22:03:55,877 INFO L267 ElimStorePlain]: Start of recursive call 24: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 22:03:56,578 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 8 xjuncts. [2018-11-18 22:03:56,696 INFO L303 Elim1Store]: Index analysis took 109 ms [2018-11-18 22:03:56,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 110 [2018-11-18 22:03:56,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 60 [2018-11-18 22:03:56,872 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:03:56,884 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:03:56,895 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:03:56,912 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:03:56,917 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:03:56,922 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:03:56,926 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:03:56,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 114 [2018-11-18 22:03:56,981 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 2 xjuncts. [2018-11-18 22:04:01,808 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:01,808 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:04:01,813 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:01,817 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:01,821 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:01,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 84 [2018-11-18 22:04:01,825 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:02,339 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:02,343 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:02,349 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:02,354 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:02,359 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:02,365 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:02,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 100 [2018-11-18 22:04:02,371 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:02,687 INFO L267 ElimStorePlain]: Start of recursive call 29: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-18 22:04:03,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 94 [2018-11-18 22:04:03,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 61 [2018-11-18 22:04:03,218 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 2 xjuncts. [2018-11-18 22:04:03,332 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 22:04:03,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 99 [2018-11-18 22:04:03,472 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:03,489 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:03,518 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:03,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 119 [2018-11-18 22:04:03,612 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 8 xjuncts. [2018-11-18 22:04:04,002 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-18 22:04:04,048 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:04,066 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:04,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 116 [2018-11-18 22:04:04,118 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:04,178 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:04,200 INFO L303 Elim1Store]: Index analysis took 120 ms [2018-11-18 22:04:04,627 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 64 treesize of output 155 [2018-11-18 22:04:04,628 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-18 22:04:04,989 INFO L267 ElimStorePlain]: Start of recursive call 38: 32 dim-0 vars, End of recursive call: 32 dim-0 vars, and 56 xjuncts. [2018-11-18 22:04:07,551 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 11 xjuncts. [2018-11-18 22:04:07,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 99 [2018-11-18 22:04:07,676 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:07,701 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:07,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 94 [2018-11-18 22:04:07,782 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 4 xjuncts. [2018-11-18 22:04:08,003 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 22:04:10,406 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 20 xjuncts. [2018-11-18 22:04:14,296 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 26 xjuncts. [2018-11-18 22:04:17,973 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 24 xjuncts. [2018-11-18 22:04:22,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 45 dim-0 vars, and 24 xjuncts. [2018-11-18 22:04:22,027 INFO L202 ElimStorePlain]: Needed 40 recursive calls to eliminate 8 variables, input treesize:382, output treesize:3377 [2018-11-18 22:04:24,042 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:04:32,092 WARN L180 SmtUtils]: Spent 5.73 s on a formula simplification. DAG size of input: 572 DAG size of output: 349 [2018-11-18 22:04:32,894 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:32,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 104 [2018-11-18 22:04:33,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 69 [2018-11-18 22:04:33,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:34,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 58 [2018-11-18 22:04:34,173 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:35,138 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:35,140 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:35,148 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:35,149 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:35,155 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:35,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 62 [2018-11-18 22:04:35,203 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-18 22:04:36,288 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:36,291 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:36,293 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:36,296 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:36,311 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:36,313 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:36,318 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:36,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 84 [2018-11-18 22:04:36,355 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-18 22:04:37,346 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 40 treesize of output 33 [2018-11-18 22:04:37,348 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:37,927 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 52 treesize of output 45 [2018-11-18 22:04:37,929 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:38,814 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 78 treesize of output 71 [2018-11-18 22:04:38,816 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:39,250 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:39,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 59 [2018-11-18 22:04:39,261 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:39,675 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 39 treesize of output 32 [2018-11-18 22:04:39,677 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:40,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 32 treesize of output 21 [2018-11-18 22:04:40,033 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:40,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 18 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:04:46,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 57 [2018-11-18 22:04:46,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2018-11-18 22:04:46,666 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:46,690 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 9 treesize of output 1 [2018-11-18 22:04:46,691 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:46,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-18 22:04:46,705 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:46,712 INFO L267 ElimStorePlain]: Start of recursive call 13: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:04:52,454 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:52,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 66 [2018-11-18 22:04:52,504 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 52 [2018-11-18 22:04:52,517 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 22:04:52,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 34 treesize of output 15 [2018-11-18 22:04:52,601 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:52,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2018-11-18 22:04:52,642 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:52,650 INFO L267 ElimStorePlain]: Start of recursive call 17: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:04:57,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 85 [2018-11-18 22:04:57,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 37 treesize of output 36 [2018-11-18 22:04:57,979 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:58,050 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:58,057 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:04:58,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 51 [2018-11-18 22:04:58,060 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:58,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2018-11-18 22:04:58,104 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-18 22:04:58,117 INFO L267 ElimStorePlain]: Start of recursive call 21: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:05:02,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 77 [2018-11-18 22:05:02,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 37 treesize of output 36 [2018-11-18 22:05:02,784 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:02,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 36 treesize of output 17 [2018-11-18 22:05:02,855 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:02,898 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:05:02,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 49 [2018-11-18 22:05:02,919 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 2 xjuncts. [2018-11-18 22:05:02,959 INFO L267 ElimStorePlain]: Start of recursive call 25: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 22:05:07,794 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:05:07,800 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:05:07,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 101 [2018-11-18 22:05:07,840 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:05:07,877 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:05:07,956 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 81 [2018-11-18 22:05:07,972 INFO L267 ElimStorePlain]: Start of recursive call 30: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-18 22:05:08,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 41 [2018-11-18 22:05:08,085 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 2 xjuncts. [2018-11-18 22:05:08,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2018-11-18 22:05:08,161 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:08,174 INFO L267 ElimStorePlain]: Start of recursive call 29: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:05:12,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 69 [2018-11-18 22:05:12,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 45 treesize of output 28 [2018-11-18 22:05:12,185 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:12,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 26 treesize of output 15 [2018-11-18 22:05:12,219 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:12,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2018-11-18 22:05:12,272 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:12,278 INFO L267 ElimStorePlain]: Start of recursive call 33: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:05:15,822 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:05:15,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 121 [2018-11-18 22:05:16,009 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 111 treesize of output 104 [2018-11-18 22:05:16,011 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:17,580 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 83 treesize of output 69 [2018-11-18 22:05:17,583 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:18,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 66 [2018-11-18 22:05:18,942 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-18 22:05:20,269 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:05:20,270 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:05:20,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 65 [2018-11-18 22:05:20,298 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 2 xjuncts.