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_Default.epf -i ../../../trunk/examples/svcomp/list-simple/dll2c_remove_all_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:25:34,406 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:25:34,408 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:25:34,425 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:25:34,425 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:25:34,426 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:25:34,430 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:25:34,433 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:25:34,442 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:25:34,443 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:25:34,444 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:25:34,444 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:25:34,447 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:25:34,448 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:25:34,449 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:25:34,450 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:25:34,452 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:25:34,455 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:25:34,458 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:25:34,463 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:25:34,465 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:25:34,467 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:25:34,469 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:25:34,469 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:25:34,469 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:25:34,473 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:25:34,473 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:25:34,474 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:25:34,477 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:25:34,479 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:25:34,479 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:25:34,480 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:25:34,480 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:25:34,482 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:25:34,483 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:25:34,483 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:25:34,484 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-14 17:25:34,509 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:25:34,509 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:25:34,510 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:25:34,510 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:25:34,511 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:25:34,513 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:25:34,514 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:25:34,514 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:25:34,514 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:25:34,514 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:25:34,514 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:25:34,515 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:25:34,515 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:25:34,515 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:25:34,515 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:25:34,515 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:25:34,516 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:25:34,517 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:25:34,517 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:25:34,517 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:25:34,517 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:25:34,518 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:25:34,518 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:25:34,518 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:25:34,518 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:25:34,518 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:25:34,518 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:25:34,519 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:25:34,519 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:25:34,519 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:25:34,576 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:25:34,591 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:25:34,594 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:25:34,596 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:25:34,597 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:25:34,597 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_remove_all_true-unreach-call_true-valid-memsafety.i [2018-11-14 17:25:34,659 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/553d39dfc/5b07d928158c458cb11a19ff340f5bea/FLAGad625fa29 [2018-11-14 17:25:35,221 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:25:35,222 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_remove_all_true-unreach-call_true-valid-memsafety.i [2018-11-14 17:25:35,244 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/553d39dfc/5b07d928158c458cb11a19ff340f5bea/FLAGad625fa29 [2018-11-14 17:25:35,265 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/553d39dfc/5b07d928158c458cb11a19ff340f5bea [2018-11-14 17:25:35,276 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:25:35,278 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:25:35,279 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:25:35,279 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:25:35,283 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:25:35,284 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:25:35" (1/1) ... [2018-11-14 17:25:35,287 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23362a6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:35, skipping insertion in model container [2018-11-14 17:25:35,288 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:25:35" (1/1) ... [2018-11-14 17:25:35,298 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:25:35,352 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:25:35,752 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:25:35,773 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:25:35,845 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:25:35,994 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:25:35,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:35 WrapperNode [2018-11-14 17:25:35,994 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:25:35,995 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:25:35,995 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:25:35,995 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:25:36,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:35" (1/1) ... [2018-11-14 17:25:36,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:35" (1/1) ... [2018-11-14 17:25:36,028 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:35" (1/1) ... [2018-11-14 17:25:36,028 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:35" (1/1) ... [2018-11-14 17:25:36,059 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:35" (1/1) ... [2018-11-14 17:25:36,071 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:35" (1/1) ... [2018-11-14 17:25:36,080 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:35" (1/1) ... [2018-11-14 17:25:36,093 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:25:36,093 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:25:36,094 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:25:36,094 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:25:36,095 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:35" (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-14 17:25:36,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:25:36,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:25:36,149 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-14 17:25:36,149 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-14 17:25:36,150 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-14 17:25:36,150 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-14 17:25:36,150 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2018-11-14 17:25:36,150 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_remove_first [2018-11-14 17:25:36,150 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:25:36,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:25:36,151 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-14 17:25:36,151 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-14 17:25:36,151 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 17:25:36,151 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 17:25:36,151 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 17:25:36,151 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 17:25:36,152 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 17:25:36,152 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 17:25:36,152 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 17:25:36,152 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 17:25:36,152 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 17:25:36,153 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 17:25:36,153 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 17:25:36,153 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 17:25:36,153 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 17:25:36,153 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 17:25:36,153 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 17:25:36,153 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 17:25:36,153 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 17:25:36,153 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 17:25:36,154 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 17:25:36,154 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 17:25:36,154 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 17:25:36,154 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 17:25:36,154 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 17:25:36,154 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 17:25:36,154 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 17:25:36,154 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 17:25:36,155 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 17:25:36,155 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 17:25:36,155 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 17:25:36,155 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 17:25:36,155 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 17:25:36,155 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 17:25:36,156 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 17:25:36,156 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 17:25:36,156 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 17:25:36,156 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 17:25:36,156 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 17:25:36,156 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 17:25:36,157 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 17:25:36,157 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 17:25:36,157 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 17:25:36,157 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 17:25:36,157 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 17:25:36,157 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 17:25:36,157 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 17:25:36,157 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 17:25:36,157 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 17:25:36,158 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 17:25:36,158 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 17:25:36,158 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 17:25:36,158 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 17:25:36,158 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 17:25:36,158 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 17:25:36,158 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 17:25:36,158 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 17:25:36,159 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 17:25:36,159 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 17:25:36,159 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 17:25:36,159 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 17:25:36,159 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 17:25:36,159 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 17:25:36,159 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 17:25:36,160 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 17:25:36,160 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 17:25:36,160 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 17:25:36,160 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 17:25:36,160 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 17:25:36,160 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 17:25:36,161 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 17:25:36,161 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 17:25:36,161 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 17:25:36,161 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 17:25:36,161 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 17:25:36,161 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 17:25:36,162 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 17:25:36,162 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 17:25:36,162 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 17:25:36,162 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 17:25:36,162 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 17:25:36,163 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 17:25:36,163 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 17:25:36,163 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 17:25:36,163 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 17:25:36,163 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 17:25:36,163 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 17:25:36,164 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 17:25:36,164 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 17:25:36,164 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 17:25:36,164 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 17:25:36,164 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 17:25:36,165 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 17:25:36,165 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 17:25:36,165 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 17:25:36,165 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 17:25:36,165 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 17:25:36,165 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 17:25:36,165 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 17:25:36,166 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 17:25:36,166 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 17:25:36,166 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 17:25:36,166 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 17:25:36,166 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 17:25:36,166 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 17:25:36,166 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-14 17:25:36,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:25:36,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 17:25:36,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 17:25:36,167 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2018-11-14 17:25:36,167 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_remove_first [2018-11-14 17:25:36,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 17:25:36,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:25:36,168 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:25:36,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:25:36,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:25:36,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 17:25:36,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 17:25:37,272 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:25:37,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:25:37 BoogieIcfgContainer [2018-11-14 17:25:37,273 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:25:37,274 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:25:37,274 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:25:37,278 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:25:37,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:25:35" (1/3) ... [2018-11-14 17:25:37,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@628a62ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:25:37, skipping insertion in model container [2018-11-14 17:25:37,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:35" (2/3) ... [2018-11-14 17:25:37,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@628a62ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:25:37, skipping insertion in model container [2018-11-14 17:25:37,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:25:37" (3/3) ... [2018-11-14 17:25:37,281 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all_true-unreach-call_true-valid-memsafety.i [2018-11-14 17:25:37,291 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:25:37,300 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:25:37,317 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:25:37,350 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:25:37,351 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:25:37,351 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:25:37,351 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:25:37,351 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:25:37,352 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:25:37,352 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:25:37,352 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:25:37,352 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:25:37,372 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-11-14 17:25:37,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 17:25:37,379 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:25:37,380 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] [2018-11-14 17:25:37,382 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:25:37,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:25:37,388 INFO L82 PathProgramCache]: Analyzing trace with hash -539924998, now seen corresponding path program 1 times [2018-11-14 17:25:37,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:25:37,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:25:37,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:25:37,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:25:37,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:25:37,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:25:37,610 INFO L256 TraceCheckUtils]: 0: Hoare triple {47#true} call ULTIMATE.init(); {47#true} is VALID [2018-11-14 17:25:37,615 INFO L273 TraceCheckUtils]: 1: Hoare triple {47#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {47#true} is VALID [2018-11-14 17:25:37,615 INFO L273 TraceCheckUtils]: 2: Hoare triple {47#true} assume true; {47#true} is VALID [2018-11-14 17:25:37,616 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {47#true} {47#true} #96#return; {47#true} is VALID [2018-11-14 17:25:37,616 INFO L256 TraceCheckUtils]: 4: Hoare triple {47#true} call #t~ret16 := main(); {47#true} is VALID [2018-11-14 17:25:37,617 INFO L273 TraceCheckUtils]: 5: Hoare triple {47#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {47#true} is VALID [2018-11-14 17:25:37,617 INFO L256 TraceCheckUtils]: 6: Hoare triple {47#true} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {47#true} is VALID [2018-11-14 17:25:37,617 INFO L273 TraceCheckUtils]: 7: Hoare triple {47#true} ~len := #in~len;~data := #in~data; {47#true} is VALID [2018-11-14 17:25:37,618 INFO L256 TraceCheckUtils]: 8: Hoare triple {47#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {47#true} is VALID [2018-11-14 17:25:37,618 INFO L273 TraceCheckUtils]: 9: Hoare triple {47#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {47#true} is VALID [2018-11-14 17:25:37,619 INFO L273 TraceCheckUtils]: 10: Hoare triple {47#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {47#true} is VALID [2018-11-14 17:25:37,619 INFO L273 TraceCheckUtils]: 11: Hoare triple {47#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 0, 4);call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 8, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {47#true} is VALID [2018-11-14 17:25:37,619 INFO L273 TraceCheckUtils]: 12: Hoare triple {47#true} assume true; {47#true} is VALID [2018-11-14 17:25:37,620 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {47#true} {47#true} #86#return; {47#true} is VALID [2018-11-14 17:25:37,620 INFO L273 TraceCheckUtils]: 14: Hoare triple {47#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {47#true} is VALID [2018-11-14 17:25:37,633 INFO L273 TraceCheckUtils]: 15: Hoare triple {47#true} assume !true; {48#false} is VALID [2018-11-14 17:25:37,634 INFO L273 TraceCheckUtils]: 16: Hoare triple {48#false} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset + 0, 4);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~head~0.offset + 4, 4);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {48#false} is VALID [2018-11-14 17:25:37,634 INFO L273 TraceCheckUtils]: 17: Hoare triple {48#false} assume true; {48#false} is VALID [2018-11-14 17:25:37,635 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {48#false} {47#true} #92#return; {48#false} is VALID [2018-11-14 17:25:37,635 INFO L273 TraceCheckUtils]: 19: Hoare triple {48#false} call write~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0; {48#false} is VALID [2018-11-14 17:25:37,635 INFO L273 TraceCheckUtils]: 20: Hoare triple {48#false} assume !true; {48#false} is VALID [2018-11-14 17:25:37,636 INFO L273 TraceCheckUtils]: 21: Hoare triple {48#false} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {48#false} is VALID [2018-11-14 17:25:37,636 INFO L273 TraceCheckUtils]: 22: Hoare triple {48#false} assume 0 != #t~mem15.base || 0 != #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {48#false} is VALID [2018-11-14 17:25:37,637 INFO L273 TraceCheckUtils]: 23: Hoare triple {48#false} assume !false; {48#false} is VALID [2018-11-14 17:25:37,642 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-14 17:25:37,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:25:37,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:25:37,650 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-11-14 17:25:37,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:25:37,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:25:37,726 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:25:37,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:25:37,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:25:37,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:25:37,737 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2018-11-14 17:25:38,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:25:38,380 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2018-11-14 17:25:38,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:25:38,380 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-11-14 17:25:38,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:25:38,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:25:38,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 74 transitions. [2018-11-14 17:25:38,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:25:38,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 74 transitions. [2018-11-14 17:25:38,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 74 transitions. [2018-11-14 17:25:38,927 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:25:38,940 INFO L225 Difference]: With dead ends: 64 [2018-11-14 17:25:38,940 INFO L226 Difference]: Without dead ends: 37 [2018-11-14 17:25:38,944 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-14 17:25:38,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-14 17:25:38,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-14 17:25:38,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:25:38,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2018-11-14 17:25:38,998 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-14 17:25:38,998 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-14 17:25:39,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:25:39,005 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-14 17:25:39,005 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-14 17:25:39,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:25:39,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:25:39,007 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-14 17:25:39,007 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-14 17:25:39,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:25:39,012 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-14 17:25:39,013 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-14 17:25:39,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:25:39,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:25:39,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:25:39,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:25:39,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 17:25:39,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-14 17:25:39,020 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 24 [2018-11-14 17:25:39,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:25:39,021 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-14 17:25:39,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:25:39,021 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-14 17:25:39,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 17:25:39,023 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:25:39,023 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] [2018-11-14 17:25:39,023 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:25:39,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:25:39,024 INFO L82 PathProgramCache]: Analyzing trace with hash -718882640, now seen corresponding path program 1 times [2018-11-14 17:25:39,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:25:39,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:25:39,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:25:39,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:25:39,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:25:39,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:25:39,324 INFO L256 TraceCheckUtils]: 0: Hoare triple {260#true} call ULTIMATE.init(); {260#true} is VALID [2018-11-14 17:25:39,325 INFO L273 TraceCheckUtils]: 1: Hoare triple {260#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {260#true} is VALID [2018-11-14 17:25:39,326 INFO L273 TraceCheckUtils]: 2: Hoare triple {260#true} assume true; {260#true} is VALID [2018-11-14 17:25:39,326 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {260#true} {260#true} #96#return; {260#true} is VALID [2018-11-14 17:25:39,327 INFO L256 TraceCheckUtils]: 4: Hoare triple {260#true} call #t~ret16 := main(); {260#true} is VALID [2018-11-14 17:25:39,328 INFO L273 TraceCheckUtils]: 5: Hoare triple {260#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {262#(<= 2 main_~len~0)} is VALID [2018-11-14 17:25:39,328 INFO L256 TraceCheckUtils]: 6: Hoare triple {262#(<= 2 main_~len~0)} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {260#true} is VALID [2018-11-14 17:25:39,329 INFO L273 TraceCheckUtils]: 7: Hoare triple {260#true} ~len := #in~len;~data := #in~data; {263#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-14 17:25:39,329 INFO L256 TraceCheckUtils]: 8: Hoare triple {263#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} call #t~ret3.base, #t~ret3.offset := node_create(~data); {260#true} is VALID [2018-11-14 17:25:39,329 INFO L273 TraceCheckUtils]: 9: Hoare triple {260#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {260#true} is VALID [2018-11-14 17:25:39,329 INFO L273 TraceCheckUtils]: 10: Hoare triple {260#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {260#true} is VALID [2018-11-14 17:25:39,330 INFO L273 TraceCheckUtils]: 11: Hoare triple {260#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 0, 4);call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 8, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {260#true} is VALID [2018-11-14 17:25:39,330 INFO L273 TraceCheckUtils]: 12: Hoare triple {260#true} assume true; {260#true} is VALID [2018-11-14 17:25:39,332 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {260#true} {263#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} #86#return; {263#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-14 17:25:39,332 INFO L273 TraceCheckUtils]: 14: Hoare triple {263#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {263#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-14 17:25:39,334 INFO L273 TraceCheckUtils]: 15: Hoare triple {263#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} assume true; {263#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-14 17:25:39,334 INFO L273 TraceCheckUtils]: 16: Hoare triple {263#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} assume !(~len > 1); {264#(<= |dll_circular_create_#in~len| 1)} is VALID [2018-11-14 17:25:39,336 INFO L273 TraceCheckUtils]: 17: Hoare triple {264#(<= |dll_circular_create_#in~len| 1)} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset + 0, 4);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~head~0.offset + 4, 4);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {264#(<= |dll_circular_create_#in~len| 1)} is VALID [2018-11-14 17:25:39,337 INFO L273 TraceCheckUtils]: 18: Hoare triple {264#(<= |dll_circular_create_#in~len| 1)} assume true; {264#(<= |dll_circular_create_#in~len| 1)} is VALID [2018-11-14 17:25:39,342 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {264#(<= |dll_circular_create_#in~len| 1)} {262#(<= 2 main_~len~0)} #92#return; {261#false} is VALID [2018-11-14 17:25:39,343 INFO L273 TraceCheckUtils]: 20: Hoare triple {261#false} call write~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0; {261#false} is VALID [2018-11-14 17:25:39,343 INFO L273 TraceCheckUtils]: 21: Hoare triple {261#false} assume true; {261#false} is VALID [2018-11-14 17:25:39,343 INFO L273 TraceCheckUtils]: 22: Hoare triple {261#false} assume !(~i~0 < ~len~0); {261#false} is VALID [2018-11-14 17:25:39,344 INFO L273 TraceCheckUtils]: 23: Hoare triple {261#false} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {261#false} is VALID [2018-11-14 17:25:39,344 INFO L273 TraceCheckUtils]: 24: Hoare triple {261#false} assume 0 != #t~mem15.base || 0 != #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {261#false} is VALID [2018-11-14 17:25:39,344 INFO L273 TraceCheckUtils]: 25: Hoare triple {261#false} assume !false; {261#false} is VALID [2018-11-14 17:25:39,346 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-14 17:25:39,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:25:39,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:25:39,348 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-14 17:25:39,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:25:39,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:25:39,450 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:25:39,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:25:39,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:25:39,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:25:39,451 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 5 states. [2018-11-14 17:25:39,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:25:39,889 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2018-11-14 17:25:39,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:25:39,890 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-14 17:25:39,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:25:39,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:25:39,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2018-11-14 17:25:39,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:25:39,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2018-11-14 17:25:39,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2018-11-14 17:25:40,013 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:25:40,017 INFO L225 Difference]: With dead ends: 59 [2018-11-14 17:25:40,018 INFO L226 Difference]: Without dead ends: 43 [2018-11-14 17:25:40,018 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-14 17:25:40,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-14 17:25:40,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-11-14 17:25:40,050 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:25:40,051 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 39 states. [2018-11-14 17:25:40,051 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 39 states. [2018-11-14 17:25:40,051 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 39 states. [2018-11-14 17:25:40,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:25:40,055 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-11-14 17:25:40,055 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-11-14 17:25:40,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:25:40,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:25:40,057 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 43 states. [2018-11-14 17:25:40,057 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 43 states. [2018-11-14 17:25:40,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:25:40,062 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-11-14 17:25:40,062 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-11-14 17:25:40,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:25:40,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:25:40,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:25:40,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:25:40,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-14 17:25:40,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-14 17:25:40,067 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 26 [2018-11-14 17:25:40,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:25:40,068 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-14 17:25:40,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:25:40,068 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-14 17:25:40,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-14 17:25:40,070 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:25:40,070 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] [2018-11-14 17:25:40,070 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:25:40,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:25:40,071 INFO L82 PathProgramCache]: Analyzing trace with hash -2065155414, now seen corresponding path program 1 times [2018-11-14 17:25:40,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:25:40,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:25:40,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:25:40,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:25:40,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:25:40,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:25:40,241 INFO L256 TraceCheckUtils]: 0: Hoare triple {488#true} call ULTIMATE.init(); {488#true} is VALID [2018-11-14 17:25:40,241 INFO L273 TraceCheckUtils]: 1: Hoare triple {488#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {488#true} is VALID [2018-11-14 17:25:40,242 INFO L273 TraceCheckUtils]: 2: Hoare triple {488#true} assume true; {488#true} is VALID [2018-11-14 17:25:40,242 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {488#true} {488#true} #96#return; {488#true} is VALID [2018-11-14 17:25:40,242 INFO L256 TraceCheckUtils]: 4: Hoare triple {488#true} call #t~ret16 := main(); {488#true} is VALID [2018-11-14 17:25:40,247 INFO L273 TraceCheckUtils]: 5: Hoare triple {488#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {490#(<= 2 main_~len~0)} is VALID [2018-11-14 17:25:40,247 INFO L256 TraceCheckUtils]: 6: Hoare triple {490#(<= 2 main_~len~0)} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {488#true} is VALID [2018-11-14 17:25:40,247 INFO L273 TraceCheckUtils]: 7: Hoare triple {488#true} ~len := #in~len;~data := #in~data; {488#true} is VALID [2018-11-14 17:25:40,248 INFO L256 TraceCheckUtils]: 8: Hoare triple {488#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {488#true} is VALID [2018-11-14 17:25:40,248 INFO L273 TraceCheckUtils]: 9: Hoare triple {488#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {488#true} is VALID [2018-11-14 17:25:40,248 INFO L273 TraceCheckUtils]: 10: Hoare triple {488#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {488#true} is VALID [2018-11-14 17:25:40,248 INFO L273 TraceCheckUtils]: 11: Hoare triple {488#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 0, 4);call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 8, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {488#true} is VALID [2018-11-14 17:25:40,248 INFO L273 TraceCheckUtils]: 12: Hoare triple {488#true} assume true; {488#true} is VALID [2018-11-14 17:25:40,249 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {488#true} {488#true} #86#return; {488#true} is VALID [2018-11-14 17:25:40,249 INFO L273 TraceCheckUtils]: 14: Hoare triple {488#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {488#true} is VALID [2018-11-14 17:25:40,250 INFO L273 TraceCheckUtils]: 15: Hoare triple {488#true} assume true; {488#true} is VALID [2018-11-14 17:25:40,250 INFO L273 TraceCheckUtils]: 16: Hoare triple {488#true} assume !!(~len > 1); {488#true} is VALID [2018-11-14 17:25:40,251 INFO L256 TraceCheckUtils]: 17: Hoare triple {488#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {488#true} is VALID [2018-11-14 17:25:40,251 INFO L273 TraceCheckUtils]: 18: Hoare triple {488#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {488#true} is VALID [2018-11-14 17:25:40,252 INFO L273 TraceCheckUtils]: 19: Hoare triple {488#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {488#true} is VALID [2018-11-14 17:25:40,252 INFO L273 TraceCheckUtils]: 20: Hoare triple {488#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 0, 4);call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 8, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {488#true} is VALID [2018-11-14 17:25:40,252 INFO L273 TraceCheckUtils]: 21: Hoare triple {488#true} assume true; {488#true} is VALID [2018-11-14 17:25:40,252 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {488#true} {488#true} #88#return; {488#true} is VALID [2018-11-14 17:25:40,253 INFO L273 TraceCheckUtils]: 23: Hoare triple {488#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, ~new_head~0.offset + 0, 4); {488#true} is VALID [2018-11-14 17:25:40,253 INFO L273 TraceCheckUtils]: 24: Hoare triple {488#true} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~head~0.offset + 4, 4); {488#true} is VALID [2018-11-14 17:25:40,253 INFO L273 TraceCheckUtils]: 25: Hoare triple {488#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {488#true} is VALID [2018-11-14 17:25:40,253 INFO L273 TraceCheckUtils]: 26: Hoare triple {488#true} assume true; {488#true} is VALID [2018-11-14 17:25:40,254 INFO L273 TraceCheckUtils]: 27: Hoare triple {488#true} assume !(~len > 1); {488#true} is VALID [2018-11-14 17:25:40,254 INFO L273 TraceCheckUtils]: 28: Hoare triple {488#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset + 0, 4);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~head~0.offset + 4, 4);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {488#true} is VALID [2018-11-14 17:25:40,254 INFO L273 TraceCheckUtils]: 29: Hoare triple {488#true} assume true; {488#true} is VALID [2018-11-14 17:25:40,257 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {488#true} {490#(<= 2 main_~len~0)} #92#return; {490#(<= 2 main_~len~0)} is VALID [2018-11-14 17:25:40,259 INFO L273 TraceCheckUtils]: 31: Hoare triple {490#(<= 2 main_~len~0)} call write~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0; {491#(and (<= 2 main_~len~0) (= main_~i~0 0))} is VALID [2018-11-14 17:25:40,261 INFO L273 TraceCheckUtils]: 32: Hoare triple {491#(and (<= 2 main_~len~0) (= main_~i~0 0))} assume true; {491#(and (<= 2 main_~len~0) (= main_~i~0 0))} is VALID [2018-11-14 17:25:40,262 INFO L273 TraceCheckUtils]: 33: Hoare triple {491#(and (<= 2 main_~len~0) (= main_~i~0 0))} assume !(~i~0 < ~len~0); {489#false} is VALID [2018-11-14 17:25:40,262 INFO L273 TraceCheckUtils]: 34: Hoare triple {489#false} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {489#false} is VALID [2018-11-14 17:25:40,262 INFO L273 TraceCheckUtils]: 35: Hoare triple {489#false} assume 0 != #t~mem15.base || 0 != #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {489#false} is VALID [2018-11-14 17:25:40,263 INFO L273 TraceCheckUtils]: 36: Hoare triple {489#false} assume !false; {489#false} is VALID [2018-11-14 17:25:40,265 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-14 17:25:40,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:25:40,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 17:25:40,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-11-14 17:25:40,267 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:25:40,267 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:25:40,353 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:25:40,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:25:40,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:25:40,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:25:40,354 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 4 states. [2018-11-14 17:25:40,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:25:40,577 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-11-14 17:25:40,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:25:40,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-11-14 17:25:40,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:25:40,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:25:40,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2018-11-14 17:25:40,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:25:40,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2018-11-14 17:25:40,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2018-11-14 17:25:40,696 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:25:40,704 INFO L225 Difference]: With dead ends: 47 [2018-11-14 17:25:40,704 INFO L226 Difference]: Without dead ends: 43 [2018-11-14 17:25:40,706 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:25:40,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-14 17:25:40,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-11-14 17:25:40,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:25:40,734 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 41 states. [2018-11-14 17:25:40,734 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 41 states. [2018-11-14 17:25:40,735 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 41 states. [2018-11-14 17:25:40,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:25:40,740 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-14 17:25:40,740 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-14 17:25:40,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:25:40,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:25:40,741 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 43 states. [2018-11-14 17:25:40,741 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 43 states. [2018-11-14 17:25:40,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:25:40,745 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-14 17:25:40,745 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-14 17:25:40,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:25:40,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:25:40,746 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:25:40,746 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:25:40,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-14 17:25:40,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-14 17:25:40,749 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 37 [2018-11-14 17:25:40,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:25:40,749 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-14 17:25:40,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:25:40,749 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-14 17:25:40,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-14 17:25:40,751 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:25:40,751 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2018-11-14 17:25:40,751 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:25:40,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:25:40,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1937853450, now seen corresponding path program 1 times [2018-11-14 17:25:40,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:25:40,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:25:40,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:25:40,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:25:40,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:25:40,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:25:40,938 INFO L256 TraceCheckUtils]: 0: Hoare triple {702#true} call ULTIMATE.init(); {702#true} is VALID [2018-11-14 17:25:40,939 INFO L273 TraceCheckUtils]: 1: Hoare triple {702#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {702#true} is VALID [2018-11-14 17:25:40,939 INFO L273 TraceCheckUtils]: 2: Hoare triple {702#true} assume true; {702#true} is VALID [2018-11-14 17:25:40,939 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {702#true} {702#true} #96#return; {702#true} is VALID [2018-11-14 17:25:40,940 INFO L256 TraceCheckUtils]: 4: Hoare triple {702#true} call #t~ret16 := main(); {702#true} is VALID [2018-11-14 17:25:40,941 INFO L273 TraceCheckUtils]: 5: Hoare triple {702#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {704#(<= 2 main_~len~0)} is VALID [2018-11-14 17:25:40,941 INFO L256 TraceCheckUtils]: 6: Hoare triple {704#(<= 2 main_~len~0)} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {702#true} is VALID [2018-11-14 17:25:40,941 INFO L273 TraceCheckUtils]: 7: Hoare triple {702#true} ~len := #in~len;~data := #in~data; {702#true} is VALID [2018-11-14 17:25:40,942 INFO L256 TraceCheckUtils]: 8: Hoare triple {702#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {702#true} is VALID [2018-11-14 17:25:40,942 INFO L273 TraceCheckUtils]: 9: Hoare triple {702#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {702#true} is VALID [2018-11-14 17:25:40,942 INFO L273 TraceCheckUtils]: 10: Hoare triple {702#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {702#true} is VALID [2018-11-14 17:25:40,942 INFO L273 TraceCheckUtils]: 11: Hoare triple {702#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 0, 4);call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 8, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {702#true} is VALID [2018-11-14 17:25:40,942 INFO L273 TraceCheckUtils]: 12: Hoare triple {702#true} assume true; {702#true} is VALID [2018-11-14 17:25:40,943 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {702#true} {702#true} #86#return; {702#true} is VALID [2018-11-14 17:25:40,943 INFO L273 TraceCheckUtils]: 14: Hoare triple {702#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {702#true} is VALID [2018-11-14 17:25:40,943 INFO L273 TraceCheckUtils]: 15: Hoare triple {702#true} assume true; {702#true} is VALID [2018-11-14 17:25:40,943 INFO L273 TraceCheckUtils]: 16: Hoare triple {702#true} assume !!(~len > 1); {702#true} is VALID [2018-11-14 17:25:40,944 INFO L256 TraceCheckUtils]: 17: Hoare triple {702#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {702#true} is VALID [2018-11-14 17:25:40,944 INFO L273 TraceCheckUtils]: 18: Hoare triple {702#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {702#true} is VALID [2018-11-14 17:25:40,944 INFO L273 TraceCheckUtils]: 19: Hoare triple {702#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {702#true} is VALID [2018-11-14 17:25:40,944 INFO L273 TraceCheckUtils]: 20: Hoare triple {702#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 0, 4);call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 8, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {702#true} is VALID [2018-11-14 17:25:40,945 INFO L273 TraceCheckUtils]: 21: Hoare triple {702#true} assume true; {702#true} is VALID [2018-11-14 17:25:40,945 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {702#true} {702#true} #88#return; {702#true} is VALID [2018-11-14 17:25:40,945 INFO L273 TraceCheckUtils]: 23: Hoare triple {702#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, ~new_head~0.offset + 0, 4); {702#true} is VALID [2018-11-14 17:25:40,945 INFO L273 TraceCheckUtils]: 24: Hoare triple {702#true} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~head~0.offset + 4, 4); {702#true} is VALID [2018-11-14 17:25:40,946 INFO L273 TraceCheckUtils]: 25: Hoare triple {702#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {702#true} is VALID [2018-11-14 17:25:40,946 INFO L273 TraceCheckUtils]: 26: Hoare triple {702#true} assume true; {702#true} is VALID [2018-11-14 17:25:40,946 INFO L273 TraceCheckUtils]: 27: Hoare triple {702#true} assume !(~len > 1); {702#true} is VALID [2018-11-14 17:25:40,947 INFO L273 TraceCheckUtils]: 28: Hoare triple {702#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset + 0, 4);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~head~0.offset + 4, 4);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {702#true} is VALID [2018-11-14 17:25:40,947 INFO L273 TraceCheckUtils]: 29: Hoare triple {702#true} assume true; {702#true} is VALID [2018-11-14 17:25:40,952 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {702#true} {704#(<= 2 main_~len~0)} #92#return; {704#(<= 2 main_~len~0)} is VALID [2018-11-14 17:25:40,954 INFO L273 TraceCheckUtils]: 31: Hoare triple {704#(<= 2 main_~len~0)} call write~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0; {705#(and (<= 2 main_~len~0) (= main_~i~0 0))} is VALID [2018-11-14 17:25:40,955 INFO L273 TraceCheckUtils]: 32: Hoare triple {705#(and (<= 2 main_~len~0) (= main_~i~0 0))} assume true; {705#(and (<= 2 main_~len~0) (= main_~i~0 0))} is VALID [2018-11-14 17:25:40,956 INFO L273 TraceCheckUtils]: 33: Hoare triple {705#(and (<= 2 main_~len~0) (= main_~i~0 0))} assume !!(~i~0 < ~len~0); {705#(and (<= 2 main_~len~0) (= main_~i~0 0))} is VALID [2018-11-14 17:25:40,956 INFO L256 TraceCheckUtils]: 34: Hoare triple {705#(and (<= 2 main_~len~0) (= main_~i~0 0))} call dll_circular_remove_first(~#s~0.base, ~#s~0.offset); {702#true} is VALID [2018-11-14 17:25:40,957 INFO L273 TraceCheckUtils]: 35: Hoare triple {702#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(#t~mem6.base, #t~mem6.offset + 0, 4);~temp~1.base, ~temp~1.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4); {702#true} is VALID [2018-11-14 17:25:40,957 INFO L273 TraceCheckUtils]: 36: Hoare triple {702#true} assume ~temp~1.base == #t~mem8.base && ~temp~1.offset == #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem9.base, #t~mem9.offset);havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(0, 0, ~head.base, ~head.offset, 4); {702#true} is VALID [2018-11-14 17:25:40,958 INFO L273 TraceCheckUtils]: 37: Hoare triple {702#true} assume true; {702#true} is VALID [2018-11-14 17:25:40,972 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {702#true} {705#(and (<= 2 main_~len~0) (= main_~i~0 0))} #94#return; {705#(and (<= 2 main_~len~0) (= main_~i~0 0))} is VALID [2018-11-14 17:25:40,973 INFO L273 TraceCheckUtils]: 39: Hoare triple {705#(and (<= 2 main_~len~0) (= main_~i~0 0))} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {706#(<= (+ main_~i~0 1) main_~len~0)} is VALID [2018-11-14 17:25:40,974 INFO L273 TraceCheckUtils]: 40: Hoare triple {706#(<= (+ main_~i~0 1) main_~len~0)} assume true; {706#(<= (+ main_~i~0 1) main_~len~0)} is VALID [2018-11-14 17:25:40,977 INFO L273 TraceCheckUtils]: 41: Hoare triple {706#(<= (+ main_~i~0 1) main_~len~0)} assume !(~i~0 < ~len~0); {703#false} is VALID [2018-11-14 17:25:40,977 INFO L273 TraceCheckUtils]: 42: Hoare triple {703#false} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {703#false} is VALID [2018-11-14 17:25:40,977 INFO L273 TraceCheckUtils]: 43: Hoare triple {703#false} assume 0 != #t~mem15.base || 0 != #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {703#false} is VALID [2018-11-14 17:25:40,978 INFO L273 TraceCheckUtils]: 44: Hoare triple {703#false} assume !false; {703#false} is VALID [2018-11-14 17:25:40,981 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-14 17:25:40,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:25:40,982 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:25:40,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:25:41,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:25:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:25:41,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:25:41,567 INFO L256 TraceCheckUtils]: 0: Hoare triple {702#true} call ULTIMATE.init(); {702#true} is VALID [2018-11-14 17:25:41,567 INFO L273 TraceCheckUtils]: 1: Hoare triple {702#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {702#true} is VALID [2018-11-14 17:25:41,567 INFO L273 TraceCheckUtils]: 2: Hoare triple {702#true} assume true; {702#true} is VALID [2018-11-14 17:25:41,568 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {702#true} {702#true} #96#return; {702#true} is VALID [2018-11-14 17:25:41,568 INFO L256 TraceCheckUtils]: 4: Hoare triple {702#true} call #t~ret16 := main(); {702#true} is VALID [2018-11-14 17:25:41,581 INFO L273 TraceCheckUtils]: 5: Hoare triple {702#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {704#(<= 2 main_~len~0)} is VALID [2018-11-14 17:25:41,581 INFO L256 TraceCheckUtils]: 6: Hoare triple {704#(<= 2 main_~len~0)} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {702#true} is VALID [2018-11-14 17:25:41,581 INFO L273 TraceCheckUtils]: 7: Hoare triple {702#true} ~len := #in~len;~data := #in~data; {702#true} is VALID [2018-11-14 17:25:41,582 INFO L256 TraceCheckUtils]: 8: Hoare triple {702#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {702#true} is VALID [2018-11-14 17:25:41,582 INFO L273 TraceCheckUtils]: 9: Hoare triple {702#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {702#true} is VALID [2018-11-14 17:25:41,582 INFO L273 TraceCheckUtils]: 10: Hoare triple {702#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {702#true} is VALID [2018-11-14 17:25:41,582 INFO L273 TraceCheckUtils]: 11: Hoare triple {702#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 0, 4);call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 8, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {702#true} is VALID [2018-11-14 17:25:41,583 INFO L273 TraceCheckUtils]: 12: Hoare triple {702#true} assume true; {702#true} is VALID [2018-11-14 17:25:41,583 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {702#true} {702#true} #86#return; {702#true} is VALID [2018-11-14 17:25:41,583 INFO L273 TraceCheckUtils]: 14: Hoare triple {702#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {702#true} is VALID [2018-11-14 17:25:41,583 INFO L273 TraceCheckUtils]: 15: Hoare triple {702#true} assume true; {702#true} is VALID [2018-11-14 17:25:41,584 INFO L273 TraceCheckUtils]: 16: Hoare triple {702#true} assume !!(~len > 1); {702#true} is VALID [2018-11-14 17:25:41,584 INFO L256 TraceCheckUtils]: 17: Hoare triple {702#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {702#true} is VALID [2018-11-14 17:25:41,584 INFO L273 TraceCheckUtils]: 18: Hoare triple {702#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {702#true} is VALID [2018-11-14 17:25:41,585 INFO L273 TraceCheckUtils]: 19: Hoare triple {702#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {702#true} is VALID [2018-11-14 17:25:41,585 INFO L273 TraceCheckUtils]: 20: Hoare triple {702#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 0, 4);call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 8, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {702#true} is VALID [2018-11-14 17:25:41,585 INFO L273 TraceCheckUtils]: 21: Hoare triple {702#true} assume true; {702#true} is VALID [2018-11-14 17:25:41,585 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {702#true} {702#true} #88#return; {702#true} is VALID [2018-11-14 17:25:41,586 INFO L273 TraceCheckUtils]: 23: Hoare triple {702#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, ~new_head~0.offset + 0, 4); {702#true} is VALID [2018-11-14 17:25:41,586 INFO L273 TraceCheckUtils]: 24: Hoare triple {702#true} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~head~0.offset + 4, 4); {702#true} is VALID [2018-11-14 17:25:41,586 INFO L273 TraceCheckUtils]: 25: Hoare triple {702#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {702#true} is VALID [2018-11-14 17:25:41,586 INFO L273 TraceCheckUtils]: 26: Hoare triple {702#true} assume true; {702#true} is VALID [2018-11-14 17:25:41,587 INFO L273 TraceCheckUtils]: 27: Hoare triple {702#true} assume !(~len > 1); {702#true} is VALID [2018-11-14 17:25:41,587 INFO L273 TraceCheckUtils]: 28: Hoare triple {702#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset + 0, 4);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~head~0.offset + 4, 4);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {702#true} is VALID [2018-11-14 17:25:41,587 INFO L273 TraceCheckUtils]: 29: Hoare triple {702#true} assume true; {702#true} is VALID [2018-11-14 17:25:41,593 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {702#true} {704#(<= 2 main_~len~0)} #92#return; {704#(<= 2 main_~len~0)} is VALID [2018-11-14 17:25:41,595 INFO L273 TraceCheckUtils]: 31: Hoare triple {704#(<= 2 main_~len~0)} call write~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0; {803#(and (<= main_~i~0 0) (<= 2 main_~len~0))} is VALID [2018-11-14 17:25:41,595 INFO L273 TraceCheckUtils]: 32: Hoare triple {803#(and (<= main_~i~0 0) (<= 2 main_~len~0))} assume true; {803#(and (<= main_~i~0 0) (<= 2 main_~len~0))} is VALID [2018-11-14 17:25:41,597 INFO L273 TraceCheckUtils]: 33: Hoare triple {803#(and (<= main_~i~0 0) (<= 2 main_~len~0))} assume !!(~i~0 < ~len~0); {803#(and (<= main_~i~0 0) (<= 2 main_~len~0))} is VALID [2018-11-14 17:25:41,597 INFO L256 TraceCheckUtils]: 34: Hoare triple {803#(and (<= main_~i~0 0) (<= 2 main_~len~0))} call dll_circular_remove_first(~#s~0.base, ~#s~0.offset); {702#true} is VALID [2018-11-14 17:25:41,597 INFO L273 TraceCheckUtils]: 35: Hoare triple {702#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(#t~mem6.base, #t~mem6.offset + 0, 4);~temp~1.base, ~temp~1.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4); {702#true} is VALID [2018-11-14 17:25:41,598 INFO L273 TraceCheckUtils]: 36: Hoare triple {702#true} assume ~temp~1.base == #t~mem8.base && ~temp~1.offset == #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem9.base, #t~mem9.offset);havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(0, 0, ~head.base, ~head.offset, 4); {702#true} is VALID [2018-11-14 17:25:41,598 INFO L273 TraceCheckUtils]: 37: Hoare triple {702#true} assume true; {702#true} is VALID [2018-11-14 17:25:41,599 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {702#true} {803#(and (<= main_~i~0 0) (<= 2 main_~len~0))} #94#return; {803#(and (<= main_~i~0 0) (<= 2 main_~len~0))} is VALID [2018-11-14 17:25:41,603 INFO L273 TraceCheckUtils]: 39: Hoare triple {803#(and (<= main_~i~0 0) (<= 2 main_~len~0))} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {828#(and (<= main_~i~0 1) (<= 2 main_~len~0))} is VALID [2018-11-14 17:25:41,603 INFO L273 TraceCheckUtils]: 40: Hoare triple {828#(and (<= main_~i~0 1) (<= 2 main_~len~0))} assume true; {828#(and (<= main_~i~0 1) (<= 2 main_~len~0))} is VALID [2018-11-14 17:25:41,611 INFO L273 TraceCheckUtils]: 41: Hoare triple {828#(and (<= main_~i~0 1) (<= 2 main_~len~0))} assume !(~i~0 < ~len~0); {703#false} is VALID [2018-11-14 17:25:41,611 INFO L273 TraceCheckUtils]: 42: Hoare triple {703#false} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {703#false} is VALID [2018-11-14 17:25:41,611 INFO L273 TraceCheckUtils]: 43: Hoare triple {703#false} assume 0 != #t~mem15.base || 0 != #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {703#false} is VALID [2018-11-14 17:25:41,612 INFO L273 TraceCheckUtils]: 44: Hoare triple {703#false} assume !false; {703#false} is VALID [2018-11-14 17:25:41,616 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-14 17:25:41,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:25:41,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-14 17:25:41,646 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-11-14 17:25:41,647 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:25:41,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 17:25:41,743 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:25:41,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 17:25:41,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 17:25:41,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:25:41,745 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 7 states. [2018-11-14 17:25:42,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:25:42,257 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-11-14 17:25:42,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:25:42,257 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-11-14 17:25:42,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:25:42,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:25:42,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2018-11-14 17:25:42,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:25:42,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2018-11-14 17:25:42,267 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2018-11-14 17:25:42,356 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:25:42,358 INFO L225 Difference]: With dead ends: 51 [2018-11-14 17:25:42,358 INFO L226 Difference]: Without dead ends: 47 [2018-11-14 17:25:42,359 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:25:42,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-14 17:25:42,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-11-14 17:25:42,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:25:42,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 45 states. [2018-11-14 17:25:42,391 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 45 states. [2018-11-14 17:25:42,391 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 45 states. [2018-11-14 17:25:42,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:25:42,396 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2018-11-14 17:25:42,396 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-14 17:25:42,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:25:42,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:25:42,397 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 47 states. [2018-11-14 17:25:42,398 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 47 states. [2018-11-14 17:25:42,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:25:42,401 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2018-11-14 17:25:42,401 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-14 17:25:42,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:25:42,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:25:42,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:25:42,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:25:42,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-14 17:25:42,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-11-14 17:25:42,405 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 45 [2018-11-14 17:25:42,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:25:42,406 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-11-14 17:25:42,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 17:25:42,406 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-11-14 17:25:42,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-14 17:25:42,408 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:25:42,408 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 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] [2018-11-14 17:25:42,408 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:25:42,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:25:42,409 INFO L82 PathProgramCache]: Analyzing trace with hash -86171326, now seen corresponding path program 2 times [2018-11-14 17:25:42,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:25:42,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:25:42,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:25:42,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:25:42,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:25:42,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:25:43,138 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-11-14 17:25:43,160 INFO L256 TraceCheckUtils]: 0: Hoare triple {1073#true} call ULTIMATE.init(); {1073#true} is VALID [2018-11-14 17:25:43,161 INFO L273 TraceCheckUtils]: 1: Hoare triple {1073#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1073#true} is VALID [2018-11-14 17:25:43,161 INFO L273 TraceCheckUtils]: 2: Hoare triple {1073#true} assume true; {1073#true} is VALID [2018-11-14 17:25:43,161 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1073#true} {1073#true} #96#return; {1073#true} is VALID [2018-11-14 17:25:43,162 INFO L256 TraceCheckUtils]: 4: Hoare triple {1073#true} call #t~ret16 := main(); {1073#true} is VALID [2018-11-14 17:25:43,162 INFO L273 TraceCheckUtils]: 5: Hoare triple {1073#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {1073#true} is VALID [2018-11-14 17:25:43,162 INFO L256 TraceCheckUtils]: 6: Hoare triple {1073#true} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {1073#true} is VALID [2018-11-14 17:25:43,163 INFO L273 TraceCheckUtils]: 7: Hoare triple {1073#true} ~len := #in~len;~data := #in~data; {1073#true} is VALID [2018-11-14 17:25:43,163 INFO L256 TraceCheckUtils]: 8: Hoare triple {1073#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1073#true} is VALID [2018-11-14 17:25:43,164 INFO L273 TraceCheckUtils]: 9: Hoare triple {1073#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1073#true} is VALID [2018-11-14 17:25:43,164 INFO L273 TraceCheckUtils]: 10: Hoare triple {1073#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1073#true} is VALID [2018-11-14 17:25:43,164 INFO L273 TraceCheckUtils]: 11: Hoare triple {1073#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 0, 4);call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 8, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1073#true} is VALID [2018-11-14 17:25:43,165 INFO L273 TraceCheckUtils]: 12: Hoare triple {1073#true} assume true; {1073#true} is VALID [2018-11-14 17:25:43,165 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1073#true} {1073#true} #86#return; {1073#true} is VALID [2018-11-14 17:25:43,165 INFO L273 TraceCheckUtils]: 14: Hoare triple {1073#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {1073#true} is VALID [2018-11-14 17:25:43,165 INFO L273 TraceCheckUtils]: 15: Hoare triple {1073#true} assume true; {1073#true} is VALID [2018-11-14 17:25:43,166 INFO L273 TraceCheckUtils]: 16: Hoare triple {1073#true} assume !!(~len > 1); {1073#true} is VALID [2018-11-14 17:25:43,166 INFO L256 TraceCheckUtils]: 17: Hoare triple {1073#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1073#true} is VALID [2018-11-14 17:25:43,166 INFO L273 TraceCheckUtils]: 18: Hoare triple {1073#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1073#true} is VALID [2018-11-14 17:25:43,167 INFO L273 TraceCheckUtils]: 19: Hoare triple {1073#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1073#true} is VALID [2018-11-14 17:25:43,167 INFO L273 TraceCheckUtils]: 20: Hoare triple {1073#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 0, 4);call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 8, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1073#true} is VALID [2018-11-14 17:25:43,167 INFO L273 TraceCheckUtils]: 21: Hoare triple {1073#true} assume true; {1073#true} is VALID [2018-11-14 17:25:43,167 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1073#true} {1073#true} #88#return; {1073#true} is VALID [2018-11-14 17:25:43,168 INFO L273 TraceCheckUtils]: 23: Hoare triple {1073#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, ~new_head~0.offset + 0, 4); {1073#true} is VALID [2018-11-14 17:25:43,168 INFO L273 TraceCheckUtils]: 24: Hoare triple {1073#true} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~head~0.offset + 4, 4); {1073#true} is VALID [2018-11-14 17:25:43,168 INFO L273 TraceCheckUtils]: 25: Hoare triple {1073#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {1073#true} is VALID [2018-11-14 17:25:43,169 INFO L273 TraceCheckUtils]: 26: Hoare triple {1073#true} assume true; {1073#true} is VALID [2018-11-14 17:25:43,169 INFO L273 TraceCheckUtils]: 27: Hoare triple {1073#true} assume !(~len > 1); {1073#true} is VALID [2018-11-14 17:25:43,169 INFO L273 TraceCheckUtils]: 28: Hoare triple {1073#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset + 0, 4);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~head~0.offset + 4, 4);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {1073#true} is VALID [2018-11-14 17:25:43,170 INFO L273 TraceCheckUtils]: 29: Hoare triple {1073#true} assume true; {1073#true} is VALID [2018-11-14 17:25:43,170 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {1073#true} {1073#true} #92#return; {1073#true} is VALID [2018-11-14 17:25:43,170 INFO L273 TraceCheckUtils]: 31: Hoare triple {1073#true} call write~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0; {1073#true} is VALID [2018-11-14 17:25:43,170 INFO L273 TraceCheckUtils]: 32: Hoare triple {1073#true} assume true; {1073#true} is VALID [2018-11-14 17:25:43,171 INFO L273 TraceCheckUtils]: 33: Hoare triple {1073#true} assume !!(~i~0 < ~len~0); {1073#true} is VALID [2018-11-14 17:25:43,171 INFO L256 TraceCheckUtils]: 34: Hoare triple {1073#true} call dll_circular_remove_first(~#s~0.base, ~#s~0.offset); {1073#true} is VALID [2018-11-14 17:25:43,171 INFO L273 TraceCheckUtils]: 35: Hoare triple {1073#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(#t~mem6.base, #t~mem6.offset + 0, 4);~temp~1.base, ~temp~1.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4); {1073#true} is VALID [2018-11-14 17:25:43,172 INFO L273 TraceCheckUtils]: 36: Hoare triple {1073#true} assume ~temp~1.base == #t~mem8.base && ~temp~1.offset == #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem9.base, #t~mem9.offset);havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(0, 0, ~head.base, ~head.offset, 4); {1073#true} is VALID [2018-11-14 17:25:43,172 INFO L273 TraceCheckUtils]: 37: Hoare triple {1073#true} assume true; {1073#true} is VALID [2018-11-14 17:25:43,172 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1073#true} {1073#true} #94#return; {1073#true} is VALID [2018-11-14 17:25:43,172 INFO L273 TraceCheckUtils]: 39: Hoare triple {1073#true} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {1073#true} is VALID [2018-11-14 17:25:43,173 INFO L273 TraceCheckUtils]: 40: Hoare triple {1073#true} assume true; {1073#true} is VALID [2018-11-14 17:25:43,173 INFO L273 TraceCheckUtils]: 41: Hoare triple {1073#true} assume !!(~i~0 < ~len~0); {1073#true} is VALID [2018-11-14 17:25:43,173 INFO L256 TraceCheckUtils]: 42: Hoare triple {1073#true} call dll_circular_remove_first(~#s~0.base, ~#s~0.offset); {1073#true} is VALID [2018-11-14 17:25:43,188 INFO L273 TraceCheckUtils]: 43: Hoare triple {1073#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(#t~mem6.base, #t~mem6.offset + 0, 4);~temp~1.base, ~temp~1.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4); {1075#(and (= dll_circular_remove_first_~head.offset |dll_circular_remove_first_#in~head.offset|) (= dll_circular_remove_first_~head.base |dll_circular_remove_first_#in~head.base|))} is VALID [2018-11-14 17:25:43,204 INFO L273 TraceCheckUtils]: 44: Hoare triple {1075#(and (= dll_circular_remove_first_~head.offset |dll_circular_remove_first_#in~head.offset|) (= dll_circular_remove_first_~head.base |dll_circular_remove_first_#in~head.base|))} assume ~temp~1.base == #t~mem8.base && ~temp~1.offset == #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem9.base, #t~mem9.offset);havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(0, 0, ~head.base, ~head.offset, 4); {1076#(and (= 0 (select (select |#memory_$Pointer$.offset| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)))} is VALID [2018-11-14 17:25:43,216 INFO L273 TraceCheckUtils]: 45: Hoare triple {1076#(and (= 0 (select (select |#memory_$Pointer$.offset| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)))} assume true; {1076#(and (= 0 (select (select |#memory_$Pointer$.offset| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)))} is VALID [2018-11-14 17:25:43,222 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {1076#(and (= 0 (select (select |#memory_$Pointer$.offset| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)))} {1073#true} #94#return; {1077#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-14 17:25:43,224 INFO L273 TraceCheckUtils]: 47: Hoare triple {1077#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {1077#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-14 17:25:43,225 INFO L273 TraceCheckUtils]: 48: Hoare triple {1077#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))} assume true; {1077#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-14 17:25:43,226 INFO L273 TraceCheckUtils]: 49: Hoare triple {1077#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))} assume !(~i~0 < ~len~0); {1077#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-14 17:25:43,226 INFO L273 TraceCheckUtils]: 50: Hoare triple {1077#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {1078#(and (= 0 |main_#t~mem15.base|) (= |main_#t~mem15.offset| 0))} is VALID [2018-11-14 17:25:43,228 INFO L273 TraceCheckUtils]: 51: Hoare triple {1078#(and (= 0 |main_#t~mem15.base|) (= |main_#t~mem15.offset| 0))} assume 0 != #t~mem15.base || 0 != #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {1074#false} is VALID [2018-11-14 17:25:43,228 INFO L273 TraceCheckUtils]: 52: Hoare triple {1074#false} assume !false; {1074#false} is VALID [2018-11-14 17:25:43,235 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-14 17:25:43,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:25:43,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 17:25:43,236 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-11-14 17:25:43,237 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:25:43,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:25:43,363 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:25:43,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:25:43,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:25:43,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:25:43,364 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 6 states. [2018-11-14 17:25:43,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:25:43,882 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2018-11-14 17:25:43,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:25:43,882 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-11-14 17:25:43,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:25:43,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:25:43,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2018-11-14 17:25:43,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:25:43,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2018-11-14 17:25:43,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 56 transitions. [2018-11-14 17:25:44,046 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:25:44,048 INFO L225 Difference]: With dead ends: 60 [2018-11-14 17:25:44,048 INFO L226 Difference]: Without dead ends: 56 [2018-11-14 17:25:44,048 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:25:44,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-14 17:25:44,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2018-11-14 17:25:44,083 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:25:44,083 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 47 states. [2018-11-14 17:25:44,083 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 47 states. [2018-11-14 17:25:44,084 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 47 states. [2018-11-14 17:25:44,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:25:44,087 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2018-11-14 17:25:44,088 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2018-11-14 17:25:44,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:25:44,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:25:44,089 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 56 states. [2018-11-14 17:25:44,089 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 56 states. [2018-11-14 17:25:44,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:25:44,093 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2018-11-14 17:25:44,093 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2018-11-14 17:25:44,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:25:44,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:25:44,094 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:25:44,094 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:25:44,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-14 17:25:44,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-11-14 17:25:44,098 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 53 [2018-11-14 17:25:44,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:25:44,098 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-11-14 17:25:44,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:25:44,098 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-14 17:25:44,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-14 17:25:44,100 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:25:44,100 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 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, 1] [2018-11-14 17:25:44,101 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:25:44,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:25:44,101 INFO L82 PathProgramCache]: Analyzing trace with hash 593887044, now seen corresponding path program 1 times [2018-11-14 17:25:44,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:25:44,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:25:44,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:25:44,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:25:44,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:25:44,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:25:45,464 INFO L256 TraceCheckUtils]: 0: Hoare triple {1345#true} call ULTIMATE.init(); {1345#true} is VALID [2018-11-14 17:25:45,464 INFO L273 TraceCheckUtils]: 1: Hoare triple {1345#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1345#true} is VALID [2018-11-14 17:25:45,465 INFO L273 TraceCheckUtils]: 2: Hoare triple {1345#true} assume true; {1345#true} is VALID [2018-11-14 17:25:45,465 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1345#true} {1345#true} #96#return; {1345#true} is VALID [2018-11-14 17:25:45,465 INFO L256 TraceCheckUtils]: 4: Hoare triple {1345#true} call #t~ret16 := main(); {1345#true} is VALID [2018-11-14 17:25:45,466 INFO L273 TraceCheckUtils]: 5: Hoare triple {1345#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4); {1347#(= (select |#valid| |main_~#s~0.base|) 1)} is VALID [2018-11-14 17:25:45,468 INFO L256 TraceCheckUtils]: 6: Hoare triple {1347#(= (select |#valid| |main_~#s~0.base|) 1)} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {1348#(= |#valid| |old(#valid)|)} is VALID [2018-11-14 17:25:45,468 INFO L273 TraceCheckUtils]: 7: Hoare triple {1348#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data; {1348#(= |#valid| |old(#valid)|)} is VALID [2018-11-14 17:25:45,470 INFO L256 TraceCheckUtils]: 8: Hoare triple {1348#(= |#valid| |old(#valid)|)} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1348#(= |#valid| |old(#valid)|)} is VALID [2018-11-14 17:25:45,472 INFO L273 TraceCheckUtils]: 9: Hoare triple {1348#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1349#(and (or (= |#valid| |old(#valid)|) (= node_create_~temp~0.base (@diff |old(#valid)| |#valid|))) (= (select |#valid| node_create_~temp~0.base) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-14 17:25:45,473 INFO L273 TraceCheckUtils]: 10: Hoare triple {1349#(and (or (= |#valid| |old(#valid)|) (= node_create_~temp~0.base (@diff |old(#valid)| |#valid|))) (= (select |#valid| node_create_~temp~0.base) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1349#(and (or (= |#valid| |old(#valid)|) (= node_create_~temp~0.base (@diff |old(#valid)| |#valid|))) (= (select |#valid| node_create_~temp~0.base) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-14 17:25:45,474 INFO L273 TraceCheckUtils]: 11: Hoare triple {1349#(and (or (= |#valid| |old(#valid)|) (= node_create_~temp~0.base (@diff |old(#valid)| |#valid|))) (= (select |#valid| node_create_~temp~0.base) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 0, 4);call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 8, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1350#(and (= (select |#valid| |node_create_#res.base|) 1) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-14 17:25:45,475 INFO L273 TraceCheckUtils]: 12: Hoare triple {1350#(and (= (select |#valid| |node_create_#res.base|) 1) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume true; {1350#(and (= (select |#valid| |node_create_#res.base|) 1) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-14 17:25:45,480 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1350#(and (= (select |#valid| |node_create_#res.base|) 1) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} {1348#(= |#valid| |old(#valid)|)} #86#return; {1351#(and (= (select |#valid| |dll_circular_create_#t~ret3.base|) 1) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-14 17:25:45,490 INFO L273 TraceCheckUtils]: 14: Hoare triple {1351#(and (= (select |#valid| |dll_circular_create_#t~ret3.base|) 1) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {1352#(and (= (select |#valid| dll_circular_create_~head~0.base) 1) (= (select |#valid| dll_circular_create_~last~0.base) 1) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-14 17:25:45,503 INFO L273 TraceCheckUtils]: 15: Hoare triple {1352#(and (= (select |#valid| dll_circular_create_~head~0.base) 1) (= (select |#valid| dll_circular_create_~last~0.base) 1) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume true; {1352#(and (= (select |#valid| dll_circular_create_~head~0.base) 1) (= (select |#valid| dll_circular_create_~last~0.base) 1) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-14 17:25:45,516 INFO L273 TraceCheckUtils]: 16: Hoare triple {1352#(and (= (select |#valid| dll_circular_create_~head~0.base) 1) (= (select |#valid| dll_circular_create_~last~0.base) 1) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume !!(~len > 1); {1352#(and (= (select |#valid| dll_circular_create_~head~0.base) 1) (= (select |#valid| dll_circular_create_~last~0.base) 1) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-14 17:25:45,530 INFO L256 TraceCheckUtils]: 17: Hoare triple {1352#(and (= (select |#valid| dll_circular_create_~head~0.base) 1) (= (select |#valid| dll_circular_create_~last~0.base) 1) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1348#(= |#valid| |old(#valid)|)} is VALID [2018-11-14 17:25:45,543 INFO L273 TraceCheckUtils]: 18: Hoare triple {1348#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1353#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= 0 node_create_~temp~0.offset))} is VALID [2018-11-14 17:25:45,553 INFO L273 TraceCheckUtils]: 19: Hoare triple {1353#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= 0 node_create_~temp~0.offset))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1353#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= 0 node_create_~temp~0.offset))} is VALID [2018-11-14 17:25:45,566 INFO L273 TraceCheckUtils]: 20: Hoare triple {1353#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= 0 node_create_~temp~0.offset))} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 0, 4);call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 8, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1354#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (= 0 |node_create_#res.offset|))} is VALID [2018-11-14 17:25:45,579 INFO L273 TraceCheckUtils]: 21: Hoare triple {1354#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (= 0 |node_create_#res.offset|))} assume true; {1354#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (= 0 |node_create_#res.offset|))} is VALID [2018-11-14 17:25:45,593 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1354#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (= 0 |node_create_#res.offset|))} {1352#(and (= (select |#valid| dll_circular_create_~head~0.base) 1) (= (select |#valid| dll_circular_create_~last~0.base) 1) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} #88#return; {1355#(and (not (= dll_circular_create_~last~0.base |dll_circular_create_#t~ret4.base|)) (= 0 (select |old(#valid)| |dll_circular_create_#t~ret4.base|)) (= 0 |dll_circular_create_#t~ret4.offset|) (not (= dll_circular_create_~head~0.base |dll_circular_create_#t~ret4.base|)))} is VALID [2018-11-14 17:25:45,606 INFO L273 TraceCheckUtils]: 23: Hoare triple {1355#(and (not (= dll_circular_create_~last~0.base |dll_circular_create_#t~ret4.base|)) (= 0 (select |old(#valid)| |dll_circular_create_#t~ret4.base|)) (= 0 |dll_circular_create_#t~ret4.offset|) (not (= dll_circular_create_~head~0.base |dll_circular_create_#t~ret4.base|)))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 0, 4); {1356#(and (not (= dll_circular_create_~new_head~0.base dll_circular_create_~head~0.base)) (not (= (select (select (store |#memory_$Pointer$.base| dll_circular_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) (+ dll_circular_create_~head~0.offset 4) dll_circular_create_~new_head~0.base)) dll_circular_create_~new_head~0.base) dll_circular_create_~new_head~0.offset) dll_circular_create_~new_head~0.base)) (= 0 (select |old(#valid)| dll_circular_create_~new_head~0.base)) (= 0 dll_circular_create_~new_head~0.offset) (not (= dll_circular_create_~new_head~0.base dll_circular_create_~last~0.base)))} is VALID [2018-11-14 17:25:45,619 INFO L273 TraceCheckUtils]: 24: Hoare triple {1356#(and (not (= dll_circular_create_~new_head~0.base dll_circular_create_~head~0.base)) (not (= (select (select (store |#memory_$Pointer$.base| dll_circular_create_~head~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) (+ dll_circular_create_~head~0.offset 4) dll_circular_create_~new_head~0.base)) dll_circular_create_~new_head~0.base) dll_circular_create_~new_head~0.offset) dll_circular_create_~new_head~0.base)) (= 0 (select |old(#valid)| dll_circular_create_~new_head~0.base)) (= 0 dll_circular_create_~new_head~0.offset) (not (= dll_circular_create_~new_head~0.base dll_circular_create_~last~0.base)))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~head~0.offset + 4, 4); {1357#(and (= 0 (select |old(#valid)| dll_circular_create_~new_head~0.base)) (= 0 dll_circular_create_~new_head~0.offset) (not (= (select (select |#memory_$Pointer$.base| dll_circular_create_~new_head~0.base) dll_circular_create_~new_head~0.offset) dll_circular_create_~new_head~0.base)) (not (= dll_circular_create_~new_head~0.base dll_circular_create_~last~0.base)))} is VALID [2018-11-14 17:25:45,632 INFO L273 TraceCheckUtils]: 25: Hoare triple {1357#(and (= 0 (select |old(#valid)| dll_circular_create_~new_head~0.base)) (= 0 dll_circular_create_~new_head~0.offset) (not (= (select (select |#memory_$Pointer$.base| dll_circular_create_~new_head~0.base) dll_circular_create_~new_head~0.offset) dll_circular_create_~new_head~0.base)) (not (= dll_circular_create_~new_head~0.base dll_circular_create_~last~0.base)))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {1358#(and (not (= (select (store (select (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~head~0.base)) dll_circular_create_~head~0.base) (+ dll_circular_create_~head~0.offset 4) dll_circular_create_~last~0.base) dll_circular_create_~head~0.offset) dll_circular_create_~head~0.base)) (= 0 (select |old(#valid)| dll_circular_create_~head~0.base)))} is VALID [2018-11-14 17:25:45,645 INFO L273 TraceCheckUtils]: 26: Hoare triple {1358#(and (not (= (select (store (select (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~head~0.base)) dll_circular_create_~head~0.base) (+ dll_circular_create_~head~0.offset 4) dll_circular_create_~last~0.base) dll_circular_create_~head~0.offset) dll_circular_create_~head~0.base)) (= 0 (select |old(#valid)| dll_circular_create_~head~0.base)))} assume true; {1358#(and (not (= (select (store (select (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~head~0.base)) dll_circular_create_~head~0.base) (+ dll_circular_create_~head~0.offset 4) dll_circular_create_~last~0.base) dll_circular_create_~head~0.offset) dll_circular_create_~head~0.base)) (= 0 (select |old(#valid)| dll_circular_create_~head~0.base)))} is VALID [2018-11-14 17:25:45,658 INFO L273 TraceCheckUtils]: 27: Hoare triple {1358#(and (not (= (select (store (select (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~head~0.base)) dll_circular_create_~head~0.base) (+ dll_circular_create_~head~0.offset 4) dll_circular_create_~last~0.base) dll_circular_create_~head~0.offset) dll_circular_create_~head~0.base)) (= 0 (select |old(#valid)| dll_circular_create_~head~0.base)))} assume !(~len > 1); {1358#(and (not (= (select (store (select (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~head~0.base)) dll_circular_create_~head~0.base) (+ dll_circular_create_~head~0.offset 4) dll_circular_create_~last~0.base) dll_circular_create_~head~0.offset) dll_circular_create_~head~0.base)) (= 0 (select |old(#valid)| dll_circular_create_~head~0.base)))} is VALID [2018-11-14 17:25:45,671 INFO L273 TraceCheckUtils]: 28: Hoare triple {1358#(and (not (= (select (store (select (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~head~0.base)) dll_circular_create_~head~0.base) (+ dll_circular_create_~head~0.offset 4) dll_circular_create_~last~0.base) dll_circular_create_~head~0.offset) dll_circular_create_~head~0.base)) (= 0 (select |old(#valid)| dll_circular_create_~head~0.base)))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset + 0, 4);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~head~0.offset + 4, 4);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {1359#(and (= 0 (select |old(#valid)| |dll_circular_create_#res.base|)) (not (= (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) |dll_circular_create_#res.offset|) |dll_circular_create_#res.base|)))} is VALID [2018-11-14 17:25:45,684 INFO L273 TraceCheckUtils]: 29: Hoare triple {1359#(and (= 0 (select |old(#valid)| |dll_circular_create_#res.base|)) (not (= (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) |dll_circular_create_#res.offset|) |dll_circular_create_#res.base|)))} assume true; {1359#(and (= 0 (select |old(#valid)| |dll_circular_create_#res.base|)) (not (= (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) |dll_circular_create_#res.offset|) |dll_circular_create_#res.base|)))} is VALID [2018-11-14 17:25:45,688 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {1359#(and (= 0 (select |old(#valid)| |dll_circular_create_#res.base|)) (not (= (select (select |#memory_$Pointer$.base| |dll_circular_create_#res.base|) |dll_circular_create_#res.offset|) |dll_circular_create_#res.base|)))} {1347#(= (select |#valid| |main_~#s~0.base|) 1)} #92#return; {1360#(not (= (select (select (store |#memory_$Pointer$.base| |main_~#s~0.base| (store (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset| |main_#t~ret13.base|)) |main_#t~ret13.base|) |main_#t~ret13.offset|) |main_#t~ret13.base|))} is VALID [2018-11-14 17:25:45,690 INFO L273 TraceCheckUtils]: 31: Hoare triple {1360#(not (= (select (select (store |#memory_$Pointer$.base| |main_~#s~0.base| (store (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset| |main_#t~ret13.base|)) |main_#t~ret13.base|) |main_#t~ret13.offset|) |main_#t~ret13.base|))} call write~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0; {1361#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-14 17:25:45,690 INFO L273 TraceCheckUtils]: 32: Hoare triple {1361#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} assume true; {1361#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-14 17:25:45,692 INFO L273 TraceCheckUtils]: 33: Hoare triple {1361#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} assume !!(~i~0 < ~len~0); {1361#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-14 17:25:45,693 INFO L256 TraceCheckUtils]: 34: Hoare triple {1361#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} call dll_circular_remove_first(~#s~0.base, ~#s~0.offset); {1362#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-14 17:25:45,696 INFO L273 TraceCheckUtils]: 35: Hoare triple {1362#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(#t~mem6.base, #t~mem6.offset + 0, 4);~temp~1.base, ~temp~1.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4); {1363#(and (= dll_circular_remove_first_~head.offset |dll_circular_remove_first_#in~head.offset|) (= dll_circular_remove_first_~head.base |dll_circular_remove_first_#in~head.base|) (= dll_circular_remove_first_~temp~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_circular_remove_first_~head.base) dll_circular_remove_first_~head.offset)) (select (select |#memory_$Pointer$.offset| dll_circular_remove_first_~head.base) dll_circular_remove_first_~head.offset))) (= (select (select |#memory_$Pointer$.base| dll_circular_remove_first_~head.base) dll_circular_remove_first_~head.offset) |dll_circular_remove_first_#t~mem8.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-14 17:25:45,697 INFO L273 TraceCheckUtils]: 36: Hoare triple {1363#(and (= dll_circular_remove_first_~head.offset |dll_circular_remove_first_#in~head.offset|) (= dll_circular_remove_first_~head.base |dll_circular_remove_first_#in~head.base|) (= dll_circular_remove_first_~temp~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_circular_remove_first_~head.base) dll_circular_remove_first_~head.offset)) (select (select |#memory_$Pointer$.offset| dll_circular_remove_first_~head.base) dll_circular_remove_first_~head.offset))) (= (select (select |#memory_$Pointer$.base| dll_circular_remove_first_~head.base) dll_circular_remove_first_~head.offset) |dll_circular_remove_first_#t~mem8.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume ~temp~1.base == #t~mem8.base && ~temp~1.offset == #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem9.base, #t~mem9.offset);havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(0, 0, ~head.base, ~head.offset, 4); {1364#(= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)))} is VALID [2018-11-14 17:25:45,698 INFO L273 TraceCheckUtils]: 37: Hoare triple {1364#(= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)))} assume true; {1364#(= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)))} is VALID [2018-11-14 17:25:45,700 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1364#(= (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)) (select (select |old(#memory_$Pointer$.offset)| |dll_circular_remove_first_#in~head.base|) |dll_circular_remove_first_#in~head.offset|)))} {1361#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} #94#return; {1346#false} is VALID [2018-11-14 17:25:45,700 INFO L273 TraceCheckUtils]: 39: Hoare triple {1346#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {1346#false} is VALID [2018-11-14 17:25:45,700 INFO L273 TraceCheckUtils]: 40: Hoare triple {1346#false} assume true; {1346#false} is VALID [2018-11-14 17:25:45,701 INFO L273 TraceCheckUtils]: 41: Hoare triple {1346#false} assume !!(~i~0 < ~len~0); {1346#false} is VALID [2018-11-14 17:25:45,701 INFO L256 TraceCheckUtils]: 42: Hoare triple {1346#false} call dll_circular_remove_first(~#s~0.base, ~#s~0.offset); {1345#true} is VALID [2018-11-14 17:25:45,701 INFO L273 TraceCheckUtils]: 43: Hoare triple {1345#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem7.base, #t~mem7.offset := read~$Pointer$(#t~mem6.base, #t~mem6.offset + 0, 4);~temp~1.base, ~temp~1.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem7.base, #t~mem7.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head.base, ~head.offset, 4); {1345#true} is VALID [2018-11-14 17:25:45,701 INFO L273 TraceCheckUtils]: 44: Hoare triple {1345#true} assume !(~temp~1.base == #t~mem8.base && ~temp~1.offset == #t~mem8.offset);havoc #t~mem8.base, #t~mem8.offset;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~head.base, ~head.offset, 4);call #t~mem11.base, #t~mem11.offset := read~$Pointer$(#t~mem10.base, #t~mem10.offset + 4, 4);~last~1.base, ~last~1.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;havoc #t~mem10.base, #t~mem10.offset;call write~$Pointer$(~last~1.base, ~last~1.offset, ~temp~1.base, ~temp~1.offset + 4, 4);call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~last~1.base, ~last~1.offset + 0, 4);call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~head.base, ~head.offset, 4);call ULTIMATE.dealloc(#t~mem12.base, #t~mem12.offset);havoc #t~mem12.base, #t~mem12.offset;call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); {1345#true} is VALID [2018-11-14 17:25:45,702 INFO L273 TraceCheckUtils]: 45: Hoare triple {1345#true} assume true; {1345#true} is VALID [2018-11-14 17:25:45,702 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {1345#true} {1346#false} #94#return; {1346#false} is VALID [2018-11-14 17:25:45,702 INFO L273 TraceCheckUtils]: 47: Hoare triple {1346#false} #t~post14 := ~i~0;~i~0 := #t~post14 + 1;havoc #t~post14; {1346#false} is VALID [2018-11-14 17:25:45,702 INFO L273 TraceCheckUtils]: 48: Hoare triple {1346#false} assume true; {1346#false} is VALID [2018-11-14 17:25:45,702 INFO L273 TraceCheckUtils]: 49: Hoare triple {1346#false} assume !(~i~0 < ~len~0); {1346#false} is VALID [2018-11-14 17:25:45,702 INFO L273 TraceCheckUtils]: 50: Hoare triple {1346#false} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {1346#false} is VALID [2018-11-14 17:25:45,702 INFO L273 TraceCheckUtils]: 51: Hoare triple {1346#false} assume 0 != #t~mem15.base || 0 != #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {1346#false} is VALID [2018-11-14 17:25:45,703 INFO L273 TraceCheckUtils]: 52: Hoare triple {1346#false} assume !false; {1346#false} is VALID [2018-11-14 17:25:45,713 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 17:25:45,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:25:45,713 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:25:45,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:25:45,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:25:45,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:25:45,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:25:45,916 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-14 17:25:45,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 17:25:45,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:25:45,932 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-14 17:25:45,935 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:25:46,551 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:25:46,553 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 25047 column 46: unknown constant v_old(#valid)_BEFORE_CALL_2 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1420) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:221) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript$DiffTransformer.checkOrAddAxiom(DiffWrapperScript.java:164) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript$DiffTransformer.convertApplicationTerm(DiffWrapperScript.java:174) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:320) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:253) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:112) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:59) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.normalforms.NnfTransformer.transform(NnfTransformer.java:150) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:87) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-14 17:25:46,558 INFO L168 Benchmark]: Toolchain (without parser) took 11280.83 ms. Allocated memory was 1.6 GB in the beginning and 2.4 GB in the end (delta: 879.8 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -834.8 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. [2018-11-14 17:25:46,559 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 17:25:46,559 INFO L168 Benchmark]: CACSL2BoogieTranslator took 716.07 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 757.6 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -819.7 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2018-11-14 17:25:46,560 INFO L168 Benchmark]: Boogie Preprocessor took 97.89 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. [2018-11-14 17:25:46,561 INFO L168 Benchmark]: RCFGBuilder took 1180.22 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 64.5 MB). Peak memory consumption was 64.5 MB. Max. memory is 7.1 GB. [2018-11-14 17:25:46,562 INFO L168 Benchmark]: TraceAbstraction took 9282.14 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 122.2 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -92.8 MB). Peak memory consumption was 29.4 MB. Max. memory is 7.1 GB. [2018-11-14 17:25:46,566 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 716.07 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 757.6 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -819.7 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 97.89 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1180.22 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 64.5 MB). Peak memory consumption was 64.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9282.14 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 122.2 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -92.8 MB). Peak memory consumption was 29.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 25047 column 46: unknown constant v_old(#valid)_BEFORE_CALL_2 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 25047 column 46: unknown constant v_old(#valid)_BEFORE_CALL_2: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1420) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...