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/sll2n_append_equal_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 22:05:52,182 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 22:05:52,185 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 22:05:52,199 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 22:05:52,199 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 22:05:52,200 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 22:05:52,202 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 22:05:52,203 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 22:05:52,205 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 22:05:52,206 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 22:05:52,207 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 22:05:52,207 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 22:05:52,208 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 22:05:52,209 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 22:05:52,210 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 22:05:52,211 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 22:05:52,212 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 22:05:52,214 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 22:05:52,216 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 22:05:52,218 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 22:05:52,219 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 22:05:52,220 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 22:05:52,223 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 22:05:52,223 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 22:05:52,223 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 22:05:52,224 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 22:05:52,225 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 22:05:52,226 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 22:05:52,227 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 22:05:52,228 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 22:05:52,228 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 22:05:52,229 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 22:05:52,229 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 22:05:52,230 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 22:05:52,231 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 22:05:52,231 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 22:05:52,232 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:05:52,247 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 22:05:52,247 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 22:05:52,248 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 22:05:52,248 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 22:05:52,249 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 22:05:52,249 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 22:05:52,249 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 22:05:52,249 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 22:05:52,250 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 22:05:52,250 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 22:05:52,250 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 22:05:52,250 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 22:05:52,250 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 22:05:52,251 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 22:05:52,251 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 22:05:52,251 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 22:05:52,251 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 22:05:52,251 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 22:05:52,252 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 22:05:52,252 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 22:05:52,252 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 22:05:52,252 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 22:05:52,252 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 22:05:52,253 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 22:05:52,253 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:05:52,253 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 22:05:52,253 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 22:05:52,253 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 22:05:52,254 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 22:05:52,254 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 22:05:52,254 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 22:05:52,254 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 22:05:52,254 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 22:05:52,310 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 22:05:52,328 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 22:05:52,333 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 22:05:52,335 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 22:05:52,335 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 22:05:52,336 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-11-18 22:05:52,402 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c542bdc79/de0de9d8186145b398f00c03719e2e27/FLAG21dba2dff [2018-11-18 22:05:52,945 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 22:05:52,946 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-11-18 22:05:52,969 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c542bdc79/de0de9d8186145b398f00c03719e2e27/FLAG21dba2dff [2018-11-18 22:05:53,212 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c542bdc79/de0de9d8186145b398f00c03719e2e27 [2018-11-18 22:05:53,222 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 22:05:53,223 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 22:05:53,224 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 22:05:53,224 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 22:05:53,228 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 22:05:53,230 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:05:53" (1/1) ... [2018-11-18 22:05:53,233 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b00f212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:05:53, skipping insertion in model container [2018-11-18 22:05:53,233 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:05:53" (1/1) ... [2018-11-18 22:05:53,242 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 22:05:53,297 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 22:05:53,802 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:05:53,819 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 22:05:53,965 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:05:54,047 INFO L195 MainTranslator]: Completed translation [2018-11-18 22:05:54,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:05:54 WrapperNode [2018-11-18 22:05:54,047 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 22:05:54,048 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 22:05:54,049 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 22:05:54,049 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 22:05:54,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:05:54" (1/1) ... [2018-11-18 22:05:54,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:05:54" (1/1) ... [2018-11-18 22:05:54,083 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:05:54" (1/1) ... [2018-11-18 22:05:54,083 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:05:54" (1/1) ... [2018-11-18 22:05:54,116 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:05:54" (1/1) ... [2018-11-18 22:05:54,123 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:05:54" (1/1) ... [2018-11-18 22:05:54,128 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:05:54" (1/1) ... [2018-11-18 22:05:54,137 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 22:05:54,138 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 22:05:54,138 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 22:05:54,138 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 22:05:54,139 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:05:54" (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:05:54,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 22:05:54,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 22:05:54,218 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-18 22:05:54,218 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-18 22:05:54,218 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-18 22:05:54,219 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-18 22:05:54,219 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-18 22:05:54,219 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-18 22:05:54,219 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_append [2018-11-18 22:05:54,220 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 22:05:54,220 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 22:05:54,220 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-18 22:05:54,220 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-18 22:05:54,221 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-18 22:05:54,221 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-18 22:05:54,221 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-18 22:05:54,221 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-18 22:05:54,221 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-18 22:05:54,222 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-18 22:05:54,222 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-18 22:05:54,222 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-18 22:05:54,222 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-18 22:05:54,223 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-18 22:05:54,223 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-18 22:05:54,223 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-18 22:05:54,223 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-18 22:05:54,223 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-18 22:05:54,224 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-18 22:05:54,224 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-18 22:05:54,224 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-18 22:05:54,224 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-18 22:05:54,224 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-18 22:05:54,225 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-18 22:05:54,225 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-18 22:05:54,225 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-18 22:05:54,225 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-18 22:05:54,226 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-18 22:05:54,226 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-18 22:05:54,226 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-18 22:05:54,226 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-18 22:05:54,226 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-18 22:05:54,227 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-18 22:05:54,227 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-18 22:05:54,227 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-18 22:05:54,227 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-18 22:05:54,227 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-18 22:05:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-18 22:05:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-18 22:05:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-18 22:05:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-18 22:05:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-18 22:05:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-18 22:05:54,229 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-18 22:05:54,229 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-18 22:05:54,229 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-18 22:05:54,229 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-18 22:05:54,229 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-18 22:05:54,230 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-18 22:05:54,230 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-18 22:05:54,230 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-18 22:05:54,230 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-18 22:05:54,230 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-18 22:05:54,230 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-18 22:05:54,231 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-18 22:05:54,231 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-18 22:05:54,231 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-18 22:05:54,231 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-18 22:05:54,231 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-18 22:05:54,231 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-18 22:05:54,232 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-18 22:05:54,232 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-18 22:05:54,232 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-18 22:05:54,232 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-18 22:05:54,232 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-18 22:05:54,233 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-18 22:05:54,233 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-18 22:05:54,233 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 22:05:54,233 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-18 22:05:54,233 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-18 22:05:54,233 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-18 22:05:54,234 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-18 22:05:54,234 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-18 22:05:54,234 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-18 22:05:54,234 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-18 22:05:54,234 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-18 22:05:54,234 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-18 22:05:54,235 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-18 22:05:54,235 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-18 22:05:54,235 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-18 22:05:54,238 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-18 22:05:54,238 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-18 22:05:54,238 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-18 22:05:54,238 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-18 22:05:54,238 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-18 22:05:54,239 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-18 22:05:54,239 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-18 22:05:54,239 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-18 22:05:54,239 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-18 22:05:54,239 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-18 22:05:54,240 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-18 22:05:54,240 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-18 22:05:54,240 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-18 22:05:54,240 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-18 22:05:54,240 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-18 22:05:54,240 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-18 22:05:54,241 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-18 22:05:54,241 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-18 22:05:54,241 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-18 22:05:54,241 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-18 22:05:54,241 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-18 22:05:54,241 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-18 22:05:54,242 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-18 22:05:54,242 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-18 22:05:54,242 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-18 22:05:54,242 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-18 22:05:54,242 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-18 22:05:54,242 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-18 22:05:54,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 22:05:54,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 22:05:54,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-18 22:05:54,243 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-18 22:05:54,243 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-18 22:05:54,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 22:05:54,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 22:05:54,243 INFO L130 BoogieDeclarations]: Found specification of procedure sll_append [2018-11-18 22:05:54,244 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 22:05:54,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-18 22:05:54,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 22:05:54,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 22:05:54,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-18 22:05:55,428 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 22:05:55,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:05:55 BoogieIcfgContainer [2018-11-18 22:05:55,429 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 22:05:55,430 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 22:05:55,430 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 22:05:55,432 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 22:05:55,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:05:53" (1/3) ... [2018-11-18 22:05:55,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63449fcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:05:55, skipping insertion in model container [2018-11-18 22:05:55,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:05:54" (2/3) ... [2018-11-18 22:05:55,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63449fcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:05:55, skipping insertion in model container [2018-11-18 22:05:55,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:05:55" (3/3) ... [2018-11-18 22:05:55,436 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-11-18 22:05:55,445 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 22:05:55,452 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 22:05:55,466 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 22:05:55,498 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 22:05:55,498 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 22:05:55,499 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 22:05:55,499 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 22:05:55,499 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 22:05:55,499 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 22:05:55,499 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 22:05:55,499 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 22:05:55,500 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 22:05:55,522 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-11-18 22:05:55,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 22:05:55,530 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:05:55,531 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] [2018-11-18 22:05:55,533 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:05:55,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:05:55,540 INFO L82 PathProgramCache]: Analyzing trace with hash -2001141171, now seen corresponding path program 1 times [2018-11-18 22:05:55,545 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:05:55,545 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:05:55,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:05:55,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:05:55,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:05:55,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:05:55,970 INFO L256 TraceCheckUtils]: 0: Hoare triple {57#true} call ULTIMATE.init(); {57#true} is VALID [2018-11-18 22:05:55,975 INFO L273 TraceCheckUtils]: 1: Hoare triple {57#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {57#true} is VALID [2018-11-18 22:05:55,975 INFO L273 TraceCheckUtils]: 2: Hoare triple {57#true} assume true; {57#true} is VALID [2018-11-18 22:05:55,976 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {57#true} {57#true} #128#return; {57#true} is VALID [2018-11-18 22:05:55,976 INFO L256 TraceCheckUtils]: 4: Hoare triple {57#true} call #t~ret17 := main(); {57#true} is VALID [2018-11-18 22:05:55,976 INFO L273 TraceCheckUtils]: 5: Hoare triple {57#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); {57#true} is VALID [2018-11-18 22:05:55,977 INFO L256 TraceCheckUtils]: 6: Hoare triple {57#true} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {57#true} is VALID [2018-11-18 22:05:55,977 INFO L273 TraceCheckUtils]: 7: Hoare triple {57#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {57#true} is VALID [2018-11-18 22:05:55,993 INFO L273 TraceCheckUtils]: 8: Hoare triple {57#true} assume !true; {58#false} is VALID [2018-11-18 22:05:55,993 INFO L273 TraceCheckUtils]: 9: Hoare triple {58#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {58#false} is VALID [2018-11-18 22:05:55,994 INFO L273 TraceCheckUtils]: 10: Hoare triple {58#false} assume true; {58#false} is VALID [2018-11-18 22:05:55,994 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {58#false} {57#true} #120#return; {58#false} is VALID [2018-11-18 22:05:55,995 INFO L273 TraceCheckUtils]: 12: Hoare triple {58#false} call write~$Pointer$(#t~ret11.base, #t~ret11.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret11.base, #t~ret11.offset; {58#false} is VALID [2018-11-18 22:05:55,995 INFO L256 TraceCheckUtils]: 13: Hoare triple {58#false} call sll_append(~#s~0.base, ~#s~0.offset, ~data~0); {58#false} is VALID [2018-11-18 22:05:55,995 INFO L273 TraceCheckUtils]: 14: Hoare triple {58#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {58#false} is VALID [2018-11-18 22:05:55,996 INFO L256 TraceCheckUtils]: 15: Hoare triple {58#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {58#false} is VALID [2018-11-18 22:05:55,996 INFO L273 TraceCheckUtils]: 16: Hoare triple {58#false} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {58#false} is VALID [2018-11-18 22:05:55,996 INFO L273 TraceCheckUtils]: 17: Hoare triple {58#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {58#false} is VALID [2018-11-18 22:05:55,997 INFO L273 TraceCheckUtils]: 18: Hoare triple {58#false} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {58#false} is VALID [2018-11-18 22:05:55,998 INFO L273 TraceCheckUtils]: 19: Hoare triple {58#false} assume true; {58#false} is VALID [2018-11-18 22:05:55,998 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {58#false} {58#false} #126#return; {58#false} is VALID [2018-11-18 22:05:55,998 INFO L273 TraceCheckUtils]: 21: Hoare triple {58#false} ~new_last~0.base, ~new_last~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {58#false} is VALID [2018-11-18 22:05:55,999 INFO L273 TraceCheckUtils]: 22: Hoare triple {58#false} assume 0bv32 == #t~mem7.base && 0bv32 == #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {58#false} is VALID [2018-11-18 22:05:55,999 INFO L273 TraceCheckUtils]: 23: Hoare triple {58#false} assume true; {58#false} is VALID [2018-11-18 22:05:56,000 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {58#false} {58#false} #122#return; {58#false} is VALID [2018-11-18 22:05:56,000 INFO L273 TraceCheckUtils]: 25: Hoare triple {58#false} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;~count~0 := 0bv32; {58#false} is VALID [2018-11-18 22:05:56,001 INFO L273 TraceCheckUtils]: 26: Hoare triple {58#false} assume !true; {58#false} is VALID [2018-11-18 22:05:56,001 INFO L273 TraceCheckUtils]: 27: Hoare triple {58#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {58#false} is VALID [2018-11-18 22:05:56,001 INFO L273 TraceCheckUtils]: 28: Hoare triple {58#false} assume !false; {58#false} is VALID [2018-11-18 22:05:56,017 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:05:56,017 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:05:56,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:05:56,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 22:05:56,032 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-11-18 22:05:56,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:05:56,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 22:05:56,431 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:05:56,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 22:05:56,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 22:05:56,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 22:05:56,447 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2018-11-18 22:05:57,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:05:57,186 INFO L93 Difference]: Finished difference Result 95 states and 116 transitions. [2018-11-18 22:05:57,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 22:05:57,187 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-11-18 22:05:57,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:05:57,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:05:57,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 116 transitions. [2018-11-18 22:05:57,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:05:57,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 116 transitions. [2018-11-18 22:05:57,214 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 116 transitions. [2018-11-18 22:05:57,738 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:05:57,753 INFO L225 Difference]: With dead ends: 95 [2018-11-18 22:05:57,755 INFO L226 Difference]: Without dead ends: 40 [2018-11-18 22:05:57,758 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 28 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:05:57,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-18 22:05:57,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-18 22:05:57,811 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:05:57,812 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-18 22:05:57,812 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-18 22:05:57,813 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-18 22:05:57,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:05:57,820 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-11-18 22:05:57,820 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-11-18 22:05:57,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:05:57,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:05:57,821 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-18 22:05:57,821 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-18 22:05:57,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:05:57,827 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-11-18 22:05:57,827 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-11-18 22:05:57,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:05:57,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:05:57,829 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:05:57,829 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:05:57,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-18 22:05:57,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-11-18 22:05:57,835 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 29 [2018-11-18 22:05:57,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:05:57,836 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-11-18 22:05:57,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 22:05:57,836 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-11-18 22:05:57,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 22:05:57,838 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:05:57,838 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:05:57,838 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:05:57,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:05:57,839 INFO L82 PathProgramCache]: Analyzing trace with hash -2063953689, now seen corresponding path program 1 times [2018-11-18 22:05:57,840 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:05:57,840 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:05:57,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:05:57,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:05:57,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:05:57,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:05:58,135 INFO L256 TraceCheckUtils]: 0: Hoare triple {407#true} call ULTIMATE.init(); {407#true} is VALID [2018-11-18 22:05:58,136 INFO L273 TraceCheckUtils]: 1: Hoare triple {407#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {407#true} is VALID [2018-11-18 22:05:58,137 INFO L273 TraceCheckUtils]: 2: Hoare triple {407#true} assume true; {407#true} is VALID [2018-11-18 22:05:58,137 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {407#true} {407#true} #128#return; {407#true} is VALID [2018-11-18 22:05:58,138 INFO L256 TraceCheckUtils]: 4: Hoare triple {407#true} call #t~ret17 := main(); {407#true} is VALID [2018-11-18 22:05:58,141 INFO L273 TraceCheckUtils]: 5: Hoare triple {407#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); {427#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:05:58,141 INFO L256 TraceCheckUtils]: 6: Hoare triple {427#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {407#true} is VALID [2018-11-18 22:05:58,142 INFO L273 TraceCheckUtils]: 7: Hoare triple {407#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {434#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-18 22:05:58,143 INFO L273 TraceCheckUtils]: 8: Hoare triple {434#(= |sll_create_#in~len| sll_create_~len)} assume true; {434#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-18 22:05:58,143 INFO L273 TraceCheckUtils]: 9: Hoare triple {434#(= |sll_create_#in~len| sll_create_~len)} assume !~bvsgt32(~len, 0bv32); {441#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-18 22:05:58,146 INFO L273 TraceCheckUtils]: 10: Hoare triple {441#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {441#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-18 22:05:58,147 INFO L273 TraceCheckUtils]: 11: Hoare triple {441#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} assume true; {441#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-18 22:05:58,157 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {441#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} {427#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #120#return; {408#false} is VALID [2018-11-18 22:05:58,157 INFO L273 TraceCheckUtils]: 13: Hoare triple {408#false} call write~$Pointer$(#t~ret11.base, #t~ret11.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret11.base, #t~ret11.offset; {408#false} is VALID [2018-11-18 22:05:58,158 INFO L256 TraceCheckUtils]: 14: Hoare triple {408#false} call sll_append(~#s~0.base, ~#s~0.offset, ~data~0); {408#false} is VALID [2018-11-18 22:05:58,158 INFO L273 TraceCheckUtils]: 15: Hoare triple {408#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {408#false} is VALID [2018-11-18 22:05:58,158 INFO L256 TraceCheckUtils]: 16: Hoare triple {408#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {408#false} is VALID [2018-11-18 22:05:58,158 INFO L273 TraceCheckUtils]: 17: Hoare triple {408#false} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {408#false} is VALID [2018-11-18 22:05:58,159 INFO L273 TraceCheckUtils]: 18: Hoare triple {408#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {408#false} is VALID [2018-11-18 22:05:58,159 INFO L273 TraceCheckUtils]: 19: Hoare triple {408#false} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {408#false} is VALID [2018-11-18 22:05:58,159 INFO L273 TraceCheckUtils]: 20: Hoare triple {408#false} assume true; {408#false} is VALID [2018-11-18 22:05:58,159 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {408#false} {408#false} #126#return; {408#false} is VALID [2018-11-18 22:05:58,160 INFO L273 TraceCheckUtils]: 22: Hoare triple {408#false} ~new_last~0.base, ~new_last~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {408#false} is VALID [2018-11-18 22:05:58,160 INFO L273 TraceCheckUtils]: 23: Hoare triple {408#false} assume 0bv32 == #t~mem7.base && 0bv32 == #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {408#false} is VALID [2018-11-18 22:05:58,160 INFO L273 TraceCheckUtils]: 24: Hoare triple {408#false} assume true; {408#false} is VALID [2018-11-18 22:05:58,161 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {408#false} {408#false} #122#return; {408#false} is VALID [2018-11-18 22:05:58,161 INFO L273 TraceCheckUtils]: 26: Hoare triple {408#false} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;~count~0 := 0bv32; {408#false} is VALID [2018-11-18 22:05:58,161 INFO L273 TraceCheckUtils]: 27: Hoare triple {408#false} assume true; {408#false} is VALID [2018-11-18 22:05:58,162 INFO L273 TraceCheckUtils]: 28: Hoare triple {408#false} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {408#false} is VALID [2018-11-18 22:05:58,162 INFO L273 TraceCheckUtils]: 29: Hoare triple {408#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {408#false} is VALID [2018-11-18 22:05:58,162 INFO L273 TraceCheckUtils]: 30: Hoare triple {408#false} assume !false; {408#false} is VALID [2018-11-18 22:05:58,165 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:05:58,165 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:05:58,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:05:58,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 22:05:58,174 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-18 22:05:58,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:05:58,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 22:05:58,252 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:05:58,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 22:05:58,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 22:05:58,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:05:58,253 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 5 states. [2018-11-18 22:05:58,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:05:58,865 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2018-11-18 22:05:58,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 22:05:58,865 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-18 22:05:58,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:05:58,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:05:58,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2018-11-18 22:05:58,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:05:58,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2018-11-18 22:05:58,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 82 transitions. [2018-11-18 22:05:59,092 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:05:59,095 INFO L225 Difference]: With dead ends: 72 [2018-11-18 22:05:59,095 INFO L226 Difference]: Without dead ends: 45 [2018-11-18 22:05:59,097 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:05:59,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-18 22:05:59,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-11-18 22:05:59,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:05:59,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 42 states. [2018-11-18 22:05:59,135 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 42 states. [2018-11-18 22:05:59,135 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 42 states. [2018-11-18 22:05:59,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:05:59,140 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-11-18 22:05:59,140 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-11-18 22:05:59,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:05:59,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:05:59,141 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 45 states. [2018-11-18 22:05:59,141 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 45 states. [2018-11-18 22:05:59,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:05:59,145 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-11-18 22:05:59,146 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-11-18 22:05:59,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:05:59,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:05:59,147 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:05:59,147 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:05:59,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-18 22:05:59,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-11-18 22:05:59,152 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 31 [2018-11-18 22:05:59,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:05:59,153 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-11-18 22:05:59,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 22:05:59,153 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-18 22:05:59,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-18 22:05:59,157 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:05:59,157 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 22:05:59,157 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:05:59,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:05:59,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1906005862, now seen corresponding path program 1 times [2018-11-18 22:05:59,161 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:05:59,161 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:05:59,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:05:59,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:05:59,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:05:59,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:05:59,394 INFO L256 TraceCheckUtils]: 0: Hoare triple {750#true} call ULTIMATE.init(); {750#true} is VALID [2018-11-18 22:05:59,395 INFO L273 TraceCheckUtils]: 1: Hoare triple {750#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {750#true} is VALID [2018-11-18 22:05:59,395 INFO L273 TraceCheckUtils]: 2: Hoare triple {750#true} assume true; {750#true} is VALID [2018-11-18 22:05:59,396 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {750#true} {750#true} #128#return; {750#true} is VALID [2018-11-18 22:05:59,396 INFO L256 TraceCheckUtils]: 4: Hoare triple {750#true} call #t~ret17 := main(); {750#true} is VALID [2018-11-18 22:05:59,399 INFO L273 TraceCheckUtils]: 5: Hoare triple {750#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); {770#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 22:05:59,399 INFO L256 TraceCheckUtils]: 6: Hoare triple {770#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {750#true} is VALID [2018-11-18 22:05:59,400 INFO L273 TraceCheckUtils]: 7: Hoare triple {750#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {777#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-18 22:05:59,400 INFO L273 TraceCheckUtils]: 8: Hoare triple {777#(= |sll_create_#in~len| sll_create_~len)} assume true; {777#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-18 22:05:59,401 INFO L273 TraceCheckUtils]: 9: Hoare triple {777#(= |sll_create_#in~len| sll_create_~len)} assume !!~bvsgt32(~len, 0bv32); {777#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-18 22:05:59,401 INFO L256 TraceCheckUtils]: 10: Hoare triple {777#(= |sll_create_#in~len| sll_create_~len)} call #t~ret4.base, #t~ret4.offset := node_create(~data); {750#true} is VALID [2018-11-18 22:05:59,401 INFO L273 TraceCheckUtils]: 11: Hoare triple {750#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {750#true} is VALID [2018-11-18 22:05:59,402 INFO L273 TraceCheckUtils]: 12: Hoare triple {750#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {750#true} is VALID [2018-11-18 22:05:59,402 INFO L273 TraceCheckUtils]: 13: Hoare triple {750#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {750#true} is VALID [2018-11-18 22:05:59,402 INFO L273 TraceCheckUtils]: 14: Hoare triple {750#true} assume true; {750#true} is VALID [2018-11-18 22:05:59,403 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {750#true} {777#(= |sll_create_#in~len| sll_create_~len)} #116#return; {777#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-18 22:05:59,404 INFO L273 TraceCheckUtils]: 16: Hoare triple {777#(= |sll_create_#in~len| sll_create_~len)} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {777#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-18 22:05:59,405 INFO L273 TraceCheckUtils]: 17: Hoare triple {777#(= |sll_create_#in~len| sll_create_~len)} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {808#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-18 22:05:59,406 INFO L273 TraceCheckUtils]: 18: Hoare triple {808#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} assume true; {808#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-18 22:05:59,411 INFO L273 TraceCheckUtils]: 19: Hoare triple {808#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} assume !~bvsgt32(~len, 0bv32); {815#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:05:59,411 INFO L273 TraceCheckUtils]: 20: Hoare triple {815#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {815#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:05:59,412 INFO L273 TraceCheckUtils]: 21: Hoare triple {815#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {815#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:05:59,413 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {815#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {770#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #120#return; {751#false} is VALID [2018-11-18 22:05:59,414 INFO L273 TraceCheckUtils]: 23: Hoare triple {751#false} call write~$Pointer$(#t~ret11.base, #t~ret11.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret11.base, #t~ret11.offset; {751#false} is VALID [2018-11-18 22:05:59,414 INFO L256 TraceCheckUtils]: 24: Hoare triple {751#false} call sll_append(~#s~0.base, ~#s~0.offset, ~data~0); {751#false} is VALID [2018-11-18 22:05:59,414 INFO L273 TraceCheckUtils]: 25: Hoare triple {751#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {751#false} is VALID [2018-11-18 22:05:59,414 INFO L256 TraceCheckUtils]: 26: Hoare triple {751#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {751#false} is VALID [2018-11-18 22:05:59,415 INFO L273 TraceCheckUtils]: 27: Hoare triple {751#false} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {751#false} is VALID [2018-11-18 22:05:59,415 INFO L273 TraceCheckUtils]: 28: Hoare triple {751#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {751#false} is VALID [2018-11-18 22:05:59,416 INFO L273 TraceCheckUtils]: 29: Hoare triple {751#false} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {751#false} is VALID [2018-11-18 22:05:59,416 INFO L273 TraceCheckUtils]: 30: Hoare triple {751#false} assume true; {751#false} is VALID [2018-11-18 22:05:59,416 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {751#false} {751#false} #126#return; {751#false} is VALID [2018-11-18 22:05:59,417 INFO L273 TraceCheckUtils]: 32: Hoare triple {751#false} ~new_last~0.base, ~new_last~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {751#false} is VALID [2018-11-18 22:05:59,417 INFO L273 TraceCheckUtils]: 33: Hoare triple {751#false} assume 0bv32 == #t~mem7.base && 0bv32 == #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {751#false} is VALID [2018-11-18 22:05:59,417 INFO L273 TraceCheckUtils]: 34: Hoare triple {751#false} assume true; {751#false} is VALID [2018-11-18 22:05:59,418 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {751#false} {751#false} #122#return; {751#false} is VALID [2018-11-18 22:05:59,418 INFO L273 TraceCheckUtils]: 36: Hoare triple {751#false} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;~count~0 := 0bv32; {751#false} is VALID [2018-11-18 22:05:59,418 INFO L273 TraceCheckUtils]: 37: Hoare triple {751#false} assume true; {751#false} is VALID [2018-11-18 22:05:59,418 INFO L273 TraceCheckUtils]: 38: Hoare triple {751#false} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {751#false} is VALID [2018-11-18 22:05:59,418 INFO L273 TraceCheckUtils]: 39: Hoare triple {751#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {751#false} is VALID [2018-11-18 22:05:59,419 INFO L273 TraceCheckUtils]: 40: Hoare triple {751#false} assume !false; {751#false} is VALID [2018-11-18 22:05:59,422 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:05:59,422 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:05:59,840 INFO L273 TraceCheckUtils]: 40: Hoare triple {751#false} assume !false; {751#false} is VALID [2018-11-18 22:05:59,840 INFO L273 TraceCheckUtils]: 39: Hoare triple {751#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {751#false} is VALID [2018-11-18 22:05:59,841 INFO L273 TraceCheckUtils]: 38: Hoare triple {751#false} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {751#false} is VALID [2018-11-18 22:05:59,841 INFO L273 TraceCheckUtils]: 37: Hoare triple {751#false} assume true; {751#false} is VALID [2018-11-18 22:05:59,841 INFO L273 TraceCheckUtils]: 36: Hoare triple {751#false} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;~count~0 := 0bv32; {751#false} is VALID [2018-11-18 22:05:59,842 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {750#true} {751#false} #122#return; {751#false} is VALID [2018-11-18 22:05:59,842 INFO L273 TraceCheckUtils]: 34: Hoare triple {750#true} assume true; {750#true} is VALID [2018-11-18 22:05:59,842 INFO L273 TraceCheckUtils]: 33: Hoare triple {750#true} assume 0bv32 == #t~mem7.base && 0bv32 == #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {750#true} is VALID [2018-11-18 22:05:59,843 INFO L273 TraceCheckUtils]: 32: Hoare triple {750#true} ~new_last~0.base, ~new_last~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {750#true} is VALID [2018-11-18 22:05:59,843 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {750#true} {750#true} #126#return; {750#true} is VALID [2018-11-18 22:05:59,843 INFO L273 TraceCheckUtils]: 30: Hoare triple {750#true} assume true; {750#true} is VALID [2018-11-18 22:05:59,843 INFO L273 TraceCheckUtils]: 29: Hoare triple {750#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {750#true} is VALID [2018-11-18 22:05:59,844 INFO L273 TraceCheckUtils]: 28: Hoare triple {750#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {750#true} is VALID [2018-11-18 22:05:59,844 INFO L273 TraceCheckUtils]: 27: Hoare triple {750#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {750#true} is VALID [2018-11-18 22:05:59,844 INFO L256 TraceCheckUtils]: 26: Hoare triple {750#true} call #t~ret6.base, #t~ret6.offset := node_create(~data); {750#true} is VALID [2018-11-18 22:05:59,845 INFO L273 TraceCheckUtils]: 25: Hoare triple {750#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {750#true} is VALID [2018-11-18 22:05:59,845 INFO L256 TraceCheckUtils]: 24: Hoare triple {751#false} call sll_append(~#s~0.base, ~#s~0.offset, ~data~0); {750#true} is VALID [2018-11-18 22:05:59,845 INFO L273 TraceCheckUtils]: 23: Hoare triple {751#false} call write~$Pointer$(#t~ret11.base, #t~ret11.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret11.base, #t~ret11.offset; {751#false} is VALID [2018-11-18 22:05:59,846 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {815#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {933#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} #120#return; {751#false} is VALID [2018-11-18 22:05:59,848 INFO L273 TraceCheckUtils]: 21: Hoare triple {815#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {815#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:05:59,863 INFO L273 TraceCheckUtils]: 20: Hoare triple {815#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {815#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:05:59,864 INFO L273 TraceCheckUtils]: 19: Hoare triple {946#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} assume !~bvsgt32(~len, 0bv32); {815#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:05:59,865 INFO L273 TraceCheckUtils]: 18: Hoare triple {946#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} assume true; {946#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-18 22:05:59,871 INFO L273 TraceCheckUtils]: 17: Hoare triple {953#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {946#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-18 22:05:59,876 INFO L273 TraceCheckUtils]: 16: Hoare triple {953#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {953#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:05:59,878 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {750#true} {953#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} #116#return; {953#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:05:59,878 INFO L273 TraceCheckUtils]: 14: Hoare triple {750#true} assume true; {750#true} is VALID [2018-11-18 22:05:59,878 INFO L273 TraceCheckUtils]: 13: Hoare triple {750#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {750#true} is VALID [2018-11-18 22:05:59,878 INFO L273 TraceCheckUtils]: 12: Hoare triple {750#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {750#true} is VALID [2018-11-18 22:05:59,879 INFO L273 TraceCheckUtils]: 11: Hoare triple {750#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {750#true} is VALID [2018-11-18 22:05:59,879 INFO L256 TraceCheckUtils]: 10: Hoare triple {953#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {750#true} is VALID [2018-11-18 22:05:59,879 INFO L273 TraceCheckUtils]: 9: Hoare triple {953#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsgt32(~len, 0bv32); {953#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:05:59,882 INFO L273 TraceCheckUtils]: 8: Hoare triple {953#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} assume true; {953#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:05:59,882 INFO L273 TraceCheckUtils]: 7: Hoare triple {750#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {953#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:05:59,883 INFO L256 TraceCheckUtils]: 6: Hoare triple {933#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {750#true} is VALID [2018-11-18 22:05:59,884 INFO L273 TraceCheckUtils]: 5: Hoare triple {750#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); {933#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:05:59,884 INFO L256 TraceCheckUtils]: 4: Hoare triple {750#true} call #t~ret17 := main(); {750#true} is VALID [2018-11-18 22:05:59,884 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {750#true} {750#true} #128#return; {750#true} is VALID [2018-11-18 22:05:59,884 INFO L273 TraceCheckUtils]: 2: Hoare triple {750#true} assume true; {750#true} is VALID [2018-11-18 22:05:59,885 INFO L273 TraceCheckUtils]: 1: Hoare triple {750#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {750#true} is VALID [2018-11-18 22:05:59,885 INFO L256 TraceCheckUtils]: 0: Hoare triple {750#true} call ULTIMATE.init(); {750#true} is VALID [2018-11-18 22:05:59,890 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 22:05:59,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:05:59,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-18 22:05:59,894 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-11-18 22:05:59,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:05:59,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 22:06:00,020 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:06:00,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 22:06:00,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 22:06:00,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:06:00,021 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 9 states. [2018-11-18 22:06:01,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:06:01,205 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2018-11-18 22:06:01,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 22:06:01,206 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-11-18 22:06:01,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:06:01,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:06:01,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2018-11-18 22:06:01,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:06:01,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2018-11-18 22:06:01,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 88 transitions. [2018-11-18 22:06:01,380 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:06:01,383 INFO L225 Difference]: With dead ends: 77 [2018-11-18 22:06:01,384 INFO L226 Difference]: Without dead ends: 50 [2018-11-18 22:06:01,384 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-18 22:06:01,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-18 22:06:01,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-11-18 22:06:01,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:06:01,437 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 47 states. [2018-11-18 22:06:01,437 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 47 states. [2018-11-18 22:06:01,437 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 47 states. [2018-11-18 22:06:01,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:06:01,441 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-11-18 22:06:01,441 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-11-18 22:06:01,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:06:01,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:06:01,443 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 50 states. [2018-11-18 22:06:01,443 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 50 states. [2018-11-18 22:06:01,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:06:01,446 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-11-18 22:06:01,447 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-11-18 22:06:01,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:06:01,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:06:01,448 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:06:01,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:06:01,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-18 22:06:01,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-11-18 22:06:01,451 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 41 [2018-11-18 22:06:01,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:06:01,452 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-11-18 22:06:01,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 22:06:01,452 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-18 22:06:01,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-18 22:06:01,454 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:06:01,454 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:06:01,454 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:06:01,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:06:01,455 INFO L82 PathProgramCache]: Analyzing trace with hash -705606875, now seen corresponding path program 2 times [2018-11-18 22:06:01,455 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:06:01,456 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:06:01,486 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 22:06:01,558 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-18 22:06:01,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:06:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:06:01,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:06:01,871 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:06:01,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 22:06:01,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:01,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:06:01,894 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:06:01,895 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-11-18 22:06:01,903 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:06:02,045 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:06:02,109 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:06:02,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:02,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:06:02,165 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:06:02,165 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-11-18 22:06:02,168 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:06:02,184 INFO L256 TraceCheckUtils]: 0: Hoare triple {1276#true} call ULTIMATE.init(); {1276#true} is VALID [2018-11-18 22:06:02,184 INFO L273 TraceCheckUtils]: 1: Hoare triple {1276#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1276#true} is VALID [2018-11-18 22:06:02,185 INFO L273 TraceCheckUtils]: 2: Hoare triple {1276#true} assume true; {1276#true} is VALID [2018-11-18 22:06:02,185 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1276#true} {1276#true} #128#return; {1276#true} is VALID [2018-11-18 22:06:02,185 INFO L256 TraceCheckUtils]: 4: Hoare triple {1276#true} call #t~ret17 := main(); {1276#true} is VALID [2018-11-18 22:06:02,186 INFO L273 TraceCheckUtils]: 5: Hoare triple {1276#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); {1296#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-18 22:06:02,187 INFO L256 TraceCheckUtils]: 6: Hoare triple {1296#(= |main_~#s~0.offset| (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {1276#true} is VALID [2018-11-18 22:06:02,187 INFO L273 TraceCheckUtils]: 7: Hoare triple {1276#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1276#true} is VALID [2018-11-18 22:06:02,187 INFO L273 TraceCheckUtils]: 8: Hoare triple {1276#true} assume true; {1276#true} is VALID [2018-11-18 22:06:02,187 INFO L273 TraceCheckUtils]: 9: Hoare triple {1276#true} assume !!~bvsgt32(~len, 0bv32); {1276#true} is VALID [2018-11-18 22:06:02,187 INFO L256 TraceCheckUtils]: 10: Hoare triple {1276#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1276#true} is VALID [2018-11-18 22:06:02,188 INFO L273 TraceCheckUtils]: 11: Hoare triple {1276#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1276#true} is VALID [2018-11-18 22:06:02,188 INFO L273 TraceCheckUtils]: 12: Hoare triple {1276#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1276#true} is VALID [2018-11-18 22:06:02,188 INFO L273 TraceCheckUtils]: 13: Hoare triple {1276#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1276#true} is VALID [2018-11-18 22:06:02,188 INFO L273 TraceCheckUtils]: 14: Hoare triple {1276#true} assume true; {1276#true} is VALID [2018-11-18 22:06:02,188 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {1276#true} {1276#true} #116#return; {1276#true} is VALID [2018-11-18 22:06:02,189 INFO L273 TraceCheckUtils]: 16: Hoare triple {1276#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1276#true} is VALID [2018-11-18 22:06:02,189 INFO L273 TraceCheckUtils]: 17: Hoare triple {1276#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1276#true} is VALID [2018-11-18 22:06:02,189 INFO L273 TraceCheckUtils]: 18: Hoare triple {1276#true} assume true; {1276#true} is VALID [2018-11-18 22:06:02,189 INFO L273 TraceCheckUtils]: 19: Hoare triple {1276#true} assume !!~bvsgt32(~len, 0bv32); {1276#true} is VALID [2018-11-18 22:06:02,189 INFO L256 TraceCheckUtils]: 20: Hoare triple {1276#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1276#true} is VALID [2018-11-18 22:06:02,190 INFO L273 TraceCheckUtils]: 21: Hoare triple {1276#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1276#true} is VALID [2018-11-18 22:06:02,190 INFO L273 TraceCheckUtils]: 22: Hoare triple {1276#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1276#true} is VALID [2018-11-18 22:06:02,190 INFO L273 TraceCheckUtils]: 23: Hoare triple {1276#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1276#true} is VALID [2018-11-18 22:06:02,190 INFO L273 TraceCheckUtils]: 24: Hoare triple {1276#true} assume true; {1276#true} is VALID [2018-11-18 22:06:02,191 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {1276#true} {1276#true} #116#return; {1276#true} is VALID [2018-11-18 22:06:02,191 INFO L273 TraceCheckUtils]: 26: Hoare triple {1276#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1276#true} is VALID [2018-11-18 22:06:02,191 INFO L273 TraceCheckUtils]: 27: Hoare triple {1276#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1276#true} is VALID [2018-11-18 22:06:02,191 INFO L273 TraceCheckUtils]: 28: Hoare triple {1276#true} assume true; {1276#true} is VALID [2018-11-18 22:06:02,191 INFO L273 TraceCheckUtils]: 29: Hoare triple {1276#true} assume !~bvsgt32(~len, 0bv32); {1276#true} is VALID [2018-11-18 22:06:02,192 INFO L273 TraceCheckUtils]: 30: Hoare triple {1276#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1276#true} is VALID [2018-11-18 22:06:02,192 INFO L273 TraceCheckUtils]: 31: Hoare triple {1276#true} assume true; {1276#true} is VALID [2018-11-18 22:06:02,193 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {1276#true} {1296#(= |main_~#s~0.offset| (_ bv0 32))} #120#return; {1296#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-18 22:06:02,193 INFO L273 TraceCheckUtils]: 33: Hoare triple {1296#(= |main_~#s~0.offset| (_ bv0 32))} call write~$Pointer$(#t~ret11.base, #t~ret11.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret11.base, #t~ret11.offset; {1296#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-18 22:06:02,194 INFO L256 TraceCheckUtils]: 34: Hoare triple {1296#(= |main_~#s~0.offset| (_ bv0 32))} call sll_append(~#s~0.base, ~#s~0.offset, ~data~0); {1276#true} is VALID [2018-11-18 22:06:02,194 INFO L273 TraceCheckUtils]: 35: Hoare triple {1276#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {1387#(and (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|))} is VALID [2018-11-18 22:06:02,194 INFO L256 TraceCheckUtils]: 36: Hoare triple {1387#(and (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1276#true} is VALID [2018-11-18 22:06:02,195 INFO L273 TraceCheckUtils]: 37: Hoare triple {1276#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1394#(not (= (_ bv0 32) node_create_~temp~0.base))} is VALID [2018-11-18 22:06:02,195 INFO L273 TraceCheckUtils]: 38: Hoare triple {1394#(not (= (_ bv0 32) node_create_~temp~0.base))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1394#(not (= (_ bv0 32) node_create_~temp~0.base))} is VALID [2018-11-18 22:06:02,196 INFO L273 TraceCheckUtils]: 39: Hoare triple {1394#(not (= (_ bv0 32) node_create_~temp~0.base))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1401#(not (= (_ bv0 32) |node_create_#res.base|))} is VALID [2018-11-18 22:06:02,197 INFO L273 TraceCheckUtils]: 40: Hoare triple {1401#(not (= (_ bv0 32) |node_create_#res.base|))} assume true; {1401#(not (= (_ bv0 32) |node_create_#res.base|))} is VALID [2018-11-18 22:06:02,198 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {1401#(not (= (_ bv0 32) |node_create_#res.base|))} {1387#(and (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|))} #126#return; {1408#(and (not (= (_ bv0 32) |sll_append_#t~ret6.base|)) (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|))} is VALID [2018-11-18 22:06:02,199 INFO L273 TraceCheckUtils]: 42: Hoare triple {1408#(and (not (= (_ bv0 32) |sll_append_#t~ret6.base|)) (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|))} ~new_last~0.base, ~new_last~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {1412#(and (not (= sll_append_~new_last~0.base (_ bv0 32))) (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|))} is VALID [2018-11-18 22:06:02,201 INFO L273 TraceCheckUtils]: 43: Hoare triple {1412#(and (not (= sll_append_~new_last~0.base (_ bv0 32))) (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|))} assume 0bv32 == #t~mem7.base && 0bv32 == #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {1416#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)))} is VALID [2018-11-18 22:06:02,202 INFO L273 TraceCheckUtils]: 44: Hoare triple {1416#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)))} assume true; {1416#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)))} is VALID [2018-11-18 22:06:02,204 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {1416#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)))} {1296#(= |main_~#s~0.offset| (_ bv0 32))} #122#return; {1423#(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:06:02,206 INFO L273 TraceCheckUtils]: 46: Hoare triple {1423#(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~mem12.base, #t~mem12.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;~count~0 := 0bv32; {1427#(not (= (_ bv0 32) main_~ptr~0.base))} is VALID [2018-11-18 22:06:02,207 INFO L273 TraceCheckUtils]: 47: Hoare triple {1427#(not (= (_ bv0 32) main_~ptr~0.base))} assume true; {1427#(not (= (_ bv0 32) main_~ptr~0.base))} is VALID [2018-11-18 22:06:02,207 INFO L273 TraceCheckUtils]: 48: Hoare triple {1427#(not (= (_ bv0 32) main_~ptr~0.base))} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {1277#false} is VALID [2018-11-18 22:06:02,208 INFO L273 TraceCheckUtils]: 49: Hoare triple {1277#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {1277#false} is VALID [2018-11-18 22:06:02,208 INFO L273 TraceCheckUtils]: 50: Hoare triple {1277#false} assume !false; {1277#false} is VALID [2018-11-18 22:06:02,215 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-18 22:06:02,215 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:06:02,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:06:02,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 22:06:02,223 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 51 [2018-11-18 22:06:02,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:06:02,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-18 22:06:02,312 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:06:02,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 22:06:02,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 22:06:02,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-11-18 22:06:02,313 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 11 states. [2018-11-18 22:06:03,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:06:03,746 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2018-11-18 22:06:03,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 22:06:03,747 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 51 [2018-11-18 22:06:03,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:06:03,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 22:06:03,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 63 transitions. [2018-11-18 22:06:03,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 22:06:03,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 63 transitions. [2018-11-18 22:06:03,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 63 transitions. [2018-11-18 22:06:03,927 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:06:03,929 INFO L225 Difference]: With dead ends: 64 [2018-11-18 22:06:03,929 INFO L226 Difference]: Without dead ends: 61 [2018-11-18 22:06:03,930 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 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:06:03,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-18 22:06:04,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2018-11-18 22:06:04,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:06:04,106 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 52 states. [2018-11-18 22:06:04,106 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 52 states. [2018-11-18 22:06:04,106 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 52 states. [2018-11-18 22:06:04,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:06:04,109 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2018-11-18 22:06:04,109 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2018-11-18 22:06:04,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:06:04,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:06:04,110 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 61 states. [2018-11-18 22:06:04,110 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 61 states. [2018-11-18 22:06:04,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:06:04,114 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2018-11-18 22:06:04,114 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2018-11-18 22:06:04,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:06:04,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:06:04,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:06:04,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:06:04,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-18 22:06:04,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2018-11-18 22:06:04,118 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 51 [2018-11-18 22:06:04,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:06:04,118 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2018-11-18 22:06:04,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 22:06:04,118 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2018-11-18 22:06:04,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-18 22:06:04,120 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:06:04,120 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:06:04,121 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:06:04,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:06:04,121 INFO L82 PathProgramCache]: Analyzing trace with hash -705605201, now seen corresponding path program 1 times [2018-11-18 22:06:04,121 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:06:04,121 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:06:04,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:06:04,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:06:04,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:06:04,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:06:04,680 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:06:04,710 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:06:04,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:04,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:06:04,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:06:04,728 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-18 22:06:04,869 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:06:04,873 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:06:04,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:04,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:06:04,904 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:06:04,912 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:06:04,921 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:04,927 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:06:04,942 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:06:04,942 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-11-18 22:06:05,001 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:06:05,141 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:06:05,148 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:06:05,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:05,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:06:05,173 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:06:05,178 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:06:05,180 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:05,184 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:06:05,194 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:06:05,195 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:16 [2018-11-18 22:06:05,200 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:06:05,266 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:06:05,271 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:06:05,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:05,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:06:05,281 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:06:05,281 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:9 [2018-11-18 22:06:05,286 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:06:05,331 INFO L256 TraceCheckUtils]: 0: Hoare triple {1725#true} call ULTIMATE.init(); {1725#true} is VALID [2018-11-18 22:06:05,332 INFO L273 TraceCheckUtils]: 1: Hoare triple {1725#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1725#true} is VALID [2018-11-18 22:06:05,332 INFO L273 TraceCheckUtils]: 2: Hoare triple {1725#true} assume true; {1725#true} is VALID [2018-11-18 22:06:05,332 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1725#true} {1725#true} #128#return; {1725#true} is VALID [2018-11-18 22:06:05,332 INFO L256 TraceCheckUtils]: 4: Hoare triple {1725#true} call #t~ret17 := main(); {1725#true} is VALID [2018-11-18 22:06:05,333 INFO L273 TraceCheckUtils]: 5: Hoare triple {1725#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); {1745#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:06:05,333 INFO L256 TraceCheckUtils]: 6: Hoare triple {1745#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {1725#true} is VALID [2018-11-18 22:06:05,333 INFO L273 TraceCheckUtils]: 7: Hoare triple {1725#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1725#true} is VALID [2018-11-18 22:06:05,334 INFO L273 TraceCheckUtils]: 8: Hoare triple {1725#true} assume true; {1725#true} is VALID [2018-11-18 22:06:05,334 INFO L273 TraceCheckUtils]: 9: Hoare triple {1725#true} assume !!~bvsgt32(~len, 0bv32); {1725#true} is VALID [2018-11-18 22:06:05,334 INFO L256 TraceCheckUtils]: 10: Hoare triple {1725#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1725#true} is VALID [2018-11-18 22:06:05,334 INFO L273 TraceCheckUtils]: 11: Hoare triple {1725#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1725#true} is VALID [2018-11-18 22:06:05,334 INFO L273 TraceCheckUtils]: 12: Hoare triple {1725#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1725#true} is VALID [2018-11-18 22:06:05,335 INFO L273 TraceCheckUtils]: 13: Hoare triple {1725#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1725#true} is VALID [2018-11-18 22:06:05,335 INFO L273 TraceCheckUtils]: 14: Hoare triple {1725#true} assume true; {1725#true} is VALID [2018-11-18 22:06:05,335 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {1725#true} {1725#true} #116#return; {1725#true} is VALID [2018-11-18 22:06:05,335 INFO L273 TraceCheckUtils]: 16: Hoare triple {1725#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1725#true} is VALID [2018-11-18 22:06:05,336 INFO L273 TraceCheckUtils]: 17: Hoare triple {1725#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1725#true} is VALID [2018-11-18 22:06:05,336 INFO L273 TraceCheckUtils]: 18: Hoare triple {1725#true} assume true; {1725#true} is VALID [2018-11-18 22:06:05,336 INFO L273 TraceCheckUtils]: 19: Hoare triple {1725#true} assume !!~bvsgt32(~len, 0bv32); {1725#true} is VALID [2018-11-18 22:06:05,336 INFO L256 TraceCheckUtils]: 20: Hoare triple {1725#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1725#true} is VALID [2018-11-18 22:06:05,336 INFO L273 TraceCheckUtils]: 21: Hoare triple {1725#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1725#true} is VALID [2018-11-18 22:06:05,337 INFO L273 TraceCheckUtils]: 22: Hoare triple {1725#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1725#true} is VALID [2018-11-18 22:06:05,337 INFO L273 TraceCheckUtils]: 23: Hoare triple {1725#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1725#true} is VALID [2018-11-18 22:06:05,337 INFO L273 TraceCheckUtils]: 24: Hoare triple {1725#true} assume true; {1725#true} is VALID [2018-11-18 22:06:05,337 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {1725#true} {1725#true} #116#return; {1725#true} is VALID [2018-11-18 22:06:05,338 INFO L273 TraceCheckUtils]: 26: Hoare triple {1725#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1725#true} is VALID [2018-11-18 22:06:05,338 INFO L273 TraceCheckUtils]: 27: Hoare triple {1725#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1725#true} is VALID [2018-11-18 22:06:05,338 INFO L273 TraceCheckUtils]: 28: Hoare triple {1725#true} assume true; {1725#true} is VALID [2018-11-18 22:06:05,338 INFO L273 TraceCheckUtils]: 29: Hoare triple {1725#true} assume !~bvsgt32(~len, 0bv32); {1725#true} is VALID [2018-11-18 22:06:05,338 INFO L273 TraceCheckUtils]: 30: Hoare triple {1725#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1725#true} is VALID [2018-11-18 22:06:05,339 INFO L273 TraceCheckUtils]: 31: Hoare triple {1725#true} assume true; {1725#true} is VALID [2018-11-18 22:06:05,341 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {1725#true} {1745#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} #120#return; {1745#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:06:05,341 INFO L273 TraceCheckUtils]: 33: Hoare triple {1745#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} call write~$Pointer$(#t~ret11.base, #t~ret11.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret11.base, #t~ret11.offset; {1745#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:06:05,342 INFO L256 TraceCheckUtils]: 34: Hoare triple {1745#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} call sll_append(~#s~0.base, ~#s~0.offset, ~data~0); {1725#true} is VALID [2018-11-18 22:06:05,346 INFO L273 TraceCheckUtils]: 35: Hoare triple {1725#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {1836#(and (= sll_append_~head.base |sll_append_#in~head.base|) (= |sll_append_#in~data| sll_append_~data) (= sll_append_~head.offset |sll_append_#in~head.offset|))} is VALID [2018-11-18 22:06:05,346 INFO L256 TraceCheckUtils]: 36: Hoare triple {1836#(and (= sll_append_~head.base |sll_append_#in~head.base|) (= |sll_append_#in~data| sll_append_~data) (= sll_append_~head.offset |sll_append_#in~head.offset|))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1725#true} is VALID [2018-11-18 22:06:05,349 INFO L273 TraceCheckUtils]: 37: Hoare triple {1725#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1843#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)))} is VALID [2018-11-18 22:06:05,351 INFO L273 TraceCheckUtils]: 38: Hoare triple {1843#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1843#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)))} is VALID [2018-11-18 22:06:05,352 INFO L273 TraceCheckUtils]: 39: Hoare triple {1843#(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~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1850#(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:06:05,353 INFO L273 TraceCheckUtils]: 40: Hoare triple {1850#(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; {1850#(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:06:05,355 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {1850#(and (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)) (= |node_create_#res.offset| (_ bv0 32)))} {1836#(and (= sll_append_~head.base |sll_append_#in~head.base|) (= |sll_append_#in~data| sll_append_~data) (= sll_append_~head.offset |sll_append_#in~head.offset|))} #126#return; {1857#(and (= (select (select |#memory_int| |sll_append_#t~ret6.base|) |sll_append_#t~ret6.offset|) |sll_append_#in~data|) (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= (_ bv0 32) |sll_append_#t~ret6.offset|))} is VALID [2018-11-18 22:06:05,355 INFO L273 TraceCheckUtils]: 42: Hoare triple {1857#(and (= (select (select |#memory_int| |sll_append_#t~ret6.base|) |sll_append_#t~ret6.offset|) |sll_append_#in~data|) (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= (_ bv0 32) |sll_append_#t~ret6.offset|))} ~new_last~0.base, ~new_last~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {1861#(and (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= (select (select |#memory_int| sll_append_~new_last~0.base) sll_append_~new_last~0.offset) |sll_append_#in~data|) (= sll_append_~new_last~0.offset (_ bv0 32)))} is VALID [2018-11-18 22:06:05,357 INFO L273 TraceCheckUtils]: 43: Hoare triple {1861#(and (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= (select (select |#memory_int| sll_append_~new_last~0.base) sll_append_~new_last~0.offset) |sll_append_#in~data|) (= sll_append_~new_last~0.offset (_ bv0 32)))} assume 0bv32 == #t~mem7.base && 0bv32 == #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {1865#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv0 32)) |sll_append_#in~data|))} is VALID [2018-11-18 22:06:05,358 INFO L273 TraceCheckUtils]: 44: Hoare triple {1865#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv0 32)) |sll_append_#in~data|))} assume true; {1865#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv0 32)) |sll_append_#in~data|))} is VALID [2018-11-18 22:06:05,360 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {1865#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv0 32)) |sll_append_#in~data|))} {1745#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} #122#return; {1872#(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:06:05,361 INFO L273 TraceCheckUtils]: 46: Hoare triple {1872#(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~mem12.base, #t~mem12.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;~count~0 := 0bv32; {1876#(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:06:05,362 INFO L273 TraceCheckUtils]: 47: Hoare triple {1876#(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; {1876#(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:06:05,368 INFO L273 TraceCheckUtils]: 48: Hoare triple {1876#(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~mem13.base, #t~mem13.offset := read~$Pointer$(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32);~temp~2.base, ~temp~2.offset := #t~mem13.base, #t~mem13.offset;havoc #t~mem13.base, #t~mem13.offset;call #t~mem14 := read~intINTTYPE4(~ptr~0.base, ~ptr~0.offset, 4bv32); {1883#(and (= |main_#t~mem14| main_~data~0) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:06:05,368 INFO L273 TraceCheckUtils]: 49: Hoare triple {1883#(and (= |main_#t~mem14| main_~data~0) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~data~0 != #t~mem14;havoc #t~mem14; {1726#false} is VALID [2018-11-18 22:06:05,369 INFO L273 TraceCheckUtils]: 50: Hoare triple {1726#false} assume !false; {1726#false} is VALID [2018-11-18 22:06:05,374 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-18 22:06:05,374 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:06:05,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:06:05,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-18 22:06:05,378 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2018-11-18 22:06:05,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:06:05,379 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-18 22:06:05,484 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:06:05,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 22:06:05,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 22:06:05,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:06:05,485 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 12 states. [2018-11-18 22:06:07,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:06:07,663 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2018-11-18 22:06:07,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 22:06:07,664 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2018-11-18 22:06:07,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:06:07,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:06:07,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 60 transitions. [2018-11-18 22:06:07,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:06:07,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 60 transitions. [2018-11-18 22:06:07,669 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 60 transitions. [2018-11-18 22:06:07,782 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:06:07,785 INFO L225 Difference]: With dead ends: 61 [2018-11-18 22:06:07,785 INFO L226 Difference]: Without dead ends: 59 [2018-11-18 22:06:07,786 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2018-11-18 22:06:07,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-18 22:06:07,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2018-11-18 22:06:07,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:06:07,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 53 states. [2018-11-18 22:06:07,827 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 53 states. [2018-11-18 22:06:07,827 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 53 states. [2018-11-18 22:06:07,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:06:07,832 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2018-11-18 22:06:07,832 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2018-11-18 22:06:07,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:06:07,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:06:07,833 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 59 states. [2018-11-18 22:06:07,833 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 59 states. [2018-11-18 22:06:07,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:06:07,836 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2018-11-18 22:06:07,836 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2018-11-18 22:06:07,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:06:07,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:06:07,837 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:06:07,837 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:06:07,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-18 22:06:07,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-11-18 22:06:07,839 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 51 [2018-11-18 22:06:07,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:06:07,840 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-11-18 22:06:07,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 22:06:07,840 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-11-18 22:06:07,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-18 22:06:07,841 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:06:07,841 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 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] [2018-11-18 22:06:07,841 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:06:07,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:06:07,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1113340754, now seen corresponding path program 1 times [2018-11-18 22:06:07,842 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:06:07,842 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:06:07,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:06:08,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:06:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:06:08,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:06:08,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 22:06:08,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:08,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:06:08,118 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 22:06:08,121 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:06:10,173 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) is different from true [2018-11-18 22:06:14,455 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-18 22:06:20,936 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-18 22:06:30,527 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-18 22:06:30,563 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:06:30,564 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:06:30,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-11-18 22:06:30,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-11-18 22:06:30,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:30,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:06:30,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:06:30,614 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:27 [2018-11-18 22:06:32,626 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:06:32,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 22:06:32,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 22:06:32,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:06:32,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:06:32,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 22:06:32,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:39 [2018-11-18 22:06:32,765 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:06:35,068 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)))) (= (_ bv0 1) (select |c_old(#valid)| node_create_~temp~0.base)))) is different from true [2018-11-18 22:06:43,743 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 24 [2018-11-18 22:06:53,303 INFO L256 TraceCheckUtils]: 0: Hoare triple {2174#true} call ULTIMATE.init(); {2174#true} is VALID [2018-11-18 22:06:53,304 INFO L273 TraceCheckUtils]: 1: Hoare triple {2174#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2174#true} is VALID [2018-11-18 22:06:53,304 INFO L273 TraceCheckUtils]: 2: Hoare triple {2174#true} assume true; {2174#true} is VALID [2018-11-18 22:06:53,304 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2174#true} {2174#true} #128#return; {2174#true} is VALID [2018-11-18 22:06:53,304 INFO L256 TraceCheckUtils]: 4: Hoare triple {2174#true} call #t~ret17 := main(); {2174#true} is VALID [2018-11-18 22:06:53,314 INFO L273 TraceCheckUtils]: 5: Hoare triple {2174#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); {2194#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} is VALID [2018-11-18 22:06:53,328 INFO L256 TraceCheckUtils]: 6: Hoare triple {2194#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {2198#(= |#valid| |old(#valid)|)} is VALID [2018-11-18 22:06:53,342 INFO L273 TraceCheckUtils]: 7: Hoare triple {2198#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {2198#(= |#valid| |old(#valid)|)} is VALID [2018-11-18 22:06:53,351 INFO L273 TraceCheckUtils]: 8: Hoare triple {2198#(= |#valid| |old(#valid)|)} assume true; {2198#(= |#valid| |old(#valid)|)} is VALID [2018-11-18 22:06:53,364 INFO L273 TraceCheckUtils]: 9: Hoare triple {2198#(= |#valid| |old(#valid)|)} assume !!~bvsgt32(~len, 0bv32); {2198#(= |#valid| |old(#valid)|)} is VALID [2018-11-18 22:06:53,377 INFO L256 TraceCheckUtils]: 10: Hoare triple {2198#(= |#valid| |old(#valid)|)} call #t~ret4.base, #t~ret4.offset := node_create(~data); {2198#(= |#valid| |old(#valid)|)} is VALID [2018-11-18 22:06:53,391 INFO L273 TraceCheckUtils]: 11: Hoare triple {2198#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2214#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-18 22:06:53,403 INFO L273 TraceCheckUtils]: 12: Hoare triple {2214#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2214#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-18 22:06:53,416 INFO L273 TraceCheckUtils]: 13: Hoare triple {2214#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2214#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-18 22:06:53,429 INFO L273 TraceCheckUtils]: 14: Hoare triple {2214#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} assume true; {2214#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-18 22:06:53,443 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {2214#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} {2198#(= |#valid| |old(#valid)|)} #116#return; {2214#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-18 22:06:53,456 INFO L273 TraceCheckUtils]: 16: Hoare triple {2214#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {2214#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-18 22:06:53,458 INFO L273 TraceCheckUtils]: 17: Hoare triple {2214#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {2214#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-18 22:06:53,460 INFO L273 TraceCheckUtils]: 18: Hoare triple {2214#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} assume true; {2214#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-18 22:06:53,462 INFO L273 TraceCheckUtils]: 19: Hoare triple {2214#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} assume !!~bvsgt32(~len, 0bv32); {2214#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-18 22:06:53,462 INFO L256 TraceCheckUtils]: 20: Hoare triple {2214#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {2198#(= |#valid| |old(#valid)|)} is VALID [2018-11-18 22:06:53,465 INFO L273 TraceCheckUtils]: 21: Hoare triple {2198#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2245#(and (not (= (_ bv0 32) node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} is VALID [2018-11-18 22:06:53,465 INFO L273 TraceCheckUtils]: 22: Hoare triple {2245#(and (not (= (_ bv0 32) node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2245#(and (not (= (_ bv0 32) node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} is VALID [2018-11-18 22:06:53,467 INFO L273 TraceCheckUtils]: 23: Hoare triple {2245#(and (not (= (_ bv0 32) node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2252#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (not (= (_ bv0 32) |node_create_#res.base|)))} is VALID [2018-11-18 22:06:53,467 INFO L273 TraceCheckUtils]: 24: Hoare triple {2252#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (not (= (_ bv0 32) |node_create_#res.base|)))} assume true; {2252#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (not (= (_ bv0 32) |node_create_#res.base|)))} is VALID [2018-11-18 22:06:53,470 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {2252#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (not (= (_ bv0 32) |node_create_#res.base|)))} {2214#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} #116#return; {2259#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_create_#t~ret4.base| (_ bv1 1))))) (not (= (_ bv0 32) |sll_create_#t~ret4.base|)))} is VALID [2018-11-18 22:06:53,473 INFO L273 TraceCheckUtils]: 26: Hoare triple {2259#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_create_#t~ret4.base| (_ bv1 1))))) (not (= (_ bv0 32) |sll_create_#t~ret4.base|)))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {2263#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base (_ bv1 1)) |#valid|))) (not (= sll_create_~head~0.base (_ bv0 32))))} is VALID [2018-11-18 22:06:53,474 INFO L273 TraceCheckUtils]: 27: Hoare triple {2263#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base (_ bv1 1)) |#valid|))) (not (= sll_create_~head~0.base (_ bv0 32))))} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {2263#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base (_ bv1 1)) |#valid|))) (not (= sll_create_~head~0.base (_ bv0 32))))} is VALID [2018-11-18 22:06:53,475 INFO L273 TraceCheckUtils]: 28: Hoare triple {2263#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base (_ bv1 1)) |#valid|))) (not (= sll_create_~head~0.base (_ bv0 32))))} assume true; {2263#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base (_ bv1 1)) |#valid|))) (not (= sll_create_~head~0.base (_ bv0 32))))} is VALID [2018-11-18 22:06:53,476 INFO L273 TraceCheckUtils]: 29: Hoare triple {2263#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base (_ bv1 1)) |#valid|))) (not (= sll_create_~head~0.base (_ bv0 32))))} assume !~bvsgt32(~len, 0bv32); {2263#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base (_ bv1 1)) |#valid|))) (not (= sll_create_~head~0.base (_ bv0 32))))} is VALID [2018-11-18 22:06:53,477 INFO L273 TraceCheckUtils]: 30: Hoare triple {2263#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base (_ bv1 1)) |#valid|))) (not (= sll_create_~head~0.base (_ bv0 32))))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2276#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_create_#res.base| (_ bv1 1))))) (not (= (_ bv0 32) |sll_create_#res.base|)))} is VALID [2018-11-18 22:06:53,478 INFO L273 TraceCheckUtils]: 31: Hoare triple {2276#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_create_#res.base| (_ bv1 1))))) (not (= (_ bv0 32) |sll_create_#res.base|)))} assume true; {2276#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_create_#res.base| (_ bv1 1))))) (not (= (_ bv0 32) |sll_create_#res.base|)))} is VALID [2018-11-18 22:06:53,485 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2276#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_create_#res.base| (_ bv1 1))))) (not (= (_ bv0 32) |sll_create_#res.base|)))} {2194#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} #120#return; {2283#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd (select |#valid| |main_#t~ret11.base|) (_ bv1 1)) (_ bv0 1)) (not (= (_ bv0 32) |main_#t~ret11.base|)))} is VALID [2018-11-18 22:06:53,487 INFO L273 TraceCheckUtils]: 33: Hoare triple {2283#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd (select |#valid| |main_#t~ret11.base|) (_ bv1 1)) (_ bv0 1)) (not (= (_ bv0 32) |main_#t~ret11.base|)))} call write~$Pointer$(#t~ret11.base, #t~ret11.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret11.base, #t~ret11.offset; {2287#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv1 1)) (_ bv0 1)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-18 22:06:53,488 INFO L256 TraceCheckUtils]: 34: Hoare triple {2287#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv1 1)) (_ bv0 1)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} call sll_append(~#s~0.base, ~#s~0.offset, ~data~0); {2291#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-18 22:06:53,488 INFO L273 TraceCheckUtils]: 35: Hoare triple {2291#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {2295#(and (= |#valid| |old(#valid)|) (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-18 22:06:53,490 INFO L256 TraceCheckUtils]: 36: Hoare triple {2295#(and (= |#valid| |old(#valid)|) (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {2291#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-18 22:06:53,491 INFO L273 TraceCheckUtils]: 37: Hoare triple {2291#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2302#(and (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-18 22:06:53,492 INFO L273 TraceCheckUtils]: 38: Hoare triple {2302#(and (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2302#(and (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-18 22:06:53,533 INFO L273 TraceCheckUtils]: 39: Hoare triple {2302#(and (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2309#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)))) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base))))} is VALID [2018-11-18 22:06:53,533 INFO L273 TraceCheckUtils]: 40: Hoare triple {2309#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)))) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base))))} assume true; {2309#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)))) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base))))} is VALID [2018-11-18 22:06:53,535 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {2309#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)))) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base))))} {2295#(and (= |#valid| |old(#valid)|) (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} #126#return; {2316#(and (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)))) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))))} is VALID [2018-11-18 22:06:53,540 INFO L273 TraceCheckUtils]: 42: Hoare triple {2316#(and (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)))) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))))} ~new_last~0.base, ~new_last~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {2320#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= |sll_append_#t~mem7.base| (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32))) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base))))} is VALID [2018-11-18 22:06:53,541 INFO L273 TraceCheckUtils]: 43: Hoare triple {2320#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= |sll_append_#t~mem7.base| (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32))) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base))))} assume 0bv32 == #t~mem7.base && 0bv32 == #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {2324#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32))) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base))))} is VALID [2018-11-18 22:06:53,541 INFO L273 TraceCheckUtils]: 44: Hoare triple {2324#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32))) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base))))} assume true; {2324#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32))) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base))))} is VALID [2018-11-18 22:06:53,544 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {2324#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32))) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base))))} {2287#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv1 1)) (_ bv0 1)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} #122#return; {2175#false} is VALID [2018-11-18 22:06:53,544 INFO L273 TraceCheckUtils]: 46: Hoare triple {2175#false} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;~count~0 := 0bv32; {2175#false} is VALID [2018-11-18 22:06:53,544 INFO L273 TraceCheckUtils]: 47: Hoare triple {2175#false} assume true; {2175#false} is VALID [2018-11-18 22:06:53,545 INFO L273 TraceCheckUtils]: 48: Hoare triple {2175#false} assume !!(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32);~temp~2.base, ~temp~2.offset := #t~mem13.base, #t~mem13.offset;havoc #t~mem13.base, #t~mem13.offset;call #t~mem14 := read~intINTTYPE4(~ptr~0.base, ~ptr~0.offset, 4bv32); {2175#false} is VALID [2018-11-18 22:06:53,545 INFO L273 TraceCheckUtils]: 49: Hoare triple {2175#false} assume !(~data~0 != #t~mem14);havoc #t~mem14;~ptr~0.base, ~ptr~0.offset := ~temp~2.base, ~temp~2.offset;#t~post15 := ~count~0;~count~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {2175#false} is VALID [2018-11-18 22:06:53,545 INFO L273 TraceCheckUtils]: 50: Hoare triple {2175#false} assume true; {2175#false} is VALID [2018-11-18 22:06:53,546 INFO L273 TraceCheckUtils]: 51: Hoare triple {2175#false} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {2175#false} is VALID [2018-11-18 22:06:53,546 INFO L273 TraceCheckUtils]: 52: Hoare triple {2175#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {2175#false} is VALID [2018-11-18 22:06:53,546 INFO L273 TraceCheckUtils]: 53: Hoare triple {2175#false} assume !false; {2175#false} is VALID [2018-11-18 22:06:53,559 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 17 not checked. [2018-11-18 22:06:53,559 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:06:54,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:06:54,117 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:06:54,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:06:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:06:54,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:06:54,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:07:05,992 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:07:05,999 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:07:06,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 22:07:06,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 22:07:06,020 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:07:06,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-11-18 22:07:06,029 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 22:07:19,318 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.base (_ BitVec 32))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base) (_ bv4 32) (_ bv0 32))))) is different from true [2018-11-18 22:07:31,446 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-18 22:07:31,791 INFO L256 TraceCheckUtils]: 0: Hoare triple {2174#true} call ULTIMATE.init(); {2174#true} is VALID [2018-11-18 22:07:31,792 INFO L273 TraceCheckUtils]: 1: Hoare triple {2174#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2174#true} is VALID [2018-11-18 22:07:31,792 INFO L273 TraceCheckUtils]: 2: Hoare triple {2174#true} assume true; {2174#true} is VALID [2018-11-18 22:07:31,793 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2174#true} {2174#true} #128#return; {2174#true} is VALID [2018-11-18 22:07:31,793 INFO L256 TraceCheckUtils]: 4: Hoare triple {2174#true} call #t~ret17 := main(); {2174#true} is VALID [2018-11-18 22:07:31,794 INFO L273 TraceCheckUtils]: 5: Hoare triple {2174#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); {2398#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-18 22:07:31,794 INFO L256 TraceCheckUtils]: 6: Hoare triple {2398#(= |main_~#s~0.offset| (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {2174#true} is VALID [2018-11-18 22:07:31,794 INFO L273 TraceCheckUtils]: 7: Hoare triple {2174#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {2174#true} is VALID [2018-11-18 22:07:31,794 INFO L273 TraceCheckUtils]: 8: Hoare triple {2174#true} assume true; {2174#true} is VALID [2018-11-18 22:07:31,794 INFO L273 TraceCheckUtils]: 9: Hoare triple {2174#true} assume !!~bvsgt32(~len, 0bv32); {2174#true} is VALID [2018-11-18 22:07:31,795 INFO L256 TraceCheckUtils]: 10: Hoare triple {2174#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {2174#true} is VALID [2018-11-18 22:07:31,795 INFO L273 TraceCheckUtils]: 11: Hoare triple {2174#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2174#true} is VALID [2018-11-18 22:07:31,795 INFO L273 TraceCheckUtils]: 12: Hoare triple {2174#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2174#true} is VALID [2018-11-18 22:07:31,795 INFO L273 TraceCheckUtils]: 13: Hoare triple {2174#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2174#true} is VALID [2018-11-18 22:07:31,796 INFO L273 TraceCheckUtils]: 14: Hoare triple {2174#true} assume true; {2174#true} is VALID [2018-11-18 22:07:31,796 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {2174#true} {2174#true} #116#return; {2174#true} is VALID [2018-11-18 22:07:31,796 INFO L273 TraceCheckUtils]: 16: Hoare triple {2174#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {2174#true} is VALID [2018-11-18 22:07:31,797 INFO L273 TraceCheckUtils]: 17: Hoare triple {2174#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {2174#true} is VALID [2018-11-18 22:07:31,797 INFO L273 TraceCheckUtils]: 18: Hoare triple {2174#true} assume true; {2174#true} is VALID [2018-11-18 22:07:31,798 INFO L273 TraceCheckUtils]: 19: Hoare triple {2174#true} assume !!~bvsgt32(~len, 0bv32); {2174#true} is VALID [2018-11-18 22:07:31,798 INFO L256 TraceCheckUtils]: 20: Hoare triple {2174#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {2174#true} is VALID [2018-11-18 22:07:31,799 INFO L273 TraceCheckUtils]: 21: Hoare triple {2174#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2447#(not (= (_ bv0 32) node_create_~temp~0.base))} is VALID [2018-11-18 22:07:31,799 INFO L273 TraceCheckUtils]: 22: Hoare triple {2447#(not (= (_ bv0 32) node_create_~temp~0.base))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2447#(not (= (_ bv0 32) node_create_~temp~0.base))} is VALID [2018-11-18 22:07:31,800 INFO L273 TraceCheckUtils]: 23: Hoare triple {2447#(not (= (_ bv0 32) node_create_~temp~0.base))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2454#(not (= (_ bv0 32) |node_create_#res.base|))} is VALID [2018-11-18 22:07:31,800 INFO L273 TraceCheckUtils]: 24: Hoare triple {2454#(not (= (_ bv0 32) |node_create_#res.base|))} assume true; {2454#(not (= (_ bv0 32) |node_create_#res.base|))} is VALID [2018-11-18 22:07:31,801 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {2454#(not (= (_ bv0 32) |node_create_#res.base|))} {2174#true} #116#return; {2461#(not (= (_ bv0 32) |sll_create_#t~ret4.base|))} is VALID [2018-11-18 22:07:31,802 INFO L273 TraceCheckUtils]: 26: Hoare triple {2461#(not (= (_ bv0 32) |sll_create_#t~ret4.base|))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {2465#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-18 22:07:31,802 INFO L273 TraceCheckUtils]: 27: Hoare triple {2465#(not (= sll_create_~head~0.base (_ bv0 32)))} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {2465#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-18 22:07:31,802 INFO L273 TraceCheckUtils]: 28: Hoare triple {2465#(not (= sll_create_~head~0.base (_ bv0 32)))} assume true; {2465#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-18 22:07:31,803 INFO L273 TraceCheckUtils]: 29: Hoare triple {2465#(not (= sll_create_~head~0.base (_ bv0 32)))} assume !~bvsgt32(~len, 0bv32); {2465#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-18 22:07:31,804 INFO L273 TraceCheckUtils]: 30: Hoare triple {2465#(not (= sll_create_~head~0.base (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2478#(not (= (_ bv0 32) |sll_create_#res.base|))} is VALID [2018-11-18 22:07:31,805 INFO L273 TraceCheckUtils]: 31: Hoare triple {2478#(not (= (_ bv0 32) |sll_create_#res.base|))} assume true; {2478#(not (= (_ bv0 32) |sll_create_#res.base|))} is VALID [2018-11-18 22:07:31,806 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2478#(not (= (_ bv0 32) |sll_create_#res.base|))} {2398#(= |main_~#s~0.offset| (_ bv0 32))} #120#return; {2485#(and (= |main_~#s~0.offset| (_ bv0 32)) (not (= (_ bv0 32) |main_#t~ret11.base|)))} is VALID [2018-11-18 22:07:31,808 INFO L273 TraceCheckUtils]: 33: Hoare triple {2485#(and (= |main_~#s~0.offset| (_ bv0 32)) (not (= (_ bv0 32) |main_#t~ret11.base|)))} call write~$Pointer$(#t~ret11.base, #t~ret11.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret11.base, #t~ret11.offset; {2489#(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:07:31,810 INFO L256 TraceCheckUtils]: 34: Hoare triple {2489#(and (= |main_~#s~0.offset| (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} call sll_append(~#s~0.base, ~#s~0.offset, ~data~0); {2493#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} is VALID [2018-11-18 22:07:31,811 INFO L273 TraceCheckUtils]: 35: Hoare triple {2493#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {2497#(and (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-18 22:07:31,812 INFO L256 TraceCheckUtils]: 36: Hoare triple {2497#(and (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {2493#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} is VALID [2018-11-18 22:07:31,813 INFO L273 TraceCheckUtils]: 37: Hoare triple {2493#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2504#(and (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-18 22:07:31,814 INFO L273 TraceCheckUtils]: 38: Hoare triple {2504#(and (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2504#(and (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-18 22:07:31,817 INFO L273 TraceCheckUtils]: 39: Hoare triple {2504#(and (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2511#(exists ((node_create_~temp~0.base (_ BitVec 32))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (_ bv4 32) (_ bv0 32)))))} is VALID [2018-11-18 22:07:31,818 INFO L273 TraceCheckUtils]: 40: Hoare triple {2511#(exists ((node_create_~temp~0.base (_ BitVec 32))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (_ bv4 32) (_ bv0 32)))))} assume true; {2511#(exists ((node_create_~temp~0.base (_ BitVec 32))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (_ bv4 32) (_ bv0 32)))))} is VALID [2018-11-18 22:07:31,820 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {2511#(exists ((node_create_~temp~0.base (_ BitVec 32))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (_ bv4 32) (_ bv0 32)))))} {2497#(and (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} #126#return; {2518#(and (exists ((node_create_~temp~0.base (_ BitVec 32))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (_ bv4 32) (_ bv0 32))))) (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|))} is VALID [2018-11-18 22:07:31,828 INFO L273 TraceCheckUtils]: 42: Hoare triple {2518#(and (exists ((node_create_~temp~0.base (_ BitVec 32))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (_ bv4 32) (_ bv0 32))))) (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|))} ~new_last~0.base, ~new_last~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {2522#(exists ((node_create_~temp~0.base (_ BitVec 32))) (= |sll_append_#t~mem7.base| (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (_ bv4 32) (_ bv0 32))) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)))} is VALID [2018-11-18 22:07:31,829 INFO L273 TraceCheckUtils]: 43: Hoare triple {2522#(exists ((node_create_~temp~0.base (_ BitVec 32))) (= |sll_append_#t~mem7.base| (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (_ bv4 32) (_ bv0 32))) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)))} assume 0bv32 == #t~mem7.base && 0bv32 == #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {2526#(exists ((node_create_~temp~0.base (_ BitVec 32))) (= (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (_ bv4 32) (_ bv0 32))) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (_ bv0 32)))} is VALID [2018-11-18 22:07:31,829 INFO L273 TraceCheckUtils]: 44: Hoare triple {2526#(exists ((node_create_~temp~0.base (_ BitVec 32))) (= (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (_ bv4 32) (_ bv0 32))) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (_ bv0 32)))} assume true; {2526#(exists ((node_create_~temp~0.base (_ BitVec 32))) (= (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (_ bv4 32) (_ bv0 32))) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (_ bv0 32)))} is VALID [2018-11-18 22:07:31,832 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {2526#(exists ((node_create_~temp~0.base (_ BitVec 32))) (= (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (_ bv4 32) (_ bv0 32))) |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (_ bv0 32)))} {2489#(and (= |main_~#s~0.offset| (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} #122#return; {2175#false} is VALID [2018-11-18 22:07:31,832 INFO L273 TraceCheckUtils]: 46: Hoare triple {2175#false} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;~count~0 := 0bv32; {2175#false} is VALID [2018-11-18 22:07:31,832 INFO L273 TraceCheckUtils]: 47: Hoare triple {2175#false} assume true; {2175#false} is VALID [2018-11-18 22:07:31,833 INFO L273 TraceCheckUtils]: 48: Hoare triple {2175#false} assume !!(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32);~temp~2.base, ~temp~2.offset := #t~mem13.base, #t~mem13.offset;havoc #t~mem13.base, #t~mem13.offset;call #t~mem14 := read~intINTTYPE4(~ptr~0.base, ~ptr~0.offset, 4bv32); {2175#false} is VALID [2018-11-18 22:07:31,833 INFO L273 TraceCheckUtils]: 49: Hoare triple {2175#false} assume !(~data~0 != #t~mem14);havoc #t~mem14;~ptr~0.base, ~ptr~0.offset := ~temp~2.base, ~temp~2.offset;#t~post15 := ~count~0;~count~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {2175#false} is VALID [2018-11-18 22:07:31,833 INFO L273 TraceCheckUtils]: 50: Hoare triple {2175#false} assume true; {2175#false} is VALID [2018-11-18 22:07:31,833 INFO L273 TraceCheckUtils]: 51: Hoare triple {2175#false} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {2175#false} is VALID [2018-11-18 22:07:31,833 INFO L273 TraceCheckUtils]: 52: Hoare triple {2175#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {2175#false} is VALID [2018-11-18 22:07:31,834 INFO L273 TraceCheckUtils]: 53: Hoare triple {2175#false} assume !false; {2175#false} is VALID [2018-11-18 22:07:31,839 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2018-11-18 22:07:31,839 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:07:39,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:07:39,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 34 [2018-11-18 22:07:39,740 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 54 [2018-11-18 22:07:39,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:07:39,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-18 22:07:40,014 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:07:40,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-18 22:07:40,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-18 22:07:40,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=947, Unknown=26, NotChecked=192, Total=1260 [2018-11-18 22:07:40,016 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 34 states.