/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/list-simple/dll2n_remove_all.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 19:04:58,098 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 19:04:58,100 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 19:04:58,113 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 19:04:58,113 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 19:04:58,114 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 19:04:58,115 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 19:04:58,117 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 19:04:58,119 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 19:04:58,120 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 19:04:58,121 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 19:04:58,122 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 19:04:58,123 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 19:04:58,124 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 19:04:58,125 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 19:04:58,127 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 19:04:58,128 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 19:04:58,131 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 19:04:58,133 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 19:04:58,136 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 19:04:58,140 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 19:04:58,142 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 19:04:58,144 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 19:04:58,145 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 19:04:58,151 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 19:04:58,151 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 19:04:58,152 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 19:04:58,153 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 19:04:58,154 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 19:04:58,155 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 19:04:58,157 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 19:04:58,158 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 19:04:58,159 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 19:04:58,160 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 19:04:58,164 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 19:04:58,164 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 19:04:58,167 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 19:04:58,167 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 19:04:58,167 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 19:04:58,168 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 19:04:58,170 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 19:04:58,171 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 19:04:58,185 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 19:04:58,185 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 19:04:58,188 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 19:04:58,188 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 19:04:58,188 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 19:04:58,188 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 19:04:58,188 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 19:04:58,189 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 19:04:58,189 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 19:04:58,189 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 19:04:58,190 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 19:04:58,190 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 19:04:58,191 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 19:04:58,191 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 19:04:58,191 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 19:04:58,191 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 19:04:58,192 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 19:04:58,192 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 19:04:58,192 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 19:04:58,192 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 19:04:58,192 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 19:04:58,193 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 19:04:58,193 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 19:04:58,478 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 19:04:58,494 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 19:04:58,497 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 19:04:58,498 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 19:04:58,499 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 19:04:58,499 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_remove_all.i [2020-07-10 19:04:58,568 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc8c28c8e/4f2296910de1489f889b131ecfa2af75/FLAG35fe29846 [2020-07-10 19:04:59,101 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 19:04:59,102 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_remove_all.i [2020-07-10 19:04:59,117 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc8c28c8e/4f2296910de1489f889b131ecfa2af75/FLAG35fe29846 [2020-07-10 19:04:59,418 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc8c28c8e/4f2296910de1489f889b131ecfa2af75 [2020-07-10 19:04:59,426 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 19:04:59,428 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 19:04:59,430 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 19:04:59,430 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 19:04:59,435 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 19:04:59,437 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 07:04:59" (1/1) ... [2020-07-10 19:04:59,440 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31b5693f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:04:59, skipping insertion in model container [2020-07-10 19:04:59,440 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 07:04:59" (1/1) ... [2020-07-10 19:04:59,448 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 19:04:59,505 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 19:04:59,968 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 19:04:59,980 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 19:05:00,029 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 19:05:00,095 INFO L208 MainTranslator]: Completed translation [2020-07-10 19:05:00,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:05:00 WrapperNode [2020-07-10 19:05:00,096 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 19:05:00,096 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 19:05:00,097 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 19:05:00,097 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 19:05:00,110 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:05:00" (1/1) ... [2020-07-10 19:05:00,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:05:00" (1/1) ... [2020-07-10 19:05:00,135 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:05:00" (1/1) ... [2020-07-10 19:05:00,135 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:05:00" (1/1) ... [2020-07-10 19:05:00,190 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:05:00" (1/1) ... [2020-07-10 19:05:00,197 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:05:00" (1/1) ... [2020-07-10 19:05:00,207 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:05:00" (1/1) ... [2020-07-10 19:05:00,220 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 19:05:00,221 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 19:05:00,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 19:05:00,221 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 19:05:00,222 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:05:00" (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 [2020-07-10 19:05:00,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 19:05:00,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 19:05:00,281 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-10 19:05:00,281 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-10 19:05:00,281 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-07-10 19:05:00,282 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2020-07-10 19:05:00,282 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2020-07-10 19:05:00,282 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_remove_first [2020-07-10 19:05:00,282 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 19:05:00,282 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 19:05:00,282 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-10 19:05:00,283 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-10 19:05:00,283 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-10 19:05:00,283 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-10 19:05:00,283 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-10 19:05:00,283 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-10 19:05:00,283 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-10 19:05:00,284 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-10 19:05:00,284 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-10 19:05:00,284 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-10 19:05:00,284 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-10 19:05:00,284 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-10 19:05:00,285 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-10 19:05:00,285 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-10 19:05:00,285 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-10 19:05:00,285 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-10 19:05:00,285 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-10 19:05:00,285 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-10 19:05:00,286 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-10 19:05:00,286 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-10 19:05:00,286 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-10 19:05:00,286 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-10 19:05:00,288 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-10 19:05:00,289 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-10 19:05:00,289 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-10 19:05:00,289 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-10 19:05:00,289 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-10 19:05:00,289 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-10 19:05:00,290 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-10 19:05:00,290 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-10 19:05:00,290 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-10 19:05:00,290 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-10 19:05:00,290 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-10 19:05:00,290 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-10 19:05:00,290 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-10 19:05:00,291 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-10 19:05:00,291 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-10 19:05:00,291 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-10 19:05:00,291 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-10 19:05:00,291 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-10 19:05:00,291 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-10 19:05:00,291 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-10 19:05:00,292 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-10 19:05:00,292 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-10 19:05:00,292 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-10 19:05:00,292 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-10 19:05:00,293 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-10 19:05:00,293 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-10 19:05:00,293 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-10 19:05:00,293 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-10 19:05:00,293 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-10 19:05:00,293 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-10 19:05:00,293 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 19:05:00,294 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-10 19:05:00,294 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-10 19:05:00,294 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-10 19:05:00,294 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-10 19:05:00,294 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-10 19:05:00,294 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-10 19:05:00,294 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-10 19:05:00,295 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-10 19:05:00,295 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 19:05:00,295 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-10 19:05:00,295 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-10 19:05:00,296 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-10 19:05:00,296 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-10 19:05:00,296 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-10 19:05:00,297 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-10 19:05:00,297 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-10 19:05:00,297 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-10 19:05:00,298 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-10 19:05:00,298 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-10 19:05:00,299 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-10 19:05:00,299 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-10 19:05:00,299 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-10 19:05:00,299 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-10 19:05:00,300 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-10 19:05:00,300 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-10 19:05:00,301 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-10 19:05:00,301 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-10 19:05:00,301 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-10 19:05:00,301 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-10 19:05:00,301 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-10 19:05:00,301 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-10 19:05:00,301 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-10 19:05:00,302 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-10 19:05:00,302 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-10 19:05:00,302 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-10 19:05:00,302 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-10 19:05:00,303 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-10 19:05:00,303 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-10 19:05:00,303 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-10 19:05:00,303 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-10 19:05:00,303 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-10 19:05:00,304 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-10 19:05:00,304 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-10 19:05:00,304 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-10 19:05:00,304 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-10 19:05:00,304 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-10 19:05:00,304 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-10 19:05:00,304 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-10 19:05:00,305 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-10 19:05:00,305 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-10 19:05:00,305 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-10 19:05:00,305 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-10 19:05:00,305 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-07-10 19:05:00,305 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2020-07-10 19:05:00,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 19:05:00,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-10 19:05:00,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 19:05:00,306 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2020-07-10 19:05:00,306 INFO L130 BoogieDeclarations]: Found specification of procedure dll_remove_first [2020-07-10 19:05:00,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-10 19:05:00,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 19:05:00,308 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 19:05:00,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 19:05:00,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-07-10 19:05:00,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 19:05:00,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 19:05:00,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 19:05:00,664 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-07-10 19:05:01,072 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 19:05:01,072 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-10 19:05:01,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 07:05:01 BoogieIcfgContainer [2020-07-10 19:05:01,078 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 19:05:01,083 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 19:05:01,083 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 19:05:01,087 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 19:05:01,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 07:04:59" (1/3) ... [2020-07-10 19:05:01,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65a4112c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 07:05:01, skipping insertion in model container [2020-07-10 19:05:01,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:05:00" (2/3) ... [2020-07-10 19:05:01,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65a4112c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 07:05:01, skipping insertion in model container [2020-07-10 19:05:01,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 07:05:01" (3/3) ... [2020-07-10 19:05:01,091 INFO L109 eAbstractionObserver]: Analyzing ICFG dll2n_remove_all.i [2020-07-10 19:05:01,103 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 19:05:01,114 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 19:05:01,128 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 19:05:01,146 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 19:05:01,147 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 19:05:01,147 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 19:05:01,147 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 19:05:01,147 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 19:05:01,148 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 19:05:01,148 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 19:05:01,148 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 19:05:01,161 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states. [2020-07-10 19:05:01,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 19:05:01,172 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:05:01,173 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 19:05:01,173 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:05:01,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:05:01,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1728925643, now seen corresponding path program 1 times [2020-07-10 19:05:01,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:05:01,187 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [328698429] [2020-07-10 19:05:01,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:05:01,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:05:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:05:01,434 INFO L280 TraceCheckUtils]: 0: Hoare triple {89#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {75#true} is VALID [2020-07-10 19:05:01,434 INFO L280 TraceCheckUtils]: 1: Hoare triple {75#true} #valid := #valid[0 := 0]; {75#true} is VALID [2020-07-10 19:05:01,435 INFO L280 TraceCheckUtils]: 2: Hoare triple {75#true} assume 0 < #StackHeapBarrier; {75#true} is VALID [2020-07-10 19:05:01,435 INFO L280 TraceCheckUtils]: 3: Hoare triple {75#true} assume true; {75#true} is VALID [2020-07-10 19:05:01,436 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {75#true} {75#true} #143#return; {75#true} is VALID [2020-07-10 19:05:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:05:01,474 INFO L280 TraceCheckUtils]: 0: Hoare triple {90#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {75#true} is VALID [2020-07-10 19:05:01,474 INFO L280 TraceCheckUtils]: 1: Hoare triple {75#true} ~data := #in~data; {75#true} is VALID [2020-07-10 19:05:01,475 INFO L280 TraceCheckUtils]: 2: Hoare triple {75#true} ~head~0.base, ~head~0.offset := 0, 0; {75#true} is VALID [2020-07-10 19:05:01,475 INFO L280 TraceCheckUtils]: 3: Hoare triple {75#true} assume !(~len > 0); {75#true} is VALID [2020-07-10 19:05:01,475 INFO L280 TraceCheckUtils]: 4: Hoare triple {75#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {75#true} is VALID [2020-07-10 19:05:01,476 INFO L280 TraceCheckUtils]: 5: Hoare triple {75#true} assume true; {75#true} is VALID [2020-07-10 19:05:01,476 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {75#true} {75#true} #137#return; {75#true} is VALID [2020-07-10 19:05:01,478 INFO L263 TraceCheckUtils]: 0: Hoare triple {75#true} call ULTIMATE.init(); {89#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:05:01,479 INFO L280 TraceCheckUtils]: 1: Hoare triple {89#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {75#true} is VALID [2020-07-10 19:05:01,479 INFO L280 TraceCheckUtils]: 2: Hoare triple {75#true} #valid := #valid[0 := 0]; {75#true} is VALID [2020-07-10 19:05:01,479 INFO L280 TraceCheckUtils]: 3: Hoare triple {75#true} assume 0 < #StackHeapBarrier; {75#true} is VALID [2020-07-10 19:05:01,480 INFO L280 TraceCheckUtils]: 4: Hoare triple {75#true} assume true; {75#true} is VALID [2020-07-10 19:05:01,480 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {75#true} {75#true} #143#return; {75#true} is VALID [2020-07-10 19:05:01,481 INFO L263 TraceCheckUtils]: 6: Hoare triple {75#true} call #t~ret11 := main(); {75#true} is VALID [2020-07-10 19:05:01,481 INFO L280 TraceCheckUtils]: 7: Hoare triple {75#true} ~len~0 := 2; {75#true} is VALID [2020-07-10 19:05:01,481 INFO L280 TraceCheckUtils]: 8: Hoare triple {75#true} ~data~0 := 1; {75#true} is VALID [2020-07-10 19:05:01,482 INFO L280 TraceCheckUtils]: 9: Hoare triple {75#true} SUMMARY for call ~#s~0.base, ~#s~0.offset := #Ultimate.allocOnStack(4); srcloc: L603 {75#true} is VALID [2020-07-10 19:05:01,484 INFO L263 TraceCheckUtils]: 10: Hoare triple {75#true} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {90#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-10 19:05:01,485 INFO L280 TraceCheckUtils]: 11: Hoare triple {90#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {75#true} is VALID [2020-07-10 19:05:01,485 INFO L280 TraceCheckUtils]: 12: Hoare triple {75#true} ~data := #in~data; {75#true} is VALID [2020-07-10 19:05:01,485 INFO L280 TraceCheckUtils]: 13: Hoare triple {75#true} ~head~0.base, ~head~0.offset := 0, 0; {75#true} is VALID [2020-07-10 19:05:01,486 INFO L280 TraceCheckUtils]: 14: Hoare triple {75#true} assume !(~len > 0); {75#true} is VALID [2020-07-10 19:05:01,486 INFO L280 TraceCheckUtils]: 15: Hoare triple {75#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {75#true} is VALID [2020-07-10 19:05:01,486 INFO L280 TraceCheckUtils]: 16: Hoare triple {75#true} assume true; {75#true} is VALID [2020-07-10 19:05:01,487 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {75#true} {75#true} #137#return; {75#true} is VALID [2020-07-10 19:05:01,487 INFO L280 TraceCheckUtils]: 18: Hoare triple {75#true} SUMMARY for call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4); srcloc: L603-2 {75#true} is VALID [2020-07-10 19:05:01,487 INFO L280 TraceCheckUtils]: 19: Hoare triple {75#true} havoc #t~ret8.base, #t~ret8.offset; {75#true} is VALID [2020-07-10 19:05:01,488 INFO L280 TraceCheckUtils]: 20: Hoare triple {75#true} havoc ~i~0; {75#true} is VALID [2020-07-10 19:05:01,488 INFO L280 TraceCheckUtils]: 21: Hoare triple {75#true} ~i~0 := ~len~0 - 1; {75#true} is VALID [2020-07-10 19:05:01,489 INFO L280 TraceCheckUtils]: 22: Hoare triple {75#true} assume !true; {76#false} is VALID [2020-07-10 19:05:01,490 INFO L280 TraceCheckUtils]: 23: Hoare triple {76#false} SUMMARY for call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); srcloc: L605-6 {76#false} is VALID [2020-07-10 19:05:01,490 INFO L280 TraceCheckUtils]: 24: Hoare triple {76#false} assume 0 != #t~mem10.base || 0 != #t~mem10.offset; {76#false} is VALID [2020-07-10 19:05:01,490 INFO L280 TraceCheckUtils]: 25: Hoare triple {76#false} havoc #t~mem10.base, #t~mem10.offset; {76#false} is VALID [2020-07-10 19:05:01,491 INFO L280 TraceCheckUtils]: 26: Hoare triple {76#false} assume !false; {76#false} is VALID [2020-07-10 19:05:01,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:05:01,496 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:05:01,498 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [328698429] [2020-07-10 19:05:01,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:05:01,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 19:05:01,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837936272] [2020-07-10 19:05:01,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-07-10 19:05:01,511 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:05:01,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 19:05:01,563 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:05:01,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 19:05:01,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:05:01,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 19:05:01,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 19:05:01,576 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 4 states. [2020-07-10 19:05:02,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:05:02,135 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2020-07-10 19:05:02,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 19:05:02,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-07-10 19:05:02,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:05:02,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 19:05:02,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2020-07-10 19:05:02,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 19:05:02,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2020-07-10 19:05:02,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 130 transitions. [2020-07-10 19:05:02,392 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:05:02,406 INFO L225 Difference]: With dead ends: 118 [2020-07-10 19:05:02,406 INFO L226 Difference]: Without dead ends: 65 [2020-07-10 19:05:02,413 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-10 19:05:02,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-07-10 19:05:02,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2020-07-10 19:05:02,521 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:05:02,522 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 58 states. [2020-07-10 19:05:02,523 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 58 states. [2020-07-10 19:05:02,523 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 58 states. [2020-07-10 19:05:02,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:05:02,530 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2020-07-10 19:05:02,530 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2020-07-10 19:05:02,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:05:02,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:05:02,531 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 65 states. [2020-07-10 19:05:02,531 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 65 states. [2020-07-10 19:05:02,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:05:02,537 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2020-07-10 19:05:02,538 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2020-07-10 19:05:02,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:05:02,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:05:02,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:05:02,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:05:02,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-07-10 19:05:02,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2020-07-10 19:05:02,545 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 27 [2020-07-10 19:05:02,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:05:02,546 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2020-07-10 19:05:02,546 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 19:05:02,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 58 states and 61 transitions. [2020-07-10 19:05:02,634 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:05:02,634 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2020-07-10 19:05:02,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 19:05:02,635 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:05:02,636 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 19:05:02,636 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 19:05:02,636 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:05:02,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:05:02,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1737237332, now seen corresponding path program 1 times [2020-07-10 19:05:02,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:05:02,637 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [624397811] [2020-07-10 19:05:02,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:05:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:05:02,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:05:02,741 INFO L280 TraceCheckUtils]: 0: Hoare triple {594#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {578#true} is VALID [2020-07-10 19:05:02,742 INFO L280 TraceCheckUtils]: 1: Hoare triple {578#true} #valid := #valid[0 := 0]; {578#true} is VALID [2020-07-10 19:05:02,742 INFO L280 TraceCheckUtils]: 2: Hoare triple {578#true} assume 0 < #StackHeapBarrier; {578#true} is VALID [2020-07-10 19:05:02,742 INFO L280 TraceCheckUtils]: 3: Hoare triple {578#true} assume true; {578#true} is VALID [2020-07-10 19:05:02,743 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {578#true} {578#true} #143#return; {578#true} is VALID [2020-07-10 19:05:02,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:05:02,775 INFO L280 TraceCheckUtils]: 0: Hoare triple {595#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {578#true} is VALID [2020-07-10 19:05:02,775 INFO L280 TraceCheckUtils]: 1: Hoare triple {578#true} ~data := #in~data; {578#true} is VALID [2020-07-10 19:05:02,776 INFO L280 TraceCheckUtils]: 2: Hoare triple {578#true} ~head~0.base, ~head~0.offset := 0, 0; {578#true} is VALID [2020-07-10 19:05:02,776 INFO L280 TraceCheckUtils]: 3: Hoare triple {578#true} assume !(~len > 0); {578#true} is VALID [2020-07-10 19:05:02,776 INFO L280 TraceCheckUtils]: 4: Hoare triple {578#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {578#true} is VALID [2020-07-10 19:05:02,777 INFO L280 TraceCheckUtils]: 5: Hoare triple {578#true} assume true; {578#true} is VALID [2020-07-10 19:05:02,778 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {578#true} {585#(<= 2 main_~len~0)} #137#return; {585#(<= 2 main_~len~0)} is VALID [2020-07-10 19:05:02,779 INFO L263 TraceCheckUtils]: 0: Hoare triple {578#true} call ULTIMATE.init(); {594#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:05:02,780 INFO L280 TraceCheckUtils]: 1: Hoare triple {594#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {578#true} is VALID [2020-07-10 19:05:02,780 INFO L280 TraceCheckUtils]: 2: Hoare triple {578#true} #valid := #valid[0 := 0]; {578#true} is VALID [2020-07-10 19:05:02,781 INFO L280 TraceCheckUtils]: 3: Hoare triple {578#true} assume 0 < #StackHeapBarrier; {578#true} is VALID [2020-07-10 19:05:02,781 INFO L280 TraceCheckUtils]: 4: Hoare triple {578#true} assume true; {578#true} is VALID [2020-07-10 19:05:02,781 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {578#true} {578#true} #143#return; {578#true} is VALID [2020-07-10 19:05:02,781 INFO L263 TraceCheckUtils]: 6: Hoare triple {578#true} call #t~ret11 := main(); {578#true} is VALID [2020-07-10 19:05:02,782 INFO L280 TraceCheckUtils]: 7: Hoare triple {578#true} ~len~0 := 2; {585#(<= 2 main_~len~0)} is VALID [2020-07-10 19:05:02,783 INFO L280 TraceCheckUtils]: 8: Hoare triple {585#(<= 2 main_~len~0)} ~data~0 := 1; {585#(<= 2 main_~len~0)} is VALID [2020-07-10 19:05:02,784 INFO L280 TraceCheckUtils]: 9: Hoare triple {585#(<= 2 main_~len~0)} SUMMARY for call ~#s~0.base, ~#s~0.offset := #Ultimate.allocOnStack(4); srcloc: L603 {585#(<= 2 main_~len~0)} is VALID [2020-07-10 19:05:02,786 INFO L263 TraceCheckUtils]: 10: Hoare triple {585#(<= 2 main_~len~0)} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {595#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-10 19:05:02,786 INFO L280 TraceCheckUtils]: 11: Hoare triple {595#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {578#true} is VALID [2020-07-10 19:05:02,786 INFO L280 TraceCheckUtils]: 12: Hoare triple {578#true} ~data := #in~data; {578#true} is VALID [2020-07-10 19:05:02,787 INFO L280 TraceCheckUtils]: 13: Hoare triple {578#true} ~head~0.base, ~head~0.offset := 0, 0; {578#true} is VALID [2020-07-10 19:05:02,787 INFO L280 TraceCheckUtils]: 14: Hoare triple {578#true} assume !(~len > 0); {578#true} is VALID [2020-07-10 19:05:02,787 INFO L280 TraceCheckUtils]: 15: Hoare triple {578#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {578#true} is VALID [2020-07-10 19:05:02,788 INFO L280 TraceCheckUtils]: 16: Hoare triple {578#true} assume true; {578#true} is VALID [2020-07-10 19:05:02,789 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {578#true} {585#(<= 2 main_~len~0)} #137#return; {585#(<= 2 main_~len~0)} is VALID [2020-07-10 19:05:02,790 INFO L280 TraceCheckUtils]: 18: Hoare triple {585#(<= 2 main_~len~0)} SUMMARY for call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4); srcloc: L603-2 {585#(<= 2 main_~len~0)} is VALID [2020-07-10 19:05:02,791 INFO L280 TraceCheckUtils]: 19: Hoare triple {585#(<= 2 main_~len~0)} havoc #t~ret8.base, #t~ret8.offset; {585#(<= 2 main_~len~0)} is VALID [2020-07-10 19:05:02,791 INFO L280 TraceCheckUtils]: 20: Hoare triple {585#(<= 2 main_~len~0)} havoc ~i~0; {585#(<= 2 main_~len~0)} is VALID [2020-07-10 19:05:02,792 INFO L280 TraceCheckUtils]: 21: Hoare triple {585#(<= 2 main_~len~0)} ~i~0 := ~len~0 - 1; {593#(<= 1 main_~i~0)} is VALID [2020-07-10 19:05:02,793 INFO L280 TraceCheckUtils]: 22: Hoare triple {593#(<= 1 main_~i~0)} assume !(~i~0 >= 0); {579#false} is VALID [2020-07-10 19:05:02,794 INFO L280 TraceCheckUtils]: 23: Hoare triple {579#false} SUMMARY for call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); srcloc: L605-6 {579#false} is VALID [2020-07-10 19:05:02,794 INFO L280 TraceCheckUtils]: 24: Hoare triple {579#false} assume 0 != #t~mem10.base || 0 != #t~mem10.offset; {579#false} is VALID [2020-07-10 19:05:02,794 INFO L280 TraceCheckUtils]: 25: Hoare triple {579#false} havoc #t~mem10.base, #t~mem10.offset; {579#false} is VALID [2020-07-10 19:05:02,794 INFO L280 TraceCheckUtils]: 26: Hoare triple {579#false} assume !false; {579#false} is VALID [2020-07-10 19:05:02,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:05:02,797 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:05:02,797 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [624397811] [2020-07-10 19:05:02,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:05:02,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 19:05:02,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626549049] [2020-07-10 19:05:02,799 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-10 19:05:02,799 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:05:02,799 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 19:05:02,832 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:05:02,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 19:05:02,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:05:02,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 19:05:02,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 19:05:02,834 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 6 states. [2020-07-10 19:05:03,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:05:03,548 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2020-07-10 19:05:03,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 19:05:03,549 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-10 19:05:03,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:05:03,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 19:05:03,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2020-07-10 19:05:03,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 19:05:03,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2020-07-10 19:05:03,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 79 transitions. [2020-07-10 19:05:03,675 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:05:03,681 INFO L225 Difference]: With dead ends: 74 [2020-07-10 19:05:03,681 INFO L226 Difference]: Without dead ends: 69 [2020-07-10 19:05:03,684 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-10 19:05:03,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-07-10 19:05:03,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 59. [2020-07-10 19:05:03,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:05:03,772 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 59 states. [2020-07-10 19:05:03,772 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 59 states. [2020-07-10 19:05:03,772 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 59 states. [2020-07-10 19:05:03,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:05:03,780 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2020-07-10 19:05:03,780 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2020-07-10 19:05:03,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:05:03,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:05:03,781 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 69 states. [2020-07-10 19:05:03,781 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 69 states. [2020-07-10 19:05:03,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:05:03,786 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2020-07-10 19:05:03,787 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2020-07-10 19:05:03,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:05:03,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:05:03,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:05:03,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:05:03,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-10 19:05:03,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2020-07-10 19:05:03,792 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 27 [2020-07-10 19:05:03,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:05:03,792 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2020-07-10 19:05:03,792 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 19:05:03,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 59 states and 62 transitions. [2020-07-10 19:05:03,872 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:05:03,872 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2020-07-10 19:05:03,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-07-10 19:05:03,874 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:05:03,874 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 19:05:03,874 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 19:05:03,875 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:05:03,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:05:03,875 INFO L82 PathProgramCache]: Analyzing trace with hash 278069346, now seen corresponding path program 1 times [2020-07-10 19:05:03,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:05:03,876 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1382274278] [2020-07-10 19:05:03,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:05:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:05:04,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:05:04,072 INFO L280 TraceCheckUtils]: 0: Hoare triple {1037#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1009#true} is VALID [2020-07-10 19:05:04,072 INFO L280 TraceCheckUtils]: 1: Hoare triple {1009#true} #valid := #valid[0 := 0]; {1009#true} is VALID [2020-07-10 19:05:04,073 INFO L280 TraceCheckUtils]: 2: Hoare triple {1009#true} assume 0 < #StackHeapBarrier; {1009#true} is VALID [2020-07-10 19:05:04,073 INFO L280 TraceCheckUtils]: 3: Hoare triple {1009#true} assume true; {1009#true} is VALID [2020-07-10 19:05:04,074 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1009#true} {1009#true} #143#return; {1009#true} is VALID [2020-07-10 19:05:04,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:05:04,140 INFO L280 TraceCheckUtils]: 0: Hoare triple {1038#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {1039#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-10 19:05:04,141 INFO L280 TraceCheckUtils]: 1: Hoare triple {1039#(= dll_create_~len |dll_create_#in~len|)} ~data := #in~data; {1039#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-10 19:05:04,143 INFO L280 TraceCheckUtils]: 2: Hoare triple {1039#(= dll_create_~len |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := 0, 0; {1039#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-10 19:05:04,146 INFO L280 TraceCheckUtils]: 3: Hoare triple {1039#(= dll_create_~len |dll_create_#in~len|)} assume !(~len > 0); {1040#(<= |dll_create_#in~len| 0)} is VALID [2020-07-10 19:05:04,147 INFO L280 TraceCheckUtils]: 4: Hoare triple {1040#(<= |dll_create_#in~len| 0)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1040#(<= |dll_create_#in~len| 0)} is VALID [2020-07-10 19:05:04,147 INFO L280 TraceCheckUtils]: 5: Hoare triple {1040#(<= |dll_create_#in~len| 0)} assume true; {1040#(<= |dll_create_#in~len| 0)} is VALID [2020-07-10 19:05:04,149 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1040#(<= |dll_create_#in~len| 0)} {1016#(<= 2 main_~len~0)} #137#return; {1010#false} is VALID [2020-07-10 19:05:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:05:04,181 INFO L280 TraceCheckUtils]: 0: Hoare triple {1041#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {1009#true} is VALID [2020-07-10 19:05:04,181 INFO L280 TraceCheckUtils]: 1: Hoare triple {1009#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); srcloc: L593 {1009#true} is VALID [2020-07-10 19:05:04,182 INFO L280 TraceCheckUtils]: 2: Hoare triple {1009#true} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4); srcloc: L593-1 {1009#true} is VALID [2020-07-10 19:05:04,182 INFO L280 TraceCheckUtils]: 3: Hoare triple {1009#true} ~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset; {1009#true} is VALID [2020-07-10 19:05:04,182 INFO L280 TraceCheckUtils]: 4: Hoare triple {1009#true} havoc #t~mem5.base, #t~mem5.offset; {1009#true} is VALID [2020-07-10 19:05:04,183 INFO L280 TraceCheckUtils]: 5: Hoare triple {1009#true} havoc #t~mem6.base, #t~mem6.offset; {1009#true} is VALID [2020-07-10 19:05:04,183 INFO L280 TraceCheckUtils]: 6: Hoare triple {1009#true} assume !(~temp~1.base != 0 || ~temp~1.offset != 0); {1009#true} is VALID [2020-07-10 19:05:04,183 INFO L280 TraceCheckUtils]: 7: Hoare triple {1009#true} SUMMARY for call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4); srcloc: L594-1 {1009#true} is VALID [2020-07-10 19:05:04,184 INFO L280 TraceCheckUtils]: 8: Hoare triple {1009#true} SUMMARY for call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset); srcloc: L597 {1009#true} is VALID [2020-07-10 19:05:04,184 INFO L280 TraceCheckUtils]: 9: Hoare triple {1009#true} havoc #t~mem7.base, #t~mem7.offset; {1009#true} is VALID [2020-07-10 19:05:04,184 INFO L280 TraceCheckUtils]: 10: Hoare triple {1009#true} SUMMARY for call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); srcloc: L598 {1009#true} is VALID [2020-07-10 19:05:04,184 INFO L280 TraceCheckUtils]: 11: Hoare triple {1009#true} assume true; {1009#true} is VALID [2020-07-10 19:05:04,185 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1009#true} {1010#false} #139#return; {1010#false} is VALID [2020-07-10 19:05:04,186 INFO L263 TraceCheckUtils]: 0: Hoare triple {1009#true} call ULTIMATE.init(); {1037#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:05:04,187 INFO L280 TraceCheckUtils]: 1: Hoare triple {1037#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1009#true} is VALID [2020-07-10 19:05:04,187 INFO L280 TraceCheckUtils]: 2: Hoare triple {1009#true} #valid := #valid[0 := 0]; {1009#true} is VALID [2020-07-10 19:05:04,187 INFO L280 TraceCheckUtils]: 3: Hoare triple {1009#true} assume 0 < #StackHeapBarrier; {1009#true} is VALID [2020-07-10 19:05:04,188 INFO L280 TraceCheckUtils]: 4: Hoare triple {1009#true} assume true; {1009#true} is VALID [2020-07-10 19:05:04,188 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1009#true} {1009#true} #143#return; {1009#true} is VALID [2020-07-10 19:05:04,188 INFO L263 TraceCheckUtils]: 6: Hoare triple {1009#true} call #t~ret11 := main(); {1009#true} is VALID [2020-07-10 19:05:04,189 INFO L280 TraceCheckUtils]: 7: Hoare triple {1009#true} ~len~0 := 2; {1016#(<= 2 main_~len~0)} is VALID [2020-07-10 19:05:04,190 INFO L280 TraceCheckUtils]: 8: Hoare triple {1016#(<= 2 main_~len~0)} ~data~0 := 1; {1016#(<= 2 main_~len~0)} is VALID [2020-07-10 19:05:04,190 INFO L280 TraceCheckUtils]: 9: Hoare triple {1016#(<= 2 main_~len~0)} SUMMARY for call ~#s~0.base, ~#s~0.offset := #Ultimate.allocOnStack(4); srcloc: L603 {1016#(<= 2 main_~len~0)} is VALID [2020-07-10 19:05:04,192 INFO L263 TraceCheckUtils]: 10: Hoare triple {1016#(<= 2 main_~len~0)} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {1038#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-10 19:05:04,193 INFO L280 TraceCheckUtils]: 11: Hoare triple {1038#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {1039#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-10 19:05:04,193 INFO L280 TraceCheckUtils]: 12: Hoare triple {1039#(= dll_create_~len |dll_create_#in~len|)} ~data := #in~data; {1039#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-10 19:05:04,194 INFO L280 TraceCheckUtils]: 13: Hoare triple {1039#(= dll_create_~len |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := 0, 0; {1039#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-10 19:05:04,195 INFO L280 TraceCheckUtils]: 14: Hoare triple {1039#(= dll_create_~len |dll_create_#in~len|)} assume !(~len > 0); {1040#(<= |dll_create_#in~len| 0)} is VALID [2020-07-10 19:05:04,196 INFO L280 TraceCheckUtils]: 15: Hoare triple {1040#(<= |dll_create_#in~len| 0)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1040#(<= |dll_create_#in~len| 0)} is VALID [2020-07-10 19:05:04,196 INFO L280 TraceCheckUtils]: 16: Hoare triple {1040#(<= |dll_create_#in~len| 0)} assume true; {1040#(<= |dll_create_#in~len| 0)} is VALID [2020-07-10 19:05:04,198 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1040#(<= |dll_create_#in~len| 0)} {1016#(<= 2 main_~len~0)} #137#return; {1010#false} is VALID [2020-07-10 19:05:04,198 INFO L280 TraceCheckUtils]: 18: Hoare triple {1010#false} SUMMARY for call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4); srcloc: L603-2 {1010#false} is VALID [2020-07-10 19:05:04,199 INFO L280 TraceCheckUtils]: 19: Hoare triple {1010#false} havoc #t~ret8.base, #t~ret8.offset; {1010#false} is VALID [2020-07-10 19:05:04,199 INFO L280 TraceCheckUtils]: 20: Hoare triple {1010#false} havoc ~i~0; {1010#false} is VALID [2020-07-10 19:05:04,199 INFO L280 TraceCheckUtils]: 21: Hoare triple {1010#false} ~i~0 := ~len~0 - 1; {1010#false} is VALID [2020-07-10 19:05:04,199 INFO L280 TraceCheckUtils]: 22: Hoare triple {1010#false} assume !!(~i~0 >= 0); {1010#false} is VALID [2020-07-10 19:05:04,200 INFO L263 TraceCheckUtils]: 23: Hoare triple {1010#false} call dll_remove_first(~#s~0.base, ~#s~0.offset); {1041#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-10 19:05:04,200 INFO L280 TraceCheckUtils]: 24: Hoare triple {1041#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {1009#true} is VALID [2020-07-10 19:05:04,200 INFO L280 TraceCheckUtils]: 25: Hoare triple {1009#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); srcloc: L593 {1009#true} is VALID [2020-07-10 19:05:04,201 INFO L280 TraceCheckUtils]: 26: Hoare triple {1009#true} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(#t~mem5.base, 4 + #t~mem5.offset, 4); srcloc: L593-1 {1009#true} is VALID [2020-07-10 19:05:04,201 INFO L280 TraceCheckUtils]: 27: Hoare triple {1009#true} ~temp~1.base, ~temp~1.offset := #t~mem6.base, #t~mem6.offset; {1009#true} is VALID [2020-07-10 19:05:04,201 INFO L280 TraceCheckUtils]: 28: Hoare triple {1009#true} havoc #t~mem5.base, #t~mem5.offset; {1009#true} is VALID [2020-07-10 19:05:04,201 INFO L280 TraceCheckUtils]: 29: Hoare triple {1009#true} havoc #t~mem6.base, #t~mem6.offset; {1009#true} is VALID [2020-07-10 19:05:04,202 INFO L280 TraceCheckUtils]: 30: Hoare triple {1009#true} assume !(~temp~1.base != 0 || ~temp~1.offset != 0); {1009#true} is VALID [2020-07-10 19:05:04,202 INFO L280 TraceCheckUtils]: 31: Hoare triple {1009#true} SUMMARY for call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4); srcloc: L594-1 {1009#true} is VALID [2020-07-10 19:05:04,202 INFO L280 TraceCheckUtils]: 32: Hoare triple {1009#true} SUMMARY for call ULTIMATE.dealloc(#t~mem7.base, #t~mem7.offset); srcloc: L597 {1009#true} is VALID [2020-07-10 19:05:04,203 INFO L280 TraceCheckUtils]: 33: Hoare triple {1009#true} havoc #t~mem7.base, #t~mem7.offset; {1009#true} is VALID [2020-07-10 19:05:04,203 INFO L280 TraceCheckUtils]: 34: Hoare triple {1009#true} SUMMARY for call write~$Pointer$(~temp~1.base, ~temp~1.offset, ~head.base, ~head.offset, 4); srcloc: L598 {1009#true} is VALID [2020-07-10 19:05:04,203 INFO L280 TraceCheckUtils]: 35: Hoare triple {1009#true} assume true; {1009#true} is VALID [2020-07-10 19:05:04,203 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1009#true} {1010#false} #139#return; {1010#false} is VALID [2020-07-10 19:05:04,204 INFO L280 TraceCheckUtils]: 37: Hoare triple {1010#false} #t~post9 := ~i~0; {1010#false} is VALID [2020-07-10 19:05:04,204 INFO L280 TraceCheckUtils]: 38: Hoare triple {1010#false} ~i~0 := #t~post9 - 1; {1010#false} is VALID [2020-07-10 19:05:04,204 INFO L280 TraceCheckUtils]: 39: Hoare triple {1010#false} havoc #t~post9; {1010#false} is VALID [2020-07-10 19:05:04,204 INFO L280 TraceCheckUtils]: 40: Hoare triple {1010#false} assume !(~i~0 >= 0); {1010#false} is VALID [2020-07-10 19:05:04,205 INFO L280 TraceCheckUtils]: 41: Hoare triple {1010#false} SUMMARY for call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); srcloc: L605-6 {1010#false} is VALID [2020-07-10 19:05:04,205 INFO L280 TraceCheckUtils]: 42: Hoare triple {1010#false} assume 0 != #t~mem10.base || 0 != #t~mem10.offset; {1010#false} is VALID [2020-07-10 19:05:04,205 INFO L280 TraceCheckUtils]: 43: Hoare triple {1010#false} havoc #t~mem10.base, #t~mem10.offset; {1010#false} is VALID [2020-07-10 19:05:04,206 INFO L280 TraceCheckUtils]: 44: Hoare triple {1010#false} assume !false; {1010#false} is VALID [2020-07-10 19:05:04,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:05:04,209 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:05:04,209 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1382274278] [2020-07-10 19:05:04,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:05:04,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-10 19:05:04,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777697763] [2020-07-10 19:05:04,210 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-07-10 19:05:04,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:05:04,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 19:05:04,260 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:05:04,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 19:05:04,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:05:04,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 19:05:04,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-10 19:05:04,261 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 8 states. [2020-07-10 19:05:05,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:05:05,060 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2020-07-10 19:05:05,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 19:05:05,060 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-07-10 19:05:05,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:05:05,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 19:05:05,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2020-07-10 19:05:05,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 19:05:05,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2020-07-10 19:05:05,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 109 transitions. [2020-07-10 19:05:05,216 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:05:05,219 INFO L225 Difference]: With dead ends: 105 [2020-07-10 19:05:05,220 INFO L226 Difference]: Without dead ends: 73 [2020-07-10 19:05:05,221 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-07-10 19:05:05,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-07-10 19:05:05,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 60. [2020-07-10 19:05:05,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:05:05,317 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 60 states. [2020-07-10 19:05:05,317 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 60 states. [2020-07-10 19:05:05,317 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 60 states. [2020-07-10 19:05:05,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:05:05,321 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2020-07-10 19:05:05,321 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2020-07-10 19:05:05,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:05:05,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:05:05,322 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 73 states. [2020-07-10 19:05:05,323 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 73 states. [2020-07-10 19:05:05,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:05:05,327 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2020-07-10 19:05:05,327 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2020-07-10 19:05:05,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:05:05,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:05:05,331 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:05:05,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:05:05,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-07-10 19:05:05,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2020-07-10 19:05:05,335 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 45 [2020-07-10 19:05:05,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:05:05,336 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2020-07-10 19:05:05,336 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 19:05:05,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 60 states and 63 transitions. [2020-07-10 19:05:05,436 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:05:05,437 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2020-07-10 19:05:05,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-07-10 19:05:05,439 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:05:05,439 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 19:05:05,440 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 19:05:05,440 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:05:05,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:05:05,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1675692718, now seen corresponding path program 1 times [2020-07-10 19:05:05,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:05:05,441 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [911587322] [2020-07-10 19:05:05,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:05:05,492 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 19:05:05,493 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:277) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:317) 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) [2020-07-10 19:05:05,500 INFO L168 Benchmark]: Toolchain (without parser) took 6070.39 ms. Allocated memory was 136.8 MB in the beginning and 295.7 MB in the end (delta: 158.9 MB). Free memory was 100.3 MB in the beginning and 263.5 MB in the end (delta: -163.2 MB). Peak memory consumption was 172.1 MB. Max. memory is 7.1 GB. [2020-07-10 19:05:05,501 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 136.8 MB. Free memory is still 119.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 19:05:05,502 INFO L168 Benchmark]: CACSL2BoogieTranslator took 666.21 ms. Allocated memory was 136.8 MB in the beginning and 201.9 MB in the end (delta: 65.0 MB). Free memory was 99.9 MB in the beginning and 166.8 MB in the end (delta: -66.8 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. [2020-07-10 19:05:05,506 INFO L168 Benchmark]: Boogie Preprocessor took 124.25 ms. Allocated memory is still 201.9 MB. Free memory was 166.8 MB in the beginning and 162.9 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. [2020-07-10 19:05:05,512 INFO L168 Benchmark]: RCFGBuilder took 857.34 ms. Allocated memory is still 201.9 MB. Free memory was 162.9 MB in the beginning and 98.2 MB in the end (delta: 64.7 MB). Peak memory consumption was 64.7 MB. Max. memory is 7.1 GB. [2020-07-10 19:05:05,515 INFO L168 Benchmark]: TraceAbstraction took 4413.30 ms. Allocated memory was 201.9 MB in the beginning and 295.7 MB in the end (delta: 93.8 MB). Free memory was 97.2 MB in the beginning and 263.5 MB in the end (delta: -166.3 MB). Peak memory consumption was 104.0 MB. Max. memory is 7.1 GB. [2020-07-10 19:05:05,521 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 136.8 MB. Free memory is still 119.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 666.21 ms. Allocated memory was 136.8 MB in the beginning and 201.9 MB in the end (delta: 65.0 MB). Free memory was 99.9 MB in the beginning and 166.8 MB in the end (delta: -66.8 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 124.25 ms. Allocated memory is still 201.9 MB. Free memory was 166.8 MB in the beginning and 162.9 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 857.34 ms. Allocated memory is still 201.9 MB. Free memory was 162.9 MB in the beginning and 98.2 MB in the end (delta: 64.7 MB). Peak memory consumption was 64.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4413.30 ms. Allocated memory was 201.9 MB in the beginning and 295.7 MB in the end (delta: 93.8 MB). Free memory was 97.2 MB in the beginning and 263.5 MB in the end (delta: -166.3 MB). Peak memory consumption was 104.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...