/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-01-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 01:08:28,143 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 01:08:28,146 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 01:08:28,166 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 01:08:28,166 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 01:08:28,167 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 01:08:28,168 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 01:08:28,182 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 01:08:28,184 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 01:08:28,185 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 01:08:28,187 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 01:08:28,188 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 01:08:28,188 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 01:08:28,191 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 01:08:28,193 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 01:08:28,195 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 01:08:28,197 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 01:08:28,202 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 01:08:28,203 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 01:08:28,209 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 01:08:28,212 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 01:08:28,213 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 01:08:28,216 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 01:08:28,217 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 01:08:28,219 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 01:08:28,219 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 01:08:28,220 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 01:08:28,223 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 01:08:28,223 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 01:08:28,224 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 01:08:28,225 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 01:08:28,225 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 01:08:28,227 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 01:08:28,227 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 01:08:28,230 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 01:08:28,230 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 01:08:28,233 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 01:08:28,233 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 01:08:28,233 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 01:08:28,234 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 01:08:28,235 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 01:08:28,236 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 01:08:28,251 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 01:08:28,251 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 01:08:28,253 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 01:08:28,253 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 01:08:28,254 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 01:08:28,254 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 01:08:28,254 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 01:08:28,255 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 01:08:28,255 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 01:08:28,255 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 01:08:28,256 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 01:08:28,256 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 01:08:28,257 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 01:08:28,257 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 01:08:28,257 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 01:08:28,257 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 01:08:28,258 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 01:08:28,258 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 01:08:28,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 01:08:28,258 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 01:08:28,258 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 01:08:28,259 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 01:08:28,259 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 01:08:28,549 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 01:08:28,564 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 01:08:28,567 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 01:08:28,569 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 01:08:28,570 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 01:08:28,571 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-01-2.i [2020-07-11 01:08:28,638 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c29b82361/300a4a07beeb4d6daf47d5604ba3fd65/FLAGa4e0a2a60 [2020-07-11 01:08:29,145 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 01:08:29,145 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-2.i [2020-07-11 01:08:29,162 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c29b82361/300a4a07beeb4d6daf47d5604ba3fd65/FLAGa4e0a2a60 [2020-07-11 01:08:29,544 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c29b82361/300a4a07beeb4d6daf47d5604ba3fd65 [2020-07-11 01:08:29,554 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 01:08:29,556 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 01:08:29,557 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 01:08:29,557 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 01:08:29,561 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 01:08:29,563 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 01:08:29" (1/1) ... [2020-07-11 01:08:29,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b4acbfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:08:29, skipping insertion in model container [2020-07-11 01:08:29,566 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 01:08:29" (1/1) ... [2020-07-11 01:08:29,575 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 01:08:29,636 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 01:08:30,088 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 01:08:30,097 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 01:08:30,207 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 01:08:30,262 INFO L208 MainTranslator]: Completed translation [2020-07-11 01:08:30,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:08:30 WrapperNode [2020-07-11 01:08:30,262 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 01:08:30,263 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 01:08:30,263 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 01:08:30,263 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 01:08:30,278 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:08:30" (1/1) ... [2020-07-11 01:08:30,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:08:30" (1/1) ... [2020-07-11 01:08:30,296 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:08:30" (1/1) ... [2020-07-11 01:08:30,296 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:08:30" (1/1) ... [2020-07-11 01:08:30,329 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:08:30" (1/1) ... [2020-07-11 01:08:30,345 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:08:30" (1/1) ... [2020-07-11 01:08:30,352 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:08:30" (1/1) ... [2020-07-11 01:08:30,366 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 01:08:30,366 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 01:08:30,367 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 01:08:30,367 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 01:08:30,368 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:08:30" (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-11 01:08:30,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 01:08:30,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 01:08:30,437 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 01:08:30,438 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-11 01:08:30,438 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-11 01:08:30,438 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-11 01:08:30,438 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-11 01:08:30,438 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-11 01:08:30,438 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-11 01:08:30,438 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-11 01:08:30,439 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-11 01:08:30,439 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-11 01:08:30,439 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-11 01:08:30,439 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-11 01:08:30,439 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-11 01:08:30,440 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-11 01:08:30,440 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-11 01:08:30,440 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-11 01:08:30,440 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-11 01:08:30,440 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-11 01:08:30,441 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-11 01:08:30,441 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-11 01:08:30,441 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-11 01:08:30,441 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-11 01:08:30,442 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-11 01:08:30,442 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-11 01:08:30,442 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-11 01:08:30,442 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-11 01:08:30,442 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-11 01:08:30,442 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-11 01:08:30,443 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-11 01:08:30,443 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-11 01:08:30,443 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-11 01:08:30,443 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-11 01:08:30,443 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-11 01:08:30,444 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-11 01:08:30,444 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-11 01:08:30,444 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-11 01:08:30,444 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-11 01:08:30,444 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-11 01:08:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-11 01:08:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-11 01:08:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-11 01:08:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-11 01:08:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-11 01:08:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-11 01:08:30,446 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-11 01:08:30,446 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-11 01:08:30,446 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-11 01:08:30,446 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-11 01:08:30,446 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-11 01:08:30,446 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-11 01:08:30,447 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-11 01:08:30,447 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-11 01:08:30,447 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-11 01:08:30,447 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-11 01:08:30,447 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-11 01:08:30,447 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-11 01:08:30,447 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-11 01:08:30,448 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-11 01:08:30,448 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-11 01:08:30,448 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-11 01:08:30,448 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-11 01:08:30,448 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-11 01:08:30,448 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-11 01:08:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-11 01:08:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-11 01:08:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-11 01:08:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-11 01:08:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-11 01:08:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-11 01:08:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-11 01:08:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-11 01:08:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-11 01:08:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-11 01:08:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-11 01:08:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-11 01:08:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-11 01:08:30,451 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-11 01:08:30,451 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-11 01:08:30,451 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-11 01:08:30,451 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-11 01:08:30,451 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-11 01:08:30,451 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-11 01:08:30,451 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-11 01:08:30,452 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-11 01:08:30,452 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-11 01:08:30,452 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-11 01:08:30,452 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-11 01:08:30,452 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-11 01:08:30,452 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-11 01:08:30,453 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-11 01:08:30,453 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-11 01:08:30,453 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-11 01:08:30,453 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-11 01:08:30,453 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-11 01:08:30,453 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-11 01:08:30,454 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-11 01:08:30,454 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-11 01:08:30,454 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-11 01:08:30,454 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-11 01:08:30,454 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-11 01:08:30,454 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-11 01:08:30,454 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-11 01:08:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-11 01:08:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-11 01:08:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 01:08:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 01:08:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 01:08:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-11 01:08:30,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-11 01:08:30,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-11 01:08:30,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-11 01:08:30,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 01:08:30,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 01:08:31,369 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 01:08:31,369 INFO L295 CfgBuilder]: Removed 30 assume(true) statements. [2020-07-11 01:08:31,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 01:08:31 BoogieIcfgContainer [2020-07-11 01:08:31,375 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 01:08:31,376 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 01:08:31,376 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 01:08:31,379 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 01:08:31,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 01:08:29" (1/3) ... [2020-07-11 01:08:31,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d85eb70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 01:08:31, skipping insertion in model container [2020-07-11 01:08:31,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:08:30" (2/3) ... [2020-07-11 01:08:31,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d85eb70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 01:08:31, skipping insertion in model container [2020-07-11 01:08:31,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 01:08:31" (3/3) ... [2020-07-11 01:08:31,383 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2020-07-11 01:08:31,394 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 01:08:31,402 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2020-07-11 01:08:31,416 INFO L251 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2020-07-11 01:08:31,437 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 01:08:31,437 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 01:08:31,437 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 01:08:31,437 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 01:08:31,437 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 01:08:31,438 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 01:08:31,438 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 01:08:31,438 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 01:08:31,459 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states. [2020-07-11 01:08:31,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-11 01:08:31,469 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:08:31,470 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:08:31,471 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:08:31,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:08:31,478 INFO L82 PathProgramCache]: Analyzing trace with hash 885652866, now seen corresponding path program 1 times [2020-07-11 01:08:31,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:08:31,487 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1327585911] [2020-07-11 01:08:31,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:08:31,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:08:31,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:08:31,763 INFO L280 TraceCheckUtils]: 0: Hoare triple {183#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {174#true} is VALID [2020-07-11 01:08:31,764 INFO L280 TraceCheckUtils]: 1: Hoare triple {174#true} #valid := #valid[0 := 0]; {174#true} is VALID [2020-07-11 01:08:31,764 INFO L280 TraceCheckUtils]: 2: Hoare triple {174#true} assume 0 < #StackHeapBarrier; {174#true} is VALID [2020-07-11 01:08:31,765 INFO L280 TraceCheckUtils]: 3: Hoare triple {174#true} assume true; {174#true} is VALID [2020-07-11 01:08:31,765 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {174#true} {174#true} #419#return; {174#true} is VALID [2020-07-11 01:08:31,769 INFO L263 TraceCheckUtils]: 0: Hoare triple {174#true} call ULTIMATE.init(); {183#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:08:31,769 INFO L280 TraceCheckUtils]: 1: Hoare triple {183#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {174#true} is VALID [2020-07-11 01:08:31,770 INFO L280 TraceCheckUtils]: 2: Hoare triple {174#true} #valid := #valid[0 := 0]; {174#true} is VALID [2020-07-11 01:08:31,770 INFO L280 TraceCheckUtils]: 3: Hoare triple {174#true} assume 0 < #StackHeapBarrier; {174#true} is VALID [2020-07-11 01:08:31,770 INFO L280 TraceCheckUtils]: 4: Hoare triple {174#true} assume true; {174#true} is VALID [2020-07-11 01:08:31,770 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {174#true} {174#true} #419#return; {174#true} is VALID [2020-07-11 01:08:31,771 INFO L263 TraceCheckUtils]: 6: Hoare triple {174#true} call #t~ret28 := main(); {174#true} is VALID [2020-07-11 01:08:31,772 INFO L280 TraceCheckUtils]: 7: Hoare triple {174#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {181#(not (= 0 |main_#t~malloc0.base|))} is VALID [2020-07-11 01:08:31,773 INFO L280 TraceCheckUtils]: 8: Hoare triple {181#(not (= 0 |main_#t~malloc0.base|))} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {182#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:31,774 INFO L280 TraceCheckUtils]: 9: Hoare triple {182#(not (= 0 main_~list~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {182#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:31,775 INFO L280 TraceCheckUtils]: 10: Hoare triple {182#(not (= 0 main_~list~0.base))} assume !(~list~0.base != 0 || ~list~0.offset != 0); {175#false} is VALID [2020-07-11 01:08:31,776 INFO L280 TraceCheckUtils]: 11: Hoare triple {175#false} assume !false; {175#false} is VALID [2020-07-11 01:08:31,777 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-11 01:08:31,778 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1327585911] [2020-07-11 01:08:31,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:08:31,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-11 01:08:31,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348749825] [2020-07-11 01:08:31,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-11 01:08:31,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:08:31,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 01:08:31,819 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:31,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 01:08:31,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:08:31,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 01:08:31,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-11 01:08:31,832 INFO L87 Difference]: Start difference. First operand 171 states. Second operand 5 states. [2020-07-11 01:08:33,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:33,135 INFO L93 Difference]: Finished difference Result 360 states and 478 transitions. [2020-07-11 01:08:33,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-11 01:08:33,136 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-11 01:08:33,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:08:33,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 01:08:33,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2020-07-11 01:08:33,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 01:08:33,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2020-07-11 01:08:33,173 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 478 transitions. [2020-07-11 01:08:33,659 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 478 edges. 478 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:33,697 INFO L225 Difference]: With dead ends: 360 [2020-07-11 01:08:33,697 INFO L226 Difference]: Without dead ends: 194 [2020-07-11 01:08:33,711 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-11 01:08:33,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-07-11 01:08:34,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 164. [2020-07-11 01:08:34,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:08:34,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand 164 states. [2020-07-11 01:08:34,023 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand 164 states. [2020-07-11 01:08:34,023 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 164 states. [2020-07-11 01:08:34,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:34,043 INFO L93 Difference]: Finished difference Result 194 states and 205 transitions. [2020-07-11 01:08:34,043 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 205 transitions. [2020-07-11 01:08:34,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:08:34,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:08:34,048 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 194 states. [2020-07-11 01:08:34,048 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 194 states. [2020-07-11 01:08:34,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:34,064 INFO L93 Difference]: Finished difference Result 194 states and 205 transitions. [2020-07-11 01:08:34,064 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 205 transitions. [2020-07-11 01:08:34,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:08:34,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:08:34,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:08:34,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:08:34,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-07-11 01:08:34,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 174 transitions. [2020-07-11 01:08:34,100 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 174 transitions. Word has length 12 [2020-07-11 01:08:34,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:08:34,101 INFO L479 AbstractCegarLoop]: Abstraction has 164 states and 174 transitions. [2020-07-11 01:08:34,102 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 01:08:34,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 164 states and 174 transitions. [2020-07-11 01:08:34,311 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:34,311 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 174 transitions. [2020-07-11 01:08:34,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-11 01:08:34,312 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:08:34,312 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] [2020-07-11 01:08:34,313 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 01:08:34,313 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:08:34,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:08:34,313 INFO L82 PathProgramCache]: Analyzing trace with hash 684663316, now seen corresponding path program 1 times [2020-07-11 01:08:34,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:08:34,314 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1810969028] [2020-07-11 01:08:34,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:08:34,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:08:34,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:08:34,424 INFO L280 TraceCheckUtils]: 0: Hoare triple {1632#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1624#true} is VALID [2020-07-11 01:08:34,425 INFO L280 TraceCheckUtils]: 1: Hoare triple {1624#true} #valid := #valid[0 := 0]; {1624#true} is VALID [2020-07-11 01:08:34,425 INFO L280 TraceCheckUtils]: 2: Hoare triple {1624#true} assume 0 < #StackHeapBarrier; {1624#true} is VALID [2020-07-11 01:08:34,425 INFO L280 TraceCheckUtils]: 3: Hoare triple {1624#true} assume true; {1624#true} is VALID [2020-07-11 01:08:34,426 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1624#true} {1624#true} #419#return; {1624#true} is VALID [2020-07-11 01:08:34,427 INFO L263 TraceCheckUtils]: 0: Hoare triple {1624#true} call ULTIMATE.init(); {1632#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:08:34,427 INFO L280 TraceCheckUtils]: 1: Hoare triple {1632#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1624#true} is VALID [2020-07-11 01:08:34,427 INFO L280 TraceCheckUtils]: 2: Hoare triple {1624#true} #valid := #valid[0 := 0]; {1624#true} is VALID [2020-07-11 01:08:34,428 INFO L280 TraceCheckUtils]: 3: Hoare triple {1624#true} assume 0 < #StackHeapBarrier; {1624#true} is VALID [2020-07-11 01:08:34,428 INFO L280 TraceCheckUtils]: 4: Hoare triple {1624#true} assume true; {1624#true} is VALID [2020-07-11 01:08:34,428 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1624#true} {1624#true} #419#return; {1624#true} is VALID [2020-07-11 01:08:34,428 INFO L263 TraceCheckUtils]: 6: Hoare triple {1624#true} call #t~ret28 := main(); {1624#true} is VALID [2020-07-11 01:08:34,429 INFO L280 TraceCheckUtils]: 7: Hoare triple {1624#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {1624#true} is VALID [2020-07-11 01:08:34,429 INFO L280 TraceCheckUtils]: 8: Hoare triple {1624#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {1624#true} is VALID [2020-07-11 01:08:34,429 INFO L280 TraceCheckUtils]: 9: Hoare triple {1624#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {1624#true} is VALID [2020-07-11 01:08:34,430 INFO L280 TraceCheckUtils]: 10: Hoare triple {1624#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {1624#true} is VALID [2020-07-11 01:08:34,430 INFO L280 TraceCheckUtils]: 11: Hoare triple {1624#true} goto; {1624#true} is VALID [2020-07-11 01:08:34,430 INFO L280 TraceCheckUtils]: 12: Hoare triple {1624#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1624#true} is VALID [2020-07-11 01:08:34,430 INFO L280 TraceCheckUtils]: 13: Hoare triple {1624#true} assume 0 != #t~nondet1; {1624#true} is VALID [2020-07-11 01:08:34,431 INFO L280 TraceCheckUtils]: 14: Hoare triple {1624#true} havoc #t~nondet1; {1624#true} is VALID [2020-07-11 01:08:34,431 INFO L280 TraceCheckUtils]: 15: Hoare triple {1624#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {1624#true} is VALID [2020-07-11 01:08:34,431 INFO L280 TraceCheckUtils]: 16: Hoare triple {1624#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {1624#true} is VALID [2020-07-11 01:08:34,432 INFO L280 TraceCheckUtils]: 17: Hoare triple {1624#true} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {1624#true} is VALID [2020-07-11 01:08:34,432 INFO L280 TraceCheckUtils]: 18: Hoare triple {1624#true} assume #t~short7; {1631#|main_#t~short7|} is VALID [2020-07-11 01:08:34,433 INFO L280 TraceCheckUtils]: 19: Hoare triple {1631#|main_#t~short7|} assume !#t~short7; {1625#false} is VALID [2020-07-11 01:08:34,433 INFO L280 TraceCheckUtils]: 20: Hoare triple {1625#false} havoc #t~mem5.base, #t~mem5.offset; {1625#false} is VALID [2020-07-11 01:08:34,434 INFO L280 TraceCheckUtils]: 21: Hoare triple {1625#false} havoc #t~short7; {1625#false} is VALID [2020-07-11 01:08:34,434 INFO L280 TraceCheckUtils]: 22: Hoare triple {1625#false} havoc #t~mem6.base, #t~mem6.offset; {1625#false} is VALID [2020-07-11 01:08:34,434 INFO L280 TraceCheckUtils]: 23: Hoare triple {1625#false} assume !false; {1625#false} is VALID [2020-07-11 01:08:34,436 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-11 01:08:34,436 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1810969028] [2020-07-11 01:08:34,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:08:34,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-11 01:08:34,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428785566] [2020-07-11 01:08:34,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-07-11 01:08:34,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:08:34,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-11 01:08:34,467 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:34,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-11 01:08:34,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:08:34,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-11 01:08:34,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-11 01:08:34,469 INFO L87 Difference]: Start difference. First operand 164 states and 174 transitions. Second operand 4 states. [2020-07-11 01:08:35,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:35,323 INFO L93 Difference]: Finished difference Result 170 states and 180 transitions. [2020-07-11 01:08:35,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-11 01:08:35,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-07-11 01:08:35,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:08:35,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 01:08:35,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2020-07-11 01:08:35,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 01:08:35,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2020-07-11 01:08:35,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 180 transitions. [2020-07-11 01:08:35,514 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:35,520 INFO L225 Difference]: With dead ends: 170 [2020-07-11 01:08:35,520 INFO L226 Difference]: Without dead ends: 165 [2020-07-11 01:08:35,521 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-11 01:08:35,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-07-11 01:08:35,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2020-07-11 01:08:35,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:08:35,759 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand 165 states. [2020-07-11 01:08:35,759 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 165 states. [2020-07-11 01:08:35,759 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 165 states. [2020-07-11 01:08:35,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:35,765 INFO L93 Difference]: Finished difference Result 165 states and 175 transitions. [2020-07-11 01:08:35,765 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 175 transitions. [2020-07-11 01:08:35,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:08:35,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:08:35,766 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 165 states. [2020-07-11 01:08:35,766 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 165 states. [2020-07-11 01:08:35,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:35,773 INFO L93 Difference]: Finished difference Result 165 states and 175 transitions. [2020-07-11 01:08:35,773 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 175 transitions. [2020-07-11 01:08:35,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:08:35,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:08:35,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:08:35,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:08:35,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-07-11 01:08:35,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 175 transitions. [2020-07-11 01:08:35,780 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 175 transitions. Word has length 24 [2020-07-11 01:08:35,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:08:35,780 INFO L479 AbstractCegarLoop]: Abstraction has 165 states and 175 transitions. [2020-07-11 01:08:35,780 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-11 01:08:35,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 165 states and 175 transitions. [2020-07-11 01:08:35,985 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:35,985 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 175 transitions. [2020-07-11 01:08:35,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-11 01:08:35,986 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:08:35,986 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] [2020-07-11 01:08:35,986 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 01:08:35,987 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:08:35,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:08:35,987 INFO L82 PathProgramCache]: Analyzing trace with hash -265499727, now seen corresponding path program 1 times [2020-07-11 01:08:35,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:08:35,988 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [941916023] [2020-07-11 01:08:35,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:08:36,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:08:36,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:08:36,142 INFO L280 TraceCheckUtils]: 0: Hoare triple {2647#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2635#true} is VALID [2020-07-11 01:08:36,142 INFO L280 TraceCheckUtils]: 1: Hoare triple {2635#true} #valid := #valid[0 := 0]; {2635#true} is VALID [2020-07-11 01:08:36,142 INFO L280 TraceCheckUtils]: 2: Hoare triple {2635#true} assume 0 < #StackHeapBarrier; {2635#true} is VALID [2020-07-11 01:08:36,143 INFO L280 TraceCheckUtils]: 3: Hoare triple {2635#true} assume true; {2635#true} is VALID [2020-07-11 01:08:36,143 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2635#true} {2635#true} #419#return; {2635#true} is VALID [2020-07-11 01:08:36,144 INFO L263 TraceCheckUtils]: 0: Hoare triple {2635#true} call ULTIMATE.init(); {2647#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:08:36,145 INFO L280 TraceCheckUtils]: 1: Hoare triple {2647#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2635#true} is VALID [2020-07-11 01:08:36,145 INFO L280 TraceCheckUtils]: 2: Hoare triple {2635#true} #valid := #valid[0 := 0]; {2635#true} is VALID [2020-07-11 01:08:36,145 INFO L280 TraceCheckUtils]: 3: Hoare triple {2635#true} assume 0 < #StackHeapBarrier; {2635#true} is VALID [2020-07-11 01:08:36,145 INFO L280 TraceCheckUtils]: 4: Hoare triple {2635#true} assume true; {2635#true} is VALID [2020-07-11 01:08:36,146 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2635#true} {2635#true} #419#return; {2635#true} is VALID [2020-07-11 01:08:36,146 INFO L263 TraceCheckUtils]: 6: Hoare triple {2635#true} call #t~ret28 := main(); {2635#true} is VALID [2020-07-11 01:08:36,146 INFO L280 TraceCheckUtils]: 7: Hoare triple {2635#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {2635#true} is VALID [2020-07-11 01:08:36,163 INFO L280 TraceCheckUtils]: 8: Hoare triple {2635#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {2635#true} is VALID [2020-07-11 01:08:36,163 INFO L280 TraceCheckUtils]: 9: Hoare triple {2635#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {2635#true} is VALID [2020-07-11 01:08:36,164 INFO L280 TraceCheckUtils]: 10: Hoare triple {2635#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {2635#true} is VALID [2020-07-11 01:08:36,164 INFO L280 TraceCheckUtils]: 11: Hoare triple {2635#true} goto; {2635#true} is VALID [2020-07-11 01:08:36,164 INFO L280 TraceCheckUtils]: 12: Hoare triple {2635#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2635#true} is VALID [2020-07-11 01:08:36,164 INFO L280 TraceCheckUtils]: 13: Hoare triple {2635#true} assume 0 != #t~nondet1; {2635#true} is VALID [2020-07-11 01:08:36,165 INFO L280 TraceCheckUtils]: 14: Hoare triple {2635#true} havoc #t~nondet1; {2635#true} is VALID [2020-07-11 01:08:36,165 INFO L280 TraceCheckUtils]: 15: Hoare triple {2635#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {2635#true} is VALID [2020-07-11 01:08:36,166 INFO L280 TraceCheckUtils]: 16: Hoare triple {2635#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {2642#(and (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem5.base|))} is VALID [2020-07-11 01:08:36,167 INFO L280 TraceCheckUtils]: 17: Hoare triple {2642#(and (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem5.base|))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {2643#(or |main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))))} is VALID [2020-07-11 01:08:36,168 INFO L280 TraceCheckUtils]: 18: Hoare triple {2643#(or |main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))))} assume !#t~short7; {2644#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:08:36,169 INFO L280 TraceCheckUtils]: 19: Hoare triple {2644#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-22 {2645#(and (= 0 |main_#t~mem6.offset|) (= 0 |main_#t~mem6.base|))} is VALID [2020-07-11 01:08:36,170 INFO L280 TraceCheckUtils]: 20: Hoare triple {2645#(and (= 0 |main_#t~mem6.offset|) (= 0 |main_#t~mem6.base|))} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {2646#|main_#t~short7|} is VALID [2020-07-11 01:08:36,171 INFO L280 TraceCheckUtils]: 21: Hoare triple {2646#|main_#t~short7|} assume !#t~short7; {2636#false} is VALID [2020-07-11 01:08:36,171 INFO L280 TraceCheckUtils]: 22: Hoare triple {2636#false} havoc #t~mem5.base, #t~mem5.offset; {2636#false} is VALID [2020-07-11 01:08:36,171 INFO L280 TraceCheckUtils]: 23: Hoare triple {2636#false} havoc #t~short7; {2636#false} is VALID [2020-07-11 01:08:36,172 INFO L280 TraceCheckUtils]: 24: Hoare triple {2636#false} havoc #t~mem6.base, #t~mem6.offset; {2636#false} is VALID [2020-07-11 01:08:36,172 INFO L280 TraceCheckUtils]: 25: Hoare triple {2636#false} assume !false; {2636#false} is VALID [2020-07-11 01:08:36,173 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-11 01:08:36,174 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [941916023] [2020-07-11 01:08:36,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:08:36,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-11 01:08:36,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726148255] [2020-07-11 01:08:36,175 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2020-07-11 01:08:36,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:08:36,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-11 01:08:36,212 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:36,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-11 01:08:36,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:08:36,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-11 01:08:36,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-11 01:08:36,214 INFO L87 Difference]: Start difference. First operand 165 states and 175 transitions. Second operand 8 states. [2020-07-11 01:08:38,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:38,238 INFO L93 Difference]: Finished difference Result 260 states and 277 transitions. [2020-07-11 01:08:38,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-11 01:08:38,238 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2020-07-11 01:08:38,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:08:38,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 01:08:38,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 277 transitions. [2020-07-11 01:08:38,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 01:08:38,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 277 transitions. [2020-07-11 01:08:38,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 277 transitions. [2020-07-11 01:08:38,606 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 277 edges. 277 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:38,612 INFO L225 Difference]: With dead ends: 260 [2020-07-11 01:08:38,613 INFO L226 Difference]: Without dead ends: 255 [2020-07-11 01:08:38,613 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2020-07-11 01:08:38,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2020-07-11 01:08:38,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 159. [2020-07-11 01:08:38,963 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:08:38,963 INFO L82 GeneralOperation]: Start isEquivalent. First operand 255 states. Second operand 159 states. [2020-07-11 01:08:38,963 INFO L74 IsIncluded]: Start isIncluded. First operand 255 states. Second operand 159 states. [2020-07-11 01:08:38,963 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 159 states. [2020-07-11 01:08:38,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:38,974 INFO L93 Difference]: Finished difference Result 255 states and 272 transitions. [2020-07-11 01:08:38,974 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 272 transitions. [2020-07-11 01:08:38,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:08:38,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:08:38,975 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 255 states. [2020-07-11 01:08:38,975 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 255 states. [2020-07-11 01:08:38,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:38,985 INFO L93 Difference]: Finished difference Result 255 states and 272 transitions. [2020-07-11 01:08:38,985 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 272 transitions. [2020-07-11 01:08:38,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:08:38,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:08:38,986 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:08:38,986 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:08:38,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-07-11 01:08:38,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 169 transitions. [2020-07-11 01:08:38,992 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 169 transitions. Word has length 26 [2020-07-11 01:08:38,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:08:38,992 INFO L479 AbstractCegarLoop]: Abstraction has 159 states and 169 transitions. [2020-07-11 01:08:38,992 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-11 01:08:38,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 159 states and 169 transitions. [2020-07-11 01:08:39,271 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:39,271 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 169 transitions. [2020-07-11 01:08:39,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-11 01:08:39,273 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:08:39,273 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] [2020-07-11 01:08:39,273 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 01:08:39,274 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:08:39,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:08:39,274 INFO L82 PathProgramCache]: Analyzing trace with hash 72562886, now seen corresponding path program 1 times [2020-07-11 01:08:39,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:08:39,275 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [935655755] [2020-07-11 01:08:39,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:08:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:08:39,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:08:39,392 INFO L280 TraceCheckUtils]: 0: Hoare triple {4026#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {4016#true} is VALID [2020-07-11 01:08:39,392 INFO L280 TraceCheckUtils]: 1: Hoare triple {4016#true} #valid := #valid[0 := 0]; {4016#true} is VALID [2020-07-11 01:08:39,393 INFO L280 TraceCheckUtils]: 2: Hoare triple {4016#true} assume 0 < #StackHeapBarrier; {4016#true} is VALID [2020-07-11 01:08:39,393 INFO L280 TraceCheckUtils]: 3: Hoare triple {4016#true} assume true; {4016#true} is VALID [2020-07-11 01:08:39,393 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {4016#true} {4016#true} #419#return; {4016#true} is VALID [2020-07-11 01:08:39,394 INFO L263 TraceCheckUtils]: 0: Hoare triple {4016#true} call ULTIMATE.init(); {4026#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:08:39,394 INFO L280 TraceCheckUtils]: 1: Hoare triple {4026#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {4016#true} is VALID [2020-07-11 01:08:39,394 INFO L280 TraceCheckUtils]: 2: Hoare triple {4016#true} #valid := #valid[0 := 0]; {4016#true} is VALID [2020-07-11 01:08:39,395 INFO L280 TraceCheckUtils]: 3: Hoare triple {4016#true} assume 0 < #StackHeapBarrier; {4016#true} is VALID [2020-07-11 01:08:39,395 INFO L280 TraceCheckUtils]: 4: Hoare triple {4016#true} assume true; {4016#true} is VALID [2020-07-11 01:08:39,395 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4016#true} {4016#true} #419#return; {4016#true} is VALID [2020-07-11 01:08:39,395 INFO L263 TraceCheckUtils]: 6: Hoare triple {4016#true} call #t~ret28 := main(); {4016#true} is VALID [2020-07-11 01:08:39,396 INFO L280 TraceCheckUtils]: 7: Hoare triple {4016#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {4016#true} is VALID [2020-07-11 01:08:39,396 INFO L280 TraceCheckUtils]: 8: Hoare triple {4016#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {4016#true} is VALID [2020-07-11 01:08:39,396 INFO L280 TraceCheckUtils]: 9: Hoare triple {4016#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {4016#true} is VALID [2020-07-11 01:08:39,396 INFO L280 TraceCheckUtils]: 10: Hoare triple {4016#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {4016#true} is VALID [2020-07-11 01:08:39,397 INFO L280 TraceCheckUtils]: 11: Hoare triple {4016#true} goto; {4016#true} is VALID [2020-07-11 01:08:39,397 INFO L280 TraceCheckUtils]: 12: Hoare triple {4016#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4016#true} is VALID [2020-07-11 01:08:39,397 INFO L280 TraceCheckUtils]: 13: Hoare triple {4016#true} assume 0 != #t~nondet1; {4016#true} is VALID [2020-07-11 01:08:39,397 INFO L280 TraceCheckUtils]: 14: Hoare triple {4016#true} havoc #t~nondet1; {4016#true} is VALID [2020-07-11 01:08:39,398 INFO L280 TraceCheckUtils]: 15: Hoare triple {4016#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {4023#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:08:39,399 INFO L280 TraceCheckUtils]: 16: Hoare triple {4023#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {4024#(and (= 0 |main_#t~mem5.offset|) (= 0 |main_#t~mem5.base|))} is VALID [2020-07-11 01:08:39,400 INFO L280 TraceCheckUtils]: 17: Hoare triple {4024#(and (= 0 |main_#t~mem5.offset|) (= 0 |main_#t~mem5.base|))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {4025#(not |main_#t~short7|)} is VALID [2020-07-11 01:08:39,401 INFO L280 TraceCheckUtils]: 18: Hoare triple {4025#(not |main_#t~short7|)} assume #t~short7; {4017#false} is VALID [2020-07-11 01:08:39,401 INFO L280 TraceCheckUtils]: 19: Hoare triple {4017#false} assume !!#t~short7; {4017#false} is VALID [2020-07-11 01:08:39,401 INFO L280 TraceCheckUtils]: 20: Hoare triple {4017#false} havoc #t~mem5.base, #t~mem5.offset; {4017#false} is VALID [2020-07-11 01:08:39,401 INFO L280 TraceCheckUtils]: 21: Hoare triple {4017#false} havoc #t~short7; {4017#false} is VALID [2020-07-11 01:08:39,402 INFO L280 TraceCheckUtils]: 22: Hoare triple {4017#false} havoc #t~mem6.base, #t~mem6.offset; {4017#false} is VALID [2020-07-11 01:08:39,402 INFO L280 TraceCheckUtils]: 23: Hoare triple {4017#false} goto; {4017#false} is VALID [2020-07-11 01:08:39,402 INFO L280 TraceCheckUtils]: 24: Hoare triple {4017#false} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {4017#false} is VALID [2020-07-11 01:08:39,403 INFO L280 TraceCheckUtils]: 25: Hoare triple {4017#false} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {4017#false} is VALID [2020-07-11 01:08:39,403 INFO L280 TraceCheckUtils]: 26: Hoare triple {4017#false} assume !(0 != #t~nondet8); {4017#false} is VALID [2020-07-11 01:08:39,403 INFO L280 TraceCheckUtils]: 27: Hoare triple {4017#false} havoc #t~nondet8; {4017#false} is VALID [2020-07-11 01:08:39,403 INFO L280 TraceCheckUtils]: 28: Hoare triple {4017#false} ~end~0.base, ~end~0.offset := 0, 0; {4017#false} is VALID [2020-07-11 01:08:39,404 INFO L280 TraceCheckUtils]: 29: Hoare triple {4017#false} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {4017#false} is VALID [2020-07-11 01:08:39,404 INFO L280 TraceCheckUtils]: 30: Hoare triple {4017#false} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {4017#false} is VALID [2020-07-11 01:08:39,404 INFO L280 TraceCheckUtils]: 31: Hoare triple {4017#false} assume !false; {4017#false} is VALID [2020-07-11 01:08:39,406 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-11 01:08:39,406 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [935655755] [2020-07-11 01:08:39,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:08:39,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-11 01:08:39,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53407826] [2020-07-11 01:08:39,407 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2020-07-11 01:08:39,407 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:08:39,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 01:08:39,456 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:39,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 01:08:39,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:08:39,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 01:08:39,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-11 01:08:39,457 INFO L87 Difference]: Start difference. First operand 159 states and 169 transitions. Second operand 6 states. [2020-07-11 01:08:41,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:41,276 INFO L93 Difference]: Finished difference Result 382 states and 407 transitions. [2020-07-11 01:08:41,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-11 01:08:41,277 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2020-07-11 01:08:41,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:08:41,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 01:08:41,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 407 transitions. [2020-07-11 01:08:41,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 01:08:41,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 407 transitions. [2020-07-11 01:08:41,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 407 transitions. [2020-07-11 01:08:41,703 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 407 edges. 407 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:41,711 INFO L225 Difference]: With dead ends: 382 [2020-07-11 01:08:41,711 INFO L226 Difference]: Without dead ends: 253 [2020-07-11 01:08:41,716 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-11 01:08:41,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2020-07-11 01:08:42,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 162. [2020-07-11 01:08:42,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:08:42,071 INFO L82 GeneralOperation]: Start isEquivalent. First operand 253 states. Second operand 162 states. [2020-07-11 01:08:42,071 INFO L74 IsIncluded]: Start isIncluded. First operand 253 states. Second operand 162 states. [2020-07-11 01:08:42,071 INFO L87 Difference]: Start difference. First operand 253 states. Second operand 162 states. [2020-07-11 01:08:42,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:42,083 INFO L93 Difference]: Finished difference Result 253 states and 269 transitions. [2020-07-11 01:08:42,083 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 269 transitions. [2020-07-11 01:08:42,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:08:42,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:08:42,084 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 253 states. [2020-07-11 01:08:42,084 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 253 states. [2020-07-11 01:08:42,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:42,095 INFO L93 Difference]: Finished difference Result 253 states and 269 transitions. [2020-07-11 01:08:42,095 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 269 transitions. [2020-07-11 01:08:42,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:08:42,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:08:42,096 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:08:42,096 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:08:42,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-07-11 01:08:42,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 172 transitions. [2020-07-11 01:08:42,102 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 172 transitions. Word has length 32 [2020-07-11 01:08:42,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:08:42,104 INFO L479 AbstractCegarLoop]: Abstraction has 162 states and 172 transitions. [2020-07-11 01:08:42,105 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 01:08:42,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 162 states and 172 transitions. [2020-07-11 01:08:42,412 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:42,412 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 172 transitions. [2020-07-11 01:08:42,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-11 01:08:42,413 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:08:42,413 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] [2020-07-11 01:08:42,413 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 01:08:42,414 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:08:42,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:08:42,414 INFO L82 PathProgramCache]: Analyzing trace with hash 972027235, now seen corresponding path program 1 times [2020-07-11 01:08:42,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:08:42,415 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1621738303] [2020-07-11 01:08:42,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:08:42,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:08:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:08:42,539 INFO L280 TraceCheckUtils]: 0: Hoare triple {5637#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {5627#true} is VALID [2020-07-11 01:08:42,539 INFO L280 TraceCheckUtils]: 1: Hoare triple {5627#true} #valid := #valid[0 := 0]; {5627#true} is VALID [2020-07-11 01:08:42,539 INFO L280 TraceCheckUtils]: 2: Hoare triple {5627#true} assume 0 < #StackHeapBarrier; {5627#true} is VALID [2020-07-11 01:08:42,540 INFO L280 TraceCheckUtils]: 3: Hoare triple {5627#true} assume true; {5627#true} is VALID [2020-07-11 01:08:42,540 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {5627#true} {5627#true} #419#return; {5627#true} is VALID [2020-07-11 01:08:42,541 INFO L263 TraceCheckUtils]: 0: Hoare triple {5627#true} call ULTIMATE.init(); {5637#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:08:42,541 INFO L280 TraceCheckUtils]: 1: Hoare triple {5637#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {5627#true} is VALID [2020-07-11 01:08:42,541 INFO L280 TraceCheckUtils]: 2: Hoare triple {5627#true} #valid := #valid[0 := 0]; {5627#true} is VALID [2020-07-11 01:08:42,542 INFO L280 TraceCheckUtils]: 3: Hoare triple {5627#true} assume 0 < #StackHeapBarrier; {5627#true} is VALID [2020-07-11 01:08:42,542 INFO L280 TraceCheckUtils]: 4: Hoare triple {5627#true} assume true; {5627#true} is VALID [2020-07-11 01:08:42,542 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {5627#true} {5627#true} #419#return; {5627#true} is VALID [2020-07-11 01:08:42,545 INFO L263 TraceCheckUtils]: 6: Hoare triple {5627#true} call #t~ret28 := main(); {5627#true} is VALID [2020-07-11 01:08:42,549 INFO L280 TraceCheckUtils]: 7: Hoare triple {5627#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {5634#(not (= 0 |main_#t~malloc0.base|))} is VALID [2020-07-11 01:08:42,550 INFO L280 TraceCheckUtils]: 8: Hoare triple {5634#(not (= 0 |main_#t~malloc0.base|))} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {5635#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:42,551 INFO L280 TraceCheckUtils]: 9: Hoare triple {5635#(not (= 0 main_~list~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {5635#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:42,551 INFO L280 TraceCheckUtils]: 10: Hoare triple {5635#(not (= 0 main_~list~0.base))} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {5635#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:42,552 INFO L280 TraceCheckUtils]: 11: Hoare triple {5635#(not (= 0 main_~list~0.base))} goto; {5635#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:42,552 INFO L280 TraceCheckUtils]: 12: Hoare triple {5635#(not (= 0 main_~list~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {5635#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:42,553 INFO L280 TraceCheckUtils]: 13: Hoare triple {5635#(not (= 0 main_~list~0.base))} assume 0 != #t~nondet1; {5635#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:42,554 INFO L280 TraceCheckUtils]: 14: Hoare triple {5635#(not (= 0 main_~list~0.base))} havoc #t~nondet1; {5635#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:42,554 INFO L280 TraceCheckUtils]: 15: Hoare triple {5635#(not (= 0 main_~list~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {5635#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:42,555 INFO L280 TraceCheckUtils]: 16: Hoare triple {5635#(not (= 0 main_~list~0.base))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {5635#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:42,556 INFO L280 TraceCheckUtils]: 17: Hoare triple {5635#(not (= 0 main_~list~0.base))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {5635#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:42,557 INFO L280 TraceCheckUtils]: 18: Hoare triple {5635#(not (= 0 main_~list~0.base))} assume !#t~short7; {5635#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:42,557 INFO L280 TraceCheckUtils]: 19: Hoare triple {5635#(not (= 0 main_~list~0.base))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-22 {5635#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:42,557 INFO L280 TraceCheckUtils]: 20: Hoare triple {5635#(not (= 0 main_~list~0.base))} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {5635#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:42,558 INFO L280 TraceCheckUtils]: 21: Hoare triple {5635#(not (= 0 main_~list~0.base))} assume !!#t~short7; {5635#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:42,558 INFO L280 TraceCheckUtils]: 22: Hoare triple {5635#(not (= 0 main_~list~0.base))} havoc #t~mem5.base, #t~mem5.offset; {5635#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:42,559 INFO L280 TraceCheckUtils]: 23: Hoare triple {5635#(not (= 0 main_~list~0.base))} havoc #t~short7; {5635#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:42,559 INFO L280 TraceCheckUtils]: 24: Hoare triple {5635#(not (= 0 main_~list~0.base))} havoc #t~mem6.base, #t~mem6.offset; {5635#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:42,560 INFO L280 TraceCheckUtils]: 25: Hoare triple {5635#(not (= 0 main_~list~0.base))} goto; {5635#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:42,566 INFO L280 TraceCheckUtils]: 26: Hoare triple {5635#(not (= 0 main_~list~0.base))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {5635#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:42,567 INFO L280 TraceCheckUtils]: 27: Hoare triple {5635#(not (= 0 main_~list~0.base))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {5635#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:42,571 INFO L280 TraceCheckUtils]: 28: Hoare triple {5635#(not (= 0 main_~list~0.base))} assume !(0 != #t~nondet8); {5635#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:42,572 INFO L280 TraceCheckUtils]: 29: Hoare triple {5635#(not (= 0 main_~list~0.base))} havoc #t~nondet8; {5635#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:42,574 INFO L280 TraceCheckUtils]: 30: Hoare triple {5635#(not (= 0 main_~list~0.base))} ~end~0.base, ~end~0.offset := 0, 0; {5635#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:42,577 INFO L280 TraceCheckUtils]: 31: Hoare triple {5635#(not (= 0 main_~list~0.base))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {5636#(not (= 0 main_~end~0.base))} is VALID [2020-07-11 01:08:42,578 INFO L280 TraceCheckUtils]: 32: Hoare triple {5636#(not (= 0 main_~end~0.base))} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {5628#false} is VALID [2020-07-11 01:08:42,579 INFO L280 TraceCheckUtils]: 33: Hoare triple {5628#false} assume !false; {5628#false} is VALID [2020-07-11 01:08:42,581 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-11 01:08:42,581 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1621738303] [2020-07-11 01:08:42,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:08:42,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-11 01:08:42,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316638554] [2020-07-11 01:08:42,584 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2020-07-11 01:08:42,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:08:42,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 01:08:42,624 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:42,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 01:08:42,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:08:42,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 01:08:42,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-11 01:08:42,625 INFO L87 Difference]: Start difference. First operand 162 states and 172 transitions. Second operand 6 states. [2020-07-11 01:08:44,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:44,117 INFO L93 Difference]: Finished difference Result 271 states and 288 transitions. [2020-07-11 01:08:44,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 01:08:44,117 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2020-07-11 01:08:44,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:08:44,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 01:08:44,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 285 transitions. [2020-07-11 01:08:44,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 01:08:44,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 285 transitions. [2020-07-11 01:08:44,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 285 transitions. [2020-07-11 01:08:44,484 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 285 edges. 285 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:44,495 INFO L225 Difference]: With dead ends: 271 [2020-07-11 01:08:44,496 INFO L226 Difference]: Without dead ends: 239 [2020-07-11 01:08:44,499 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-11 01:08:44,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2020-07-11 01:08:44,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 161. [2020-07-11 01:08:44,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:08:44,966 INFO L82 GeneralOperation]: Start isEquivalent. First operand 239 states. Second operand 161 states. [2020-07-11 01:08:44,966 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand 161 states. [2020-07-11 01:08:44,966 INFO L87 Difference]: Start difference. First operand 239 states. Second operand 161 states. [2020-07-11 01:08:44,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:44,974 INFO L93 Difference]: Finished difference Result 239 states and 254 transitions. [2020-07-11 01:08:44,974 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 254 transitions. [2020-07-11 01:08:44,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:08:44,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:08:44,975 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand 239 states. [2020-07-11 01:08:44,975 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 239 states. [2020-07-11 01:08:44,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:44,982 INFO L93 Difference]: Finished difference Result 239 states and 254 transitions. [2020-07-11 01:08:44,982 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 254 transitions. [2020-07-11 01:08:44,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:08:44,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:08:44,983 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:08:44,983 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:08:44,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2020-07-11 01:08:44,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 171 transitions. [2020-07-11 01:08:44,988 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 171 transitions. Word has length 34 [2020-07-11 01:08:44,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:08:44,988 INFO L479 AbstractCegarLoop]: Abstraction has 161 states and 171 transitions. [2020-07-11 01:08:44,988 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 01:08:44,988 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 161 states and 171 transitions. [2020-07-11 01:08:45,248 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:45,249 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 171 transitions. [2020-07-11 01:08:45,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-11 01:08:45,250 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:08:45,250 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] [2020-07-11 01:08:45,250 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-11 01:08:45,251 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:08:45,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:08:45,251 INFO L82 PathProgramCache]: Analyzing trace with hash -401575995, now seen corresponding path program 1 times [2020-07-11 01:08:45,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:08:45,252 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [951610033] [2020-07-11 01:08:45,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:08:45,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:08:45,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:08:45,365 INFO L280 TraceCheckUtils]: 0: Hoare triple {6997#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {6986#true} is VALID [2020-07-11 01:08:45,365 INFO L280 TraceCheckUtils]: 1: Hoare triple {6986#true} #valid := #valid[0 := 0]; {6986#true} is VALID [2020-07-11 01:08:45,365 INFO L280 TraceCheckUtils]: 2: Hoare triple {6986#true} assume 0 < #StackHeapBarrier; {6986#true} is VALID [2020-07-11 01:08:45,365 INFO L280 TraceCheckUtils]: 3: Hoare triple {6986#true} assume true; {6986#true} is VALID [2020-07-11 01:08:45,366 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {6986#true} {6986#true} #419#return; {6986#true} is VALID [2020-07-11 01:08:45,367 INFO L263 TraceCheckUtils]: 0: Hoare triple {6986#true} call ULTIMATE.init(); {6997#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:08:45,367 INFO L280 TraceCheckUtils]: 1: Hoare triple {6997#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {6986#true} is VALID [2020-07-11 01:08:45,367 INFO L280 TraceCheckUtils]: 2: Hoare triple {6986#true} #valid := #valid[0 := 0]; {6986#true} is VALID [2020-07-11 01:08:45,367 INFO L280 TraceCheckUtils]: 3: Hoare triple {6986#true} assume 0 < #StackHeapBarrier; {6986#true} is VALID [2020-07-11 01:08:45,368 INFO L280 TraceCheckUtils]: 4: Hoare triple {6986#true} assume true; {6986#true} is VALID [2020-07-11 01:08:45,368 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {6986#true} {6986#true} #419#return; {6986#true} is VALID [2020-07-11 01:08:45,368 INFO L263 TraceCheckUtils]: 6: Hoare triple {6986#true} call #t~ret28 := main(); {6986#true} is VALID [2020-07-11 01:08:45,368 INFO L280 TraceCheckUtils]: 7: Hoare triple {6986#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {6986#true} is VALID [2020-07-11 01:08:45,369 INFO L280 TraceCheckUtils]: 8: Hoare triple {6986#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {6986#true} is VALID [2020-07-11 01:08:45,369 INFO L280 TraceCheckUtils]: 9: Hoare triple {6986#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {6986#true} is VALID [2020-07-11 01:08:45,369 INFO L280 TraceCheckUtils]: 10: Hoare triple {6986#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {6986#true} is VALID [2020-07-11 01:08:45,369 INFO L280 TraceCheckUtils]: 11: Hoare triple {6986#true} goto; {6986#true} is VALID [2020-07-11 01:08:45,369 INFO L280 TraceCheckUtils]: 12: Hoare triple {6986#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {6986#true} is VALID [2020-07-11 01:08:45,370 INFO L280 TraceCheckUtils]: 13: Hoare triple {6986#true} assume 0 != #t~nondet1; {6986#true} is VALID [2020-07-11 01:08:45,370 INFO L280 TraceCheckUtils]: 14: Hoare triple {6986#true} havoc #t~nondet1; {6986#true} is VALID [2020-07-11 01:08:45,370 INFO L280 TraceCheckUtils]: 15: Hoare triple {6986#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {6986#true} is VALID [2020-07-11 01:08:45,370 INFO L280 TraceCheckUtils]: 16: Hoare triple {6986#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {6986#true} is VALID [2020-07-11 01:08:45,371 INFO L280 TraceCheckUtils]: 17: Hoare triple {6986#true} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {6986#true} is VALID [2020-07-11 01:08:45,371 INFO L280 TraceCheckUtils]: 18: Hoare triple {6986#true} assume !#t~short7; {6986#true} is VALID [2020-07-11 01:08:45,371 INFO L280 TraceCheckUtils]: 19: Hoare triple {6986#true} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-22 {6986#true} is VALID [2020-07-11 01:08:45,371 INFO L280 TraceCheckUtils]: 20: Hoare triple {6986#true} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {6986#true} is VALID [2020-07-11 01:08:45,372 INFO L280 TraceCheckUtils]: 21: Hoare triple {6986#true} assume !!#t~short7; {6986#true} is VALID [2020-07-11 01:08:45,372 INFO L280 TraceCheckUtils]: 22: Hoare triple {6986#true} havoc #t~mem5.base, #t~mem5.offset; {6986#true} is VALID [2020-07-11 01:08:45,372 INFO L280 TraceCheckUtils]: 23: Hoare triple {6986#true} havoc #t~short7; {6986#true} is VALID [2020-07-11 01:08:45,372 INFO L280 TraceCheckUtils]: 24: Hoare triple {6986#true} havoc #t~mem6.base, #t~mem6.offset; {6986#true} is VALID [2020-07-11 01:08:45,373 INFO L280 TraceCheckUtils]: 25: Hoare triple {6986#true} goto; {6986#true} is VALID [2020-07-11 01:08:45,373 INFO L280 TraceCheckUtils]: 26: Hoare triple {6986#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {6986#true} is VALID [2020-07-11 01:08:45,373 INFO L280 TraceCheckUtils]: 27: Hoare triple {6986#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {6986#true} is VALID [2020-07-11 01:08:45,373 INFO L280 TraceCheckUtils]: 28: Hoare triple {6986#true} assume !!(0 != #t~nondet8); {6986#true} is VALID [2020-07-11 01:08:45,373 INFO L280 TraceCheckUtils]: 29: Hoare triple {6986#true} havoc #t~nondet8; {6986#true} is VALID [2020-07-11 01:08:45,374 INFO L280 TraceCheckUtils]: 30: Hoare triple {6986#true} SUMMARY for call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(8); srcloc: L1001 {6993#(not (= 0 |main_#t~malloc9.base|))} is VALID [2020-07-11 01:08:45,376 INFO L280 TraceCheckUtils]: 31: Hoare triple {6993#(not (= 0 |main_#t~malloc9.base|))} SUMMARY for call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~end~0.base, ~end~0.offset, 4); srcloc: L1001-1 {6994#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-11 01:08:45,377 INFO L280 TraceCheckUtils]: 32: Hoare triple {6994#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} SUMMARY for call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1001-2 {6995#(not (= 0 |main_#t~mem10.base|))} is VALID [2020-07-11 01:08:45,378 INFO L280 TraceCheckUtils]: 33: Hoare triple {6995#(not (= 0 |main_#t~mem10.base|))} ~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset; {6996#(not (= 0 main_~end~0.base))} is VALID [2020-07-11 01:08:45,379 INFO L280 TraceCheckUtils]: 34: Hoare triple {6996#(not (= 0 main_~end~0.base))} havoc #t~mem10.base, #t~mem10.offset; {6996#(not (= 0 main_~end~0.base))} is VALID [2020-07-11 01:08:45,380 INFO L280 TraceCheckUtils]: 35: Hoare triple {6996#(not (= 0 main_~end~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); srcloc: L1003 {6996#(not (= 0 main_~end~0.base))} is VALID [2020-07-11 01:08:45,381 INFO L280 TraceCheckUtils]: 36: Hoare triple {6996#(not (= 0 main_~end~0.base))} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {6987#false} is VALID [2020-07-11 01:08:45,381 INFO L280 TraceCheckUtils]: 37: Hoare triple {6987#false} assume !false; {6987#false} is VALID [2020-07-11 01:08:45,383 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-11 01:08:45,383 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [951610033] [2020-07-11 01:08:45,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:08:45,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-11 01:08:45,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109620571] [2020-07-11 01:08:45,384 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2020-07-11 01:08:45,384 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:08:45,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 01:08:45,420 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:45,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 01:08:45,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:08:45,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 01:08:45,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-11 01:08:45,422 INFO L87 Difference]: Start difference. First operand 161 states and 171 transitions. Second operand 7 states. [2020-07-11 01:08:47,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:47,505 INFO L93 Difference]: Finished difference Result 245 states and 261 transitions. [2020-07-11 01:08:47,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-11 01:08:47,505 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2020-07-11 01:08:47,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:08:47,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 01:08:47,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 256 transitions. [2020-07-11 01:08:47,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 01:08:47,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 256 transitions. [2020-07-11 01:08:47,516 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 256 transitions. [2020-07-11 01:08:47,793 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:47,799 INFO L225 Difference]: With dead ends: 245 [2020-07-11 01:08:47,799 INFO L226 Difference]: Without dead ends: 241 [2020-07-11 01:08:47,800 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2020-07-11 01:08:47,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2020-07-11 01:08:48,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 157. [2020-07-11 01:08:48,211 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:08:48,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 241 states. Second operand 157 states. [2020-07-11 01:08:48,211 INFO L74 IsIncluded]: Start isIncluded. First operand 241 states. Second operand 157 states. [2020-07-11 01:08:48,211 INFO L87 Difference]: Start difference. First operand 241 states. Second operand 157 states. [2020-07-11 01:08:48,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:48,217 INFO L93 Difference]: Finished difference Result 241 states and 257 transitions. [2020-07-11 01:08:48,217 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 257 transitions. [2020-07-11 01:08:48,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:08:48,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:08:48,218 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand 241 states. [2020-07-11 01:08:48,218 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 241 states. [2020-07-11 01:08:48,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:48,224 INFO L93 Difference]: Finished difference Result 241 states and 257 transitions. [2020-07-11 01:08:48,224 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 257 transitions. [2020-07-11 01:08:48,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:08:48,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:08:48,225 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:08:48,225 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:08:48,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-07-11 01:08:48,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 167 transitions. [2020-07-11 01:08:48,229 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 167 transitions. Word has length 38 [2020-07-11 01:08:48,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:08:48,229 INFO L479 AbstractCegarLoop]: Abstraction has 157 states and 167 transitions. [2020-07-11 01:08:48,229 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 01:08:48,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 157 states and 167 transitions. [2020-07-11 01:08:48,539 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:48,539 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 167 transitions. [2020-07-11 01:08:48,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-11 01:08:48,540 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:08:48,540 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] [2020-07-11 01:08:48,540 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-11 01:08:48,541 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:08:48,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:08:48,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1938604912, now seen corresponding path program 1 times [2020-07-11 01:08:48,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:08:48,542 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1036272052] [2020-07-11 01:08:48,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:08:48,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:08:48,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:08:48,618 INFO L280 TraceCheckUtils]: 0: Hoare triple {8307#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {8299#true} is VALID [2020-07-11 01:08:48,618 INFO L280 TraceCheckUtils]: 1: Hoare triple {8299#true} #valid := #valid[0 := 0]; {8299#true} is VALID [2020-07-11 01:08:48,619 INFO L280 TraceCheckUtils]: 2: Hoare triple {8299#true} assume 0 < #StackHeapBarrier; {8299#true} is VALID [2020-07-11 01:08:48,619 INFO L280 TraceCheckUtils]: 3: Hoare triple {8299#true} assume true; {8299#true} is VALID [2020-07-11 01:08:48,619 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {8299#true} {8299#true} #419#return; {8299#true} is VALID [2020-07-11 01:08:48,621 INFO L263 TraceCheckUtils]: 0: Hoare triple {8299#true} call ULTIMATE.init(); {8307#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:08:48,621 INFO L280 TraceCheckUtils]: 1: Hoare triple {8307#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {8299#true} is VALID [2020-07-11 01:08:48,621 INFO L280 TraceCheckUtils]: 2: Hoare triple {8299#true} #valid := #valid[0 := 0]; {8299#true} is VALID [2020-07-11 01:08:48,621 INFO L280 TraceCheckUtils]: 3: Hoare triple {8299#true} assume 0 < #StackHeapBarrier; {8299#true} is VALID [2020-07-11 01:08:48,622 INFO L280 TraceCheckUtils]: 4: Hoare triple {8299#true} assume true; {8299#true} is VALID [2020-07-11 01:08:48,622 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {8299#true} {8299#true} #419#return; {8299#true} is VALID [2020-07-11 01:08:48,625 INFO L263 TraceCheckUtils]: 6: Hoare triple {8299#true} call #t~ret28 := main(); {8299#true} is VALID [2020-07-11 01:08:48,626 INFO L280 TraceCheckUtils]: 7: Hoare triple {8299#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {8299#true} is VALID [2020-07-11 01:08:48,626 INFO L280 TraceCheckUtils]: 8: Hoare triple {8299#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {8299#true} is VALID [2020-07-11 01:08:48,626 INFO L280 TraceCheckUtils]: 9: Hoare triple {8299#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {8299#true} is VALID [2020-07-11 01:08:48,626 INFO L280 TraceCheckUtils]: 10: Hoare triple {8299#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {8299#true} is VALID [2020-07-11 01:08:48,626 INFO L280 TraceCheckUtils]: 11: Hoare triple {8299#true} goto; {8299#true} is VALID [2020-07-11 01:08:48,627 INFO L280 TraceCheckUtils]: 12: Hoare triple {8299#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {8299#true} is VALID [2020-07-11 01:08:48,627 INFO L280 TraceCheckUtils]: 13: Hoare triple {8299#true} assume 0 != #t~nondet1; {8299#true} is VALID [2020-07-11 01:08:48,627 INFO L280 TraceCheckUtils]: 14: Hoare triple {8299#true} havoc #t~nondet1; {8299#true} is VALID [2020-07-11 01:08:48,627 INFO L280 TraceCheckUtils]: 15: Hoare triple {8299#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {8299#true} is VALID [2020-07-11 01:08:48,628 INFO L280 TraceCheckUtils]: 16: Hoare triple {8299#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {8299#true} is VALID [2020-07-11 01:08:48,628 INFO L280 TraceCheckUtils]: 17: Hoare triple {8299#true} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {8299#true} is VALID [2020-07-11 01:08:48,631 INFO L280 TraceCheckUtils]: 18: Hoare triple {8299#true} assume !#t~short7; {8299#true} is VALID [2020-07-11 01:08:48,631 INFO L280 TraceCheckUtils]: 19: Hoare triple {8299#true} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-22 {8299#true} is VALID [2020-07-11 01:08:48,631 INFO L280 TraceCheckUtils]: 20: Hoare triple {8299#true} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {8299#true} is VALID [2020-07-11 01:08:48,632 INFO L280 TraceCheckUtils]: 21: Hoare triple {8299#true} assume !!#t~short7; {8299#true} is VALID [2020-07-11 01:08:48,632 INFO L280 TraceCheckUtils]: 22: Hoare triple {8299#true} havoc #t~mem5.base, #t~mem5.offset; {8299#true} is VALID [2020-07-11 01:08:48,632 INFO L280 TraceCheckUtils]: 23: Hoare triple {8299#true} havoc #t~short7; {8299#true} is VALID [2020-07-11 01:08:48,632 INFO L280 TraceCheckUtils]: 24: Hoare triple {8299#true} havoc #t~mem6.base, #t~mem6.offset; {8299#true} is VALID [2020-07-11 01:08:48,633 INFO L280 TraceCheckUtils]: 25: Hoare triple {8299#true} goto; {8299#true} is VALID [2020-07-11 01:08:48,633 INFO L280 TraceCheckUtils]: 26: Hoare triple {8299#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {8299#true} is VALID [2020-07-11 01:08:48,635 INFO L280 TraceCheckUtils]: 27: Hoare triple {8299#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {8299#true} is VALID [2020-07-11 01:08:48,636 INFO L280 TraceCheckUtils]: 28: Hoare triple {8299#true} assume !(0 != #t~nondet8); {8299#true} is VALID [2020-07-11 01:08:48,636 INFO L280 TraceCheckUtils]: 29: Hoare triple {8299#true} havoc #t~nondet8; {8299#true} is VALID [2020-07-11 01:08:48,637 INFO L280 TraceCheckUtils]: 30: Hoare triple {8299#true} ~end~0.base, ~end~0.offset := 0, 0; {8299#true} is VALID [2020-07-11 01:08:48,637 INFO L280 TraceCheckUtils]: 31: Hoare triple {8299#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {8299#true} is VALID [2020-07-11 01:08:48,637 INFO L280 TraceCheckUtils]: 32: Hoare triple {8299#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {8299#true} is VALID [2020-07-11 01:08:48,638 INFO L280 TraceCheckUtils]: 33: Hoare triple {8299#true} goto; {8299#true} is VALID [2020-07-11 01:08:48,638 INFO L280 TraceCheckUtils]: 34: Hoare triple {8299#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {8299#true} is VALID [2020-07-11 01:08:48,643 INFO L280 TraceCheckUtils]: 35: Hoare triple {8299#true} ~len~0 := 0; {8306#(= 0 main_~len~0)} is VALID [2020-07-11 01:08:48,643 INFO L280 TraceCheckUtils]: 36: Hoare triple {8306#(= 0 main_~len~0)} SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 {8306#(= 0 main_~len~0)} is VALID [2020-07-11 01:08:48,644 INFO L280 TraceCheckUtils]: 37: Hoare triple {8306#(= 0 main_~len~0)} ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; {8306#(= 0 main_~len~0)} is VALID [2020-07-11 01:08:48,644 INFO L280 TraceCheckUtils]: 38: Hoare triple {8306#(= 0 main_~len~0)} havoc #t~mem18.base, #t~mem18.offset; {8306#(= 0 main_~len~0)} is VALID [2020-07-11 01:08:48,645 INFO L280 TraceCheckUtils]: 39: Hoare triple {8306#(= 0 main_~len~0)} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {8306#(= 0 main_~len~0)} is VALID [2020-07-11 01:08:48,646 INFO L280 TraceCheckUtils]: 40: Hoare triple {8306#(= 0 main_~len~0)} assume !(~len~0 <= 1); {8300#false} is VALID [2020-07-11 01:08:48,646 INFO L280 TraceCheckUtils]: 41: Hoare triple {8300#false} assume !false; {8300#false} is VALID [2020-07-11 01:08:48,648 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-11 01:08:48,648 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1036272052] [2020-07-11 01:08:48,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:08:48,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-11 01:08:48,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441887686] [2020-07-11 01:08:48,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2020-07-11 01:08:48,650 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:08:48,650 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-11 01:08:48,688 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:48,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-11 01:08:48,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:08:48,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-11 01:08:48,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-11 01:08:48,689 INFO L87 Difference]: Start difference. First operand 157 states and 167 transitions. Second operand 4 states. [2020-07-11 01:08:49,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:49,797 INFO L93 Difference]: Finished difference Result 267 states and 287 transitions. [2020-07-11 01:08:49,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-11 01:08:49,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2020-07-11 01:08:49,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:08:49,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 01:08:49,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 283 transitions. [2020-07-11 01:08:49,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 01:08:49,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 283 transitions. [2020-07-11 01:08:49,803 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 283 transitions. [2020-07-11 01:08:50,064 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 283 edges. 283 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:50,070 INFO L225 Difference]: With dead ends: 267 [2020-07-11 01:08:50,070 INFO L226 Difference]: Without dead ends: 196 [2020-07-11 01:08:50,072 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-11 01:08:50,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2020-07-11 01:08:50,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 160. [2020-07-11 01:08:50,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:08:50,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 196 states. Second operand 160 states. [2020-07-11 01:08:50,516 INFO L74 IsIncluded]: Start isIncluded. First operand 196 states. Second operand 160 states. [2020-07-11 01:08:50,516 INFO L87 Difference]: Start difference. First operand 196 states. Second operand 160 states. [2020-07-11 01:08:50,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:50,521 INFO L93 Difference]: Finished difference Result 196 states and 209 transitions. [2020-07-11 01:08:50,522 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 209 transitions. [2020-07-11 01:08:50,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:08:50,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:08:50,523 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 196 states. [2020-07-11 01:08:50,523 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 196 states. [2020-07-11 01:08:50,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:50,528 INFO L93 Difference]: Finished difference Result 196 states and 209 transitions. [2020-07-11 01:08:50,528 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 209 transitions. [2020-07-11 01:08:50,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:08:50,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:08:50,529 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:08:50,529 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:08:50,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2020-07-11 01:08:50,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 171 transitions. [2020-07-11 01:08:50,532 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 171 transitions. Word has length 42 [2020-07-11 01:08:50,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:08:50,533 INFO L479 AbstractCegarLoop]: Abstraction has 160 states and 171 transitions. [2020-07-11 01:08:50,533 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-11 01:08:50,533 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 160 states and 171 transitions. [2020-07-11 01:08:50,835 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:50,835 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 171 transitions. [2020-07-11 01:08:50,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-11 01:08:50,836 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:08:50,836 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] [2020-07-11 01:08:50,836 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-11 01:08:50,837 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:08:50,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:08:50,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1017153069, now seen corresponding path program 1 times [2020-07-11 01:08:50,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:08:50,837 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [775182602] [2020-07-11 01:08:50,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:08:50,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:08:50,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:08:50,970 INFO L280 TraceCheckUtils]: 0: Hoare triple {9564#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {9556#true} is VALID [2020-07-11 01:08:50,970 INFO L280 TraceCheckUtils]: 1: Hoare triple {9556#true} #valid := #valid[0 := 0]; {9556#true} is VALID [2020-07-11 01:08:50,970 INFO L280 TraceCheckUtils]: 2: Hoare triple {9556#true} assume 0 < #StackHeapBarrier; {9556#true} is VALID [2020-07-11 01:08:50,971 INFO L280 TraceCheckUtils]: 3: Hoare triple {9556#true} assume true; {9556#true} is VALID [2020-07-11 01:08:50,971 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {9556#true} {9556#true} #419#return; {9556#true} is VALID [2020-07-11 01:08:50,972 INFO L263 TraceCheckUtils]: 0: Hoare triple {9556#true} call ULTIMATE.init(); {9564#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:08:50,972 INFO L280 TraceCheckUtils]: 1: Hoare triple {9564#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {9556#true} is VALID [2020-07-11 01:08:50,973 INFO L280 TraceCheckUtils]: 2: Hoare triple {9556#true} #valid := #valid[0 := 0]; {9556#true} is VALID [2020-07-11 01:08:50,973 INFO L280 TraceCheckUtils]: 3: Hoare triple {9556#true} assume 0 < #StackHeapBarrier; {9556#true} is VALID [2020-07-11 01:08:50,973 INFO L280 TraceCheckUtils]: 4: Hoare triple {9556#true} assume true; {9556#true} is VALID [2020-07-11 01:08:50,974 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {9556#true} {9556#true} #419#return; {9556#true} is VALID [2020-07-11 01:08:50,974 INFO L263 TraceCheckUtils]: 6: Hoare triple {9556#true} call #t~ret28 := main(); {9556#true} is VALID [2020-07-11 01:08:50,975 INFO L280 TraceCheckUtils]: 7: Hoare triple {9556#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {9556#true} is VALID [2020-07-11 01:08:50,975 INFO L280 TraceCheckUtils]: 8: Hoare triple {9556#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {9556#true} is VALID [2020-07-11 01:08:50,976 INFO L280 TraceCheckUtils]: 9: Hoare triple {9556#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {9556#true} is VALID [2020-07-11 01:08:50,976 INFO L280 TraceCheckUtils]: 10: Hoare triple {9556#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {9556#true} is VALID [2020-07-11 01:08:50,976 INFO L280 TraceCheckUtils]: 11: Hoare triple {9556#true} goto; {9556#true} is VALID [2020-07-11 01:08:50,979 INFO L280 TraceCheckUtils]: 12: Hoare triple {9556#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {9556#true} is VALID [2020-07-11 01:08:50,980 INFO L280 TraceCheckUtils]: 13: Hoare triple {9556#true} assume 0 != #t~nondet1; {9556#true} is VALID [2020-07-11 01:08:50,980 INFO L280 TraceCheckUtils]: 14: Hoare triple {9556#true} havoc #t~nondet1; {9556#true} is VALID [2020-07-11 01:08:50,980 INFO L280 TraceCheckUtils]: 15: Hoare triple {9556#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {9556#true} is VALID [2020-07-11 01:08:50,981 INFO L280 TraceCheckUtils]: 16: Hoare triple {9556#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {9556#true} is VALID [2020-07-11 01:08:50,981 INFO L280 TraceCheckUtils]: 17: Hoare triple {9556#true} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {9556#true} is VALID [2020-07-11 01:08:50,981 INFO L280 TraceCheckUtils]: 18: Hoare triple {9556#true} assume !#t~short7; {9556#true} is VALID [2020-07-11 01:08:50,983 INFO L280 TraceCheckUtils]: 19: Hoare triple {9556#true} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-22 {9556#true} is VALID [2020-07-11 01:08:50,983 INFO L280 TraceCheckUtils]: 20: Hoare triple {9556#true} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {9556#true} is VALID [2020-07-11 01:08:50,983 INFO L280 TraceCheckUtils]: 21: Hoare triple {9556#true} assume !!#t~short7; {9556#true} is VALID [2020-07-11 01:08:50,983 INFO L280 TraceCheckUtils]: 22: Hoare triple {9556#true} havoc #t~mem5.base, #t~mem5.offset; {9556#true} is VALID [2020-07-11 01:08:50,984 INFO L280 TraceCheckUtils]: 23: Hoare triple {9556#true} havoc #t~short7; {9556#true} is VALID [2020-07-11 01:08:50,984 INFO L280 TraceCheckUtils]: 24: Hoare triple {9556#true} havoc #t~mem6.base, #t~mem6.offset; {9556#true} is VALID [2020-07-11 01:08:50,984 INFO L280 TraceCheckUtils]: 25: Hoare triple {9556#true} goto; {9556#true} is VALID [2020-07-11 01:08:50,984 INFO L280 TraceCheckUtils]: 26: Hoare triple {9556#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {9556#true} is VALID [2020-07-11 01:08:50,985 INFO L280 TraceCheckUtils]: 27: Hoare triple {9556#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {9556#true} is VALID [2020-07-11 01:08:50,985 INFO L280 TraceCheckUtils]: 28: Hoare triple {9556#true} assume !(0 != #t~nondet8); {9556#true} is VALID [2020-07-11 01:08:50,985 INFO L280 TraceCheckUtils]: 29: Hoare triple {9556#true} havoc #t~nondet8; {9556#true} is VALID [2020-07-11 01:08:50,985 INFO L280 TraceCheckUtils]: 30: Hoare triple {9556#true} ~end~0.base, ~end~0.offset := 0, 0; {9556#true} is VALID [2020-07-11 01:08:50,986 INFO L280 TraceCheckUtils]: 31: Hoare triple {9556#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {9556#true} is VALID [2020-07-11 01:08:50,986 INFO L280 TraceCheckUtils]: 32: Hoare triple {9556#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {9556#true} is VALID [2020-07-11 01:08:50,986 INFO L280 TraceCheckUtils]: 33: Hoare triple {9556#true} goto; {9556#true} is VALID [2020-07-11 01:08:50,986 INFO L280 TraceCheckUtils]: 34: Hoare triple {9556#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {9556#true} is VALID [2020-07-11 01:08:50,986 INFO L280 TraceCheckUtils]: 35: Hoare triple {9556#true} ~len~0 := 0; {9556#true} is VALID [2020-07-11 01:08:50,987 INFO L280 TraceCheckUtils]: 36: Hoare triple {9556#true} SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 {9556#true} is VALID [2020-07-11 01:08:50,987 INFO L280 TraceCheckUtils]: 37: Hoare triple {9556#true} ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; {9556#true} is VALID [2020-07-11 01:08:50,987 INFO L280 TraceCheckUtils]: 38: Hoare triple {9556#true} havoc #t~mem18.base, #t~mem18.offset; {9556#true} is VALID [2020-07-11 01:08:50,988 INFO L280 TraceCheckUtils]: 39: Hoare triple {9556#true} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {9563#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} is VALID [2020-07-11 01:08:50,989 INFO L280 TraceCheckUtils]: 40: Hoare triple {9563#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} assume 0 == ~len~0; {9563#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} is VALID [2020-07-11 01:08:50,990 INFO L280 TraceCheckUtils]: 41: Hoare triple {9563#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} ~len~0 := 1; {9563#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} is VALID [2020-07-11 01:08:50,990 INFO L280 TraceCheckUtils]: 42: Hoare triple {9563#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {9557#false} is VALID [2020-07-11 01:08:50,990 INFO L280 TraceCheckUtils]: 43: Hoare triple {9557#false} assume !false; {9557#false} is VALID [2020-07-11 01:08:50,993 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-11 01:08:50,993 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [775182602] [2020-07-11 01:08:50,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:08:50,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-11 01:08:50,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856079966] [2020-07-11 01:08:50,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2020-07-11 01:08:50,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:08:50,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-11 01:08:51,045 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:51,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-11 01:08:51,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:08:51,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-11 01:08:51,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-11 01:08:51,047 INFO L87 Difference]: Start difference. First operand 160 states and 171 transitions. Second operand 4 states. [2020-07-11 01:08:52,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:52,116 INFO L93 Difference]: Finished difference Result 160 states and 171 transitions. [2020-07-11 01:08:52,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-11 01:08:52,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2020-07-11 01:08:52,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:08:52,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 01:08:52,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2020-07-11 01:08:52,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 01:08:52,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2020-07-11 01:08:52,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 163 transitions. [2020-07-11 01:08:52,357 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:52,362 INFO L225 Difference]: With dead ends: 160 [2020-07-11 01:08:52,363 INFO L226 Difference]: Without dead ends: 158 [2020-07-11 01:08:52,363 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-11 01:08:52,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-07-11 01:08:53,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2020-07-11 01:08:53,069 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:08:53,070 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand 158 states. [2020-07-11 01:08:53,070 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 158 states. [2020-07-11 01:08:53,070 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 158 states. [2020-07-11 01:08:53,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:53,077 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2020-07-11 01:08:53,077 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 169 transitions. [2020-07-11 01:08:53,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:08:53,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:08:53,079 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 158 states. [2020-07-11 01:08:53,079 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 158 states. [2020-07-11 01:08:53,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:53,086 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2020-07-11 01:08:53,087 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 169 transitions. [2020-07-11 01:08:53,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:08:53,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:08:53,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:08:53,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:08:53,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2020-07-11 01:08:53,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 169 transitions. [2020-07-11 01:08:53,095 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 169 transitions. Word has length 44 [2020-07-11 01:08:53,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:08:53,096 INFO L479 AbstractCegarLoop]: Abstraction has 158 states and 169 transitions. [2020-07-11 01:08:53,096 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-11 01:08:53,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 158 states and 169 transitions. [2020-07-11 01:08:53,576 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:53,576 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 169 transitions. [2020-07-11 01:08:53,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-11 01:08:53,577 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:08:53,577 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] [2020-07-11 01:08:53,578 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-11 01:08:53,578 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:08:53,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:08:53,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1203451366, now seen corresponding path program 1 times [2020-07-11 01:08:53,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:08:53,579 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [455372123] [2020-07-11 01:08:53,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:08:53,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:08:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:08:53,931 INFO L280 TraceCheckUtils]: 0: Hoare triple {10534#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {10519#true} is VALID [2020-07-11 01:08:53,931 INFO L280 TraceCheckUtils]: 1: Hoare triple {10519#true} #valid := #valid[0 := 0]; {10519#true} is VALID [2020-07-11 01:08:53,932 INFO L280 TraceCheckUtils]: 2: Hoare triple {10519#true} assume 0 < #StackHeapBarrier; {10519#true} is VALID [2020-07-11 01:08:53,932 INFO L280 TraceCheckUtils]: 3: Hoare triple {10519#true} assume true; {10519#true} is VALID [2020-07-11 01:08:53,932 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {10519#true} {10519#true} #419#return; {10519#true} is VALID [2020-07-11 01:08:53,934 INFO L263 TraceCheckUtils]: 0: Hoare triple {10519#true} call ULTIMATE.init(); {10534#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:08:53,934 INFO L280 TraceCheckUtils]: 1: Hoare triple {10534#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {10519#true} is VALID [2020-07-11 01:08:53,935 INFO L280 TraceCheckUtils]: 2: Hoare triple {10519#true} #valid := #valid[0 := 0]; {10519#true} is VALID [2020-07-11 01:08:53,935 INFO L280 TraceCheckUtils]: 3: Hoare triple {10519#true} assume 0 < #StackHeapBarrier; {10519#true} is VALID [2020-07-11 01:08:53,935 INFO L280 TraceCheckUtils]: 4: Hoare triple {10519#true} assume true; {10519#true} is VALID [2020-07-11 01:08:53,936 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {10519#true} {10519#true} #419#return; {10519#true} is VALID [2020-07-11 01:08:53,936 INFO L263 TraceCheckUtils]: 6: Hoare triple {10519#true} call #t~ret28 := main(); {10519#true} is VALID [2020-07-11 01:08:53,938 INFO L280 TraceCheckUtils]: 7: Hoare triple {10519#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {10526#(= 0 |main_#t~malloc0.offset|)} is VALID [2020-07-11 01:08:53,939 INFO L280 TraceCheckUtils]: 8: Hoare triple {10526#(= 0 |main_#t~malloc0.offset|)} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {10527#(= 0 main_~list~0.offset)} is VALID [2020-07-11 01:08:53,940 INFO L280 TraceCheckUtils]: 9: Hoare triple {10527#(= 0 main_~list~0.offset)} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {10527#(= 0 main_~list~0.offset)} is VALID [2020-07-11 01:08:53,942 INFO L280 TraceCheckUtils]: 10: Hoare triple {10527#(= 0 main_~list~0.offset)} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {10527#(= 0 main_~list~0.offset)} is VALID [2020-07-11 01:08:53,943 INFO L280 TraceCheckUtils]: 11: Hoare triple {10527#(= 0 main_~list~0.offset)} goto; {10527#(= 0 main_~list~0.offset)} is VALID [2020-07-11 01:08:53,944 INFO L280 TraceCheckUtils]: 12: Hoare triple {10527#(= 0 main_~list~0.offset)} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {10527#(= 0 main_~list~0.offset)} is VALID [2020-07-11 01:08:53,945 INFO L280 TraceCheckUtils]: 13: Hoare triple {10527#(= 0 main_~list~0.offset)} assume 0 != #t~nondet1; {10527#(= 0 main_~list~0.offset)} is VALID [2020-07-11 01:08:53,945 INFO L280 TraceCheckUtils]: 14: Hoare triple {10527#(= 0 main_~list~0.offset)} havoc #t~nondet1; {10527#(= 0 main_~list~0.offset)} is VALID [2020-07-11 01:08:53,946 INFO L280 TraceCheckUtils]: 15: Hoare triple {10527#(= 0 main_~list~0.offset)} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {10527#(= 0 main_~list~0.offset)} is VALID [2020-07-11 01:08:53,947 INFO L280 TraceCheckUtils]: 16: Hoare triple {10527#(= 0 main_~list~0.offset)} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {10528#(and (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem5.base|))} is VALID [2020-07-11 01:08:53,950 INFO L280 TraceCheckUtils]: 17: Hoare triple {10528#(and (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem5.base|))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {10529#(and (or |main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))) (= 0 main_~list~0.offset))} is VALID [2020-07-11 01:08:53,951 INFO L280 TraceCheckUtils]: 18: Hoare triple {10529#(and (or |main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))) (= 0 main_~list~0.offset))} assume !#t~short7; {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:08:53,952 INFO L280 TraceCheckUtils]: 19: Hoare triple {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-22 {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:08:53,953 INFO L280 TraceCheckUtils]: 20: Hoare triple {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:08:53,955 INFO L280 TraceCheckUtils]: 21: Hoare triple {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !!#t~short7; {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:08:53,956 INFO L280 TraceCheckUtils]: 22: Hoare triple {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~mem5.base, #t~mem5.offset; {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:08:53,957 INFO L280 TraceCheckUtils]: 23: Hoare triple {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~short7; {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:08:53,958 INFO L280 TraceCheckUtils]: 24: Hoare triple {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~mem6.base, #t~mem6.offset; {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:08:53,959 INFO L280 TraceCheckUtils]: 25: Hoare triple {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} goto; {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:08:53,960 INFO L280 TraceCheckUtils]: 26: Hoare triple {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:08:53,962 INFO L280 TraceCheckUtils]: 27: Hoare triple {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:08:53,963 INFO L280 TraceCheckUtils]: 28: Hoare triple {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !(0 != #t~nondet8); {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:08:53,964 INFO L280 TraceCheckUtils]: 29: Hoare triple {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~nondet8; {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:08:53,966 INFO L280 TraceCheckUtils]: 30: Hoare triple {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := 0, 0; {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:08:53,967 INFO L280 TraceCheckUtils]: 31: Hoare triple {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {10531#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} is VALID [2020-07-11 01:08:53,968 INFO L280 TraceCheckUtils]: 32: Hoare triple {10531#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {10531#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} is VALID [2020-07-11 01:08:53,969 INFO L280 TraceCheckUtils]: 33: Hoare triple {10531#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} goto; {10531#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} is VALID [2020-07-11 01:08:53,970 INFO L280 TraceCheckUtils]: 34: Hoare triple {10531#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {10531#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} is VALID [2020-07-11 01:08:53,972 INFO L280 TraceCheckUtils]: 35: Hoare triple {10531#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} ~len~0 := 0; {10531#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} is VALID [2020-07-11 01:08:53,973 INFO L280 TraceCheckUtils]: 36: Hoare triple {10531#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 {10532#(and (= 0 |main_#t~mem18.offset|) (= 0 |main_#t~mem18.base|))} is VALID [2020-07-11 01:08:53,974 INFO L280 TraceCheckUtils]: 37: Hoare triple {10532#(and (= 0 |main_#t~mem18.offset|) (= 0 |main_#t~mem18.base|))} ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; {10533#(and (= 0 main_~inner~0.base) (= 0 main_~inner~0.offset))} is VALID [2020-07-11 01:08:53,975 INFO L280 TraceCheckUtils]: 38: Hoare triple {10533#(and (= 0 main_~inner~0.base) (= 0 main_~inner~0.offset))} havoc #t~mem18.base, #t~mem18.offset; {10533#(and (= 0 main_~inner~0.base) (= 0 main_~inner~0.offset))} is VALID [2020-07-11 01:08:53,976 INFO L280 TraceCheckUtils]: 39: Hoare triple {10533#(and (= 0 main_~inner~0.base) (= 0 main_~inner~0.offset))} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {10520#false} is VALID [2020-07-11 01:08:53,977 INFO L280 TraceCheckUtils]: 40: Hoare triple {10520#false} assume 0 == ~len~0; {10520#false} is VALID [2020-07-11 01:08:53,977 INFO L280 TraceCheckUtils]: 41: Hoare triple {10520#false} ~len~0 := 1; {10520#false} is VALID [2020-07-11 01:08:53,977 INFO L280 TraceCheckUtils]: 42: Hoare triple {10520#false} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {10520#false} is VALID [2020-07-11 01:08:53,978 INFO L280 TraceCheckUtils]: 43: Hoare triple {10520#false} goto; {10520#false} is VALID [2020-07-11 01:08:53,978 INFO L280 TraceCheckUtils]: 44: Hoare triple {10520#false} SUMMARY for call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); srcloc: L1025-6 {10520#false} is VALID [2020-07-11 01:08:53,978 INFO L280 TraceCheckUtils]: 45: Hoare triple {10520#false} assume !(0 == #t~mem19.base && 0 == #t~mem19.offset); {10520#false} is VALID [2020-07-11 01:08:53,979 INFO L280 TraceCheckUtils]: 46: Hoare triple {10520#false} havoc #t~mem19.base, #t~mem19.offset; {10520#false} is VALID [2020-07-11 01:08:53,979 INFO L280 TraceCheckUtils]: 47: Hoare triple {10520#false} assume !false; {10520#false} is VALID [2020-07-11 01:08:53,996 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-11 01:08:53,996 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [455372123] [2020-07-11 01:08:53,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:08:53,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-11 01:08:54,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517422986] [2020-07-11 01:08:54,005 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2020-07-11 01:08:54,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:08:54,006 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-11 01:08:54,089 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:54,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-11 01:08:54,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:08:54,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-11 01:08:54,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-07-11 01:08:54,091 INFO L87 Difference]: Start difference. First operand 158 states and 169 transitions. Second operand 11 states. [2020-07-11 01:08:58,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:58,225 INFO L93 Difference]: Finished difference Result 398 states and 427 transitions. [2020-07-11 01:08:58,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-11 01:08:58,226 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2020-07-11 01:08:58,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:08:58,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 01:08:58,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 415 transitions. [2020-07-11 01:08:58,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 01:08:58,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 415 transitions. [2020-07-11 01:08:58,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 415 transitions. [2020-07-11 01:08:58,822 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 415 edges. 415 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:58,831 INFO L225 Difference]: With dead ends: 398 [2020-07-11 01:08:58,831 INFO L226 Difference]: Without dead ends: 326 [2020-07-11 01:08:58,832 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2020-07-11 01:08:58,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2020-07-11 01:08:59,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 204. [2020-07-11 01:08:59,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:08:59,711 INFO L82 GeneralOperation]: Start isEquivalent. First operand 326 states. Second operand 204 states. [2020-07-11 01:08:59,711 INFO L74 IsIncluded]: Start isIncluded. First operand 326 states. Second operand 204 states. [2020-07-11 01:08:59,711 INFO L87 Difference]: Start difference. First operand 326 states. Second operand 204 states. [2020-07-11 01:08:59,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:59,720 INFO L93 Difference]: Finished difference Result 326 states and 348 transitions. [2020-07-11 01:08:59,720 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 348 transitions. [2020-07-11 01:08:59,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:08:59,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:08:59,721 INFO L74 IsIncluded]: Start isIncluded. First operand 204 states. Second operand 326 states. [2020-07-11 01:08:59,721 INFO L87 Difference]: Start difference. First operand 204 states. Second operand 326 states. [2020-07-11 01:08:59,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:59,730 INFO L93 Difference]: Finished difference Result 326 states and 348 transitions. [2020-07-11 01:08:59,730 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 348 transitions. [2020-07-11 01:08:59,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:08:59,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:08:59,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:08:59,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:08:59,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-07-11 01:08:59,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 220 transitions. [2020-07-11 01:08:59,737 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 220 transitions. Word has length 48 [2020-07-11 01:08:59,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:08:59,737 INFO L479 AbstractCegarLoop]: Abstraction has 204 states and 220 transitions. [2020-07-11 01:08:59,737 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-11 01:08:59,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 204 states and 220 transitions. [2020-07-11 01:09:00,228 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 220 edges. 220 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:09:00,228 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 220 transitions. [2020-07-11 01:09:00,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-11 01:09:00,230 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:09:00,230 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] [2020-07-11 01:09:00,231 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-11 01:09:00,231 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:09:00,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:09:00,231 INFO L82 PathProgramCache]: Analyzing trace with hash 2069783995, now seen corresponding path program 1 times [2020-07-11 01:09:00,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:09:00,232 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1655205558] [2020-07-11 01:09:00,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:09:00,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:09:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:09:00,288 INFO L280 TraceCheckUtils]: 0: Hoare triple {12427#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {12419#true} is VALID [2020-07-11 01:09:00,288 INFO L280 TraceCheckUtils]: 1: Hoare triple {12419#true} #valid := #valid[0 := 0]; {12419#true} is VALID [2020-07-11 01:09:00,288 INFO L280 TraceCheckUtils]: 2: Hoare triple {12419#true} assume 0 < #StackHeapBarrier; {12419#true} is VALID [2020-07-11 01:09:00,288 INFO L280 TraceCheckUtils]: 3: Hoare triple {12419#true} assume true; {12419#true} is VALID [2020-07-11 01:09:00,289 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {12419#true} {12419#true} #419#return; {12419#true} is VALID [2020-07-11 01:09:00,289 INFO L263 TraceCheckUtils]: 0: Hoare triple {12419#true} call ULTIMATE.init(); {12427#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:09:00,289 INFO L280 TraceCheckUtils]: 1: Hoare triple {12427#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {12419#true} is VALID [2020-07-11 01:09:00,290 INFO L280 TraceCheckUtils]: 2: Hoare triple {12419#true} #valid := #valid[0 := 0]; {12419#true} is VALID [2020-07-11 01:09:00,290 INFO L280 TraceCheckUtils]: 3: Hoare triple {12419#true} assume 0 < #StackHeapBarrier; {12419#true} is VALID [2020-07-11 01:09:00,290 INFO L280 TraceCheckUtils]: 4: Hoare triple {12419#true} assume true; {12419#true} is VALID [2020-07-11 01:09:00,290 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {12419#true} {12419#true} #419#return; {12419#true} is VALID [2020-07-11 01:09:00,290 INFO L263 TraceCheckUtils]: 6: Hoare triple {12419#true} call #t~ret28 := main(); {12419#true} is VALID [2020-07-11 01:09:00,290 INFO L280 TraceCheckUtils]: 7: Hoare triple {12419#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {12419#true} is VALID [2020-07-11 01:09:00,290 INFO L280 TraceCheckUtils]: 8: Hoare triple {12419#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {12419#true} is VALID [2020-07-11 01:09:00,291 INFO L280 TraceCheckUtils]: 9: Hoare triple {12419#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {12419#true} is VALID [2020-07-11 01:09:00,291 INFO L280 TraceCheckUtils]: 10: Hoare triple {12419#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {12419#true} is VALID [2020-07-11 01:09:00,291 INFO L280 TraceCheckUtils]: 11: Hoare triple {12419#true} goto; {12419#true} is VALID [2020-07-11 01:09:00,291 INFO L280 TraceCheckUtils]: 12: Hoare triple {12419#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {12419#true} is VALID [2020-07-11 01:09:00,291 INFO L280 TraceCheckUtils]: 13: Hoare triple {12419#true} assume 0 != #t~nondet1; {12419#true} is VALID [2020-07-11 01:09:00,291 INFO L280 TraceCheckUtils]: 14: Hoare triple {12419#true} havoc #t~nondet1; {12419#true} is VALID [2020-07-11 01:09:00,292 INFO L280 TraceCheckUtils]: 15: Hoare triple {12419#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {12419#true} is VALID [2020-07-11 01:09:00,292 INFO L280 TraceCheckUtils]: 16: Hoare triple {12419#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {12419#true} is VALID [2020-07-11 01:09:00,292 INFO L280 TraceCheckUtils]: 17: Hoare triple {12419#true} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {12419#true} is VALID [2020-07-11 01:09:00,292 INFO L280 TraceCheckUtils]: 18: Hoare triple {12419#true} assume !#t~short7; {12419#true} is VALID [2020-07-11 01:09:00,292 INFO L280 TraceCheckUtils]: 19: Hoare triple {12419#true} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-22 {12419#true} is VALID [2020-07-11 01:09:00,293 INFO L280 TraceCheckUtils]: 20: Hoare triple {12419#true} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {12419#true} is VALID [2020-07-11 01:09:00,293 INFO L280 TraceCheckUtils]: 21: Hoare triple {12419#true} assume !!#t~short7; {12419#true} is VALID [2020-07-11 01:09:00,293 INFO L280 TraceCheckUtils]: 22: Hoare triple {12419#true} havoc #t~mem5.base, #t~mem5.offset; {12419#true} is VALID [2020-07-11 01:09:00,293 INFO L280 TraceCheckUtils]: 23: Hoare triple {12419#true} havoc #t~short7; {12419#true} is VALID [2020-07-11 01:09:00,293 INFO L280 TraceCheckUtils]: 24: Hoare triple {12419#true} havoc #t~mem6.base, #t~mem6.offset; {12419#true} is VALID [2020-07-11 01:09:00,294 INFO L280 TraceCheckUtils]: 25: Hoare triple {12419#true} goto; {12419#true} is VALID [2020-07-11 01:09:00,294 INFO L280 TraceCheckUtils]: 26: Hoare triple {12419#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {12419#true} is VALID [2020-07-11 01:09:00,294 INFO L280 TraceCheckUtils]: 27: Hoare triple {12419#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {12419#true} is VALID [2020-07-11 01:09:00,294 INFO L280 TraceCheckUtils]: 28: Hoare triple {12419#true} assume !!(0 != #t~nondet8); {12419#true} is VALID [2020-07-11 01:09:00,294 INFO L280 TraceCheckUtils]: 29: Hoare triple {12419#true} havoc #t~nondet8; {12419#true} is VALID [2020-07-11 01:09:00,296 INFO L280 TraceCheckUtils]: 30: Hoare triple {12419#true} SUMMARY for call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(8); srcloc: L1001 {12419#true} is VALID [2020-07-11 01:09:00,297 INFO L280 TraceCheckUtils]: 31: Hoare triple {12419#true} SUMMARY for call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~end~0.base, ~end~0.offset, 4); srcloc: L1001-1 {12419#true} is VALID [2020-07-11 01:09:00,298 INFO L280 TraceCheckUtils]: 32: Hoare triple {12419#true} SUMMARY for call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1001-2 {12419#true} is VALID [2020-07-11 01:09:00,298 INFO L280 TraceCheckUtils]: 33: Hoare triple {12419#true} ~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset; {12419#true} is VALID [2020-07-11 01:09:00,301 INFO L280 TraceCheckUtils]: 34: Hoare triple {12419#true} havoc #t~mem10.base, #t~mem10.offset; {12419#true} is VALID [2020-07-11 01:09:00,301 INFO L280 TraceCheckUtils]: 35: Hoare triple {12419#true} SUMMARY for call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); srcloc: L1003 {12419#true} is VALID [2020-07-11 01:09:00,301 INFO L280 TraceCheckUtils]: 36: Hoare triple {12419#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {12419#true} is VALID [2020-07-11 01:09:00,302 INFO L280 TraceCheckUtils]: 37: Hoare triple {12419#true} goto; {12419#true} is VALID [2020-07-11 01:09:00,302 INFO L280 TraceCheckUtils]: 38: Hoare triple {12419#true} assume !!(~end~0.base != 0 || ~end~0.offset != 0); {12419#true} is VALID [2020-07-11 01:09:00,302 INFO L280 TraceCheckUtils]: 39: Hoare triple {12419#true} goto; {12419#true} is VALID [2020-07-11 01:09:00,302 INFO L280 TraceCheckUtils]: 40: Hoare triple {12419#true} assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; {12419#true} is VALID [2020-07-11 01:09:00,302 INFO L280 TraceCheckUtils]: 41: Hoare triple {12419#true} assume 0 != #t~nondet11; {12419#true} is VALID [2020-07-11 01:09:00,303 INFO L280 TraceCheckUtils]: 42: Hoare triple {12419#true} havoc #t~nondet11; {12419#true} is VALID [2020-07-11 01:09:00,303 INFO L280 TraceCheckUtils]: 43: Hoare triple {12419#true} SUMMARY for call write~$Pointer$(0, 0, ~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1005-7 {12419#true} is VALID [2020-07-11 01:09:00,303 INFO L280 TraceCheckUtils]: 44: Hoare triple {12419#true} SUMMARY for call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1005-34 {12419#true} is VALID [2020-07-11 01:09:00,303 INFO L280 TraceCheckUtils]: 45: Hoare triple {12419#true} #t~short17 := #t~mem15.base != 0 || #t~mem15.offset != 0; {12419#true} is VALID [2020-07-11 01:09:00,306 INFO L280 TraceCheckUtils]: 46: Hoare triple {12419#true} assume #t~short17; {12426#|main_#t~short17|} is VALID [2020-07-11 01:09:00,307 INFO L280 TraceCheckUtils]: 47: Hoare triple {12426#|main_#t~short17|} assume !#t~short17; {12420#false} is VALID [2020-07-11 01:09:00,307 INFO L280 TraceCheckUtils]: 48: Hoare triple {12420#false} havoc #t~mem16.base, #t~mem16.offset; {12420#false} is VALID [2020-07-11 01:09:00,308 INFO L280 TraceCheckUtils]: 49: Hoare triple {12420#false} havoc #t~mem15.base, #t~mem15.offset; {12420#false} is VALID [2020-07-11 01:09:00,308 INFO L280 TraceCheckUtils]: 50: Hoare triple {12420#false} havoc #t~short17; {12420#false} is VALID [2020-07-11 01:09:00,308 INFO L280 TraceCheckUtils]: 51: Hoare triple {12420#false} assume !false; {12420#false} is VALID [2020-07-11 01:09:00,312 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-11 01:09:00,313 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1655205558] [2020-07-11 01:09:00,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:09:00,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-11 01:09:00,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358295752] [2020-07-11 01:09:00,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2020-07-11 01:09:00,314 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:09:00,314 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-11 01:09:00,363 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:09:00,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-11 01:09:00,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:09:00,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-11 01:09:00,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-11 01:09:00,363 INFO L87 Difference]: Start difference. First operand 204 states and 220 transitions. Second operand 4 states. [2020-07-11 01:09:01,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:09:01,665 INFO L93 Difference]: Finished difference Result 211 states and 228 transitions. [2020-07-11 01:09:01,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-11 01:09:01,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2020-07-11 01:09:01,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:09:01,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 01:09:01,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2020-07-11 01:09:01,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 01:09:01,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2020-07-11 01:09:01,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 167 transitions. [2020-07-11 01:09:01,834 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:09:01,837 INFO L225 Difference]: With dead ends: 211 [2020-07-11 01:09:01,837 INFO L226 Difference]: Without dead ends: 206 [2020-07-11 01:09:01,838 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-11 01:09:01,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-07-11 01:09:02,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2020-07-11 01:09:02,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:09:02,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand 206 states. [2020-07-11 01:09:02,650 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand 206 states. [2020-07-11 01:09:02,650 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 206 states. [2020-07-11 01:09:02,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:09:02,656 INFO L93 Difference]: Finished difference Result 206 states and 222 transitions. [2020-07-11 01:09:02,656 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 222 transitions. [2020-07-11 01:09:02,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:09:02,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:09:02,657 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand 206 states. [2020-07-11 01:09:02,657 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 206 states. [2020-07-11 01:09:02,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:09:02,662 INFO L93 Difference]: Finished difference Result 206 states and 222 transitions. [2020-07-11 01:09:02,662 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 222 transitions. [2020-07-11 01:09:02,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:09:02,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:09:02,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:09:02,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:09:02,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-07-11 01:09:02,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 222 transitions. [2020-07-11 01:09:02,667 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 222 transitions. Word has length 52 [2020-07-11 01:09:02,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:09:02,667 INFO L479 AbstractCegarLoop]: Abstraction has 206 states and 222 transitions. [2020-07-11 01:09:02,667 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-11 01:09:02,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 206 states and 222 transitions. [2020-07-11 01:09:03,185 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:09:03,186 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 222 transitions. [2020-07-11 01:09:03,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-07-11 01:09:03,187 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:09:03,187 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] [2020-07-11 01:09:03,187 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-11 01:09:03,187 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:09:03,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:09:03,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1565892499, now seen corresponding path program 1 times [2020-07-11 01:09:03,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:09:03,188 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1672117267] [2020-07-11 01:09:03,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:09:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:09:03,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:09:03,798 INFO L280 TraceCheckUtils]: 0: Hoare triple {13694#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {13676#true} is VALID [2020-07-11 01:09:03,798 INFO L280 TraceCheckUtils]: 1: Hoare triple {13676#true} #valid := #valid[0 := 0]; {13676#true} is VALID [2020-07-11 01:09:03,798 INFO L280 TraceCheckUtils]: 2: Hoare triple {13676#true} assume 0 < #StackHeapBarrier; {13676#true} is VALID [2020-07-11 01:09:03,799 INFO L280 TraceCheckUtils]: 3: Hoare triple {13676#true} assume true; {13676#true} is VALID [2020-07-11 01:09:03,799 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {13676#true} {13676#true} #419#return; {13676#true} is VALID [2020-07-11 01:09:03,801 INFO L263 TraceCheckUtils]: 0: Hoare triple {13676#true} call ULTIMATE.init(); {13694#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:09:03,801 INFO L280 TraceCheckUtils]: 1: Hoare triple {13694#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {13676#true} is VALID [2020-07-11 01:09:03,802 INFO L280 TraceCheckUtils]: 2: Hoare triple {13676#true} #valid := #valid[0 := 0]; {13676#true} is VALID [2020-07-11 01:09:03,802 INFO L280 TraceCheckUtils]: 3: Hoare triple {13676#true} assume 0 < #StackHeapBarrier; {13676#true} is VALID [2020-07-11 01:09:03,802 INFO L280 TraceCheckUtils]: 4: Hoare triple {13676#true} assume true; {13676#true} is VALID [2020-07-11 01:09:03,802 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {13676#true} {13676#true} #419#return; {13676#true} is VALID [2020-07-11 01:09:03,803 INFO L263 TraceCheckUtils]: 6: Hoare triple {13676#true} call #t~ret28 := main(); {13676#true} is VALID [2020-07-11 01:09:03,804 INFO L280 TraceCheckUtils]: 7: Hoare triple {13676#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {13683#(and (= 1 (select |#valid| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|))} is VALID [2020-07-11 01:09:03,806 INFO L280 TraceCheckUtils]: 8: Hoare triple {13683#(and (= 1 (select |#valid| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|))} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {13684#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-11 01:09:03,807 INFO L280 TraceCheckUtils]: 9: Hoare triple {13684#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {13684#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-11 01:09:03,807 INFO L280 TraceCheckUtils]: 10: Hoare triple {13684#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {13684#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-11 01:09:03,811 INFO L280 TraceCheckUtils]: 11: Hoare triple {13684#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} goto; {13684#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-11 01:09:03,813 INFO L280 TraceCheckUtils]: 12: Hoare triple {13684#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {13684#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-11 01:09:03,814 INFO L280 TraceCheckUtils]: 13: Hoare triple {13684#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} assume !(0 != #t~nondet1); {13684#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-11 01:09:03,814 INFO L280 TraceCheckUtils]: 14: Hoare triple {13684#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} havoc #t~nondet1; {13684#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-11 01:09:03,815 INFO L280 TraceCheckUtils]: 15: Hoare triple {13684#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); srcloc: L993-10 {13685#(and (= 0 |main_#t~malloc2.offset|) (= 0 main_~list~0.offset) (not (= |main_#t~malloc2.base| main_~list~0.base)))} is VALID [2020-07-11 01:09:03,817 INFO L280 TraceCheckUtils]: 16: Hoare triple {13685#(and (= 0 |main_#t~malloc2.offset|) (= 0 main_~list~0.offset) (not (= |main_#t~malloc2.base| main_~list~0.base)))} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-11 {13686#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} is VALID [2020-07-11 01:09:03,818 INFO L280 TraceCheckUtils]: 17: Hoare triple {13686#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-12 {13687#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem3.base|) (not (= |main_#t~mem3.base| main_~list~0.base)))} is VALID [2020-07-11 01:09:03,820 INFO L280 TraceCheckUtils]: 18: Hoare triple {13687#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem3.base|) (not (= |main_#t~mem3.base| main_~list~0.base)))} SUMMARY for call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4); srcloc: L993-13 {13686#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} is VALID [2020-07-11 01:09:03,826 INFO L280 TraceCheckUtils]: 19: Hoare triple {13686#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} havoc #t~mem3.base, #t~mem3.offset; {13686#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} is VALID [2020-07-11 01:09:03,828 INFO L280 TraceCheckUtils]: 20: Hoare triple {13686#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-15 {13688#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (not (= |main_#t~mem4.base| main_~list~0.base)) (= 0 |main_#t~mem4.offset|) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem4.base|))} is VALID [2020-07-11 01:09:03,830 INFO L280 TraceCheckUtils]: 21: Hoare triple {13688#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (not (= |main_#t~mem4.base| main_~list~0.base)) (= 0 |main_#t~mem4.offset|) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem4.base|))} SUMMARY for call write~$Pointer$(0, 0, #t~mem4.base, 4 + #t~mem4.offset, 4); srcloc: L993-16 {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:09:03,833 INFO L280 TraceCheckUtils]: 22: Hoare triple {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} havoc #t~mem4.base, #t~mem4.offset; {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:09:03,834 INFO L280 TraceCheckUtils]: 23: Hoare triple {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:09:03,836 INFO L280 TraceCheckUtils]: 24: Hoare triple {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:09:03,839 INFO L280 TraceCheckUtils]: 25: Hoare triple {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} assume #t~short7; {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:09:03,843 INFO L280 TraceCheckUtils]: 26: Hoare triple {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} assume !!#t~short7; {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:09:03,845 INFO L280 TraceCheckUtils]: 27: Hoare triple {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} havoc #t~mem5.base, #t~mem5.offset; {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:09:03,848 INFO L280 TraceCheckUtils]: 28: Hoare triple {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} havoc #t~short7; {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:09:03,850 INFO L280 TraceCheckUtils]: 29: Hoare triple {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} havoc #t~mem6.base, #t~mem6.offset; {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:09:03,851 INFO L280 TraceCheckUtils]: 30: Hoare triple {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} goto; {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:09:03,852 INFO L280 TraceCheckUtils]: 31: Hoare triple {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:09:03,853 INFO L280 TraceCheckUtils]: 32: Hoare triple {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:09:03,854 INFO L280 TraceCheckUtils]: 33: Hoare triple {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} assume !(0 != #t~nondet8); {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:09:03,855 INFO L280 TraceCheckUtils]: 34: Hoare triple {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} havoc #t~nondet8; {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:09:03,856 INFO L280 TraceCheckUtils]: 35: Hoare triple {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := 0, 0; {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:09:03,857 INFO L280 TraceCheckUtils]: 36: Hoare triple {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {13690#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4) 0))} is VALID [2020-07-11 01:09:03,858 INFO L280 TraceCheckUtils]: 37: Hoare triple {13690#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4) 0))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {13690#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4) 0))} is VALID [2020-07-11 01:09:03,860 INFO L280 TraceCheckUtils]: 38: Hoare triple {13690#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4) 0))} goto; {13690#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4) 0))} is VALID [2020-07-11 01:09:03,861 INFO L280 TraceCheckUtils]: 39: Hoare triple {13690#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4) 0))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {13690#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4) 0))} is VALID [2020-07-11 01:09:03,863 INFO L280 TraceCheckUtils]: 40: Hoare triple {13690#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4) 0))} ~len~0 := 0; {13690#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4) 0))} is VALID [2020-07-11 01:09:03,865 INFO L280 TraceCheckUtils]: 41: Hoare triple {13690#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4) 0))} SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 {13691#(and (= 0 |main_#t~mem18.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) 4)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) 4)))} is VALID [2020-07-11 01:09:03,866 INFO L280 TraceCheckUtils]: 42: Hoare triple {13691#(and (= 0 |main_#t~mem18.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) 4)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) 4)))} ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; {13692#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} is VALID [2020-07-11 01:09:03,867 INFO L280 TraceCheckUtils]: 43: Hoare triple {13692#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} havoc #t~mem18.base, #t~mem18.offset; {13692#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} is VALID [2020-07-11 01:09:03,868 INFO L280 TraceCheckUtils]: 44: Hoare triple {13692#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {13692#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} is VALID [2020-07-11 01:09:03,869 INFO L280 TraceCheckUtils]: 45: Hoare triple {13692#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} assume 0 == ~len~0; {13692#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} is VALID [2020-07-11 01:09:03,870 INFO L280 TraceCheckUtils]: 46: Hoare triple {13692#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} ~len~0 := 1; {13692#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} is VALID [2020-07-11 01:09:03,871 INFO L280 TraceCheckUtils]: 47: Hoare triple {13692#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {13692#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} is VALID [2020-07-11 01:09:03,874 INFO L280 TraceCheckUtils]: 48: Hoare triple {13692#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} goto; {13692#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} is VALID [2020-07-11 01:09:03,876 INFO L280 TraceCheckUtils]: 49: Hoare triple {13692#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} SUMMARY for call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); srcloc: L1025-6 {13693#(and (= 0 |main_#t~mem19.offset|) (= 0 |main_#t~mem19.base|))} is VALID [2020-07-11 01:09:03,876 INFO L280 TraceCheckUtils]: 50: Hoare triple {13693#(and (= 0 |main_#t~mem19.offset|) (= 0 |main_#t~mem19.base|))} assume !(0 == #t~mem19.base && 0 == #t~mem19.offset); {13677#false} is VALID [2020-07-11 01:09:03,876 INFO L280 TraceCheckUtils]: 51: Hoare triple {13677#false} havoc #t~mem19.base, #t~mem19.offset; {13677#false} is VALID [2020-07-11 01:09:03,877 INFO L280 TraceCheckUtils]: 52: Hoare triple {13677#false} assume !false; {13677#false} is VALID [2020-07-11 01:09:03,893 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-11 01:09:03,894 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1672117267] [2020-07-11 01:09:03,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:09:03,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-11 01:09:03,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767587133] [2020-07-11 01:09:03,903 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 53 [2020-07-11 01:09:03,903 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:09:03,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-11 01:09:03,979 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:09:03,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-11 01:09:03,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:09:03,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-11 01:09:03,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2020-07-11 01:09:03,981 INFO L87 Difference]: Start difference. First operand 206 states and 222 transitions. Second operand 14 states. [2020-07-11 01:09:14,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:09:14,917 INFO L93 Difference]: Finished difference Result 636 states and 681 transitions. [2020-07-11 01:09:14,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-07-11 01:09:14,917 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 53 [2020-07-11 01:09:14,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:09:14,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-11 01:09:14,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 556 transitions. [2020-07-11 01:09:14,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-11 01:09:14,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 556 transitions. [2020-07-11 01:09:14,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 556 transitions. [2020-07-11 01:09:15,993 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 556 edges. 556 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:09:16,016 INFO L225 Difference]: With dead ends: 636 [2020-07-11 01:09:16,017 INFO L226 Difference]: Without dead ends: 633 [2020-07-11 01:09:16,017 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=252, Invalid=804, Unknown=0, NotChecked=0, Total=1056 [2020-07-11 01:09:16,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2020-07-11 01:09:17,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 225. [2020-07-11 01:09:17,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:09:17,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 633 states. Second operand 225 states. [2020-07-11 01:09:17,619 INFO L74 IsIncluded]: Start isIncluded. First operand 633 states. Second operand 225 states. [2020-07-11 01:09:17,619 INFO L87 Difference]: Start difference. First operand 633 states. Second operand 225 states. [2020-07-11 01:09:17,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:09:17,642 INFO L93 Difference]: Finished difference Result 633 states and 678 transitions. [2020-07-11 01:09:17,642 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 678 transitions. [2020-07-11 01:09:17,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:09:17,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:09:17,644 INFO L74 IsIncluded]: Start isIncluded. First operand 225 states. Second operand 633 states. [2020-07-11 01:09:17,644 INFO L87 Difference]: Start difference. First operand 225 states. Second operand 633 states. [2020-07-11 01:09:17,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:09:17,661 INFO L93 Difference]: Finished difference Result 633 states and 678 transitions. [2020-07-11 01:09:17,661 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 678 transitions. [2020-07-11 01:09:17,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:09:17,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:09:17,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:09:17,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:09:17,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2020-07-11 01:09:17,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 243 transitions. [2020-07-11 01:09:17,666 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 243 transitions. Word has length 53 [2020-07-11 01:09:17,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:09:17,666 INFO L479 AbstractCegarLoop]: Abstraction has 225 states and 243 transitions. [2020-07-11 01:09:17,666 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-11 01:09:17,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 225 states and 243 transitions. [2020-07-11 01:09:18,495 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:09:18,495 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 243 transitions. [2020-07-11 01:09:18,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-07-11 01:09:18,496 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:09:18,497 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] [2020-07-11 01:09:18,497 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-11 01:09:18,498 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:09:18,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:09:18,498 INFO L82 PathProgramCache]: Analyzing trace with hash 991929043, now seen corresponding path program 1 times [2020-07-11 01:09:18,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:09:18,498 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1758634802] [2020-07-11 01:09:18,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:09:18,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:09:18,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:09:18,657 INFO L280 TraceCheckUtils]: 0: Hoare triple {16735#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {16723#true} is VALID [2020-07-11 01:09:18,657 INFO L280 TraceCheckUtils]: 1: Hoare triple {16723#true} #valid := #valid[0 := 0]; {16723#true} is VALID [2020-07-11 01:09:18,657 INFO L280 TraceCheckUtils]: 2: Hoare triple {16723#true} assume 0 < #StackHeapBarrier; {16723#true} is VALID [2020-07-11 01:09:18,658 INFO L280 TraceCheckUtils]: 3: Hoare triple {16723#true} assume true; {16723#true} is VALID [2020-07-11 01:09:18,658 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {16723#true} {16723#true} #419#return; {16723#true} is VALID [2020-07-11 01:09:18,659 INFO L263 TraceCheckUtils]: 0: Hoare triple {16723#true} call ULTIMATE.init(); {16735#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:09:18,660 INFO L280 TraceCheckUtils]: 1: Hoare triple {16735#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {16723#true} is VALID [2020-07-11 01:09:18,660 INFO L280 TraceCheckUtils]: 2: Hoare triple {16723#true} #valid := #valid[0 := 0]; {16723#true} is VALID [2020-07-11 01:09:18,660 INFO L280 TraceCheckUtils]: 3: Hoare triple {16723#true} assume 0 < #StackHeapBarrier; {16723#true} is VALID [2020-07-11 01:09:18,661 INFO L280 TraceCheckUtils]: 4: Hoare triple {16723#true} assume true; {16723#true} is VALID [2020-07-11 01:09:18,661 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {16723#true} {16723#true} #419#return; {16723#true} is VALID [2020-07-11 01:09:18,661 INFO L263 TraceCheckUtils]: 6: Hoare triple {16723#true} call #t~ret28 := main(); {16723#true} is VALID [2020-07-11 01:09:18,661 INFO L280 TraceCheckUtils]: 7: Hoare triple {16723#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {16723#true} is VALID [2020-07-11 01:09:18,662 INFO L280 TraceCheckUtils]: 8: Hoare triple {16723#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {16723#true} is VALID [2020-07-11 01:09:18,662 INFO L280 TraceCheckUtils]: 9: Hoare triple {16723#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {16723#true} is VALID [2020-07-11 01:09:18,662 INFO L280 TraceCheckUtils]: 10: Hoare triple {16723#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {16723#true} is VALID [2020-07-11 01:09:18,662 INFO L280 TraceCheckUtils]: 11: Hoare triple {16723#true} goto; {16723#true} is VALID [2020-07-11 01:09:18,663 INFO L280 TraceCheckUtils]: 12: Hoare triple {16723#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {16723#true} is VALID [2020-07-11 01:09:18,663 INFO L280 TraceCheckUtils]: 13: Hoare triple {16723#true} assume 0 != #t~nondet1; {16723#true} is VALID [2020-07-11 01:09:18,663 INFO L280 TraceCheckUtils]: 14: Hoare triple {16723#true} havoc #t~nondet1; {16723#true} is VALID [2020-07-11 01:09:18,664 INFO L280 TraceCheckUtils]: 15: Hoare triple {16723#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {16723#true} is VALID [2020-07-11 01:09:18,665 INFO L280 TraceCheckUtils]: 16: Hoare triple {16723#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {16730#(and (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem5.base|))} is VALID [2020-07-11 01:09:18,666 INFO L280 TraceCheckUtils]: 17: Hoare triple {16730#(and (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem5.base|))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {16731#(or |main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))))} is VALID [2020-07-11 01:09:18,668 INFO L280 TraceCheckUtils]: 18: Hoare triple {16731#(or |main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))))} assume !#t~short7; {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:09:18,669 INFO L280 TraceCheckUtils]: 19: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-22 {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:09:18,670 INFO L280 TraceCheckUtils]: 20: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:09:18,671 INFO L280 TraceCheckUtils]: 21: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !!#t~short7; {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:09:18,672 INFO L280 TraceCheckUtils]: 22: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~mem5.base, #t~mem5.offset; {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:09:18,673 INFO L280 TraceCheckUtils]: 23: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~short7; {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:09:18,674 INFO L280 TraceCheckUtils]: 24: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~mem6.base, #t~mem6.offset; {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:09:18,675 INFO L280 TraceCheckUtils]: 25: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} goto; {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:09:18,676 INFO L280 TraceCheckUtils]: 26: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:09:18,677 INFO L280 TraceCheckUtils]: 27: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:09:18,678 INFO L280 TraceCheckUtils]: 28: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !(0 != #t~nondet8); {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:09:18,679 INFO L280 TraceCheckUtils]: 29: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~nondet8; {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:09:18,680 INFO L280 TraceCheckUtils]: 30: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := 0, 0; {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:09:18,681 INFO L280 TraceCheckUtils]: 31: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:09:18,682 INFO L280 TraceCheckUtils]: 32: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:09:18,683 INFO L280 TraceCheckUtils]: 33: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} goto; {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:09:18,684 INFO L280 TraceCheckUtils]: 34: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:09:18,685 INFO L280 TraceCheckUtils]: 35: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~len~0 := 0; {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:09:18,687 INFO L280 TraceCheckUtils]: 36: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:09:18,688 INFO L280 TraceCheckUtils]: 37: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:09:18,689 INFO L280 TraceCheckUtils]: 38: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~mem18.base, #t~mem18.offset; {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:09:18,690 INFO L280 TraceCheckUtils]: 39: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:09:18,692 INFO L280 TraceCheckUtils]: 40: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !!(~len~0 <= 1); {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:09:18,693 INFO L280 TraceCheckUtils]: 41: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} goto; {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:09:18,694 INFO L280 TraceCheckUtils]: 42: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1031-4 {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:09:18,695 INFO L280 TraceCheckUtils]: 43: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := #t~mem23.base, #t~mem23.offset; {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:09:18,696 INFO L280 TraceCheckUtils]: 44: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~mem23.base, #t~mem23.offset; {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:09:18,697 INFO L280 TraceCheckUtils]: 45: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:09:18,699 INFO L280 TraceCheckUtils]: 46: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !!(0 != ~list~0.base || 0 != ~list~0.offset); {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:09:18,700 INFO L280 TraceCheckUtils]: 47: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L1039 {16733#(and (= 0 |main_#t~mem24.offset|) (= 0 |main_#t~mem24.base|))} is VALID [2020-07-11 01:09:18,701 INFO L280 TraceCheckUtils]: 48: Hoare triple {16733#(and (= 0 |main_#t~mem24.offset|) (= 0 |main_#t~mem24.base|))} ~end~0.base, ~end~0.offset := #t~mem24.base, #t~mem24.offset; {16734#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} is VALID [2020-07-11 01:09:18,701 INFO L280 TraceCheckUtils]: 49: Hoare triple {16734#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} havoc #t~mem24.base, #t~mem24.offset; {16734#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} is VALID [2020-07-11 01:09:18,702 INFO L280 TraceCheckUtils]: 50: Hoare triple {16734#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} assume 0 != ~end~0.base || 0 != ~end~0.offset; {16724#false} is VALID [2020-07-11 01:09:18,702 INFO L280 TraceCheckUtils]: 51: Hoare triple {16724#false} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {16724#false} is VALID [2020-07-11 01:09:18,703 INFO L280 TraceCheckUtils]: 52: Hoare triple {16724#false} assume !false; {16724#false} is VALID [2020-07-11 01:09:18,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-11 01:09:18,713 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1758634802] [2020-07-11 01:09:18,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:09:18,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-11 01:09:18,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840285762] [2020-07-11 01:09:18,714 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2020-07-11 01:09:18,714 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:09:18,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-11 01:09:18,796 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:09:18,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-11 01:09:18,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:09:18,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-11 01:09:18,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-11 01:09:18,797 INFO L87 Difference]: Start difference. First operand 225 states and 243 transitions. Second operand 8 states. [2020-07-11 01:09:22,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:09:22,476 INFO L93 Difference]: Finished difference Result 321 states and 346 transitions. [2020-07-11 01:09:22,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-11 01:09:22,477 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2020-07-11 01:09:22,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:09:22,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 01:09:22,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 269 transitions. [2020-07-11 01:09:22,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 01:09:22,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 269 transitions. [2020-07-11 01:09:22,481 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 269 transitions. [2020-07-11 01:09:22,796 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 269 edges. 269 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:09:22,803 INFO L225 Difference]: With dead ends: 321 [2020-07-11 01:09:22,803 INFO L226 Difference]: Without dead ends: 291 [2020-07-11 01:09:22,804 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-07-11 01:09:22,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-07-11 01:09:24,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 275. [2020-07-11 01:09:24,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:09:24,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 291 states. Second operand 275 states. [2020-07-11 01:09:24,746 INFO L74 IsIncluded]: Start isIncluded. First operand 291 states. Second operand 275 states. [2020-07-11 01:09:24,746 INFO L87 Difference]: Start difference. First operand 291 states. Second operand 275 states. [2020-07-11 01:09:24,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:09:24,752 INFO L93 Difference]: Finished difference Result 291 states and 314 transitions. [2020-07-11 01:09:24,753 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 314 transitions. [2020-07-11 01:09:24,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:09:24,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:09:24,754 INFO L74 IsIncluded]: Start isIncluded. First operand 275 states. Second operand 291 states. [2020-07-11 01:09:24,754 INFO L87 Difference]: Start difference. First operand 275 states. Second operand 291 states. [2020-07-11 01:09:24,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:09:24,760 INFO L93 Difference]: Finished difference Result 291 states and 314 transitions. [2020-07-11 01:09:24,761 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 314 transitions. [2020-07-11 01:09:24,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:09:24,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:09:24,762 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:09:24,762 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:09:24,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2020-07-11 01:09:24,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 301 transitions. [2020-07-11 01:09:24,768 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 301 transitions. Word has length 53 [2020-07-11 01:09:24,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:09:24,768 INFO L479 AbstractCegarLoop]: Abstraction has 275 states and 301 transitions. [2020-07-11 01:09:24,768 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-11 01:09:24,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 275 states and 301 transitions. [2020-07-11 01:09:25,737 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 301 edges. 301 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:09:25,737 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 301 transitions. [2020-07-11 01:09:25,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-11 01:09:25,738 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:09:25,738 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] [2020-07-11 01:09:25,739 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-11 01:09:25,739 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:09:25,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:09:25,740 INFO L82 PathProgramCache]: Analyzing trace with hash -604385608, now seen corresponding path program 1 times [2020-07-11 01:09:25,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:09:25,741 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [798876950] [2020-07-11 01:09:25,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:09:25,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:09:25,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:09:25,865 INFO L280 TraceCheckUtils]: 0: Hoare triple {18532#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {18520#true} is VALID [2020-07-11 01:09:25,865 INFO L280 TraceCheckUtils]: 1: Hoare triple {18520#true} #valid := #valid[0 := 0]; {18520#true} is VALID [2020-07-11 01:09:25,865 INFO L280 TraceCheckUtils]: 2: Hoare triple {18520#true} assume 0 < #StackHeapBarrier; {18520#true} is VALID [2020-07-11 01:09:25,865 INFO L280 TraceCheckUtils]: 3: Hoare triple {18520#true} assume true; {18520#true} is VALID [2020-07-11 01:09:25,865 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {18520#true} {18520#true} #419#return; {18520#true} is VALID [2020-07-11 01:09:25,866 INFO L263 TraceCheckUtils]: 0: Hoare triple {18520#true} call ULTIMATE.init(); {18532#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:09:25,866 INFO L280 TraceCheckUtils]: 1: Hoare triple {18532#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {18520#true} is VALID [2020-07-11 01:09:25,866 INFO L280 TraceCheckUtils]: 2: Hoare triple {18520#true} #valid := #valid[0 := 0]; {18520#true} is VALID [2020-07-11 01:09:25,866 INFO L280 TraceCheckUtils]: 3: Hoare triple {18520#true} assume 0 < #StackHeapBarrier; {18520#true} is VALID [2020-07-11 01:09:25,866 INFO L280 TraceCheckUtils]: 4: Hoare triple {18520#true} assume true; {18520#true} is VALID [2020-07-11 01:09:25,867 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {18520#true} {18520#true} #419#return; {18520#true} is VALID [2020-07-11 01:09:25,867 INFO L263 TraceCheckUtils]: 6: Hoare triple {18520#true} call #t~ret28 := main(); {18520#true} is VALID [2020-07-11 01:09:25,867 INFO L280 TraceCheckUtils]: 7: Hoare triple {18520#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {18520#true} is VALID [2020-07-11 01:09:25,867 INFO L280 TraceCheckUtils]: 8: Hoare triple {18520#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {18520#true} is VALID [2020-07-11 01:09:25,867 INFO L280 TraceCheckUtils]: 9: Hoare triple {18520#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {18520#true} is VALID [2020-07-11 01:09:25,867 INFO L280 TraceCheckUtils]: 10: Hoare triple {18520#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {18520#true} is VALID [2020-07-11 01:09:25,867 INFO L280 TraceCheckUtils]: 11: Hoare triple {18520#true} goto; {18520#true} is VALID [2020-07-11 01:09:25,867 INFO L280 TraceCheckUtils]: 12: Hoare triple {18520#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {18520#true} is VALID [2020-07-11 01:09:25,868 INFO L280 TraceCheckUtils]: 13: Hoare triple {18520#true} assume 0 != #t~nondet1; {18520#true} is VALID [2020-07-11 01:09:25,868 INFO L280 TraceCheckUtils]: 14: Hoare triple {18520#true} havoc #t~nondet1; {18520#true} is VALID [2020-07-11 01:09:25,868 INFO L280 TraceCheckUtils]: 15: Hoare triple {18520#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {18520#true} is VALID [2020-07-11 01:09:25,868 INFO L280 TraceCheckUtils]: 16: Hoare triple {18520#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {18520#true} is VALID [2020-07-11 01:09:25,868 INFO L280 TraceCheckUtils]: 17: Hoare triple {18520#true} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {18520#true} is VALID [2020-07-11 01:09:25,868 INFO L280 TraceCheckUtils]: 18: Hoare triple {18520#true} assume !#t~short7; {18520#true} is VALID [2020-07-11 01:09:25,869 INFO L280 TraceCheckUtils]: 19: Hoare triple {18520#true} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-22 {18520#true} is VALID [2020-07-11 01:09:25,869 INFO L280 TraceCheckUtils]: 20: Hoare triple {18520#true} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {18520#true} is VALID [2020-07-11 01:09:25,869 INFO L280 TraceCheckUtils]: 21: Hoare triple {18520#true} assume !!#t~short7; {18520#true} is VALID [2020-07-11 01:09:25,869 INFO L280 TraceCheckUtils]: 22: Hoare triple {18520#true} havoc #t~mem5.base, #t~mem5.offset; {18520#true} is VALID [2020-07-11 01:09:25,869 INFO L280 TraceCheckUtils]: 23: Hoare triple {18520#true} havoc #t~short7; {18520#true} is VALID [2020-07-11 01:09:25,870 INFO L280 TraceCheckUtils]: 24: Hoare triple {18520#true} havoc #t~mem6.base, #t~mem6.offset; {18520#true} is VALID [2020-07-11 01:09:25,870 INFO L280 TraceCheckUtils]: 25: Hoare triple {18520#true} goto; {18520#true} is VALID [2020-07-11 01:09:25,870 INFO L280 TraceCheckUtils]: 26: Hoare triple {18520#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {18520#true} is VALID [2020-07-11 01:09:25,870 INFO L280 TraceCheckUtils]: 27: Hoare triple {18520#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {18520#true} is VALID [2020-07-11 01:09:25,870 INFO L280 TraceCheckUtils]: 28: Hoare triple {18520#true} assume !!(0 != #t~nondet8); {18520#true} is VALID [2020-07-11 01:09:25,870 INFO L280 TraceCheckUtils]: 29: Hoare triple {18520#true} havoc #t~nondet8; {18520#true} is VALID [2020-07-11 01:09:25,871 INFO L280 TraceCheckUtils]: 30: Hoare triple {18520#true} SUMMARY for call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(8); srcloc: L1001 {18520#true} is VALID [2020-07-11 01:09:25,871 INFO L280 TraceCheckUtils]: 31: Hoare triple {18520#true} SUMMARY for call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~end~0.base, ~end~0.offset, 4); srcloc: L1001-1 {18520#true} is VALID [2020-07-11 01:09:25,871 INFO L280 TraceCheckUtils]: 32: Hoare triple {18520#true} SUMMARY for call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1001-2 {18520#true} is VALID [2020-07-11 01:09:25,871 INFO L280 TraceCheckUtils]: 33: Hoare triple {18520#true} ~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset; {18520#true} is VALID [2020-07-11 01:09:25,871 INFO L280 TraceCheckUtils]: 34: Hoare triple {18520#true} havoc #t~mem10.base, #t~mem10.offset; {18520#true} is VALID [2020-07-11 01:09:25,871 INFO L280 TraceCheckUtils]: 35: Hoare triple {18520#true} SUMMARY for call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); srcloc: L1003 {18520#true} is VALID [2020-07-11 01:09:25,871 INFO L280 TraceCheckUtils]: 36: Hoare triple {18520#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {18520#true} is VALID [2020-07-11 01:09:25,871 INFO L280 TraceCheckUtils]: 37: Hoare triple {18520#true} goto; {18520#true} is VALID [2020-07-11 01:09:25,872 INFO L280 TraceCheckUtils]: 38: Hoare triple {18520#true} assume !!(~end~0.base != 0 || ~end~0.offset != 0); {18520#true} is VALID [2020-07-11 01:09:25,872 INFO L280 TraceCheckUtils]: 39: Hoare triple {18520#true} goto; {18520#true} is VALID [2020-07-11 01:09:25,872 INFO L280 TraceCheckUtils]: 40: Hoare triple {18520#true} assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; {18520#true} is VALID [2020-07-11 01:09:25,872 INFO L280 TraceCheckUtils]: 41: Hoare triple {18520#true} assume 0 != #t~nondet11; {18520#true} is VALID [2020-07-11 01:09:25,872 INFO L280 TraceCheckUtils]: 42: Hoare triple {18520#true} havoc #t~nondet11; {18520#true} is VALID [2020-07-11 01:09:25,872 INFO L280 TraceCheckUtils]: 43: Hoare triple {18520#true} SUMMARY for call write~$Pointer$(0, 0, ~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1005-7 {18520#true} is VALID [2020-07-11 01:09:25,873 INFO L280 TraceCheckUtils]: 44: Hoare triple {18520#true} SUMMARY for call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1005-34 {18527#(and (= |main_#t~mem15.offset| (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)) |main_#t~mem15.base|))} is VALID [2020-07-11 01:09:25,873 INFO L280 TraceCheckUtils]: 45: Hoare triple {18527#(and (= |main_#t~mem15.offset| (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)) |main_#t~mem15.base|))} #t~short17 := #t~mem15.base != 0 || #t~mem15.offset != 0; {18528#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)))) |main_#t~short17|)} is VALID [2020-07-11 01:09:25,874 INFO L280 TraceCheckUtils]: 46: Hoare triple {18528#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)))) |main_#t~short17|)} assume !#t~short17; {18529#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} is VALID [2020-07-11 01:09:25,875 INFO L280 TraceCheckUtils]: 47: Hoare triple {18529#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} SUMMARY for call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1005-22 {18530#(and (= 0 |main_#t~mem16.offset|) (= 0 |main_#t~mem16.base|))} is VALID [2020-07-11 01:09:25,875 INFO L280 TraceCheckUtils]: 48: Hoare triple {18530#(and (= 0 |main_#t~mem16.offset|) (= 0 |main_#t~mem16.base|))} #t~short17 := #t~mem16.base == 0 && #t~mem16.offset == 0; {18531#|main_#t~short17|} is VALID [2020-07-11 01:09:25,875 INFO L280 TraceCheckUtils]: 49: Hoare triple {18531#|main_#t~short17|} assume !#t~short17; {18521#false} is VALID [2020-07-11 01:09:25,876 INFO L280 TraceCheckUtils]: 50: Hoare triple {18521#false} havoc #t~mem16.base, #t~mem16.offset; {18521#false} is VALID [2020-07-11 01:09:25,876 INFO L280 TraceCheckUtils]: 51: Hoare triple {18521#false} havoc #t~mem15.base, #t~mem15.offset; {18521#false} is VALID [2020-07-11 01:09:25,876 INFO L280 TraceCheckUtils]: 52: Hoare triple {18521#false} havoc #t~short17; {18521#false} is VALID [2020-07-11 01:09:25,876 INFO L280 TraceCheckUtils]: 53: Hoare triple {18521#false} assume !false; {18521#false} is VALID [2020-07-11 01:09:25,878 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-11 01:09:25,878 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [798876950] [2020-07-11 01:09:25,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:09:25,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-11 01:09:25,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466062169] [2020-07-11 01:09:25,879 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2020-07-11 01:09:25,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:09:25,879 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-11 01:09:25,933 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:09:25,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-11 01:09:25,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:09:25,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-11 01:09:25,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-11 01:09:25,935 INFO L87 Difference]: Start difference. First operand 275 states and 301 transitions. Second operand 8 states. [2020-07-11 01:09:29,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:09:29,076 INFO L93 Difference]: Finished difference Result 294 states and 322 transitions. [2020-07-11 01:09:29,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-11 01:09:29,076 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2020-07-11 01:09:29,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:09:29,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 01:09:29,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 182 transitions. [2020-07-11 01:09:29,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 01:09:29,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 182 transitions. [2020-07-11 01:09:29,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 182 transitions. [2020-07-11 01:09:29,311 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:09:29,317 INFO L225 Difference]: With dead ends: 294 [2020-07-11 01:09:29,317 INFO L226 Difference]: Without dead ends: 289 [2020-07-11 01:09:29,318 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2020-07-11 01:09:29,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-07-11 01:09:31,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 268. [2020-07-11 01:09:31,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:09:31,183 INFO L82 GeneralOperation]: Start isEquivalent. First operand 289 states. Second operand 268 states. [2020-07-11 01:09:31,183 INFO L74 IsIncluded]: Start isIncluded. First operand 289 states. Second operand 268 states. [2020-07-11 01:09:31,183 INFO L87 Difference]: Start difference. First operand 289 states. Second operand 268 states. [2020-07-11 01:09:31,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:09:31,189 INFO L93 Difference]: Finished difference Result 289 states and 316 transitions. [2020-07-11 01:09:31,189 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 316 transitions. [2020-07-11 01:09:31,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:09:31,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:09:31,190 INFO L74 IsIncluded]: Start isIncluded. First operand 268 states. Second operand 289 states. [2020-07-11 01:09:31,190 INFO L87 Difference]: Start difference. First operand 268 states. Second operand 289 states. [2020-07-11 01:09:31,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:09:31,196 INFO L93 Difference]: Finished difference Result 289 states and 316 transitions. [2020-07-11 01:09:31,196 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 316 transitions. [2020-07-11 01:09:31,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:09:31,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:09:31,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:09:31,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:09:31,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2020-07-11 01:09:31,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 293 transitions. [2020-07-11 01:09:31,202 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 293 transitions. Word has length 54 [2020-07-11 01:09:31,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:09:31,202 INFO L479 AbstractCegarLoop]: Abstraction has 268 states and 293 transitions. [2020-07-11 01:09:31,202 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-11 01:09:31,202 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 268 states and 293 transitions. [2020-07-11 01:09:32,177 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 293 edges. 293 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:09:32,177 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 293 transitions. [2020-07-11 01:09:32,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-07-11 01:09:32,178 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:09:32,179 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-11 01:09:32,179 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-11 01:09:32,179 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:09:32,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:09:32,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1636675303, now seen corresponding path program 1 times [2020-07-11 01:09:32,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:09:32,180 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2146002208] [2020-07-11 01:09:32,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:09:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:09:32,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:09:32,607 INFO L280 TraceCheckUtils]: 0: Hoare triple {20270#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {20251#true} is VALID [2020-07-11 01:09:32,608 INFO L280 TraceCheckUtils]: 1: Hoare triple {20251#true} #valid := #valid[0 := 0]; {20251#true} is VALID [2020-07-11 01:09:32,608 INFO L280 TraceCheckUtils]: 2: Hoare triple {20251#true} assume 0 < #StackHeapBarrier; {20251#true} is VALID [2020-07-11 01:09:32,608 INFO L280 TraceCheckUtils]: 3: Hoare triple {20251#true} assume true; {20251#true} is VALID [2020-07-11 01:09:32,608 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {20251#true} {20251#true} #419#return; {20251#true} is VALID [2020-07-11 01:09:32,609 INFO L263 TraceCheckUtils]: 0: Hoare triple {20251#true} call ULTIMATE.init(); {20270#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:09:32,609 INFO L280 TraceCheckUtils]: 1: Hoare triple {20270#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {20251#true} is VALID [2020-07-11 01:09:32,609 INFO L280 TraceCheckUtils]: 2: Hoare triple {20251#true} #valid := #valid[0 := 0]; {20251#true} is VALID [2020-07-11 01:09:32,610 INFO L280 TraceCheckUtils]: 3: Hoare triple {20251#true} assume 0 < #StackHeapBarrier; {20251#true} is VALID [2020-07-11 01:09:32,610 INFO L280 TraceCheckUtils]: 4: Hoare triple {20251#true} assume true; {20251#true} is VALID [2020-07-11 01:09:32,610 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {20251#true} {20251#true} #419#return; {20251#true} is VALID [2020-07-11 01:09:32,610 INFO L263 TraceCheckUtils]: 6: Hoare triple {20251#true} call #t~ret28 := main(); {20251#true} is VALID [2020-07-11 01:09:32,611 INFO L280 TraceCheckUtils]: 7: Hoare triple {20251#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {20258#(= 1 (select |#valid| |main_#t~malloc0.base|))} is VALID [2020-07-11 01:09:32,612 INFO L280 TraceCheckUtils]: 8: Hoare triple {20258#(= 1 (select |#valid| |main_#t~malloc0.base|))} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {20259#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-11 01:09:32,612 INFO L280 TraceCheckUtils]: 9: Hoare triple {20259#(= 1 (select |#valid| main_~list~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {20259#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-11 01:09:32,613 INFO L280 TraceCheckUtils]: 10: Hoare triple {20259#(= 1 (select |#valid| main_~list~0.base))} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {20259#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-11 01:09:32,613 INFO L280 TraceCheckUtils]: 11: Hoare triple {20259#(= 1 (select |#valid| main_~list~0.base))} goto; {20259#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-11 01:09:32,614 INFO L280 TraceCheckUtils]: 12: Hoare triple {20259#(= 1 (select |#valid| main_~list~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {20259#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-11 01:09:32,614 INFO L280 TraceCheckUtils]: 13: Hoare triple {20259#(= 1 (select |#valid| main_~list~0.base))} assume !(0 != #t~nondet1); {20259#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-11 01:09:32,615 INFO L280 TraceCheckUtils]: 14: Hoare triple {20259#(= 1 (select |#valid| main_~list~0.base))} havoc #t~nondet1; {20259#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-11 01:09:32,616 INFO L280 TraceCheckUtils]: 15: Hoare triple {20259#(= 1 (select |#valid| main_~list~0.base))} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); srcloc: L993-10 {20260#(and (= 0 |main_#t~malloc2.offset|) (not (= |main_#t~malloc2.base| main_~list~0.base)))} is VALID [2020-07-11 01:09:32,617 INFO L280 TraceCheckUtils]: 16: Hoare triple {20260#(and (= 0 |main_#t~malloc2.offset|) (not (= |main_#t~malloc2.base| main_~list~0.base)))} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-11 {20261#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:09:32,617 INFO L280 TraceCheckUtils]: 17: Hoare triple {20261#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-12 {20262#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem3.base|) (= 0 |main_#t~mem3.offset|) (not (= |main_#t~mem3.base| main_~list~0.base)))} is VALID [2020-07-11 01:09:32,619 INFO L280 TraceCheckUtils]: 18: Hoare triple {20262#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem3.base|) (= 0 |main_#t~mem3.offset|) (not (= |main_#t~mem3.base| main_~list~0.base)))} SUMMARY for call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4); srcloc: L993-13 {20263#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-11 01:09:32,620 INFO L280 TraceCheckUtils]: 19: Hoare triple {20263#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} havoc #t~mem3.base, #t~mem3.offset; {20263#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-11 01:09:32,621 INFO L280 TraceCheckUtils]: 20: Hoare triple {20263#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-15 {20264#(and (= 0 (select (store (select |#memory_$Pointer$.base| |main_#t~mem4.base|) (+ |main_#t~mem4.offset| 4) 0) 0)) (= 0 (select (store (select |#memory_$Pointer$.offset| |main_#t~mem4.base|) (+ |main_#t~mem4.offset| 4) 0) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= |main_#t~mem4.base| main_~list~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem4.base|))} is VALID [2020-07-11 01:09:32,623 INFO L280 TraceCheckUtils]: 21: Hoare triple {20264#(and (= 0 (select (store (select |#memory_$Pointer$.base| |main_#t~mem4.base|) (+ |main_#t~mem4.offset| 4) 0) 0)) (= 0 (select (store (select |#memory_$Pointer$.offset| |main_#t~mem4.base|) (+ |main_#t~mem4.offset| 4) 0) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= |main_#t~mem4.base| main_~list~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem4.base|))} SUMMARY for call write~$Pointer$(0, 0, #t~mem4.base, 4 + #t~mem4.offset, 4); srcloc: L993-16 {20265#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-11 01:09:32,624 INFO L280 TraceCheckUtils]: 22: Hoare triple {20265#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} havoc #t~mem4.base, #t~mem4.offset; {20265#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-11 01:09:32,625 INFO L280 TraceCheckUtils]: 23: Hoare triple {20265#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {20265#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-11 01:09:32,626 INFO L280 TraceCheckUtils]: 24: Hoare triple {20265#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {20265#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-11 01:09:32,627 INFO L280 TraceCheckUtils]: 25: Hoare triple {20265#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} assume #t~short7; {20265#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-11 01:09:32,628 INFO L280 TraceCheckUtils]: 26: Hoare triple {20265#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} assume !!#t~short7; {20265#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-11 01:09:32,629 INFO L280 TraceCheckUtils]: 27: Hoare triple {20265#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} havoc #t~mem5.base, #t~mem5.offset; {20265#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-11 01:09:32,629 INFO L280 TraceCheckUtils]: 28: Hoare triple {20265#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} havoc #t~short7; {20265#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-11 01:09:32,630 INFO L280 TraceCheckUtils]: 29: Hoare triple {20265#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} havoc #t~mem6.base, #t~mem6.offset; {20265#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-11 01:09:32,631 INFO L280 TraceCheckUtils]: 30: Hoare triple {20265#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} goto; {20265#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-11 01:09:32,632 INFO L280 TraceCheckUtils]: 31: Hoare triple {20265#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {20265#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-11 01:09:32,632 INFO L280 TraceCheckUtils]: 32: Hoare triple {20265#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {20265#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-11 01:09:32,633 INFO L280 TraceCheckUtils]: 33: Hoare triple {20265#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} assume !(0 != #t~nondet8); {20265#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-11 01:09:32,634 INFO L280 TraceCheckUtils]: 34: Hoare triple {20265#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} havoc #t~nondet8; {20265#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-11 01:09:32,635 INFO L280 TraceCheckUtils]: 35: Hoare triple {20265#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} ~end~0.base, ~end~0.offset := 0, 0; {20265#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-11 01:09:32,636 INFO L280 TraceCheckUtils]: 36: Hoare triple {20265#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {20266#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0)))} is VALID [2020-07-11 01:09:32,636 INFO L280 TraceCheckUtils]: 37: Hoare triple {20266#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0)))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {20266#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0)))} is VALID [2020-07-11 01:09:32,642 INFO L280 TraceCheckUtils]: 38: Hoare triple {20266#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0)))} goto; {20266#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0)))} is VALID [2020-07-11 01:09:32,643 INFO L280 TraceCheckUtils]: 39: Hoare triple {20266#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0)))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {20266#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0)))} is VALID [2020-07-11 01:09:32,644 INFO L280 TraceCheckUtils]: 40: Hoare triple {20266#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0)))} ~len~0 := 0; {20266#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0)))} is VALID [2020-07-11 01:09:32,644 INFO L280 TraceCheckUtils]: 41: Hoare triple {20266#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0)))} SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 {20267#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) 0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) 0)) (= 0 |main_#t~mem18.offset|))} is VALID [2020-07-11 01:09:32,645 INFO L280 TraceCheckUtils]: 42: Hoare triple {20267#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) 0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) 0)) (= 0 |main_#t~mem18.offset|))} ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; {20268#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} is VALID [2020-07-11 01:09:32,646 INFO L280 TraceCheckUtils]: 43: Hoare triple {20268#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} havoc #t~mem18.base, #t~mem18.offset; {20268#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} is VALID [2020-07-11 01:09:32,647 INFO L280 TraceCheckUtils]: 44: Hoare triple {20268#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {20268#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} is VALID [2020-07-11 01:09:32,648 INFO L280 TraceCheckUtils]: 45: Hoare triple {20268#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} assume 0 == ~len~0; {20268#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} is VALID [2020-07-11 01:09:32,648 INFO L280 TraceCheckUtils]: 46: Hoare triple {20268#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} ~len~0 := 1; {20268#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} is VALID [2020-07-11 01:09:32,649 INFO L280 TraceCheckUtils]: 47: Hoare triple {20268#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {20268#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} is VALID [2020-07-11 01:09:32,650 INFO L280 TraceCheckUtils]: 48: Hoare triple {20268#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} goto; {20268#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} is VALID [2020-07-11 01:09:32,650 INFO L280 TraceCheckUtils]: 49: Hoare triple {20268#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} SUMMARY for call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); srcloc: L1025-6 {20268#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} is VALID [2020-07-11 01:09:32,651 INFO L280 TraceCheckUtils]: 50: Hoare triple {20268#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} assume !!(0 == #t~mem19.base && 0 == #t~mem19.offset); {20268#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} is VALID [2020-07-11 01:09:32,652 INFO L280 TraceCheckUtils]: 51: Hoare triple {20268#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} havoc #t~mem19.base, #t~mem19.offset; {20268#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} is VALID [2020-07-11 01:09:32,653 INFO L280 TraceCheckUtils]: 52: Hoare triple {20268#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} goto; {20268#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} is VALID [2020-07-11 01:09:32,653 INFO L280 TraceCheckUtils]: 53: Hoare triple {20268#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} SUMMARY for call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~inner~0.base, ~inner~0.offset, 4); srcloc: L1026-6 {20269#(and (= 0 |main_#t~mem20.base|) (= 0 |main_#t~mem20.offset|))} is VALID [2020-07-11 01:09:32,654 INFO L280 TraceCheckUtils]: 54: Hoare triple {20269#(and (= 0 |main_#t~mem20.base|) (= 0 |main_#t~mem20.offset|))} assume !(0 == #t~mem20.base && 0 == #t~mem20.offset); {20252#false} is VALID [2020-07-11 01:09:32,654 INFO L280 TraceCheckUtils]: 55: Hoare triple {20252#false} havoc #t~mem20.base, #t~mem20.offset; {20252#false} is VALID [2020-07-11 01:09:32,654 INFO L280 TraceCheckUtils]: 56: Hoare triple {20252#false} assume !false; {20252#false} is VALID [2020-07-11 01:09:32,670 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-11 01:09:32,670 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2146002208] [2020-07-11 01:09:32,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:09:32,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-11 01:09:32,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641884449] [2020-07-11 01:09:32,671 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2020-07-11 01:09:32,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:09:32,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-11 01:09:32,744 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:09:32,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-11 01:09:32,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:09:32,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-11 01:09:32,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-07-11 01:09:32,745 INFO L87 Difference]: Start difference. First operand 268 states and 293 transitions. Second operand 15 states. [2020-07-11 01:09:44,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:09:44,166 INFO L93 Difference]: Finished difference Result 722 states and 782 transitions. [2020-07-11 01:09:44,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-07-11 01:09:44,166 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2020-07-11 01:09:44,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:09:44,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-11 01:09:44,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 543 transitions. [2020-07-11 01:09:44,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-11 01:09:44,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 543 transitions. [2020-07-11 01:09:44,172 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 543 transitions. [2020-07-11 01:09:45,011 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 543 edges. 543 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:09:45,035 INFO L225 Difference]: With dead ends: 722 [2020-07-11 01:09:45,036 INFO L226 Difference]: Without dead ends: 719 [2020-07-11 01:09:45,037 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=272, Invalid=850, Unknown=0, NotChecked=0, Total=1122 [2020-07-11 01:09:45,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2020-07-11 01:09:47,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 272. [2020-07-11 01:09:47,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:09:47,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 719 states. Second operand 272 states. [2020-07-11 01:09:47,358 INFO L74 IsIncluded]: Start isIncluded. First operand 719 states. Second operand 272 states. [2020-07-11 01:09:47,358 INFO L87 Difference]: Start difference. First operand 719 states. Second operand 272 states. [2020-07-11 01:09:47,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:09:47,381 INFO L93 Difference]: Finished difference Result 719 states and 779 transitions. [2020-07-11 01:09:47,381 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 779 transitions. [2020-07-11 01:09:47,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:09:47,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:09:47,382 INFO L74 IsIncluded]: Start isIncluded. First operand 272 states. Second operand 719 states. [2020-07-11 01:09:47,383 INFO L87 Difference]: Start difference. First operand 272 states. Second operand 719 states. [2020-07-11 01:09:47,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:09:47,403 INFO L93 Difference]: Finished difference Result 719 states and 779 transitions. [2020-07-11 01:09:47,403 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 779 transitions. [2020-07-11 01:09:47,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:09:47,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:09:47,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:09:47,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:09:47,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2020-07-11 01:09:47,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 297 transitions. [2020-07-11 01:09:47,411 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 297 transitions. Word has length 57 [2020-07-11 01:09:47,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:09:47,411 INFO L479 AbstractCegarLoop]: Abstraction has 272 states and 297 transitions. [2020-07-11 01:09:47,411 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-11 01:09:47,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 272 states and 297 transitions. [2020-07-11 01:09:48,553 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 297 edges. 297 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:09:48,554 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 297 transitions. [2020-07-11 01:09:48,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-11 01:09:48,555 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:09:48,555 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, 1] [2020-07-11 01:09:48,555 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-11 01:09:48,555 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:09:48,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:09:48,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1939208096, now seen corresponding path program 1 times [2020-07-11 01:09:48,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:09:48,556 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [873458400] [2020-07-11 01:09:48,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:09:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:09:48,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:09:48,607 INFO L280 TraceCheckUtils]: 0: Hoare triple {23745#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {23737#true} is VALID [2020-07-11 01:09:48,608 INFO L280 TraceCheckUtils]: 1: Hoare triple {23737#true} #valid := #valid[0 := 0]; {23737#true} is VALID [2020-07-11 01:09:48,608 INFO L280 TraceCheckUtils]: 2: Hoare triple {23737#true} assume 0 < #StackHeapBarrier; {23737#true} is VALID [2020-07-11 01:09:48,609 INFO L280 TraceCheckUtils]: 3: Hoare triple {23737#true} assume true; {23737#true} is VALID [2020-07-11 01:09:48,609 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {23737#true} {23737#true} #419#return; {23737#true} is VALID [2020-07-11 01:09:48,610 INFO L263 TraceCheckUtils]: 0: Hoare triple {23737#true} call ULTIMATE.init(); {23745#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:09:48,610 INFO L280 TraceCheckUtils]: 1: Hoare triple {23745#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {23737#true} is VALID [2020-07-11 01:09:48,610 INFO L280 TraceCheckUtils]: 2: Hoare triple {23737#true} #valid := #valid[0 := 0]; {23737#true} is VALID [2020-07-11 01:09:48,610 INFO L280 TraceCheckUtils]: 3: Hoare triple {23737#true} assume 0 < #StackHeapBarrier; {23737#true} is VALID [2020-07-11 01:09:48,611 INFO L280 TraceCheckUtils]: 4: Hoare triple {23737#true} assume true; {23737#true} is VALID [2020-07-11 01:09:48,611 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {23737#true} {23737#true} #419#return; {23737#true} is VALID [2020-07-11 01:09:48,611 INFO L263 TraceCheckUtils]: 6: Hoare triple {23737#true} call #t~ret28 := main(); {23737#true} is VALID [2020-07-11 01:09:48,611 INFO L280 TraceCheckUtils]: 7: Hoare triple {23737#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {23737#true} is VALID [2020-07-11 01:09:48,611 INFO L280 TraceCheckUtils]: 8: Hoare triple {23737#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {23737#true} is VALID [2020-07-11 01:09:48,612 INFO L280 TraceCheckUtils]: 9: Hoare triple {23737#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {23737#true} is VALID [2020-07-11 01:09:48,612 INFO L280 TraceCheckUtils]: 10: Hoare triple {23737#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {23737#true} is VALID [2020-07-11 01:09:48,612 INFO L280 TraceCheckUtils]: 11: Hoare triple {23737#true} goto; {23737#true} is VALID [2020-07-11 01:09:48,612 INFO L280 TraceCheckUtils]: 12: Hoare triple {23737#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {23737#true} is VALID [2020-07-11 01:09:48,612 INFO L280 TraceCheckUtils]: 13: Hoare triple {23737#true} assume !(0 != #t~nondet1); {23737#true} is VALID [2020-07-11 01:09:48,613 INFO L280 TraceCheckUtils]: 14: Hoare triple {23737#true} havoc #t~nondet1; {23737#true} is VALID [2020-07-11 01:09:48,613 INFO L280 TraceCheckUtils]: 15: Hoare triple {23737#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); srcloc: L993-10 {23737#true} is VALID [2020-07-11 01:09:48,613 INFO L280 TraceCheckUtils]: 16: Hoare triple {23737#true} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-11 {23737#true} is VALID [2020-07-11 01:09:48,613 INFO L280 TraceCheckUtils]: 17: Hoare triple {23737#true} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-12 {23737#true} is VALID [2020-07-11 01:09:48,613 INFO L280 TraceCheckUtils]: 18: Hoare triple {23737#true} SUMMARY for call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4); srcloc: L993-13 {23737#true} is VALID [2020-07-11 01:09:48,613 INFO L280 TraceCheckUtils]: 19: Hoare triple {23737#true} havoc #t~mem3.base, #t~mem3.offset; {23737#true} is VALID [2020-07-11 01:09:48,614 INFO L280 TraceCheckUtils]: 20: Hoare triple {23737#true} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-15 {23737#true} is VALID [2020-07-11 01:09:48,614 INFO L280 TraceCheckUtils]: 21: Hoare triple {23737#true} SUMMARY for call write~$Pointer$(0, 0, #t~mem4.base, 4 + #t~mem4.offset, 4); srcloc: L993-16 {23737#true} is VALID [2020-07-11 01:09:48,614 INFO L280 TraceCheckUtils]: 22: Hoare triple {23737#true} havoc #t~mem4.base, #t~mem4.offset; {23737#true} is VALID [2020-07-11 01:09:48,614 INFO L280 TraceCheckUtils]: 23: Hoare triple {23737#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {23737#true} is VALID [2020-07-11 01:09:48,614 INFO L280 TraceCheckUtils]: 24: Hoare triple {23737#true} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {23737#true} is VALID [2020-07-11 01:09:48,614 INFO L280 TraceCheckUtils]: 25: Hoare triple {23737#true} assume #t~short7; {23737#true} is VALID [2020-07-11 01:09:48,615 INFO L280 TraceCheckUtils]: 26: Hoare triple {23737#true} assume !!#t~short7; {23737#true} is VALID [2020-07-11 01:09:48,615 INFO L280 TraceCheckUtils]: 27: Hoare triple {23737#true} havoc #t~mem5.base, #t~mem5.offset; {23737#true} is VALID [2020-07-11 01:09:48,615 INFO L280 TraceCheckUtils]: 28: Hoare triple {23737#true} havoc #t~short7; {23737#true} is VALID [2020-07-11 01:09:48,615 INFO L280 TraceCheckUtils]: 29: Hoare triple {23737#true} havoc #t~mem6.base, #t~mem6.offset; {23737#true} is VALID [2020-07-11 01:09:48,615 INFO L280 TraceCheckUtils]: 30: Hoare triple {23737#true} goto; {23737#true} is VALID [2020-07-11 01:09:48,616 INFO L280 TraceCheckUtils]: 31: Hoare triple {23737#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {23737#true} is VALID [2020-07-11 01:09:48,616 INFO L280 TraceCheckUtils]: 32: Hoare triple {23737#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {23737#true} is VALID [2020-07-11 01:09:48,616 INFO L280 TraceCheckUtils]: 33: Hoare triple {23737#true} assume !(0 != #t~nondet8); {23737#true} is VALID [2020-07-11 01:09:48,616 INFO L280 TraceCheckUtils]: 34: Hoare triple {23737#true} havoc #t~nondet8; {23737#true} is VALID [2020-07-11 01:09:48,616 INFO L280 TraceCheckUtils]: 35: Hoare triple {23737#true} ~end~0.base, ~end~0.offset := 0, 0; {23737#true} is VALID [2020-07-11 01:09:48,617 INFO L280 TraceCheckUtils]: 36: Hoare triple {23737#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {23737#true} is VALID [2020-07-11 01:09:48,617 INFO L280 TraceCheckUtils]: 37: Hoare triple {23737#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {23737#true} is VALID [2020-07-11 01:09:48,617 INFO L280 TraceCheckUtils]: 38: Hoare triple {23737#true} goto; {23737#true} is VALID [2020-07-11 01:09:48,617 INFO L280 TraceCheckUtils]: 39: Hoare triple {23737#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {23737#true} is VALID [2020-07-11 01:09:48,617 INFO L280 TraceCheckUtils]: 40: Hoare triple {23737#true} ~len~0 := 0; {23737#true} is VALID [2020-07-11 01:09:48,617 INFO L280 TraceCheckUtils]: 41: Hoare triple {23737#true} SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 {23737#true} is VALID [2020-07-11 01:09:48,618 INFO L280 TraceCheckUtils]: 42: Hoare triple {23737#true} ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; {23737#true} is VALID [2020-07-11 01:09:48,618 INFO L280 TraceCheckUtils]: 43: Hoare triple {23737#true} havoc #t~mem18.base, #t~mem18.offset; {23737#true} is VALID [2020-07-11 01:09:48,618 INFO L280 TraceCheckUtils]: 44: Hoare triple {23737#true} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {23737#true} is VALID [2020-07-11 01:09:48,618 INFO L280 TraceCheckUtils]: 45: Hoare triple {23737#true} assume !!(~len~0 <= 1); {23737#true} is VALID [2020-07-11 01:09:48,618 INFO L280 TraceCheckUtils]: 46: Hoare triple {23737#true} goto; {23737#true} is VALID [2020-07-11 01:09:48,618 INFO L280 TraceCheckUtils]: 47: Hoare triple {23737#true} SUMMARY for call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1031-4 {23737#true} is VALID [2020-07-11 01:09:48,619 INFO L280 TraceCheckUtils]: 48: Hoare triple {23737#true} ~end~0.base, ~end~0.offset := #t~mem23.base, #t~mem23.offset; {23737#true} is VALID [2020-07-11 01:09:48,619 INFO L280 TraceCheckUtils]: 49: Hoare triple {23737#true} havoc #t~mem23.base, #t~mem23.offset; {23737#true} is VALID [2020-07-11 01:09:48,619 INFO L280 TraceCheckUtils]: 50: Hoare triple {23737#true} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {23737#true} is VALID [2020-07-11 01:09:48,619 INFO L280 TraceCheckUtils]: 51: Hoare triple {23737#true} assume !!(0 != ~list~0.base || 0 != ~list~0.offset); {23737#true} is VALID [2020-07-11 01:09:48,619 INFO L280 TraceCheckUtils]: 52: Hoare triple {23737#true} SUMMARY for call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L1039 {23737#true} is VALID [2020-07-11 01:09:48,619 INFO L280 TraceCheckUtils]: 53: Hoare triple {23737#true} ~end~0.base, ~end~0.offset := #t~mem24.base, #t~mem24.offset; {23737#true} is VALID [2020-07-11 01:09:48,620 INFO L280 TraceCheckUtils]: 54: Hoare triple {23737#true} havoc #t~mem24.base, #t~mem24.offset; {23737#true} is VALID [2020-07-11 01:09:48,620 INFO L280 TraceCheckUtils]: 55: Hoare triple {23737#true} assume 0 != ~end~0.base || 0 != ~end~0.offset; {23744#(or (not (= 0 main_~end~0.base)) (not (= 0 main_~end~0.offset)))} is VALID [2020-07-11 01:09:48,621 INFO L280 TraceCheckUtils]: 56: Hoare triple {23744#(or (not (= 0 main_~end~0.base)) (not (= 0 main_~end~0.offset)))} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {23738#false} is VALID [2020-07-11 01:09:48,621 INFO L280 TraceCheckUtils]: 57: Hoare triple {23738#false} assume !false; {23738#false} is VALID [2020-07-11 01:09:48,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-11 01:09:48,624 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [873458400] [2020-07-11 01:09:48,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:09:48,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-11 01:09:48,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375531032] [2020-07-11 01:09:48,625 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2020-07-11 01:09:48,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:09:48,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-11 01:09:48,680 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:09:48,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-11 01:09:48,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:09:48,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-11 01:09:48,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-11 01:09:48,681 INFO L87 Difference]: Start difference. First operand 272 states and 297 transitions. Second operand 4 states. [2020-07-11 01:09:51,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:09:51,328 INFO L93 Difference]: Finished difference Result 277 states and 302 transitions. [2020-07-11 01:09:51,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-11 01:09:51,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2020-07-11 01:09:51,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:09:51,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 01:09:51,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2020-07-11 01:09:51,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 01:09:51,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2020-07-11 01:09:51,330 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 167 transitions. [2020-07-11 01:09:51,521 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:09:51,527 INFO L225 Difference]: With dead ends: 277 [2020-07-11 01:09:51,527 INFO L226 Difference]: Without dead ends: 275 [2020-07-11 01:09:51,527 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-11 01:09:51,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-07-11 01:09:53,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 270. [2020-07-11 01:09:53,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:09:53,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 275 states. Second operand 270 states. [2020-07-11 01:09:53,648 INFO L74 IsIncluded]: Start isIncluded. First operand 275 states. Second operand 270 states. [2020-07-11 01:09:53,648 INFO L87 Difference]: Start difference. First operand 275 states. Second operand 270 states. [2020-07-11 01:09:53,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:09:53,653 INFO L93 Difference]: Finished difference Result 275 states and 300 transitions. [2020-07-11 01:09:53,653 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 300 transitions. [2020-07-11 01:09:53,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:09:53,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:09:53,654 INFO L74 IsIncluded]: Start isIncluded. First operand 270 states. Second operand 275 states. [2020-07-11 01:09:53,654 INFO L87 Difference]: Start difference. First operand 270 states. Second operand 275 states. [2020-07-11 01:09:53,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:09:53,660 INFO L93 Difference]: Finished difference Result 275 states and 300 transitions. [2020-07-11 01:09:53,660 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 300 transitions. [2020-07-11 01:09:53,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:09:53,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:09:53,661 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:09:53,661 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:09:53,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2020-07-11 01:09:53,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 295 transitions. [2020-07-11 01:09:53,668 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 295 transitions. Word has length 58 [2020-07-11 01:09:53,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:09:53,669 INFO L479 AbstractCegarLoop]: Abstraction has 270 states and 295 transitions. [2020-07-11 01:09:53,669 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-11 01:09:53,669 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 270 states and 295 transitions. [2020-07-11 01:09:54,846 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 295 edges. 295 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:09:54,846 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 295 transitions. [2020-07-11 01:09:54,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-07-11 01:09:54,848 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:09:54,848 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:09:54,848 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-11 01:09:54,849 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:09:54,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:09:54,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1792411396, now seen corresponding path program 1 times [2020-07-11 01:09:54,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:09:54,850 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [150765306] [2020-07-11 01:09:54,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:09:54,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:09:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:09:54,980 INFO L280 TraceCheckUtils]: 0: Hoare triple {25403#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {25392#true} is VALID [2020-07-11 01:09:54,980 INFO L280 TraceCheckUtils]: 1: Hoare triple {25392#true} #valid := #valid[0 := 0]; {25392#true} is VALID [2020-07-11 01:09:54,981 INFO L280 TraceCheckUtils]: 2: Hoare triple {25392#true} assume 0 < #StackHeapBarrier; {25392#true} is VALID [2020-07-11 01:09:54,981 INFO L280 TraceCheckUtils]: 3: Hoare triple {25392#true} assume true; {25392#true} is VALID [2020-07-11 01:09:54,981 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {25392#true} {25392#true} #419#return; {25392#true} is VALID [2020-07-11 01:09:54,982 INFO L263 TraceCheckUtils]: 0: Hoare triple {25392#true} call ULTIMATE.init(); {25403#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:09:54,982 INFO L280 TraceCheckUtils]: 1: Hoare triple {25403#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {25392#true} is VALID [2020-07-11 01:09:54,982 INFO L280 TraceCheckUtils]: 2: Hoare triple {25392#true} #valid := #valid[0 := 0]; {25392#true} is VALID [2020-07-11 01:09:54,982 INFO L280 TraceCheckUtils]: 3: Hoare triple {25392#true} assume 0 < #StackHeapBarrier; {25392#true} is VALID [2020-07-11 01:09:54,983 INFO L280 TraceCheckUtils]: 4: Hoare triple {25392#true} assume true; {25392#true} is VALID [2020-07-11 01:09:54,983 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {25392#true} {25392#true} #419#return; {25392#true} is VALID [2020-07-11 01:09:54,983 INFO L263 TraceCheckUtils]: 6: Hoare triple {25392#true} call #t~ret28 := main(); {25392#true} is VALID [2020-07-11 01:09:54,983 INFO L280 TraceCheckUtils]: 7: Hoare triple {25392#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {25392#true} is VALID [2020-07-11 01:09:54,983 INFO L280 TraceCheckUtils]: 8: Hoare triple {25392#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {25392#true} is VALID [2020-07-11 01:09:54,985 INFO L280 TraceCheckUtils]: 9: Hoare triple {25392#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {25399#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-11 01:09:54,986 INFO L280 TraceCheckUtils]: 10: Hoare triple {25399#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {25399#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-11 01:09:54,987 INFO L280 TraceCheckUtils]: 11: Hoare triple {25399#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} goto; {25399#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-11 01:09:54,988 INFO L280 TraceCheckUtils]: 12: Hoare triple {25399#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {25399#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-11 01:09:54,988 INFO L280 TraceCheckUtils]: 13: Hoare triple {25399#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} assume 0 != #t~nondet1; {25399#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-11 01:09:54,989 INFO L280 TraceCheckUtils]: 14: Hoare triple {25399#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} havoc #t~nondet1; {25399#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-11 01:09:54,990 INFO L280 TraceCheckUtils]: 15: Hoare triple {25399#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {25399#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-11 01:09:54,991 INFO L280 TraceCheckUtils]: 16: Hoare triple {25399#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {25399#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-11 01:09:54,992 INFO L280 TraceCheckUtils]: 17: Hoare triple {25399#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {25399#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-11 01:09:54,992 INFO L280 TraceCheckUtils]: 18: Hoare triple {25399#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} assume !#t~short7; {25399#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-11 01:09:54,993 INFO L280 TraceCheckUtils]: 19: Hoare triple {25399#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-22 {25399#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-11 01:09:54,994 INFO L280 TraceCheckUtils]: 20: Hoare triple {25399#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {25399#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-11 01:09:54,994 INFO L280 TraceCheckUtils]: 21: Hoare triple {25399#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} assume !!#t~short7; {25399#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-11 01:09:54,995 INFO L280 TraceCheckUtils]: 22: Hoare triple {25399#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} havoc #t~mem5.base, #t~mem5.offset; {25399#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-11 01:09:54,995 INFO L280 TraceCheckUtils]: 23: Hoare triple {25399#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} havoc #t~short7; {25399#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-11 01:09:54,998 INFO L280 TraceCheckUtils]: 24: Hoare triple {25399#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} havoc #t~mem6.base, #t~mem6.offset; {25399#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-11 01:09:55,001 INFO L280 TraceCheckUtils]: 25: Hoare triple {25399#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} goto; {25399#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-11 01:09:55,002 INFO L280 TraceCheckUtils]: 26: Hoare triple {25399#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {25399#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-11 01:09:55,003 INFO L280 TraceCheckUtils]: 27: Hoare triple {25399#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {25399#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-11 01:09:55,004 INFO L280 TraceCheckUtils]: 28: Hoare triple {25399#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} assume !(0 != #t~nondet8); {25399#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-11 01:09:55,005 INFO L280 TraceCheckUtils]: 29: Hoare triple {25399#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} havoc #t~nondet8; {25399#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-11 01:09:55,005 INFO L280 TraceCheckUtils]: 30: Hoare triple {25399#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} ~end~0.base, ~end~0.offset := 0, 0; {25399#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-11 01:09:55,006 INFO L280 TraceCheckUtils]: 31: Hoare triple {25399#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {25400#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-11 01:09:55,007 INFO L280 TraceCheckUtils]: 32: Hoare triple {25400#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {25400#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-11 01:09:55,007 INFO L280 TraceCheckUtils]: 33: Hoare triple {25400#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} goto; {25400#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-11 01:09:55,008 INFO L280 TraceCheckUtils]: 34: Hoare triple {25400#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {25400#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-11 01:09:55,009 INFO L280 TraceCheckUtils]: 35: Hoare triple {25400#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} ~len~0 := 0; {25400#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-11 01:09:55,010 INFO L280 TraceCheckUtils]: 36: Hoare triple {25400#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 {25400#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-11 01:09:55,010 INFO L280 TraceCheckUtils]: 37: Hoare triple {25400#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; {25400#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-11 01:09:55,011 INFO L280 TraceCheckUtils]: 38: Hoare triple {25400#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} havoc #t~mem18.base, #t~mem18.offset; {25400#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-11 01:09:55,012 INFO L280 TraceCheckUtils]: 39: Hoare triple {25400#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {25400#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-11 01:09:55,012 INFO L280 TraceCheckUtils]: 40: Hoare triple {25400#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} assume !!(~len~0 <= 1); {25400#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-11 01:09:55,013 INFO L280 TraceCheckUtils]: 41: Hoare triple {25400#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} goto; {25400#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-11 01:09:55,013 INFO L280 TraceCheckUtils]: 42: Hoare triple {25400#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} SUMMARY for call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1031-4 {25401#(and (= 0 |main_#t~mem23.base|) (= |main_#t~mem23.offset| 0))} is VALID [2020-07-11 01:09:55,014 INFO L280 TraceCheckUtils]: 43: Hoare triple {25401#(and (= 0 |main_#t~mem23.base|) (= |main_#t~mem23.offset| 0))} ~end~0.base, ~end~0.offset := #t~mem23.base, #t~mem23.offset; {25402#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} is VALID [2020-07-11 01:09:55,014 INFO L280 TraceCheckUtils]: 44: Hoare triple {25402#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} havoc #t~mem23.base, #t~mem23.offset; {25402#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} is VALID [2020-07-11 01:09:55,015 INFO L280 TraceCheckUtils]: 45: Hoare triple {25402#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {25393#false} is VALID [2020-07-11 01:09:55,015 INFO L280 TraceCheckUtils]: 46: Hoare triple {25393#false} ~len~0 := 0; {25393#false} is VALID [2020-07-11 01:09:55,015 INFO L280 TraceCheckUtils]: 47: Hoare triple {25393#false} SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 {25393#false} is VALID [2020-07-11 01:09:55,015 INFO L280 TraceCheckUtils]: 48: Hoare triple {25393#false} ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; {25393#false} is VALID [2020-07-11 01:09:55,016 INFO L280 TraceCheckUtils]: 49: Hoare triple {25393#false} havoc #t~mem18.base, #t~mem18.offset; {25393#false} is VALID [2020-07-11 01:09:55,016 INFO L280 TraceCheckUtils]: 50: Hoare triple {25393#false} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {25393#false} is VALID [2020-07-11 01:09:55,016 INFO L280 TraceCheckUtils]: 51: Hoare triple {25393#false} assume 0 == ~len~0; {25393#false} is VALID [2020-07-11 01:09:55,016 INFO L280 TraceCheckUtils]: 52: Hoare triple {25393#false} ~len~0 := 1; {25393#false} is VALID [2020-07-11 01:09:55,016 INFO L280 TraceCheckUtils]: 53: Hoare triple {25393#false} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {25393#false} is VALID [2020-07-11 01:09:55,017 INFO L280 TraceCheckUtils]: 54: Hoare triple {25393#false} goto; {25393#false} is VALID [2020-07-11 01:09:55,017 INFO L280 TraceCheckUtils]: 55: Hoare triple {25393#false} SUMMARY for call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); srcloc: L1025-6 {25393#false} is VALID [2020-07-11 01:09:55,017 INFO L280 TraceCheckUtils]: 56: Hoare triple {25393#false} assume !(0 == #t~mem19.base && 0 == #t~mem19.offset); {25393#false} is VALID [2020-07-11 01:09:55,017 INFO L280 TraceCheckUtils]: 57: Hoare triple {25393#false} havoc #t~mem19.base, #t~mem19.offset; {25393#false} is VALID [2020-07-11 01:09:55,018 INFO L280 TraceCheckUtils]: 58: Hoare triple {25393#false} assume !false; {25393#false} is VALID [2020-07-11 01:09:55,027 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 01:09:55,027 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [150765306] [2020-07-11 01:09:55,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 01:09:55,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-11 01:09:55,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834706906] [2020-07-11 01:09:55,028 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2020-07-11 01:09:55,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:09:55,028 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 01:09:55,104 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:09:55,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 01:09:55,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:09:55,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 01:09:55,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-11 01:09:55,106 INFO L87 Difference]: Start difference. First operand 270 states and 295 transitions. Second operand 7 states. [2020-07-11 01:09:59,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:09:59,260 INFO L93 Difference]: Finished difference Result 421 states and 458 transitions. [2020-07-11 01:09:59,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-11 01:09:59,260 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2020-07-11 01:09:59,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:09:59,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 01:09:59,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 313 transitions. [2020-07-11 01:09:59,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 01:09:59,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 313 transitions. [2020-07-11 01:09:59,264 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 313 transitions. [2020-07-11 01:09:59,635 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 313 edges. 313 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:09:59,641 INFO L225 Difference]: With dead ends: 421 [2020-07-11 01:09:59,641 INFO L226 Difference]: Without dead ends: 312 [2020-07-11 01:09:59,642 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-07-11 01:09:59,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2020-07-11 01:10:02,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 270. [2020-07-11 01:10:02,062 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:10:02,062 INFO L82 GeneralOperation]: Start isEquivalent. First operand 312 states. Second operand 270 states. [2020-07-11 01:10:02,062 INFO L74 IsIncluded]: Start isIncluded. First operand 312 states. Second operand 270 states. [2020-07-11 01:10:02,062 INFO L87 Difference]: Start difference. First operand 312 states. Second operand 270 states. [2020-07-11 01:10:02,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:02,067 INFO L93 Difference]: Finished difference Result 312 states and 333 transitions. [2020-07-11 01:10:02,068 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 333 transitions. [2020-07-11 01:10:02,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:10:02,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:10:02,068 INFO L74 IsIncluded]: Start isIncluded. First operand 270 states. Second operand 312 states. [2020-07-11 01:10:02,068 INFO L87 Difference]: Start difference. First operand 270 states. Second operand 312 states. [2020-07-11 01:10:02,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:02,075 INFO L93 Difference]: Finished difference Result 312 states and 333 transitions. [2020-07-11 01:10:02,076 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 333 transitions. [2020-07-11 01:10:02,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:10:02,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:10:02,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:10:02,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:10:02,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2020-07-11 01:10:02,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 293 transitions. [2020-07-11 01:10:02,086 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 293 transitions. Word has length 59 [2020-07-11 01:10:02,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:10:02,087 INFO L479 AbstractCegarLoop]: Abstraction has 270 states and 293 transitions. [2020-07-11 01:10:02,087 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 01:10:02,087 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 270 states and 293 transitions. [2020-07-11 01:10:03,360 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 293 edges. 293 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:10:03,360 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 293 transitions. [2020-07-11 01:10:03,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-07-11 01:10:03,361 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:10:03,361 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, 1, 1, 1, 1, 1] [2020-07-11 01:10:03,362 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-11 01:10:03,362 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:10:03,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:10:03,362 INFO L82 PathProgramCache]: Analyzing trace with hash -984681049, now seen corresponding path program 1 times [2020-07-11 01:10:03,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:10:03,363 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [867724184] [2020-07-11 01:10:03,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:10:03,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:03,678 INFO L280 TraceCheckUtils]: 0: Hoare triple {27440#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {27420#true} is VALID [2020-07-11 01:10:03,678 INFO L280 TraceCheckUtils]: 1: Hoare triple {27420#true} #valid := #valid[0 := 0]; {27420#true} is VALID [2020-07-11 01:10:03,679 INFO L280 TraceCheckUtils]: 2: Hoare triple {27420#true} assume 0 < #StackHeapBarrier; {27420#true} is VALID [2020-07-11 01:10:03,679 INFO L280 TraceCheckUtils]: 3: Hoare triple {27420#true} assume true; {27420#true} is VALID [2020-07-11 01:10:03,679 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {27420#true} {27420#true} #419#return; {27420#true} is VALID [2020-07-11 01:10:03,680 INFO L263 TraceCheckUtils]: 0: Hoare triple {27420#true} call ULTIMATE.init(); {27440#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:10:03,680 INFO L280 TraceCheckUtils]: 1: Hoare triple {27440#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {27420#true} is VALID [2020-07-11 01:10:03,680 INFO L280 TraceCheckUtils]: 2: Hoare triple {27420#true} #valid := #valid[0 := 0]; {27420#true} is VALID [2020-07-11 01:10:03,680 INFO L280 TraceCheckUtils]: 3: Hoare triple {27420#true} assume 0 < #StackHeapBarrier; {27420#true} is VALID [2020-07-11 01:10:03,681 INFO L280 TraceCheckUtils]: 4: Hoare triple {27420#true} assume true; {27420#true} is VALID [2020-07-11 01:10:03,681 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {27420#true} {27420#true} #419#return; {27420#true} is VALID [2020-07-11 01:10:03,681 INFO L263 TraceCheckUtils]: 6: Hoare triple {27420#true} call #t~ret28 := main(); {27420#true} is VALID [2020-07-11 01:10:03,682 INFO L280 TraceCheckUtils]: 7: Hoare triple {27420#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {27427#(= 1 (select |#valid| |main_#t~malloc0.base|))} is VALID [2020-07-11 01:10:03,682 INFO L280 TraceCheckUtils]: 8: Hoare triple {27427#(= 1 (select |#valid| |main_#t~malloc0.base|))} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {27428#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-11 01:10:03,683 INFO L280 TraceCheckUtils]: 9: Hoare triple {27428#(= 1 (select |#valid| main_~list~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {27428#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-11 01:10:03,689 INFO L280 TraceCheckUtils]: 10: Hoare triple {27428#(= 1 (select |#valid| main_~list~0.base))} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {27428#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-11 01:10:03,690 INFO L280 TraceCheckUtils]: 11: Hoare triple {27428#(= 1 (select |#valid| main_~list~0.base))} goto; {27428#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-11 01:10:03,690 INFO L280 TraceCheckUtils]: 12: Hoare triple {27428#(= 1 (select |#valid| main_~list~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {27428#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-11 01:10:03,691 INFO L280 TraceCheckUtils]: 13: Hoare triple {27428#(= 1 (select |#valid| main_~list~0.base))} assume !(0 != #t~nondet1); {27428#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-11 01:10:03,691 INFO L280 TraceCheckUtils]: 14: Hoare triple {27428#(= 1 (select |#valid| main_~list~0.base))} havoc #t~nondet1; {27428#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-11 01:10:03,692 INFO L280 TraceCheckUtils]: 15: Hoare triple {27428#(= 1 (select |#valid| main_~list~0.base))} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); srcloc: L993-10 {27429#(and (= 0 |main_#t~malloc2.offset|) (not (= |main_#t~malloc2.base| main_~list~0.base)))} is VALID [2020-07-11 01:10:03,693 INFO L280 TraceCheckUtils]: 16: Hoare triple {27429#(and (= 0 |main_#t~malloc2.offset|) (not (= |main_#t~malloc2.base| main_~list~0.base)))} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-11 {27430#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:10:03,694 INFO L280 TraceCheckUtils]: 17: Hoare triple {27430#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-12 {27431#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem3.base|) (not (= |main_#t~mem3.base| main_~list~0.base)))} is VALID [2020-07-11 01:10:03,695 INFO L280 TraceCheckUtils]: 18: Hoare triple {27431#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem3.base|) (not (= |main_#t~mem3.base| main_~list~0.base)))} SUMMARY for call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4); srcloc: L993-13 {27430#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:10:03,696 INFO L280 TraceCheckUtils]: 19: Hoare triple {27430#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~mem3.base, #t~mem3.offset; {27430#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:10:03,697 INFO L280 TraceCheckUtils]: 20: Hoare triple {27430#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-15 {27432#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= |main_#t~mem4.base| main_~list~0.base)))} is VALID [2020-07-11 01:10:03,697 INFO L280 TraceCheckUtils]: 21: Hoare triple {27432#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= |main_#t~mem4.base| main_~list~0.base)))} SUMMARY for call write~$Pointer$(0, 0, #t~mem4.base, 4 + #t~mem4.offset, 4); srcloc: L993-16 {27433#(= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))} is VALID [2020-07-11 01:10:03,698 INFO L280 TraceCheckUtils]: 22: Hoare triple {27433#(= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))} havoc #t~mem4.base, #t~mem4.offset; {27433#(= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))} is VALID [2020-07-11 01:10:03,699 INFO L280 TraceCheckUtils]: 23: Hoare triple {27433#(= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {27434#(and (= 0 |main_#t~mem5.offset|) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem5.base|))} is VALID [2020-07-11 01:10:03,700 INFO L280 TraceCheckUtils]: 24: Hoare triple {27434#(and (= 0 |main_#t~mem5.offset|) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem5.base|))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {27435#(or (not |main_#t~short7|) (not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))))} is VALID [2020-07-11 01:10:03,700 INFO L280 TraceCheckUtils]: 25: Hoare triple {27435#(or (not |main_#t~short7|) (not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))))} assume #t~short7; {27436#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:10:03,701 INFO L280 TraceCheckUtils]: 26: Hoare triple {27436#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !!#t~short7; {27436#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:10:03,701 INFO L280 TraceCheckUtils]: 27: Hoare triple {27436#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~mem5.base, #t~mem5.offset; {27436#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:10:03,702 INFO L280 TraceCheckUtils]: 28: Hoare triple {27436#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~short7; {27436#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:10:03,702 INFO L280 TraceCheckUtils]: 29: Hoare triple {27436#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~mem6.base, #t~mem6.offset; {27436#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:10:03,703 INFO L280 TraceCheckUtils]: 30: Hoare triple {27436#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} goto; {27436#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:10:03,703 INFO L280 TraceCheckUtils]: 31: Hoare triple {27436#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {27436#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:10:03,704 INFO L280 TraceCheckUtils]: 32: Hoare triple {27436#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {27436#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:10:03,704 INFO L280 TraceCheckUtils]: 33: Hoare triple {27436#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !(0 != #t~nondet8); {27436#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:10:03,705 INFO L280 TraceCheckUtils]: 34: Hoare triple {27436#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~nondet8; {27436#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:10:03,705 INFO L280 TraceCheckUtils]: 35: Hoare triple {27436#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := 0, 0; {27436#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:10:03,706 INFO L280 TraceCheckUtils]: 36: Hoare triple {27436#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {27437#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} is VALID [2020-07-11 01:10:03,706 INFO L280 TraceCheckUtils]: 37: Hoare triple {27437#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {27437#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} is VALID [2020-07-11 01:10:03,707 INFO L280 TraceCheckUtils]: 38: Hoare triple {27437#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} goto; {27437#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} is VALID [2020-07-11 01:10:03,708 INFO L280 TraceCheckUtils]: 39: Hoare triple {27437#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {27437#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} is VALID [2020-07-11 01:10:03,709 INFO L280 TraceCheckUtils]: 40: Hoare triple {27437#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} ~len~0 := 0; {27437#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} is VALID [2020-07-11 01:10:03,709 INFO L280 TraceCheckUtils]: 41: Hoare triple {27437#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 {27438#(not (= 0 |main_#t~mem18.base|))} is VALID [2020-07-11 01:10:03,710 INFO L280 TraceCheckUtils]: 42: Hoare triple {27438#(not (= 0 |main_#t~mem18.base|))} ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; {27439#(not (= 0 main_~inner~0.base))} is VALID [2020-07-11 01:10:03,710 INFO L280 TraceCheckUtils]: 43: Hoare triple {27439#(not (= 0 main_~inner~0.base))} havoc #t~mem18.base, #t~mem18.offset; {27439#(not (= 0 main_~inner~0.base))} is VALID [2020-07-11 01:10:03,711 INFO L280 TraceCheckUtils]: 44: Hoare triple {27439#(not (= 0 main_~inner~0.base))} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {27421#false} is VALID [2020-07-11 01:10:03,711 INFO L280 TraceCheckUtils]: 45: Hoare triple {27421#false} assume !!(~len~0 <= 1); {27421#false} is VALID [2020-07-11 01:10:03,711 INFO L280 TraceCheckUtils]: 46: Hoare triple {27421#false} goto; {27421#false} is VALID [2020-07-11 01:10:03,712 INFO L280 TraceCheckUtils]: 47: Hoare triple {27421#false} SUMMARY for call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1031-4 {27421#false} is VALID [2020-07-11 01:10:03,712 INFO L280 TraceCheckUtils]: 48: Hoare triple {27421#false} ~end~0.base, ~end~0.offset := #t~mem23.base, #t~mem23.offset; {27421#false} is VALID [2020-07-11 01:10:03,712 INFO L280 TraceCheckUtils]: 49: Hoare triple {27421#false} havoc #t~mem23.base, #t~mem23.offset; {27421#false} is VALID [2020-07-11 01:10:03,712 INFO L280 TraceCheckUtils]: 50: Hoare triple {27421#false} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {27421#false} is VALID [2020-07-11 01:10:03,712 INFO L280 TraceCheckUtils]: 51: Hoare triple {27421#false} assume !!(0 != ~list~0.base || 0 != ~list~0.offset); {27421#false} is VALID [2020-07-11 01:10:03,712 INFO L280 TraceCheckUtils]: 52: Hoare triple {27421#false} SUMMARY for call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L1039 {27421#false} is VALID [2020-07-11 01:10:03,713 INFO L280 TraceCheckUtils]: 53: Hoare triple {27421#false} ~end~0.base, ~end~0.offset := #t~mem24.base, #t~mem24.offset; {27421#false} is VALID [2020-07-11 01:10:03,713 INFO L280 TraceCheckUtils]: 54: Hoare triple {27421#false} havoc #t~mem24.base, #t~mem24.offset; {27421#false} is VALID [2020-07-11 01:10:03,713 INFO L280 TraceCheckUtils]: 55: Hoare triple {27421#false} assume 0 != ~end~0.base || 0 != ~end~0.offset; {27421#false} is VALID [2020-07-11 01:10:03,713 INFO L280 TraceCheckUtils]: 56: Hoare triple {27421#false} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {27421#false} is VALID [2020-07-11 01:10:03,713 INFO L280 TraceCheckUtils]: 57: Hoare triple {27421#false} goto; {27421#false} is VALID [2020-07-11 01:10:03,714 INFO L280 TraceCheckUtils]: 58: Hoare triple {27421#false} SUMMARY for call #t~mem25.base, #t~mem25.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1044-6 {27421#false} is VALID [2020-07-11 01:10:03,714 INFO L280 TraceCheckUtils]: 59: Hoare triple {27421#false} assume !(0 == #t~mem25.base && 0 == #t~mem25.offset); {27421#false} is VALID [2020-07-11 01:10:03,714 INFO L280 TraceCheckUtils]: 60: Hoare triple {27421#false} havoc #t~mem25.base, #t~mem25.offset; {27421#false} is VALID [2020-07-11 01:10:03,714 INFO L280 TraceCheckUtils]: 61: Hoare triple {27421#false} assume !false; {27421#false} is VALID [2020-07-11 01:10:03,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 01:10:03,722 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [867724184] [2020-07-11 01:10:03,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:10:03,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-07-11 01:10:03,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572357984] [2020-07-11 01:10:03,723 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 62 [2020-07-11 01:10:03,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:10:03,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-11 01:10:03,791 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-11 01:10:03,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-11 01:10:03,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:10:03,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-11 01:10:03,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2020-07-11 01:10:03,792 INFO L87 Difference]: Start difference. First operand 270 states and 293 transitions. Second operand 16 states. [2020-07-11 01:10:14,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:14,312 INFO L93 Difference]: Finished difference Result 574 states and 610 transitions. [2020-07-11 01:10:14,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-07-11 01:10:14,312 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 62 [2020-07-11 01:10:14,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:10:14,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-11 01:10:14,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 524 transitions. [2020-07-11 01:10:14,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-11 01:10:14,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 524 transitions. [2020-07-11 01:10:14,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 524 transitions. [2020-07-11 01:10:15,112 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 524 edges. 524 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:10:15,130 INFO L225 Difference]: With dead ends: 574 [2020-07-11 01:10:15,130 INFO L226 Difference]: Without dead ends: 540 [2020-07-11 01:10:15,131 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=274, Invalid=916, Unknown=0, NotChecked=0, Total=1190 [2020-07-11 01:10:15,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-07-11 01:10:17,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 269. [2020-07-11 01:10:17,519 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:10:17,519 INFO L82 GeneralOperation]: Start isEquivalent. First operand 540 states. Second operand 269 states. [2020-07-11 01:10:17,519 INFO L74 IsIncluded]: Start isIncluded. First operand 540 states. Second operand 269 states. [2020-07-11 01:10:17,519 INFO L87 Difference]: Start difference. First operand 540 states. Second operand 269 states. [2020-07-11 01:10:17,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:17,533 INFO L93 Difference]: Finished difference Result 540 states and 574 transitions. [2020-07-11 01:10:17,533 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 574 transitions. [2020-07-11 01:10:17,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:10:17,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:10:17,534 INFO L74 IsIncluded]: Start isIncluded. First operand 269 states. Second operand 540 states. [2020-07-11 01:10:17,534 INFO L87 Difference]: Start difference. First operand 269 states. Second operand 540 states. [2020-07-11 01:10:17,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:17,551 INFO L93 Difference]: Finished difference Result 540 states and 574 transitions. [2020-07-11 01:10:17,552 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 574 transitions. [2020-07-11 01:10:17,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:10:17,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:10:17,553 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:10:17,553 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:10:17,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2020-07-11 01:10:17,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 291 transitions. [2020-07-11 01:10:17,558 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 291 transitions. Word has length 62 [2020-07-11 01:10:17,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:10:17,559 INFO L479 AbstractCegarLoop]: Abstraction has 269 states and 291 transitions. [2020-07-11 01:10:17,559 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-11 01:10:17,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 269 states and 291 transitions. [2020-07-11 01:10:18,835 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 291 edges. 291 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:10:18,835 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 291 transitions. [2020-07-11 01:10:18,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-07-11 01:10:18,836 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:10:18,836 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, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:10:18,836 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-11 01:10:18,837 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:10:18,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:10:18,837 INFO L82 PathProgramCache]: Analyzing trace with hash -649286859, now seen corresponding path program 1 times [2020-07-11 01:10:18,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:10:18,838 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2012798625] [2020-07-11 01:10:18,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:10:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:18,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:18,894 INFO L280 TraceCheckUtils]: 0: Hoare triple {30255#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {30247#true} is VALID [2020-07-11 01:10:18,894 INFO L280 TraceCheckUtils]: 1: Hoare triple {30247#true} #valid := #valid[0 := 0]; {30247#true} is VALID [2020-07-11 01:10:18,895 INFO L280 TraceCheckUtils]: 2: Hoare triple {30247#true} assume 0 < #StackHeapBarrier; {30247#true} is VALID [2020-07-11 01:10:18,895 INFO L280 TraceCheckUtils]: 3: Hoare triple {30247#true} assume true; {30247#true} is VALID [2020-07-11 01:10:18,895 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {30247#true} {30247#true} #419#return; {30247#true} is VALID [2020-07-11 01:10:18,896 INFO L263 TraceCheckUtils]: 0: Hoare triple {30247#true} call ULTIMATE.init(); {30255#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:10:18,896 INFO L280 TraceCheckUtils]: 1: Hoare triple {30255#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {30247#true} is VALID [2020-07-11 01:10:18,897 INFO L280 TraceCheckUtils]: 2: Hoare triple {30247#true} #valid := #valid[0 := 0]; {30247#true} is VALID [2020-07-11 01:10:18,897 INFO L280 TraceCheckUtils]: 3: Hoare triple {30247#true} assume 0 < #StackHeapBarrier; {30247#true} is VALID [2020-07-11 01:10:18,897 INFO L280 TraceCheckUtils]: 4: Hoare triple {30247#true} assume true; {30247#true} is VALID [2020-07-11 01:10:18,897 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {30247#true} {30247#true} #419#return; {30247#true} is VALID [2020-07-11 01:10:18,898 INFO L263 TraceCheckUtils]: 6: Hoare triple {30247#true} call #t~ret28 := main(); {30247#true} is VALID [2020-07-11 01:10:18,898 INFO L280 TraceCheckUtils]: 7: Hoare triple {30247#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {30247#true} is VALID [2020-07-11 01:10:18,898 INFO L280 TraceCheckUtils]: 8: Hoare triple {30247#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {30247#true} is VALID [2020-07-11 01:10:18,898 INFO L280 TraceCheckUtils]: 9: Hoare triple {30247#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {30247#true} is VALID [2020-07-11 01:10:18,898 INFO L280 TraceCheckUtils]: 10: Hoare triple {30247#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {30247#true} is VALID [2020-07-11 01:10:18,899 INFO L280 TraceCheckUtils]: 11: Hoare triple {30247#true} goto; {30247#true} is VALID [2020-07-11 01:10:18,899 INFO L280 TraceCheckUtils]: 12: Hoare triple {30247#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {30247#true} is VALID [2020-07-11 01:10:18,899 INFO L280 TraceCheckUtils]: 13: Hoare triple {30247#true} assume !(0 != #t~nondet1); {30247#true} is VALID [2020-07-11 01:10:18,899 INFO L280 TraceCheckUtils]: 14: Hoare triple {30247#true} havoc #t~nondet1; {30247#true} is VALID [2020-07-11 01:10:18,899 INFO L280 TraceCheckUtils]: 15: Hoare triple {30247#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); srcloc: L993-10 {30247#true} is VALID [2020-07-11 01:10:18,900 INFO L280 TraceCheckUtils]: 16: Hoare triple {30247#true} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-11 {30247#true} is VALID [2020-07-11 01:10:18,900 INFO L280 TraceCheckUtils]: 17: Hoare triple {30247#true} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-12 {30247#true} is VALID [2020-07-11 01:10:18,900 INFO L280 TraceCheckUtils]: 18: Hoare triple {30247#true} SUMMARY for call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4); srcloc: L993-13 {30247#true} is VALID [2020-07-11 01:10:18,900 INFO L280 TraceCheckUtils]: 19: Hoare triple {30247#true} havoc #t~mem3.base, #t~mem3.offset; {30247#true} is VALID [2020-07-11 01:10:18,901 INFO L280 TraceCheckUtils]: 20: Hoare triple {30247#true} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-15 {30247#true} is VALID [2020-07-11 01:10:18,901 INFO L280 TraceCheckUtils]: 21: Hoare triple {30247#true} SUMMARY for call write~$Pointer$(0, 0, #t~mem4.base, 4 + #t~mem4.offset, 4); srcloc: L993-16 {30247#true} is VALID [2020-07-11 01:10:18,901 INFO L280 TraceCheckUtils]: 22: Hoare triple {30247#true} havoc #t~mem4.base, #t~mem4.offset; {30247#true} is VALID [2020-07-11 01:10:18,901 INFO L280 TraceCheckUtils]: 23: Hoare triple {30247#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {30247#true} is VALID [2020-07-11 01:10:18,901 INFO L280 TraceCheckUtils]: 24: Hoare triple {30247#true} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {30247#true} is VALID [2020-07-11 01:10:18,902 INFO L280 TraceCheckUtils]: 25: Hoare triple {30247#true} assume #t~short7; {30247#true} is VALID [2020-07-11 01:10:18,902 INFO L280 TraceCheckUtils]: 26: Hoare triple {30247#true} assume !!#t~short7; {30247#true} is VALID [2020-07-11 01:10:18,902 INFO L280 TraceCheckUtils]: 27: Hoare triple {30247#true} havoc #t~mem5.base, #t~mem5.offset; {30247#true} is VALID [2020-07-11 01:10:18,902 INFO L280 TraceCheckUtils]: 28: Hoare triple {30247#true} havoc #t~short7; {30247#true} is VALID [2020-07-11 01:10:18,902 INFO L280 TraceCheckUtils]: 29: Hoare triple {30247#true} havoc #t~mem6.base, #t~mem6.offset; {30247#true} is VALID [2020-07-11 01:10:18,902 INFO L280 TraceCheckUtils]: 30: Hoare triple {30247#true} goto; {30247#true} is VALID [2020-07-11 01:10:18,903 INFO L280 TraceCheckUtils]: 31: Hoare triple {30247#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {30247#true} is VALID [2020-07-11 01:10:18,903 INFO L280 TraceCheckUtils]: 32: Hoare triple {30247#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {30247#true} is VALID [2020-07-11 01:10:18,903 INFO L280 TraceCheckUtils]: 33: Hoare triple {30247#true} assume !(0 != #t~nondet8); {30247#true} is VALID [2020-07-11 01:10:18,903 INFO L280 TraceCheckUtils]: 34: Hoare triple {30247#true} havoc #t~nondet8; {30247#true} is VALID [2020-07-11 01:10:18,903 INFO L280 TraceCheckUtils]: 35: Hoare triple {30247#true} ~end~0.base, ~end~0.offset := 0, 0; {30247#true} is VALID [2020-07-11 01:10:18,903 INFO L280 TraceCheckUtils]: 36: Hoare triple {30247#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {30247#true} is VALID [2020-07-11 01:10:18,904 INFO L280 TraceCheckUtils]: 37: Hoare triple {30247#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {30247#true} is VALID [2020-07-11 01:10:18,904 INFO L280 TraceCheckUtils]: 38: Hoare triple {30247#true} goto; {30247#true} is VALID [2020-07-11 01:10:18,904 INFO L280 TraceCheckUtils]: 39: Hoare triple {30247#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {30247#true} is VALID [2020-07-11 01:10:18,904 INFO L280 TraceCheckUtils]: 40: Hoare triple {30247#true} ~len~0 := 0; {30247#true} is VALID [2020-07-11 01:10:18,904 INFO L280 TraceCheckUtils]: 41: Hoare triple {30247#true} SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 {30247#true} is VALID [2020-07-11 01:10:18,905 INFO L280 TraceCheckUtils]: 42: Hoare triple {30247#true} ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; {30247#true} is VALID [2020-07-11 01:10:18,905 INFO L280 TraceCheckUtils]: 43: Hoare triple {30247#true} havoc #t~mem18.base, #t~mem18.offset; {30247#true} is VALID [2020-07-11 01:10:18,905 INFO L280 TraceCheckUtils]: 44: Hoare triple {30247#true} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {30247#true} is VALID [2020-07-11 01:10:18,905 INFO L280 TraceCheckUtils]: 45: Hoare triple {30247#true} assume 0 == ~len~0; {30247#true} is VALID [2020-07-11 01:10:18,906 INFO L280 TraceCheckUtils]: 46: Hoare triple {30247#true} ~len~0 := 1; {30254#(= 1 main_~len~0)} is VALID [2020-07-11 01:10:18,906 INFO L280 TraceCheckUtils]: 47: Hoare triple {30254#(= 1 main_~len~0)} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {30254#(= 1 main_~len~0)} is VALID [2020-07-11 01:10:18,907 INFO L280 TraceCheckUtils]: 48: Hoare triple {30254#(= 1 main_~len~0)} goto; {30254#(= 1 main_~len~0)} is VALID [2020-07-11 01:10:18,907 INFO L280 TraceCheckUtils]: 49: Hoare triple {30254#(= 1 main_~len~0)} SUMMARY for call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); srcloc: L1025-6 {30254#(= 1 main_~len~0)} is VALID [2020-07-11 01:10:18,908 INFO L280 TraceCheckUtils]: 50: Hoare triple {30254#(= 1 main_~len~0)} assume !!(0 == #t~mem19.base && 0 == #t~mem19.offset); {30254#(= 1 main_~len~0)} is VALID [2020-07-11 01:10:18,909 INFO L280 TraceCheckUtils]: 51: Hoare triple {30254#(= 1 main_~len~0)} havoc #t~mem19.base, #t~mem19.offset; {30254#(= 1 main_~len~0)} is VALID [2020-07-11 01:10:18,909 INFO L280 TraceCheckUtils]: 52: Hoare triple {30254#(= 1 main_~len~0)} goto; {30254#(= 1 main_~len~0)} is VALID [2020-07-11 01:10:18,910 INFO L280 TraceCheckUtils]: 53: Hoare triple {30254#(= 1 main_~len~0)} SUMMARY for call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~inner~0.base, ~inner~0.offset, 4); srcloc: L1026-6 {30254#(= 1 main_~len~0)} is VALID [2020-07-11 01:10:18,910 INFO L280 TraceCheckUtils]: 54: Hoare triple {30254#(= 1 main_~len~0)} assume !!(0 == #t~mem20.base && 0 == #t~mem20.offset); {30254#(= 1 main_~len~0)} is VALID [2020-07-11 01:10:18,911 INFO L280 TraceCheckUtils]: 55: Hoare triple {30254#(= 1 main_~len~0)} havoc #t~mem20.base, #t~mem20.offset; {30254#(= 1 main_~len~0)} is VALID [2020-07-11 01:10:18,912 INFO L280 TraceCheckUtils]: 56: Hoare triple {30254#(= 1 main_~len~0)} goto; {30254#(= 1 main_~len~0)} is VALID [2020-07-11 01:10:18,912 INFO L280 TraceCheckUtils]: 57: Hoare triple {30254#(= 1 main_~len~0)} SUMMARY for call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); srcloc: L1026-7 {30254#(= 1 main_~len~0)} is VALID [2020-07-11 01:10:18,913 INFO L280 TraceCheckUtils]: 58: Hoare triple {30254#(= 1 main_~len~0)} ~inner~0.base, ~inner~0.offset := #t~mem21.base, #t~mem21.offset; {30254#(= 1 main_~len~0)} is VALID [2020-07-11 01:10:18,914 INFO L280 TraceCheckUtils]: 59: Hoare triple {30254#(= 1 main_~len~0)} havoc #t~mem21.base, #t~mem21.offset; {30254#(= 1 main_~len~0)} is VALID [2020-07-11 01:10:18,915 INFO L280 TraceCheckUtils]: 60: Hoare triple {30254#(= 1 main_~len~0)} assume !(1 == ~len~0); {30248#false} is VALID [2020-07-11 01:10:18,915 INFO L280 TraceCheckUtils]: 61: Hoare triple {30248#false} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {30248#false} is VALID [2020-07-11 01:10:18,915 INFO L280 TraceCheckUtils]: 62: Hoare triple {30248#false} assume !(~len~0 <= 1); {30248#false} is VALID [2020-07-11 01:10:18,915 INFO L280 TraceCheckUtils]: 63: Hoare triple {30248#false} assume !false; {30248#false} is VALID [2020-07-11 01:10:18,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 01:10:18,920 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2012798625] [2020-07-11 01:10:18,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:10:18,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-11 01:10:18,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333940195] [2020-07-11 01:10:18,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2020-07-11 01:10:18,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:10:18,921 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-11 01:10:19,012 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:10:19,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-11 01:10:19,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:10:19,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-11 01:10:19,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-11 01:10:19,017 INFO L87 Difference]: Start difference. First operand 269 states and 291 transitions. Second operand 4 states. [2020-07-11 01:10:23,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:23,297 INFO L93 Difference]: Finished difference Result 447 states and 493 transitions. [2020-07-11 01:10:23,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-11 01:10:23,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2020-07-11 01:10:23,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:10:23,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 01:10:23,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 290 transitions. [2020-07-11 01:10:23,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 01:10:23,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 290 transitions. [2020-07-11 01:10:23,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 290 transitions. [2020-07-11 01:10:23,685 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 290 edges. 290 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:10:23,693 INFO L225 Difference]: With dead ends: 447 [2020-07-11 01:10:23,694 INFO L226 Difference]: Without dead ends: 350 [2020-07-11 01:10:23,694 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-11 01:10:23,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2020-07-11 01:10:26,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 302. [2020-07-11 01:10:26,434 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:10:26,434 INFO L82 GeneralOperation]: Start isEquivalent. First operand 350 states. Second operand 302 states. [2020-07-11 01:10:26,434 INFO L74 IsIncluded]: Start isIncluded. First operand 350 states. Second operand 302 states. [2020-07-11 01:10:26,434 INFO L87 Difference]: Start difference. First operand 350 states. Second operand 302 states. [2020-07-11 01:10:26,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:26,442 INFO L93 Difference]: Finished difference Result 350 states and 378 transitions. [2020-07-11 01:10:26,443 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 378 transitions. [2020-07-11 01:10:26,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:10:26,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:10:26,443 INFO L74 IsIncluded]: Start isIncluded. First operand 302 states. Second operand 350 states. [2020-07-11 01:10:26,444 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 350 states. [2020-07-11 01:10:26,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:26,451 INFO L93 Difference]: Finished difference Result 350 states and 378 transitions. [2020-07-11 01:10:26,452 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 378 transitions. [2020-07-11 01:10:26,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:10:26,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:10:26,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:10:26,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:10:26,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2020-07-11 01:10:26,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 330 transitions. [2020-07-11 01:10:26,459 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 330 transitions. Word has length 64 [2020-07-11 01:10:26,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:10:26,459 INFO L479 AbstractCegarLoop]: Abstraction has 302 states and 330 transitions. [2020-07-11 01:10:26,459 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-11 01:10:26,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 302 states and 330 transitions. [2020-07-11 01:10:28,005 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 330 edges. 330 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:10:28,005 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 330 transitions. [2020-07-11 01:10:28,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-11 01:10:28,006 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:10:28,006 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:10:28,007 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-11 01:10:28,007 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:10:28,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:10:28,007 INFO L82 PathProgramCache]: Analyzing trace with hash -201437452, now seen corresponding path program 1 times [2020-07-11 01:10:28,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:10:28,008 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1149227665] [2020-07-11 01:10:28,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:10:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:10:28,188 INFO L280 TraceCheckUtils]: 0: Hoare triple {32470#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {32456#true} is VALID [2020-07-11 01:10:28,189 INFO L280 TraceCheckUtils]: 1: Hoare triple {32456#true} #valid := #valid[0 := 0]; {32456#true} is VALID [2020-07-11 01:10:28,189 INFO L280 TraceCheckUtils]: 2: Hoare triple {32456#true} assume 0 < #StackHeapBarrier; {32456#true} is VALID [2020-07-11 01:10:28,189 INFO L280 TraceCheckUtils]: 3: Hoare triple {32456#true} assume true; {32456#true} is VALID [2020-07-11 01:10:28,190 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {32456#true} {32456#true} #419#return; {32456#true} is VALID [2020-07-11 01:10:28,191 INFO L263 TraceCheckUtils]: 0: Hoare triple {32456#true} call ULTIMATE.init(); {32470#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:10:28,191 INFO L280 TraceCheckUtils]: 1: Hoare triple {32470#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {32456#true} is VALID [2020-07-11 01:10:28,192 INFO L280 TraceCheckUtils]: 2: Hoare triple {32456#true} #valid := #valid[0 := 0]; {32456#true} is VALID [2020-07-11 01:10:28,192 INFO L280 TraceCheckUtils]: 3: Hoare triple {32456#true} assume 0 < #StackHeapBarrier; {32456#true} is VALID [2020-07-11 01:10:28,192 INFO L280 TraceCheckUtils]: 4: Hoare triple {32456#true} assume true; {32456#true} is VALID [2020-07-11 01:10:28,193 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {32456#true} {32456#true} #419#return; {32456#true} is VALID [2020-07-11 01:10:28,193 INFO L263 TraceCheckUtils]: 6: Hoare triple {32456#true} call #t~ret28 := main(); {32456#true} is VALID [2020-07-11 01:10:28,193 INFO L280 TraceCheckUtils]: 7: Hoare triple {32456#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {32456#true} is VALID [2020-07-11 01:10:28,193 INFO L280 TraceCheckUtils]: 8: Hoare triple {32456#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {32456#true} is VALID [2020-07-11 01:10:28,194 INFO L280 TraceCheckUtils]: 9: Hoare triple {32456#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {32456#true} is VALID [2020-07-11 01:10:28,194 INFO L280 TraceCheckUtils]: 10: Hoare triple {32456#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {32456#true} is VALID [2020-07-11 01:10:28,194 INFO L280 TraceCheckUtils]: 11: Hoare triple {32456#true} goto; {32456#true} is VALID [2020-07-11 01:10:28,195 INFO L280 TraceCheckUtils]: 12: Hoare triple {32456#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {32456#true} is VALID [2020-07-11 01:10:28,195 INFO L280 TraceCheckUtils]: 13: Hoare triple {32456#true} assume 0 != #t~nondet1; {32456#true} is VALID [2020-07-11 01:10:28,195 INFO L280 TraceCheckUtils]: 14: Hoare triple {32456#true} havoc #t~nondet1; {32456#true} is VALID [2020-07-11 01:10:28,195 INFO L280 TraceCheckUtils]: 15: Hoare triple {32456#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {32456#true} is VALID [2020-07-11 01:10:28,195 INFO L280 TraceCheckUtils]: 16: Hoare triple {32456#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {32456#true} is VALID [2020-07-11 01:10:28,196 INFO L280 TraceCheckUtils]: 17: Hoare triple {32456#true} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {32456#true} is VALID [2020-07-11 01:10:28,196 INFO L280 TraceCheckUtils]: 18: Hoare triple {32456#true} assume !#t~short7; {32456#true} is VALID [2020-07-11 01:10:28,196 INFO L280 TraceCheckUtils]: 19: Hoare triple {32456#true} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-22 {32456#true} is VALID [2020-07-11 01:10:28,196 INFO L280 TraceCheckUtils]: 20: Hoare triple {32456#true} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {32456#true} is VALID [2020-07-11 01:10:28,196 INFO L280 TraceCheckUtils]: 21: Hoare triple {32456#true} assume !!#t~short7; {32456#true} is VALID [2020-07-11 01:10:28,197 INFO L280 TraceCheckUtils]: 22: Hoare triple {32456#true} havoc #t~mem5.base, #t~mem5.offset; {32456#true} is VALID [2020-07-11 01:10:28,197 INFO L280 TraceCheckUtils]: 23: Hoare triple {32456#true} havoc #t~short7; {32456#true} is VALID [2020-07-11 01:10:28,197 INFO L280 TraceCheckUtils]: 24: Hoare triple {32456#true} havoc #t~mem6.base, #t~mem6.offset; {32456#true} is VALID [2020-07-11 01:10:28,197 INFO L280 TraceCheckUtils]: 25: Hoare triple {32456#true} goto; {32456#true} is VALID [2020-07-11 01:10:28,197 INFO L280 TraceCheckUtils]: 26: Hoare triple {32456#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {32456#true} is VALID [2020-07-11 01:10:28,198 INFO L280 TraceCheckUtils]: 27: Hoare triple {32456#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {32456#true} is VALID [2020-07-11 01:10:28,198 INFO L280 TraceCheckUtils]: 28: Hoare triple {32456#true} assume !(0 != #t~nondet8); {32456#true} is VALID [2020-07-11 01:10:28,198 INFO L280 TraceCheckUtils]: 29: Hoare triple {32456#true} havoc #t~nondet8; {32456#true} is VALID [2020-07-11 01:10:28,198 INFO L280 TraceCheckUtils]: 30: Hoare triple {32456#true} ~end~0.base, ~end~0.offset := 0, 0; {32456#true} is VALID [2020-07-11 01:10:28,199 INFO L280 TraceCheckUtils]: 31: Hoare triple {32456#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {32463#(and (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.base main_~end~0.base))} is VALID [2020-07-11 01:10:28,200 INFO L280 TraceCheckUtils]: 32: Hoare triple {32463#(and (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.base main_~end~0.base))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {32463#(and (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.base main_~end~0.base))} is VALID [2020-07-11 01:10:28,201 INFO L280 TraceCheckUtils]: 33: Hoare triple {32463#(and (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.base main_~end~0.base))} goto; {32463#(and (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.base main_~end~0.base))} is VALID [2020-07-11 01:10:28,202 INFO L280 TraceCheckUtils]: 34: Hoare triple {32463#(and (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.base main_~end~0.base))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {32463#(and (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.base main_~end~0.base))} is VALID [2020-07-11 01:10:28,202 INFO L280 TraceCheckUtils]: 35: Hoare triple {32463#(and (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.base main_~end~0.base))} ~len~0 := 0; {32463#(and (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.base main_~end~0.base))} is VALID [2020-07-11 01:10:28,203 INFO L280 TraceCheckUtils]: 36: Hoare triple {32463#(and (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.base main_~end~0.base))} SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 {32463#(and (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.base main_~end~0.base))} is VALID [2020-07-11 01:10:28,204 INFO L280 TraceCheckUtils]: 37: Hoare triple {32463#(and (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.base main_~end~0.base))} ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; {32463#(and (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.base main_~end~0.base))} is VALID [2020-07-11 01:10:28,205 INFO L280 TraceCheckUtils]: 38: Hoare triple {32463#(and (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.base main_~end~0.base))} havoc #t~mem18.base, #t~mem18.offset; {32463#(and (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.base main_~end~0.base))} is VALID [2020-07-11 01:10:28,206 INFO L280 TraceCheckUtils]: 39: Hoare triple {32463#(and (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.base main_~end~0.base))} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {32463#(and (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.base main_~end~0.base))} is VALID [2020-07-11 01:10:28,207 INFO L280 TraceCheckUtils]: 40: Hoare triple {32463#(and (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.base main_~end~0.base))} assume !!(~len~0 <= 1); {32463#(and (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.base main_~end~0.base))} is VALID [2020-07-11 01:10:28,208 INFO L280 TraceCheckUtils]: 41: Hoare triple {32463#(and (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.base main_~end~0.base))} goto; {32463#(and (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.base main_~end~0.base))} is VALID [2020-07-11 01:10:28,209 INFO L280 TraceCheckUtils]: 42: Hoare triple {32463#(and (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.base main_~end~0.base))} SUMMARY for call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1031-4 {32464#(and (= |main_#t~mem23.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= |main_#t~mem23.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))} is VALID [2020-07-11 01:10:28,210 INFO L280 TraceCheckUtils]: 43: Hoare triple {32464#(and (= |main_#t~mem23.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= |main_#t~mem23.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))} ~end~0.base, ~end~0.offset := #t~mem23.base, #t~mem23.offset; {32465#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~end~0.base) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))} is VALID [2020-07-11 01:10:28,211 INFO L280 TraceCheckUtils]: 44: Hoare triple {32465#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~end~0.base) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))} havoc #t~mem23.base, #t~mem23.offset; {32465#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~end~0.base) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))} is VALID [2020-07-11 01:10:28,213 INFO L280 TraceCheckUtils]: 45: Hoare triple {32465#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~end~0.base) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {32466#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))} is VALID [2020-07-11 01:10:28,214 INFO L280 TraceCheckUtils]: 46: Hoare triple {32466#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))} assume !!(0 != ~list~0.base || 0 != ~list~0.offset); {32466#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))} is VALID [2020-07-11 01:10:28,215 INFO L280 TraceCheckUtils]: 47: Hoare triple {32466#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))} SUMMARY for call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L1039 {32466#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))} is VALID [2020-07-11 01:10:28,217 INFO L280 TraceCheckUtils]: 48: Hoare triple {32466#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))} ~end~0.base, ~end~0.offset := #t~mem24.base, #t~mem24.offset; {32466#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))} is VALID [2020-07-11 01:10:28,218 INFO L280 TraceCheckUtils]: 49: Hoare triple {32466#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))} havoc #t~mem24.base, #t~mem24.offset; {32466#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))} is VALID [2020-07-11 01:10:28,219 INFO L280 TraceCheckUtils]: 50: Hoare triple {32466#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {32466#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))} is VALID [2020-07-11 01:10:28,220 INFO L280 TraceCheckUtils]: 51: Hoare triple {32466#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))} SUMMARY for call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~list~0.base, ~list~0.offset, 4); srcloc: L1041-2 {32467#(and (= 0 |main_#t~mem27.offset|) (= 0 |main_#t~mem27.base|))} is VALID [2020-07-11 01:10:28,221 INFO L280 TraceCheckUtils]: 52: Hoare triple {32467#(and (= 0 |main_#t~mem27.offset|) (= 0 |main_#t~mem27.base|))} ~end~0.base, ~end~0.offset := #t~mem27.base, #t~mem27.offset; {32468#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} is VALID [2020-07-11 01:10:28,222 INFO L280 TraceCheckUtils]: 53: Hoare triple {32468#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} havoc #t~mem27.base, #t~mem27.offset; {32468#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} is VALID [2020-07-11 01:10:28,223 INFO L280 TraceCheckUtils]: 54: Hoare triple {32468#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} SUMMARY for call ULTIMATE.dealloc(~list~0.base, ~list~0.offset); srcloc: L1050 {32468#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} is VALID [2020-07-11 01:10:28,224 INFO L280 TraceCheckUtils]: 55: Hoare triple {32468#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} ~list~0.base, ~list~0.offset := ~end~0.base, ~end~0.offset; {32469#(and (= 0 main_~list~0.offset) (= 0 main_~list~0.base))} is VALID [2020-07-11 01:10:28,224 INFO L280 TraceCheckUtils]: 56: Hoare triple {32469#(and (= 0 main_~list~0.offset) (= 0 main_~list~0.base))} assume !!(0 != ~list~0.base || 0 != ~list~0.offset); {32457#false} is VALID [2020-07-11 01:10:28,225 INFO L280 TraceCheckUtils]: 57: Hoare triple {32457#false} SUMMARY for call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L1039 {32457#false} is VALID [2020-07-11 01:10:28,225 INFO L280 TraceCheckUtils]: 58: Hoare triple {32457#false} ~end~0.base, ~end~0.offset := #t~mem24.base, #t~mem24.offset; {32457#false} is VALID [2020-07-11 01:10:28,225 INFO L280 TraceCheckUtils]: 59: Hoare triple {32457#false} havoc #t~mem24.base, #t~mem24.offset; {32457#false} is VALID [2020-07-11 01:10:28,225 INFO L280 TraceCheckUtils]: 60: Hoare triple {32457#false} assume 0 != ~end~0.base || 0 != ~end~0.offset; {32457#false} is VALID [2020-07-11 01:10:28,225 INFO L280 TraceCheckUtils]: 61: Hoare triple {32457#false} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {32457#false} is VALID [2020-07-11 01:10:28,226 INFO L280 TraceCheckUtils]: 62: Hoare triple {32457#false} goto; {32457#false} is VALID [2020-07-11 01:10:28,226 INFO L280 TraceCheckUtils]: 63: Hoare triple {32457#false} SUMMARY for call #t~mem25.base, #t~mem25.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1044-6 {32457#false} is VALID [2020-07-11 01:10:28,226 INFO L280 TraceCheckUtils]: 64: Hoare triple {32457#false} assume !(0 == #t~mem25.base && 0 == #t~mem25.offset); {32457#false} is VALID [2020-07-11 01:10:28,226 INFO L280 TraceCheckUtils]: 65: Hoare triple {32457#false} havoc #t~mem25.base, #t~mem25.offset; {32457#false} is VALID [2020-07-11 01:10:28,226 INFO L280 TraceCheckUtils]: 66: Hoare triple {32457#false} assume !false; {32457#false} is VALID [2020-07-11 01:10:28,236 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 01:10:28,236 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1149227665] [2020-07-11 01:10:28,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 01:10:28,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-11 01:10:28,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748249768] [2020-07-11 01:10:28,238 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2020-07-11 01:10:28,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:10:28,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-11 01:10:28,321 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:10:28,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-11 01:10:28,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:10:28,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-11 01:10:28,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-07-11 01:10:28,322 INFO L87 Difference]: Start difference. First operand 302 states and 330 transitions. Second operand 10 states. [2020-07-11 01:10:35,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:35,524 INFO L93 Difference]: Finished difference Result 489 states and 531 transitions. [2020-07-11 01:10:35,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-11 01:10:35,525 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2020-07-11 01:10:35,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:10:35,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 01:10:35,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 356 transitions. [2020-07-11 01:10:35,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 01:10:35,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 356 transitions. [2020-07-11 01:10:35,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 356 transitions. [2020-07-11 01:10:35,986 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 356 edges. 356 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:10:35,997 INFO L225 Difference]: With dead ends: 489 [2020-07-11 01:10:35,998 INFO L226 Difference]: Without dead ends: 429 [2020-07-11 01:10:35,998 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2020-07-11 01:10:35,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2020-07-11 01:10:39,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 343. [2020-07-11 01:10:39,533 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:10:39,533 INFO L82 GeneralOperation]: Start isEquivalent. First operand 429 states. Second operand 343 states. [2020-07-11 01:10:39,533 INFO L74 IsIncluded]: Start isIncluded. First operand 429 states. Second operand 343 states. [2020-07-11 01:10:39,533 INFO L87 Difference]: Start difference. First operand 429 states. Second operand 343 states. [2020-07-11 01:10:39,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:39,542 INFO L93 Difference]: Finished difference Result 429 states and 467 transitions. [2020-07-11 01:10:39,542 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 467 transitions. [2020-07-11 01:10:39,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:10:39,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:10:39,543 INFO L74 IsIncluded]: Start isIncluded. First operand 343 states. Second operand 429 states. [2020-07-11 01:10:39,543 INFO L87 Difference]: Start difference. First operand 343 states. Second operand 429 states. [2020-07-11 01:10:39,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:10:39,553 INFO L93 Difference]: Finished difference Result 429 states and 467 transitions. [2020-07-11 01:10:39,553 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 467 transitions. [2020-07-11 01:10:39,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:10:39,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:10:39,553 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:10:39,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:10:39,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2020-07-11 01:10:39,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 382 transitions. [2020-07-11 01:10:39,559 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 382 transitions. Word has length 67 [2020-07-11 01:10:39,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:10:39,559 INFO L479 AbstractCegarLoop]: Abstraction has 343 states and 382 transitions. [2020-07-11 01:10:39,560 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-11 01:10:39,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 343 states and 382 transitions. [2020-07-11 01:10:41,382 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 382 edges. 382 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:10:41,382 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 382 transitions. [2020-07-11 01:10:41,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-07-11 01:10:41,383 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:10:41,383 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:10:41,383 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-07-11 01:10:41,384 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:10:41,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:10:41,384 INFO L82 PathProgramCache]: Analyzing trace with hash 364568229, now seen corresponding path program 1 times [2020-07-11 01:10:41,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:10:41,385 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [125106243] [2020-07-11 01:10:41,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:10:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 01:10:41,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 01:10:41,473 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-11 01:10:41,473 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-11 01:10:41,474 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-07-11 01:10:41,588 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-11 01:10:41,589 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 01:10:41,589 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 01:10:41,589 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-11 01:10:41,589 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 01:10:41,589 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 01:10:41,589 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 01:10:41,589 WARN L170 areAnnotationChecker]: L991 has no Hoare annotation [2020-07-11 01:10:41,589 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-11 01:10:41,590 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-11 01:10:41,590 WARN L170 areAnnotationChecker]: L992 has no Hoare annotation [2020-07-11 01:10:41,590 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-11 01:10:41,590 WARN L170 areAnnotationChecker]: L993-3 has no Hoare annotation [2020-07-11 01:10:41,590 WARN L170 areAnnotationChecker]: L993-3 has no Hoare annotation [2020-07-11 01:10:41,590 WARN L170 areAnnotationChecker]: L993-3 has no Hoare annotation [2020-07-11 01:10:41,590 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-11 01:10:41,590 WARN L170 areAnnotationChecker]: L993-4 has no Hoare annotation [2020-07-11 01:10:41,590 WARN L170 areAnnotationChecker]: L993 has no Hoare annotation [2020-07-11 01:10:41,590 WARN L170 areAnnotationChecker]: L993 has no Hoare annotation [2020-07-11 01:10:41,591 WARN L170 areAnnotationChecker]: L993-2 has no Hoare annotation [2020-07-11 01:10:41,591 WARN L170 areAnnotationChecker]: L993-2 has no Hoare annotation [2020-07-11 01:10:41,591 WARN L170 areAnnotationChecker]: L993-5 has no Hoare annotation [2020-07-11 01:10:41,591 WARN L170 areAnnotationChecker]: L993-5 has no Hoare annotation [2020-07-11 01:10:41,591 WARN L170 areAnnotationChecker]: L993-6 has no Hoare annotation [2020-07-11 01:10:41,591 WARN L170 areAnnotationChecker]: L993-9 has no Hoare annotation [2020-07-11 01:10:41,591 WARN L170 areAnnotationChecker]: L993-7 has no Hoare annotation [2020-07-11 01:10:41,591 WARN L170 areAnnotationChecker]: L993-10 has no Hoare annotation [2020-07-11 01:10:41,591 WARN L170 areAnnotationChecker]: L993-34 has no Hoare annotation [2020-07-11 01:10:41,592 WARN L170 areAnnotationChecker]: L993-34 has no Hoare annotation [2020-07-11 01:10:41,592 WARN L170 areAnnotationChecker]: L993-11 has no Hoare annotation [2020-07-11 01:10:41,592 WARN L170 areAnnotationChecker]: L993-19 has no Hoare annotation [2020-07-11 01:10:41,592 WARN L170 areAnnotationChecker]: L993-35 has no Hoare annotation [2020-07-11 01:10:41,592 WARN L170 areAnnotationChecker]: L993-12 has no Hoare annotation [2020-07-11 01:10:41,592 WARN L170 areAnnotationChecker]: L993-20 has no Hoare annotation [2020-07-11 01:10:41,592 WARN L170 areAnnotationChecker]: L993-20 has no Hoare annotation [2020-07-11 01:10:41,592 WARN L170 areAnnotationChecker]: L1005-35 has no Hoare annotation [2020-07-11 01:10:41,592 WARN L170 areAnnotationChecker]: L1005-35 has no Hoare annotation [2020-07-11 01:10:41,592 WARN L170 areAnnotationChecker]: L993-13 has no Hoare annotation [2020-07-11 01:10:41,593 WARN L170 areAnnotationChecker]: L993-24 has no Hoare annotation [2020-07-11 01:10:41,593 WARN L170 areAnnotationChecker]: L993-24 has no Hoare annotation [2020-07-11 01:10:41,593 WARN L170 areAnnotationChecker]: L993-22 has no Hoare annotation [2020-07-11 01:10:41,593 WARN L170 areAnnotationChecker]: L998-5 has no Hoare annotation [2020-07-11 01:10:41,593 WARN L170 areAnnotationChecker]: L998-1 has no Hoare annotation [2020-07-11 01:10:41,593 WARN L170 areAnnotationChecker]: L998-1 has no Hoare annotation [2020-07-11 01:10:41,593 WARN L170 areAnnotationChecker]: L993-14 has no Hoare annotation [2020-07-11 01:10:41,593 WARN L170 areAnnotationChecker]: L993-25 has no Hoare annotation [2020-07-11 01:10:41,593 WARN L170 areAnnotationChecker]: L993-30 has no Hoare annotation [2020-07-11 01:10:41,594 WARN L170 areAnnotationChecker]: L993-23 has no Hoare annotation [2020-07-11 01:10:41,594 WARN L170 areAnnotationChecker]: L1009 has no Hoare annotation [2020-07-11 01:10:41,594 WARN L170 areAnnotationChecker]: L998-2 has no Hoare annotation [2020-07-11 01:10:41,594 WARN L170 areAnnotationChecker]: L998-4 has no Hoare annotation [2020-07-11 01:10:41,594 WARN L170 areAnnotationChecker]: L993-15 has no Hoare annotation [2020-07-11 01:10:41,594 WARN L170 areAnnotationChecker]: L993-26 has no Hoare annotation [2020-07-11 01:10:41,594 WARN L170 areAnnotationChecker]: L993-31 has no Hoare annotation [2020-07-11 01:10:41,594 WARN L170 areAnnotationChecker]: L1012-4 has no Hoare annotation [2020-07-11 01:10:41,594 WARN L170 areAnnotationChecker]: L1012-4 has no Hoare annotation [2020-07-11 01:10:41,594 WARN L170 areAnnotationChecker]: L1012-4 has no Hoare annotation [2020-07-11 01:10:41,595 WARN L170 areAnnotationChecker]: L1001 has no Hoare annotation [2020-07-11 01:10:41,595 WARN L170 areAnnotationChecker]: L993-16 has no Hoare annotation [2020-07-11 01:10:41,595 WARN L170 areAnnotationChecker]: L993-27 has no Hoare annotation [2020-07-11 01:10:41,595 WARN L170 areAnnotationChecker]: L993-32 has no Hoare annotation [2020-07-11 01:10:41,595 WARN L170 areAnnotationChecker]: L1014-1 has no Hoare annotation [2020-07-11 01:10:41,595 WARN L170 areAnnotationChecker]: L1014-1 has no Hoare annotation [2020-07-11 01:10:41,595 WARN L170 areAnnotationChecker]: L1014-1 has no Hoare annotation [2020-07-11 01:10:41,595 WARN L170 areAnnotationChecker]: L1012-1 has no Hoare annotation [2020-07-11 01:10:41,595 WARN L170 areAnnotationChecker]: L1012-1 has no Hoare annotation [2020-07-11 01:10:41,595 WARN L170 areAnnotationChecker]: L1012-3 has no Hoare annotation [2020-07-11 01:10:41,596 WARN L170 areAnnotationChecker]: L1012-3 has no Hoare annotation [2020-07-11 01:10:41,596 WARN L170 areAnnotationChecker]: L1001-1 has no Hoare annotation [2020-07-11 01:10:41,596 WARN L170 areAnnotationChecker]: L993-17 has no Hoare annotation [2020-07-11 01:10:41,596 WARN L170 areAnnotationChecker]: L993-28 has no Hoare annotation [2020-07-11 01:10:41,596 WARN L170 areAnnotationChecker]: L993-28 has no Hoare annotation [2020-07-11 01:10:41,596 WARN L170 areAnnotationChecker]: L993-33 has no Hoare annotation [2020-07-11 01:10:41,596 WARN L170 areAnnotationChecker]: L993-33 has no Hoare annotation [2020-07-11 01:10:41,596 WARN L170 areAnnotationChecker]: L1037-1 has no Hoare annotation [2020-07-11 01:10:41,596 WARN L170 areAnnotationChecker]: L1037-1 has no Hoare annotation [2020-07-11 01:10:41,596 WARN L170 areAnnotationChecker]: L1037-1 has no Hoare annotation [2020-07-11 01:10:41,597 WARN L170 areAnnotationChecker]: L1016 has no Hoare annotation [2020-07-11 01:10:41,597 WARN L170 areAnnotationChecker]: L1001-2 has no Hoare annotation [2020-07-11 01:10:41,597 WARN L170 areAnnotationChecker]: L1037-2 has no Hoare annotation [2020-07-11 01:10:41,597 WARN L170 areAnnotationChecker]: L1039 has no Hoare annotation [2020-07-11 01:10:41,597 WARN L170 areAnnotationChecker]: L1017 has no Hoare annotation [2020-07-11 01:10:41,597 WARN L170 areAnnotationChecker]: L1002 has no Hoare annotation [2020-07-11 01:10:41,597 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-11 01:10:41,597 WARN L170 areAnnotationChecker]: L1039-1 has no Hoare annotation [2020-07-11 01:10:41,597 WARN L170 areAnnotationChecker]: L1017-1 has no Hoare annotation [2020-07-11 01:10:41,597 WARN L170 areAnnotationChecker]: L1002-1 has no Hoare annotation [2020-07-11 01:10:41,598 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-11 01:10:41,598 WARN L170 areAnnotationChecker]: L1039-2 has no Hoare annotation [2020-07-11 01:10:41,598 WARN L170 areAnnotationChecker]: L1017-2 has no Hoare annotation [2020-07-11 01:10:41,598 WARN L170 areAnnotationChecker]: L1003 has no Hoare annotation [2020-07-11 01:10:41,598 WARN L170 areAnnotationChecker]: L1041 has no Hoare annotation [2020-07-11 01:10:41,598 WARN L170 areAnnotationChecker]: L1041 has no Hoare annotation [2020-07-11 01:10:41,598 WARN L170 areAnnotationChecker]: L1028-2 has no Hoare annotation [2020-07-11 01:10:41,598 WARN L170 areAnnotationChecker]: L1028-2 has no Hoare annotation [2020-07-11 01:10:41,598 WARN L170 areAnnotationChecker]: L1028-2 has no Hoare annotation [2020-07-11 01:10:41,598 WARN L170 areAnnotationChecker]: L1004-3 has no Hoare annotation [2020-07-11 01:10:41,598 WARN L170 areAnnotationChecker]: L1004-3 has no Hoare annotation [2020-07-11 01:10:41,599 WARN L170 areAnnotationChecker]: L1004-3 has no Hoare annotation [2020-07-11 01:10:41,599 WARN L170 areAnnotationChecker]: L1043-4 has no Hoare annotation [2020-07-11 01:10:41,599 WARN L170 areAnnotationChecker]: L1043-4 has no Hoare annotation [2020-07-11 01:10:41,599 WARN L170 areAnnotationChecker]: L1043-4 has no Hoare annotation [2020-07-11 01:10:41,599 WARN L170 areAnnotationChecker]: L1041-2 has no Hoare annotation [2020-07-11 01:10:41,599 WARN L170 areAnnotationChecker]: L1031-3 has no Hoare annotation [2020-07-11 01:10:41,599 WARN L170 areAnnotationChecker]: L1031-3 has no Hoare annotation [2020-07-11 01:10:41,599 WARN L170 areAnnotationChecker]: L1031-3 has no Hoare annotation [2020-07-11 01:10:41,599 WARN L170 areAnnotationChecker]: L1020 has no Hoare annotation [2020-07-11 01:10:41,599 WARN L170 areAnnotationChecker]: L1020 has no Hoare annotation [2020-07-11 01:10:41,600 WARN L170 areAnnotationChecker]: L1005-3 has no Hoare annotation [2020-07-11 01:10:41,600 WARN L170 areAnnotationChecker]: L1005-3 has no Hoare annotation [2020-07-11 01:10:41,600 WARN L170 areAnnotationChecker]: L1005-3 has no Hoare annotation [2020-07-11 01:10:41,600 WARN L170 areAnnotationChecker]: L1004 has no Hoare annotation [2020-07-11 01:10:41,600 WARN L170 areAnnotationChecker]: L1004 has no Hoare annotation [2020-07-11 01:10:41,600 WARN L170 areAnnotationChecker]: L1004-2 has no Hoare annotation [2020-07-11 01:10:41,600 WARN L170 areAnnotationChecker]: L1004-2 has no Hoare annotation [2020-07-11 01:10:41,600 WARN L170 areAnnotationChecker]: L1044-6 has no Hoare annotation [2020-07-11 01:10:41,600 WARN L170 areAnnotationChecker]: L1044-6 has no Hoare annotation [2020-07-11 01:10:41,600 WARN L170 areAnnotationChecker]: L1043-1 has no Hoare annotation [2020-07-11 01:10:41,600 WARN L170 areAnnotationChecker]: L1043-1 has no Hoare annotation [2020-07-11 01:10:41,601 WARN L170 areAnnotationChecker]: L1043-3 has no Hoare annotation [2020-07-11 01:10:41,601 WARN L170 areAnnotationChecker]: L1043-3 has no Hoare annotation [2020-07-11 01:10:41,601 WARN L170 areAnnotationChecker]: L1049 has no Hoare annotation [2020-07-11 01:10:41,601 WARN L170 areAnnotationChecker]: L1031-4 has no Hoare annotation [2020-07-11 01:10:41,601 WARN L170 areAnnotationChecker]: L1031 has no Hoare annotation [2020-07-11 01:10:41,601 WARN L170 areAnnotationChecker]: L1031 has no Hoare annotation [2020-07-11 01:10:41,601 WARN L170 areAnnotationChecker]: L1031-2 has no Hoare annotation [2020-07-11 01:10:41,601 WARN L170 areAnnotationChecker]: L1031-2 has no Hoare annotation [2020-07-11 01:10:41,601 WARN L170 areAnnotationChecker]: L1021 has no Hoare annotation [2020-07-11 01:10:41,601 WARN L170 areAnnotationChecker]: L1023 has no Hoare annotation [2020-07-11 01:10:41,602 WARN L170 areAnnotationChecker]: L1005-4 has no Hoare annotation [2020-07-11 01:10:41,602 WARN L170 areAnnotationChecker]: L1005 has no Hoare annotation [2020-07-11 01:10:41,602 WARN L170 areAnnotationChecker]: L1005 has no Hoare annotation [2020-07-11 01:10:41,602 WARN L170 areAnnotationChecker]: L1005-2 has no Hoare annotation [2020-07-11 01:10:41,602 WARN L170 areAnnotationChecker]: L1005-2 has no Hoare annotation [2020-07-11 01:10:41,602 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2020-07-11 01:10:41,602 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2020-07-11 01:10:41,602 WARN L170 areAnnotationChecker]: L1045-6 has no Hoare annotation [2020-07-11 01:10:41,602 WARN L170 areAnnotationChecker]: L1045-6 has no Hoare annotation [2020-07-11 01:10:41,602 WARN L170 areAnnotationChecker]: L1049-1 has no Hoare annotation [2020-07-11 01:10:41,603 WARN L170 areAnnotationChecker]: L1033 has no Hoare annotation [2020-07-11 01:10:41,603 WARN L170 areAnnotationChecker]: L1024-3 has no Hoare annotation [2020-07-11 01:10:41,603 WARN L170 areAnnotationChecker]: L1024-3 has no Hoare annotation [2020-07-11 01:10:41,603 WARN L170 areAnnotationChecker]: L1024-3 has no Hoare annotation [2020-07-11 01:10:41,603 WARN L170 areAnnotationChecker]: L1005-5 has no Hoare annotation [2020-07-11 01:10:41,603 WARN L170 areAnnotationChecker]: L1005-5 has no Hoare annotation [2020-07-11 01:10:41,603 WARN L170 areAnnotationChecker]: L1044-1 has no Hoare annotation [2020-07-11 01:10:41,603 WARN L170 areAnnotationChecker]: L1044-4 has no Hoare annotation [2020-07-11 01:10:41,603 WARN L170 areAnnotationChecker]: L1045 has no Hoare annotation [2020-07-11 01:10:41,604 WARN L170 areAnnotationChecker]: L1045 has no Hoare annotation [2020-07-11 01:10:41,604 WARN L170 areAnnotationChecker]: L1045-7 has no Hoare annotation [2020-07-11 01:10:41,604 WARN L170 areAnnotationChecker]: L1050 has no Hoare annotation [2020-07-11 01:10:41,604 WARN L170 areAnnotationChecker]: L1033-1 has no Hoare annotation [2020-07-11 01:10:41,604 WARN L170 areAnnotationChecker]: L1025-6 has no Hoare annotation [2020-07-11 01:10:41,604 WARN L170 areAnnotationChecker]: L1025-6 has no Hoare annotation [2020-07-11 01:10:41,604 WARN L170 areAnnotationChecker]: L1024 has no Hoare annotation [2020-07-11 01:10:41,604 WARN L170 areAnnotationChecker]: L1024 has no Hoare annotation [2020-07-11 01:10:41,604 WARN L170 areAnnotationChecker]: L1024-2 has no Hoare annotation [2020-07-11 01:10:41,604 WARN L170 areAnnotationChecker]: L1024-2 has no Hoare annotation [2020-07-11 01:10:41,604 WARN L170 areAnnotationChecker]: L1005-6 has no Hoare annotation [2020-07-11 01:10:41,605 WARN L170 areAnnotationChecker]: L1005-9 has no Hoare annotation [2020-07-11 01:10:41,605 WARN L170 areAnnotationChecker]: L1044-2 has no Hoare annotation [2020-07-11 01:10:41,605 WARN L170 areAnnotationChecker]: L1044-2 has no Hoare annotation [2020-07-11 01:10:41,605 WARN L170 areAnnotationChecker]: L1044-5 has no Hoare annotation [2020-07-11 01:10:41,605 WARN L170 areAnnotationChecker]: L1044-5 has no Hoare annotation [2020-07-11 01:10:41,605 WARN L170 areAnnotationChecker]: L1045-1 has no Hoare annotation [2020-07-11 01:10:41,605 WARN L170 areAnnotationChecker]: L1045-4 has no Hoare annotation [2020-07-11 01:10:41,605 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2020-07-11 01:10:41,605 WARN L170 areAnnotationChecker]: L1050-1 has no Hoare annotation [2020-07-11 01:10:41,606 WARN L170 areAnnotationChecker]: L1025 has no Hoare annotation [2020-07-11 01:10:41,606 WARN L170 areAnnotationChecker]: L1025 has no Hoare annotation [2020-07-11 01:10:41,606 WARN L170 areAnnotationChecker]: L1026-6 has no Hoare annotation [2020-07-11 01:10:41,606 WARN L170 areAnnotationChecker]: L1026-6 has no Hoare annotation [2020-07-11 01:10:41,606 WARN L170 areAnnotationChecker]: L1005-7 has no Hoare annotation [2020-07-11 01:10:41,606 WARN L170 areAnnotationChecker]: L1005-10 has no Hoare annotation [2020-07-11 01:10:41,606 WARN L170 areAnnotationChecker]: L1045-2 has no Hoare annotation [2020-07-11 01:10:41,606 WARN L170 areAnnotationChecker]: L1045-2 has no Hoare annotation [2020-07-11 01:10:41,606 WARN L170 areAnnotationChecker]: L1045-5 has no Hoare annotation [2020-07-11 01:10:41,607 WARN L170 areAnnotationChecker]: L1045-5 has no Hoare annotation [2020-07-11 01:10:41,607 WARN L170 areAnnotationChecker]: L1025-1 has no Hoare annotation [2020-07-11 01:10:41,607 WARN L170 areAnnotationChecker]: L1025-4 has no Hoare annotation [2020-07-11 01:10:41,607 WARN L170 areAnnotationChecker]: L1026 has no Hoare annotation [2020-07-11 01:10:41,607 WARN L170 areAnnotationChecker]: L1026 has no Hoare annotation [2020-07-11 01:10:41,607 WARN L170 areAnnotationChecker]: L1026-7 has no Hoare annotation [2020-07-11 01:10:41,607 WARN L170 areAnnotationChecker]: L1005-34 has no Hoare annotation [2020-07-11 01:10:41,607 WARN L170 areAnnotationChecker]: L1005-34 has no Hoare annotation [2020-07-11 01:10:41,607 WARN L170 areAnnotationChecker]: L1005-11 has no Hoare annotation [2020-07-11 01:10:41,607 WARN L170 areAnnotationChecker]: L1025-2 has no Hoare annotation [2020-07-11 01:10:41,607 WARN L170 areAnnotationChecker]: L1025-2 has no Hoare annotation [2020-07-11 01:10:41,608 WARN L170 areAnnotationChecker]: L1025-5 has no Hoare annotation [2020-07-11 01:10:41,608 WARN L170 areAnnotationChecker]: L1025-5 has no Hoare annotation [2020-07-11 01:10:41,608 WARN L170 areAnnotationChecker]: L1026-1 has no Hoare annotation [2020-07-11 01:10:41,608 WARN L170 areAnnotationChecker]: L1026-4 has no Hoare annotation [2020-07-11 01:10:41,608 WARN L170 areAnnotationChecker]: L1027 has no Hoare annotation [2020-07-11 01:10:41,608 WARN L170 areAnnotationChecker]: L1005-19 has no Hoare annotation [2020-07-11 01:10:41,608 WARN L170 areAnnotationChecker]: L1005-12 has no Hoare annotation [2020-07-11 01:10:41,608 WARN L170 areAnnotationChecker]: L1026-2 has no Hoare annotation [2020-07-11 01:10:41,608 WARN L170 areAnnotationChecker]: L1026-2 has no Hoare annotation [2020-07-11 01:10:41,608 WARN L170 areAnnotationChecker]: L1026-5 has no Hoare annotation [2020-07-11 01:10:41,609 WARN L170 areAnnotationChecker]: L1026-5 has no Hoare annotation [2020-07-11 01:10:41,609 WARN L170 areAnnotationChecker]: L1027-1 has no Hoare annotation [2020-07-11 01:10:41,609 WARN L170 areAnnotationChecker]: L1005-20 has no Hoare annotation [2020-07-11 01:10:41,609 WARN L170 areAnnotationChecker]: L1005-20 has no Hoare annotation [2020-07-11 01:10:41,609 WARN L170 areAnnotationChecker]: L1005-13 has no Hoare annotation [2020-07-11 01:10:41,609 WARN L170 areAnnotationChecker]: L1028 has no Hoare annotation [2020-07-11 01:10:41,609 WARN L170 areAnnotationChecker]: L1028 has no Hoare annotation [2020-07-11 01:10:41,609 WARN L170 areAnnotationChecker]: L1005-24 has no Hoare annotation [2020-07-11 01:10:41,609 WARN L170 areAnnotationChecker]: L1005-24 has no Hoare annotation [2020-07-11 01:10:41,609 WARN L170 areAnnotationChecker]: L1005-22 has no Hoare annotation [2020-07-11 01:10:41,610 WARN L170 areAnnotationChecker]: L1005-14 has no Hoare annotation [2020-07-11 01:10:41,610 WARN L170 areAnnotationChecker]: L1029 has no Hoare annotation [2020-07-11 01:10:41,610 WARN L170 areAnnotationChecker]: L1005-25 has no Hoare annotation [2020-07-11 01:10:41,610 WARN L170 areAnnotationChecker]: L1005-30 has no Hoare annotation [2020-07-11 01:10:41,610 WARN L170 areAnnotationChecker]: L1005-23 has no Hoare annotation [2020-07-11 01:10:41,610 WARN L170 areAnnotationChecker]: L1005-15 has no Hoare annotation [2020-07-11 01:10:41,610 WARN L170 areAnnotationChecker]: L1029-1 has no Hoare annotation [2020-07-11 01:10:41,610 WARN L170 areAnnotationChecker]: L1005-26 has no Hoare annotation [2020-07-11 01:10:41,610 WARN L170 areAnnotationChecker]: L1005-31 has no Hoare annotation [2020-07-11 01:10:41,610 WARN L170 areAnnotationChecker]: L1005-16 has no Hoare annotation [2020-07-11 01:10:41,610 WARN L170 areAnnotationChecker]: L1029-2 has no Hoare annotation [2020-07-11 01:10:41,611 WARN L170 areAnnotationChecker]: L1005-27 has no Hoare annotation [2020-07-11 01:10:41,611 WARN L170 areAnnotationChecker]: L1005-32 has no Hoare annotation [2020-07-11 01:10:41,611 WARN L170 areAnnotationChecker]: L1005-17 has no Hoare annotation [2020-07-11 01:10:41,611 WARN L170 areAnnotationChecker]: L1005-28 has no Hoare annotation [2020-07-11 01:10:41,611 WARN L170 areAnnotationChecker]: L1005-28 has no Hoare annotation [2020-07-11 01:10:41,611 WARN L170 areAnnotationChecker]: L1005-33 has no Hoare annotation [2020-07-11 01:10:41,611 WARN L170 areAnnotationChecker]: L1005-33 has no Hoare annotation [2020-07-11 01:10:41,611 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-11 01:10:41,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 01:10:41 BoogieIcfgContainer [2020-07-11 01:10:41,615 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 01:10:41,618 INFO L168 Benchmark]: Toolchain (without parser) took 132061.72 ms. Allocated memory was 145.8 MB in the beginning and 722.5 MB in the end (delta: 576.7 MB). Free memory was 102.8 MB in the beginning and 546.8 MB in the end (delta: -444.0 MB). Peak memory consumption was 132.7 MB. Max. memory is 7.1 GB. [2020-07-11 01:10:41,618 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 145.8 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-11 01:10:41,619 INFO L168 Benchmark]: CACSL2BoogieTranslator took 705.54 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 102.6 MB in the beginning and 169.5 MB in the end (delta: -66.9 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. [2020-07-11 01:10:41,620 INFO L168 Benchmark]: Boogie Preprocessor took 102.83 ms. Allocated memory is still 203.9 MB. Free memory was 169.5 MB in the beginning and 165.5 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. [2020-07-11 01:10:41,620 INFO L168 Benchmark]: RCFGBuilder took 1008.50 ms. Allocated memory was 203.9 MB in the beginning and 235.4 MB in the end (delta: 31.5 MB). Free memory was 165.5 MB in the beginning and 190.2 MB in the end (delta: -24.7 MB). Peak memory consumption was 78.5 MB. Max. memory is 7.1 GB. [2020-07-11 01:10:41,621 INFO L168 Benchmark]: TraceAbstraction took 130239.45 ms. Allocated memory was 235.4 MB in the beginning and 722.5 MB in the end (delta: 487.1 MB). Free memory was 190.2 MB in the beginning and 546.8 MB in the end (delta: -356.6 MB). Peak memory consumption was 130.5 MB. Max. memory is 7.1 GB. [2020-07-11 01:10:41,623 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.25 ms. Allocated memory is still 145.8 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 705.54 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 102.6 MB in the beginning and 169.5 MB in the end (delta: -66.9 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 102.83 ms. Allocated memory is still 203.9 MB. Free memory was 169.5 MB in the beginning and 165.5 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1008.50 ms. Allocated memory was 203.9 MB in the beginning and 235.4 MB in the end (delta: 31.5 MB). Free memory was 165.5 MB in the beginning and 190.2 MB in the end (delta: -24.7 MB). Peak memory consumption was 78.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 130239.45 ms. Allocated memory was 235.4 MB in the beginning and 722.5 MB in the end (delta: 487.1 MB). Free memory was 190.2 MB in the beginning and 546.8 MB in the end (delta: -356.6 MB). Peak memory consumption was 130.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1025]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L991] SLL* list = malloc(sizeof(SLL)); VAL [list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L992] list->next = ((void*)0) VAL [list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L993] COND FALSE !(!(list != ((void*)0))) VAL [list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L993] COND FALSE !(__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L993] list->inner = malloc(sizeof(SLL)) VAL [list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L993] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L993] list->inner->next = ((void*)0) VAL [list={-1:0}, list->inner={-2:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L993] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L993] list->inner->inner = ((void*)0) VAL [list={-1:0}, list->inner={-2:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L993] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={-1:0}, list->inner={-2:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L993] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) VAL [list={-1:0}, list->inner={-2:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L995] SLL* end = list; VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L998] COND FALSE !(__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1008] end = ((void*)0) VAL [end={0:0}, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1009] end = list VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1012] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1014] COND TRUE ((void*)0) != end VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1016] int len = 0; VAL [end={-1:0}, len=0, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1017] EXPR end->inner VAL [end={-1:0}, end->inner={-2:0}, len=0, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1017] SLL* inner = end->inner; VAL [end={-1:0}, end->inner={-2:0}, inner={-2:0}, len=0, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1018] COND TRUE ((void*)0) != inner VAL [end={-1:0}, inner={-2:0}, len=0, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1020] COND TRUE len == 0 VAL [end={-1:0}, inner={-2:0}, len=0, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1021] len = 1 VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1025] EXPR inner->inner VAL [end={-1:0}, inner={-2:0}, inner->inner={0:0}, len=1, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1025] COND FALSE !(!(((void*)0) == inner->inner)) VAL [end={-1:0}, inner={-2:0}, inner->inner={0:0}, len=1, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1026] EXPR inner->next VAL [end={-1:0}, inner={-2:0}, inner->next={0:0}, len=1, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1026] COND FALSE !(!(((void*)0) == inner->next)) VAL [end={-1:0}, inner={-2:0}, inner->next={0:0}, len=1, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1027] EXPR inner->inner VAL [end={-1:0}, inner={-2:0}, inner->inner={0:0}, len=1, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1027] inner = inner->inner VAL [end={-1:0}, inner={0:0}, inner->inner={0:0}, len=1, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1028] COND TRUE len == 1 VAL [end={-1:0}, inner={0:0}, len=1, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1029] EXPR inner->inner VAL [end={-1:0}, inner={0:0}, inner->inner={10:3}, len=1, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1029] inner = inner->inner VAL [end={-1:0}, inner={10:3}, inner->inner={10:3}, len=1, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1018] COND TRUE ((void*)0) != inner VAL [end={-1:0}, inner={10:3}, len=1, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1020] COND FALSE !(len == 0) VAL [end={-1:0}, inner={10:3}, len=1, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1023] len = 2 VAL [end={-1:0}, inner={10:3}, len=2, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={-1:0}, inner={10:3}, len=2, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1025] EXPR inner->inner VAL [end={-1:0}, inner={10:3}, inner->inner={11:13}, len=2, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1025] COND TRUE !(((void*)0) == inner->inner) VAL [end={-1:0}, inner={10:3}, inner->inner={11:13}, len=2, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1025] __VERIFIER_error() VAL [end={-1:0}, inner={10:3}, len=2, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 171 locations, 13 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 130.0s, OverallIterations: 20, TraceHistogramMax: 2, AutomataDifference: 83.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3224 SDtfs, 6436 SDslu, 10787 SDs, 0 SdLazy, 7275 SolverSat, 254 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 283 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=343occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 26.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 1881 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 952 NumberOfCodeBlocks, 952 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 860 ConstructedInterpolants, 0 QuantifiedInterpolants, 314052 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 17 PerfectInterpolantSequences, 13/16 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...