/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/dll-sorted-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 05:14:46,330 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 05:14:46,333 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 05:14:46,352 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 05:14:46,353 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 05:14:46,355 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 05:14:46,357 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 05:14:46,367 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 05:14:46,370 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 05:14:46,374 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 05:14:46,376 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 05:14:46,379 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 05:14:46,379 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 05:14:46,381 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 05:14:46,383 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 05:14:46,385 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 05:14:46,386 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 05:14:46,387 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 05:14:46,388 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 05:14:46,392 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 05:14:46,397 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 05:14:46,401 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 05:14:46,402 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 05:14:46,402 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 05:14:46,405 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 05:14:46,405 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 05:14:46,406 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 05:14:46,408 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 05:14:46,408 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 05:14:46,409 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 05:14:46,410 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 05:14:46,410 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 05:14:46,412 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 05:14:46,412 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 05:14:46,413 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 05:14:46,414 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 05:14:46,414 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 05:14:46,415 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 05:14:46,415 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 05:14:46,416 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 05:14:46,417 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 05:14:46,418 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 05:14:46,445 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 05:14:46,445 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 05:14:46,450 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 05:14:46,450 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 05:14:46,450 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 05:14:46,450 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 05:14:46,451 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 05:14:46,451 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 05:14:46,451 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 05:14:46,451 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 05:14:46,451 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 05:14:46,451 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 05:14:46,452 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 05:14:46,452 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 05:14:46,452 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 05:14:46,452 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 05:14:46,453 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 05:14:46,453 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 05:14:46,453 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 05:14:46,453 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 05:14:46,453 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 05:14:46,454 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 05:14:46,454 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-18 05:14:46,753 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 05:14:46,766 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 05:14:46,771 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 05:14:46,772 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 05:14:46,773 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 05:14:46,773 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-sorted-1.i [2020-07-18 05:14:46,846 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03bc7c38a/998bd49e976e4200a3bad077229b145b/FLAGd15a0c280 [2020-07-18 05:14:47,429 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 05:14:47,430 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-sorted-1.i [2020-07-18 05:14:47,441 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03bc7c38a/998bd49e976e4200a3bad077229b145b/FLAGd15a0c280 [2020-07-18 05:14:47,666 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03bc7c38a/998bd49e976e4200a3bad077229b145b [2020-07-18 05:14:47,675 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 05:14:47,677 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 05:14:47,678 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 05:14:47,679 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 05:14:47,682 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 05:14:47,684 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 05:14:47" (1/1) ... [2020-07-18 05:14:47,686 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e8abd88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:14:47, skipping insertion in model container [2020-07-18 05:14:47,687 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 05:14:47" (1/1) ... [2020-07-18 05:14:47,695 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 05:14:47,740 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 05:14:48,231 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 05:14:48,247 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 05:14:48,316 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 05:14:48,396 INFO L208 MainTranslator]: Completed translation [2020-07-18 05:14:48,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:14:48 WrapperNode [2020-07-18 05:14:48,396 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 05:14:48,398 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 05:14:48,398 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 05:14:48,398 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 05:14:48,413 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:14:48" (1/1) ... [2020-07-18 05:14:48,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:14:48" (1/1) ... [2020-07-18 05:14:48,453 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:14:48" (1/1) ... [2020-07-18 05:14:48,454 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:14:48" (1/1) ... [2020-07-18 05:14:48,485 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:14:48" (1/1) ... [2020-07-18 05:14:48,497 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:14:48" (1/1) ... [2020-07-18 05:14:48,501 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:14:48" (1/1) ... [2020-07-18 05:14:48,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 05:14:48,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 05:14:48,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 05:14:48,509 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 05:14:48,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:14:48" (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-18 05:14:48,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 05:14:48,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 05:14:48,585 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 05:14:48,585 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-18 05:14:48,585 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-18 05:14:48,585 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-18 05:14:48,585 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-18 05:14:48,586 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-18 05:14:48,586 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-18 05:14:48,586 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-18 05:14:48,586 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-18 05:14:48,586 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-18 05:14:48,586 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-18 05:14:48,586 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-18 05:14:48,587 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-18 05:14:48,587 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-18 05:14:48,587 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-18 05:14:48,592 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-18 05:14:48,593 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-18 05:14:48,593 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-18 05:14:48,593 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-18 05:14:48,593 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-18 05:14:48,593 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-18 05:14:48,593 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-18 05:14:48,594 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-18 05:14:48,594 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-18 05:14:48,594 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-18 05:14:48,594 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-18 05:14:48,594 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-18 05:14:48,594 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-18 05:14:48,595 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-18 05:14:48,595 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-18 05:14:48,595 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-18 05:14:48,595 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-18 05:14:48,595 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-18 05:14:48,596 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-18 05:14:48,596 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-18 05:14:48,596 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-18 05:14:48,596 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-18 05:14:48,596 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-18 05:14:48,596 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-18 05:14:48,597 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-18 05:14:48,597 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-18 05:14:48,597 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-18 05:14:48,597 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-18 05:14:48,597 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-18 05:14:48,597 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-18 05:14:48,598 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-18 05:14:48,598 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-18 05:14:48,598 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-18 05:14:48,598 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-18 05:14:48,598 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-18 05:14:48,599 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-18 05:14:48,599 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-18 05:14:48,599 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-18 05:14:48,599 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-18 05:14:48,599 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-18 05:14:48,599 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-18 05:14:48,599 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-18 05:14:48,599 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-18 05:14:48,600 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-18 05:14:48,600 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-18 05:14:48,600 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-18 05:14:48,600 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-18 05:14:48,600 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-18 05:14:48,600 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-18 05:14:48,600 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-18 05:14:48,601 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-18 05:14:48,601 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-18 05:14:48,601 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-18 05:14:48,601 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-18 05:14:48,601 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-18 05:14:48,601 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-18 05:14:48,602 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-18 05:14:48,602 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-18 05:14:48,602 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-18 05:14:48,602 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-18 05:14:48,602 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-18 05:14:48,602 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-18 05:14:48,603 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-18 05:14:48,603 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-18 05:14:48,603 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-18 05:14:48,603 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-18 05:14:48,603 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-18 05:14:48,603 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-18 05:14:48,604 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-18 05:14:48,604 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-18 05:14:48,604 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-18 05:14:48,604 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-18 05:14:48,604 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-18 05:14:48,604 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-18 05:14:48,605 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-18 05:14:48,605 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-18 05:14:48,605 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-18 05:14:48,605 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-18 05:14:48,605 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-18 05:14:48,605 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-18 05:14:48,606 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-18 05:14:48,606 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-18 05:14:48,606 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-18 05:14:48,606 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-18 05:14:48,606 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-18 05:14:48,606 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-18 05:14:48,607 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-18 05:14:48,607 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-18 05:14:48,607 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-18 05:14:48,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 05:14:48,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 05:14:48,607 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 05:14:48,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-18 05:14:48,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-18 05:14:48,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-18 05:14:48,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-18 05:14:48,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-18 05:14:48,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-18 05:14:48,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 05:14:48,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 05:14:49,522 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 05:14:49,522 INFO L295 CfgBuilder]: Removed 18 assume(true) statements. [2020-07-18 05:14:49,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 05:14:49 BoogieIcfgContainer [2020-07-18 05:14:49,529 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 05:14:49,533 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 05:14:49,533 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 05:14:49,537 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 05:14:49,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 05:14:47" (1/3) ... [2020-07-18 05:14:49,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@144df6db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 05:14:49, skipping insertion in model container [2020-07-18 05:14:49,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:14:48" (2/3) ... [2020-07-18 05:14:49,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@144df6db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 05:14:49, skipping insertion in model container [2020-07-18 05:14:49,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 05:14:49" (3/3) ... [2020-07-18 05:14:49,542 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-sorted-1.i [2020-07-18 05:14:49,554 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 05:14:49,565 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-07-18 05:14:49,580 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-07-18 05:14:49,606 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 05:14:49,606 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 05:14:49,606 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-18 05:14:49,606 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 05:14:49,607 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 05:14:49,607 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 05:14:49,607 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 05:14:49,608 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 05:14:49,635 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states. [2020-07-18 05:14:49,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-18 05:14:49,646 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:14:49,647 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 05:14:49,648 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:14:49,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:14:49,655 INFO L82 PathProgramCache]: Analyzing trace with hash 815166367, now seen corresponding path program 1 times [2020-07-18 05:14:49,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:14:49,665 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [568486387] [2020-07-18 05:14:49,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:14:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:14:49,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:14:49,916 INFO L280 TraceCheckUtils]: 0: Hoare triple {166#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {159#true} is VALID [2020-07-18 05:14:49,917 INFO L280 TraceCheckUtils]: 1: Hoare triple {159#true} #valid := #valid[0 := 0]; {159#true} is VALID [2020-07-18 05:14:49,917 INFO L280 TraceCheckUtils]: 2: Hoare triple {159#true} assume 0 < #StackHeapBarrier; {159#true} is VALID [2020-07-18 05:14:49,918 INFO L280 TraceCheckUtils]: 3: Hoare triple {159#true} assume true; {159#true} is VALID [2020-07-18 05:14:49,918 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {159#true} {159#true} #330#return; {159#true} is VALID [2020-07-18 05:14:49,923 INFO L263 TraceCheckUtils]: 0: Hoare triple {159#true} call ULTIMATE.init(); {166#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 05:14:49,923 INFO L280 TraceCheckUtils]: 1: Hoare triple {166#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {159#true} is VALID [2020-07-18 05:14:49,924 INFO L280 TraceCheckUtils]: 2: Hoare triple {159#true} #valid := #valid[0 := 0]; {159#true} is VALID [2020-07-18 05:14:49,924 INFO L280 TraceCheckUtils]: 3: Hoare triple {159#true} assume 0 < #StackHeapBarrier; {159#true} is VALID [2020-07-18 05:14:49,924 INFO L280 TraceCheckUtils]: 4: Hoare triple {159#true} assume true; {159#true} is VALID [2020-07-18 05:14:49,924 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {159#true} {159#true} #330#return; {159#true} is VALID [2020-07-18 05:14:49,925 INFO L263 TraceCheckUtils]: 6: Hoare triple {159#true} call #t~ret29 := main(); {159#true} is VALID [2020-07-18 05:14:49,925 INFO L280 TraceCheckUtils]: 7: Hoare triple {159#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {159#true} is VALID [2020-07-18 05:14:49,925 INFO L280 TraceCheckUtils]: 8: Hoare triple {159#true} ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {159#true} is VALID [2020-07-18 05:14:49,926 INFO L280 TraceCheckUtils]: 9: Hoare triple {159#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L987 {159#true} is VALID [2020-07-18 05:14:49,926 INFO L280 TraceCheckUtils]: 10: Hoare triple {159#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L987-1 {159#true} is VALID [2020-07-18 05:14:49,926 INFO L280 TraceCheckUtils]: 11: Hoare triple {159#true} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L988 {159#true} is VALID [2020-07-18 05:14:49,927 INFO L280 TraceCheckUtils]: 12: Hoare triple {159#true} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {159#true} is VALID [2020-07-18 05:14:49,927 INFO L280 TraceCheckUtils]: 13: Hoare triple {159#true} ~marked~0 := 0; {159#true} is VALID [2020-07-18 05:14:49,928 INFO L280 TraceCheckUtils]: 14: Hoare triple {159#true} assume !true; {160#false} is VALID [2020-07-18 05:14:49,928 INFO L280 TraceCheckUtils]: 15: Hoare triple {160#false} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {160#false} is VALID [2020-07-18 05:14:49,929 INFO L280 TraceCheckUtils]: 16: Hoare triple {160#false} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {160#false} is VALID [2020-07-18 05:14:49,929 INFO L280 TraceCheckUtils]: 17: Hoare triple {160#false} assume !false; {160#false} is VALID [2020-07-18 05:14:49,933 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-18 05:14:49,934 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [568486387] [2020-07-18 05:14:49,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:14:49,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:14:49,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582272702] [2020-07-18 05:14:49,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-18 05:14:49,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:14:49,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:14:49,980 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:14:49,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:14:49,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:14:49,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:14:49,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:14:49,992 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 3 states. [2020-07-18 05:14:50,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:14:50,857 INFO L93 Difference]: Finished difference Result 277 states and 343 transitions. [2020-07-18 05:14:50,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:14:50,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-18 05:14:50,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:14:50,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:14:50,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions. [2020-07-18 05:14:50,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:14:50,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions. [2020-07-18 05:14:50,894 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 343 transitions. [2020-07-18 05:14:51,262 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 343 edges. 343 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:14:51,281 INFO L225 Difference]: With dead ends: 277 [2020-07-18 05:14:51,281 INFO L226 Difference]: Without dead ends: 144 [2020-07-18 05:14:51,286 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:14:51,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-07-18 05:14:51,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2020-07-18 05:14:51,385 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:14:51,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand 144 states. [2020-07-18 05:14:51,386 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 144 states. [2020-07-18 05:14:51,387 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 144 states. [2020-07-18 05:14:51,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:14:51,397 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2020-07-18 05:14:51,397 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 154 transitions. [2020-07-18 05:14:51,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:14:51,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:14:51,400 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 144 states. [2020-07-18 05:14:51,400 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 144 states. [2020-07-18 05:14:51,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:14:51,419 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2020-07-18 05:14:51,419 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 154 transitions. [2020-07-18 05:14:51,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:14:51,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:14:51,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:14:51,428 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:14:51,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-07-18 05:14:51,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 154 transitions. [2020-07-18 05:14:51,439 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 154 transitions. Word has length 18 [2020-07-18 05:14:51,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:14:51,440 INFO L479 AbstractCegarLoop]: Abstraction has 144 states and 154 transitions. [2020-07-18 05:14:51,440 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:14:51,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 144 states and 154 transitions. [2020-07-18 05:14:51,606 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:14:51,606 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 154 transitions. [2020-07-18 05:14:51,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-18 05:14:51,607 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:14:51,607 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] [2020-07-18 05:14:51,608 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 05:14:51,608 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:14:51,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:14:51,608 INFO L82 PathProgramCache]: Analyzing trace with hash 626661666, now seen corresponding path program 1 times [2020-07-18 05:14:51,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:14:51,609 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [222553501] [2020-07-18 05:14:51,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:14:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:14:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:14:51,689 INFO L280 TraceCheckUtils]: 0: Hoare triple {1307#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1299#true} is VALID [2020-07-18 05:14:51,690 INFO L280 TraceCheckUtils]: 1: Hoare triple {1299#true} #valid := #valid[0 := 0]; {1299#true} is VALID [2020-07-18 05:14:51,690 INFO L280 TraceCheckUtils]: 2: Hoare triple {1299#true} assume 0 < #StackHeapBarrier; {1299#true} is VALID [2020-07-18 05:14:51,690 INFO L280 TraceCheckUtils]: 3: Hoare triple {1299#true} assume true; {1299#true} is VALID [2020-07-18 05:14:51,691 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1299#true} {1299#true} #330#return; {1299#true} is VALID [2020-07-18 05:14:51,692 INFO L263 TraceCheckUtils]: 0: Hoare triple {1299#true} call ULTIMATE.init(); {1307#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 05:14:51,692 INFO L280 TraceCheckUtils]: 1: Hoare triple {1307#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1299#true} is VALID [2020-07-18 05:14:51,692 INFO L280 TraceCheckUtils]: 2: Hoare triple {1299#true} #valid := #valid[0 := 0]; {1299#true} is VALID [2020-07-18 05:14:51,693 INFO L280 TraceCheckUtils]: 3: Hoare triple {1299#true} assume 0 < #StackHeapBarrier; {1299#true} is VALID [2020-07-18 05:14:51,693 INFO L280 TraceCheckUtils]: 4: Hoare triple {1299#true} assume true; {1299#true} is VALID [2020-07-18 05:14:51,693 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1299#true} {1299#true} #330#return; {1299#true} is VALID [2020-07-18 05:14:51,694 INFO L263 TraceCheckUtils]: 6: Hoare triple {1299#true} call #t~ret29 := main(); {1299#true} is VALID [2020-07-18 05:14:51,694 INFO L280 TraceCheckUtils]: 7: Hoare triple {1299#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {1299#true} is VALID [2020-07-18 05:14:51,694 INFO L280 TraceCheckUtils]: 8: Hoare triple {1299#true} ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {1299#true} is VALID [2020-07-18 05:14:51,694 INFO L280 TraceCheckUtils]: 9: Hoare triple {1299#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L987 {1299#true} is VALID [2020-07-18 05:14:51,695 INFO L280 TraceCheckUtils]: 10: Hoare triple {1299#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L987-1 {1299#true} is VALID [2020-07-18 05:14:51,695 INFO L280 TraceCheckUtils]: 11: Hoare triple {1299#true} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L988 {1299#true} is VALID [2020-07-18 05:14:51,695 INFO L280 TraceCheckUtils]: 12: Hoare triple {1299#true} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1299#true} is VALID [2020-07-18 05:14:51,696 INFO L280 TraceCheckUtils]: 13: Hoare triple {1299#true} ~marked~0 := 0; {1306#(= 0 main_~marked~0)} is VALID [2020-07-18 05:14:51,697 INFO L280 TraceCheckUtils]: 14: Hoare triple {1306#(= 0 main_~marked~0)} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1306#(= 0 main_~marked~0)} is VALID [2020-07-18 05:14:51,697 INFO L280 TraceCheckUtils]: 15: Hoare triple {1306#(= 0 main_~marked~0)} assume !(0 != #t~nondet1 || 0 == ~marked~0); {1300#false} is VALID [2020-07-18 05:14:51,698 INFO L280 TraceCheckUtils]: 16: Hoare triple {1300#false} havoc #t~nondet1; {1300#false} is VALID [2020-07-18 05:14:51,698 INFO L280 TraceCheckUtils]: 17: Hoare triple {1300#false} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1300#false} is VALID [2020-07-18 05:14:51,698 INFO L280 TraceCheckUtils]: 18: Hoare triple {1300#false} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {1300#false} is VALID [2020-07-18 05:14:51,699 INFO L280 TraceCheckUtils]: 19: Hoare triple {1300#false} assume !false; {1300#false} is VALID [2020-07-18 05:14:51,713 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-18 05:14:51,713 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [222553501] [2020-07-18 05:14:51,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:14:51,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-18 05:14:51,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334410017] [2020-07-18 05:14:51,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-07-18 05:14:51,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:14:51,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-18 05:14:51,752 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:14:51,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-18 05:14:51,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:14:51,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-18 05:14:51,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 05:14:51,754 INFO L87 Difference]: Start difference. First operand 144 states and 154 transitions. Second operand 4 states. [2020-07-18 05:14:52,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:14:52,518 INFO L93 Difference]: Finished difference Result 295 states and 318 transitions. [2020-07-18 05:14:52,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-18 05:14:52,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-07-18 05:14:52,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:14:52,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 05:14:52,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 318 transitions. [2020-07-18 05:14:52,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 05:14:52,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 318 transitions. [2020-07-18 05:14:52,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 318 transitions. [2020-07-18 05:14:52,834 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 318 edges. 318 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:14:52,839 INFO L225 Difference]: With dead ends: 295 [2020-07-18 05:14:52,839 INFO L226 Difference]: Without dead ends: 165 [2020-07-18 05:14:52,844 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-18 05:14:52,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-07-18 05:14:52,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 160. [2020-07-18 05:14:52,979 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:14:52,979 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand 160 states. [2020-07-18 05:14:52,979 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 160 states. [2020-07-18 05:14:52,980 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 160 states. [2020-07-18 05:14:52,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:14:52,991 INFO L93 Difference]: Finished difference Result 165 states and 176 transitions. [2020-07-18 05:14:52,992 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 176 transitions. [2020-07-18 05:14:52,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:14:52,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:14:52,993 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 165 states. [2020-07-18 05:14:52,993 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 165 states. [2020-07-18 05:14:53,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:14:53,005 INFO L93 Difference]: Finished difference Result 165 states and 176 transitions. [2020-07-18 05:14:53,005 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 176 transitions. [2020-07-18 05:14:53,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:14:53,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:14:53,006 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:14:53,006 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:14:53,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2020-07-18 05:14:53,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 171 transitions. [2020-07-18 05:14:53,016 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 171 transitions. Word has length 20 [2020-07-18 05:14:53,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:14:53,017 INFO L479 AbstractCegarLoop]: Abstraction has 160 states and 171 transitions. [2020-07-18 05:14:53,017 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-18 05:14:53,017 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 160 states and 171 transitions. [2020-07-18 05:14:53,200 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-18 05:14:53,201 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 171 transitions. [2020-07-18 05:14:53,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-18 05:14:53,202 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:14:53,202 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 05:14:53,203 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 05:14:53,203 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:14:53,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:14:53,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1840738898, now seen corresponding path program 1 times [2020-07-18 05:14:53,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:14:53,204 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1568661848] [2020-07-18 05:14:53,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:14:53,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:14:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:14:53,373 INFO L280 TraceCheckUtils]: 0: Hoare triple {2560#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2550#true} is VALID [2020-07-18 05:14:53,373 INFO L280 TraceCheckUtils]: 1: Hoare triple {2550#true} #valid := #valid[0 := 0]; {2550#true} is VALID [2020-07-18 05:14:53,374 INFO L280 TraceCheckUtils]: 2: Hoare triple {2550#true} assume 0 < #StackHeapBarrier; {2550#true} is VALID [2020-07-18 05:14:53,374 INFO L280 TraceCheckUtils]: 3: Hoare triple {2550#true} assume true; {2550#true} is VALID [2020-07-18 05:14:53,374 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2550#true} {2550#true} #330#return; {2550#true} is VALID [2020-07-18 05:14:53,380 INFO L263 TraceCheckUtils]: 0: Hoare triple {2550#true} call ULTIMATE.init(); {2560#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 05:14:53,380 INFO L280 TraceCheckUtils]: 1: Hoare triple {2560#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2550#true} is VALID [2020-07-18 05:14:53,381 INFO L280 TraceCheckUtils]: 2: Hoare triple {2550#true} #valid := #valid[0 := 0]; {2550#true} is VALID [2020-07-18 05:14:53,381 INFO L280 TraceCheckUtils]: 3: Hoare triple {2550#true} assume 0 < #StackHeapBarrier; {2550#true} is VALID [2020-07-18 05:14:53,381 INFO L280 TraceCheckUtils]: 4: Hoare triple {2550#true} assume true; {2550#true} is VALID [2020-07-18 05:14:53,382 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2550#true} {2550#true} #330#return; {2550#true} is VALID [2020-07-18 05:14:53,382 INFO L263 TraceCheckUtils]: 6: Hoare triple {2550#true} call #t~ret29 := main(); {2550#true} is VALID [2020-07-18 05:14:53,388 INFO L280 TraceCheckUtils]: 7: Hoare triple {2550#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {2557#(not (= 0 |main_#t~malloc0.base|))} is VALID [2020-07-18 05:14:53,389 INFO L280 TraceCheckUtils]: 8: Hoare triple {2557#(not (= 0 |main_#t~malloc0.base|))} ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {2558#(not (= 0 main_~head~0.base))} is VALID [2020-07-18 05:14:53,396 INFO L280 TraceCheckUtils]: 9: Hoare triple {2558#(not (= 0 main_~head~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L987 {2558#(not (= 0 main_~head~0.base))} is VALID [2020-07-18 05:14:53,398 INFO L280 TraceCheckUtils]: 10: Hoare triple {2558#(not (= 0 main_~head~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L987-1 {2558#(not (= 0 main_~head~0.base))} is VALID [2020-07-18 05:14:53,404 INFO L280 TraceCheckUtils]: 11: Hoare triple {2558#(not (= 0 main_~head~0.base))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L988 {2558#(not (= 0 main_~head~0.base))} is VALID [2020-07-18 05:14:53,405 INFO L280 TraceCheckUtils]: 12: Hoare triple {2558#(not (= 0 main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {2558#(not (= 0 main_~head~0.base))} is VALID [2020-07-18 05:14:53,405 INFO L280 TraceCheckUtils]: 13: Hoare triple {2558#(not (= 0 main_~head~0.base))} ~marked~0 := 0; {2558#(not (= 0 main_~head~0.base))} is VALID [2020-07-18 05:14:53,406 INFO L280 TraceCheckUtils]: 14: Hoare triple {2558#(not (= 0 main_~head~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2558#(not (= 0 main_~head~0.base))} is VALID [2020-07-18 05:14:53,408 INFO L280 TraceCheckUtils]: 15: Hoare triple {2558#(not (= 0 main_~head~0.base))} assume !!(0 != #t~nondet1 || 0 == ~marked~0); {2558#(not (= 0 main_~head~0.base))} is VALID [2020-07-18 05:14:53,408 INFO L280 TraceCheckUtils]: 16: Hoare triple {2558#(not (= 0 main_~head~0.base))} havoc #t~nondet1; {2558#(not (= 0 main_~head~0.base))} is VALID [2020-07-18 05:14:53,409 INFO L280 TraceCheckUtils]: 17: Hoare triple {2558#(not (= 0 main_~head~0.base))} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12); srcloc: L998 {2558#(not (= 0 main_~head~0.base))} is VALID [2020-07-18 05:14:53,410 INFO L280 TraceCheckUtils]: 18: Hoare triple {2558#(not (= 0 main_~head~0.base))} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L998-1 {2558#(not (= 0 main_~head~0.base))} is VALID [2020-07-18 05:14:53,410 INFO L280 TraceCheckUtils]: 19: Hoare triple {2558#(not (= 0 main_~head~0.base))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L998-2 {2558#(not (= 0 main_~head~0.base))} is VALID [2020-07-18 05:14:53,411 INFO L280 TraceCheckUtils]: 20: Hoare triple {2558#(not (= 0 main_~head~0.base))} SUMMARY for call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4); srcloc: L999 {2558#(not (= 0 main_~head~0.base))} is VALID [2020-07-18 05:14:53,411 INFO L280 TraceCheckUtils]: 21: Hoare triple {2558#(not (= 0 main_~head~0.base))} havoc #t~mem3.base, #t~mem3.offset; {2558#(not (= 0 main_~head~0.base))} is VALID [2020-07-18 05:14:53,412 INFO L280 TraceCheckUtils]: 22: Hoare triple {2558#(not (= 0 main_~head~0.base))} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1000 {2558#(not (= 0 main_~head~0.base))} is VALID [2020-07-18 05:14:53,413 INFO L280 TraceCheckUtils]: 23: Hoare triple {2558#(not (= 0 main_~head~0.base))} ~x~0.base, ~x~0.offset := #t~mem4.base, #t~mem4.offset; {2558#(not (= 0 main_~head~0.base))} is VALID [2020-07-18 05:14:53,413 INFO L280 TraceCheckUtils]: 24: Hoare triple {2558#(not (= 0 main_~head~0.base))} havoc #t~mem4.base, #t~mem4.offset; {2558#(not (= 0 main_~head~0.base))} is VALID [2020-07-18 05:14:53,414 INFO L280 TraceCheckUtils]: 25: Hoare triple {2558#(not (= 0 main_~head~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~x~0.base, ~x~0.offset, 4); srcloc: L1001 {2558#(not (= 0 main_~head~0.base))} is VALID [2020-07-18 05:14:53,415 INFO L280 TraceCheckUtils]: 26: Hoare triple {2558#(not (= 0 main_~head~0.base))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2558#(not (= 0 main_~head~0.base))} is VALID [2020-07-18 05:14:53,415 INFO L280 TraceCheckUtils]: 27: Hoare triple {2558#(not (= 0 main_~head~0.base))} assume 0 != #t~nondet5; {2558#(not (= 0 main_~head~0.base))} is VALID [2020-07-18 05:14:53,416 INFO L280 TraceCheckUtils]: 28: Hoare triple {2558#(not (= 0 main_~head~0.base))} havoc #t~nondet5; {2558#(not (= 0 main_~head~0.base))} is VALID [2020-07-18 05:14:53,416 INFO L280 TraceCheckUtils]: 29: Hoare triple {2558#(not (= 0 main_~head~0.base))} ~marked~0 := 1; {2558#(not (= 0 main_~head~0.base))} is VALID [2020-07-18 05:14:53,417 INFO L280 TraceCheckUtils]: 30: Hoare triple {2558#(not (= 0 main_~head~0.base))} assume 0 != ~marked~0; {2558#(not (= 0 main_~head~0.base))} is VALID [2020-07-18 05:14:53,418 INFO L280 TraceCheckUtils]: 31: Hoare triple {2558#(not (= 0 main_~head~0.base))} SUMMARY for call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1009 {2558#(not (= 0 main_~head~0.base))} is VALID [2020-07-18 05:14:53,418 INFO L280 TraceCheckUtils]: 32: Hoare triple {2558#(not (= 0 main_~head~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2558#(not (= 0 main_~head~0.base))} is VALID [2020-07-18 05:14:53,420 INFO L280 TraceCheckUtils]: 33: Hoare triple {2558#(not (= 0 main_~head~0.base))} assume !(0 != #t~nondet1 || 0 == ~marked~0); {2558#(not (= 0 main_~head~0.base))} is VALID [2020-07-18 05:14:53,422 INFO L280 TraceCheckUtils]: 34: Hoare triple {2558#(not (= 0 main_~head~0.base))} havoc #t~nondet1; {2558#(not (= 0 main_~head~0.base))} is VALID [2020-07-18 05:14:53,424 INFO L280 TraceCheckUtils]: 35: Hoare triple {2558#(not (= 0 main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {2559#(not (= 0 main_~x~0.base))} is VALID [2020-07-18 05:14:53,425 INFO L280 TraceCheckUtils]: 36: Hoare triple {2559#(not (= 0 main_~x~0.base))} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {2551#false} is VALID [2020-07-18 05:14:53,425 INFO L280 TraceCheckUtils]: 37: Hoare triple {2551#false} assume !false; {2551#false} is VALID [2020-07-18 05:14:53,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-18 05:14:53,429 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1568661848] [2020-07-18 05:14:53,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:14:53,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-18 05:14:53,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539232965] [2020-07-18 05:14:53,432 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2020-07-18 05:14:53,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:14:53,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 05:14:53,477 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:14:53,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 05:14:53,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:14:53,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 05:14:53,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-18 05:14:53,478 INFO L87 Difference]: Start difference. First operand 160 states and 171 transitions. Second operand 6 states. [2020-07-18 05:14:54,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:14:54,852 INFO L93 Difference]: Finished difference Result 262 states and 280 transitions. [2020-07-18 05:14:54,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 05:14:54,852 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2020-07-18 05:14:54,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:14:54,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 05:14:54,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 263 transitions. [2020-07-18 05:14:54,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 05:14:54,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 263 transitions. [2020-07-18 05:14:54,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 263 transitions. [2020-07-18 05:14:55,179 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 263 edges. 263 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:14:55,186 INFO L225 Difference]: With dead ends: 262 [2020-07-18 05:14:55,187 INFO L226 Difference]: Without dead ends: 260 [2020-07-18 05:14:55,187 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-18 05:14:55,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2020-07-18 05:14:55,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 158. [2020-07-18 05:14:55,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:14:55,488 INFO L82 GeneralOperation]: Start isEquivalent. First operand 260 states. Second operand 158 states. [2020-07-18 05:14:55,488 INFO L74 IsIncluded]: Start isIncluded. First operand 260 states. Second operand 158 states. [2020-07-18 05:14:55,489 INFO L87 Difference]: Start difference. First operand 260 states. Second operand 158 states. [2020-07-18 05:14:55,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:14:55,499 INFO L93 Difference]: Finished difference Result 260 states and 278 transitions. [2020-07-18 05:14:55,499 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 278 transitions. [2020-07-18 05:14:55,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:14:55,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:14:55,500 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 260 states. [2020-07-18 05:14:55,500 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 260 states. [2020-07-18 05:14:55,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:14:55,510 INFO L93 Difference]: Finished difference Result 260 states and 278 transitions. [2020-07-18 05:14:55,510 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 278 transitions. [2020-07-18 05:14:55,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:14:55,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:14:55,511 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:14:55,511 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:14:55,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2020-07-18 05:14:55,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 169 transitions. [2020-07-18 05:14:55,516 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 169 transitions. Word has length 38 [2020-07-18 05:14:55,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:14:55,517 INFO L479 AbstractCegarLoop]: Abstraction has 158 states and 169 transitions. [2020-07-18 05:14:55,517 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 05:14:55,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 158 states and 169 transitions. [2020-07-18 05:14:55,754 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-18 05:14:55,755 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 169 transitions. [2020-07-18 05:14:55,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-07-18 05:14:55,756 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:14:55,757 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 05:14:55,757 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 05:14:55,757 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:14:55,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:14:55,758 INFO L82 PathProgramCache]: Analyzing trace with hash 24683595, now seen corresponding path program 1 times [2020-07-18 05:14:55,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:14:55,758 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2022769820] [2020-07-18 05:14:55,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:14:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:14:55,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:14:55,879 INFO L280 TraceCheckUtils]: 0: Hoare triple {3935#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3927#true} is VALID [2020-07-18 05:14:55,879 INFO L280 TraceCheckUtils]: 1: Hoare triple {3927#true} #valid := #valid[0 := 0]; {3927#true} is VALID [2020-07-18 05:14:55,880 INFO L280 TraceCheckUtils]: 2: Hoare triple {3927#true} assume 0 < #StackHeapBarrier; {3927#true} is VALID [2020-07-18 05:14:55,880 INFO L280 TraceCheckUtils]: 3: Hoare triple {3927#true} assume true; {3927#true} is VALID [2020-07-18 05:14:55,880 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3927#true} {3927#true} #330#return; {3927#true} is VALID [2020-07-18 05:14:55,881 INFO L263 TraceCheckUtils]: 0: Hoare triple {3927#true} call ULTIMATE.init(); {3935#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 05:14:55,882 INFO L280 TraceCheckUtils]: 1: Hoare triple {3935#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3927#true} is VALID [2020-07-18 05:14:55,882 INFO L280 TraceCheckUtils]: 2: Hoare triple {3927#true} #valid := #valid[0 := 0]; {3927#true} is VALID [2020-07-18 05:14:55,882 INFO L280 TraceCheckUtils]: 3: Hoare triple {3927#true} assume 0 < #StackHeapBarrier; {3927#true} is VALID [2020-07-18 05:14:55,882 INFO L280 TraceCheckUtils]: 4: Hoare triple {3927#true} assume true; {3927#true} is VALID [2020-07-18 05:14:55,883 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3927#true} {3927#true} #330#return; {3927#true} is VALID [2020-07-18 05:14:55,883 INFO L263 TraceCheckUtils]: 6: Hoare triple {3927#true} call #t~ret29 := main(); {3927#true} is VALID [2020-07-18 05:14:55,883 INFO L280 TraceCheckUtils]: 7: Hoare triple {3927#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {3927#true} is VALID [2020-07-18 05:14:55,883 INFO L280 TraceCheckUtils]: 8: Hoare triple {3927#true} ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {3927#true} is VALID [2020-07-18 05:14:55,884 INFO L280 TraceCheckUtils]: 9: Hoare triple {3927#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L987 {3927#true} is VALID [2020-07-18 05:14:55,884 INFO L280 TraceCheckUtils]: 10: Hoare triple {3927#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L987-1 {3927#true} is VALID [2020-07-18 05:14:55,884 INFO L280 TraceCheckUtils]: 11: Hoare triple {3927#true} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L988 {3927#true} is VALID [2020-07-18 05:14:55,884 INFO L280 TraceCheckUtils]: 12: Hoare triple {3927#true} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {3927#true} is VALID [2020-07-18 05:14:55,885 INFO L280 TraceCheckUtils]: 13: Hoare triple {3927#true} ~marked~0 := 0; {3927#true} is VALID [2020-07-18 05:14:55,885 INFO L280 TraceCheckUtils]: 14: Hoare triple {3927#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3927#true} is VALID [2020-07-18 05:14:55,885 INFO L280 TraceCheckUtils]: 15: Hoare triple {3927#true} assume !!(0 != #t~nondet1 || 0 == ~marked~0); {3927#true} is VALID [2020-07-18 05:14:55,886 INFO L280 TraceCheckUtils]: 16: Hoare triple {3927#true} havoc #t~nondet1; {3927#true} is VALID [2020-07-18 05:14:55,886 INFO L280 TraceCheckUtils]: 17: Hoare triple {3927#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12); srcloc: L998 {3927#true} is VALID [2020-07-18 05:14:55,886 INFO L280 TraceCheckUtils]: 18: Hoare triple {3927#true} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L998-1 {3927#true} is VALID [2020-07-18 05:14:55,886 INFO L280 TraceCheckUtils]: 19: Hoare triple {3927#true} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L998-2 {3927#true} is VALID [2020-07-18 05:14:55,887 INFO L280 TraceCheckUtils]: 20: Hoare triple {3927#true} SUMMARY for call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4); srcloc: L999 {3927#true} is VALID [2020-07-18 05:14:55,887 INFO L280 TraceCheckUtils]: 21: Hoare triple {3927#true} havoc #t~mem3.base, #t~mem3.offset; {3927#true} is VALID [2020-07-18 05:14:55,887 INFO L280 TraceCheckUtils]: 22: Hoare triple {3927#true} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1000 {3927#true} is VALID [2020-07-18 05:14:55,888 INFO L280 TraceCheckUtils]: 23: Hoare triple {3927#true} ~x~0.base, ~x~0.offset := #t~mem4.base, #t~mem4.offset; {3927#true} is VALID [2020-07-18 05:14:55,888 INFO L280 TraceCheckUtils]: 24: Hoare triple {3927#true} havoc #t~mem4.base, #t~mem4.offset; {3927#true} is VALID [2020-07-18 05:14:55,888 INFO L280 TraceCheckUtils]: 25: Hoare triple {3927#true} SUMMARY for call write~$Pointer$(0, 0, ~x~0.base, ~x~0.offset, 4); srcloc: L1001 {3927#true} is VALID [2020-07-18 05:14:55,888 INFO L280 TraceCheckUtils]: 26: Hoare triple {3927#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {3927#true} is VALID [2020-07-18 05:14:55,889 INFO L280 TraceCheckUtils]: 27: Hoare triple {3927#true} assume 0 != #t~nondet5; {3927#true} is VALID [2020-07-18 05:14:55,889 INFO L280 TraceCheckUtils]: 28: Hoare triple {3927#true} havoc #t~nondet5; {3927#true} is VALID [2020-07-18 05:14:55,889 INFO L280 TraceCheckUtils]: 29: Hoare triple {3927#true} ~marked~0 := 1; {3927#true} is VALID [2020-07-18 05:14:55,889 INFO L280 TraceCheckUtils]: 30: Hoare triple {3927#true} assume 0 != ~marked~0; {3927#true} is VALID [2020-07-18 05:14:55,890 INFO L280 TraceCheckUtils]: 31: Hoare triple {3927#true} SUMMARY for call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1009 {3927#true} is VALID [2020-07-18 05:14:55,890 INFO L280 TraceCheckUtils]: 32: Hoare triple {3927#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3927#true} is VALID [2020-07-18 05:14:55,890 INFO L280 TraceCheckUtils]: 33: Hoare triple {3927#true} assume !(0 != #t~nondet1 || 0 == ~marked~0); {3927#true} is VALID [2020-07-18 05:14:55,891 INFO L280 TraceCheckUtils]: 34: Hoare triple {3927#true} havoc #t~nondet1; {3927#true} is VALID [2020-07-18 05:14:55,891 INFO L280 TraceCheckUtils]: 35: Hoare triple {3927#true} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {3927#true} is VALID [2020-07-18 05:14:55,891 INFO L280 TraceCheckUtils]: 36: Hoare triple {3927#true} assume !!(0 != ~x~0.base || 0 != ~x~0.offset); {3927#true} is VALID [2020-07-18 05:14:55,891 INFO L280 TraceCheckUtils]: 37: Hoare triple {3927#true} goto; {3927#true} is VALID [2020-07-18 05:14:55,892 INFO L280 TraceCheckUtils]: 38: Hoare triple {3927#true} ~marked~0 := 0; {3927#true} is VALID [2020-07-18 05:14:55,892 INFO L280 TraceCheckUtils]: 39: Hoare triple {3927#true} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1019-17 {3927#true} is VALID [2020-07-18 05:14:55,892 INFO L280 TraceCheckUtils]: 40: Hoare triple {3927#true} #t~short9 := #t~mem6.base != 0 || #t~mem6.offset != 0; {3927#true} is VALID [2020-07-18 05:14:55,893 INFO L280 TraceCheckUtils]: 41: Hoare triple {3927#true} assume !#t~short9; {3927#true} is VALID [2020-07-18 05:14:55,893 INFO L280 TraceCheckUtils]: 42: Hoare triple {3927#true} assume !#t~short9; {3927#true} is VALID [2020-07-18 05:14:55,893 INFO L280 TraceCheckUtils]: 43: Hoare triple {3927#true} havoc #t~mem8; {3927#true} is VALID [2020-07-18 05:14:55,893 INFO L280 TraceCheckUtils]: 44: Hoare triple {3927#true} havoc #t~mem6.base, #t~mem6.offset; {3927#true} is VALID [2020-07-18 05:14:55,894 INFO L280 TraceCheckUtils]: 45: Hoare triple {3927#true} havoc #t~short9; {3927#true} is VALID [2020-07-18 05:14:55,894 INFO L280 TraceCheckUtils]: 46: Hoare triple {3927#true} havoc #t~mem7.base, #t~mem7.offset; {3927#true} is VALID [2020-07-18 05:14:55,894 INFO L280 TraceCheckUtils]: 47: Hoare triple {3927#true} SUMMARY for call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1027-8 {3927#true} is VALID [2020-07-18 05:14:55,895 INFO L280 TraceCheckUtils]: 48: Hoare triple {3927#true} #t~short13 := #t~mem11.base != 0 || #t~mem11.offset != 0; {3927#true} is VALID [2020-07-18 05:14:55,898 INFO L280 TraceCheckUtils]: 49: Hoare triple {3927#true} assume !#t~short13; {3934#(not |main_#t~short13|)} is VALID [2020-07-18 05:14:55,898 INFO L280 TraceCheckUtils]: 50: Hoare triple {3934#(not |main_#t~short13|)} assume !!#t~short13; {3928#false} is VALID [2020-07-18 05:14:55,899 INFO L280 TraceCheckUtils]: 51: Hoare triple {3928#false} havoc #t~mem11.base, #t~mem11.offset; {3928#false} is VALID [2020-07-18 05:14:55,899 INFO L280 TraceCheckUtils]: 52: Hoare triple {3928#false} havoc #t~nondet12; {3928#false} is VALID [2020-07-18 05:14:55,899 INFO L280 TraceCheckUtils]: 53: Hoare triple {3928#false} havoc #t~short13; {3928#false} is VALID [2020-07-18 05:14:55,900 INFO L280 TraceCheckUtils]: 54: Hoare triple {3928#false} SUMMARY for call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1026 {3928#false} is VALID [2020-07-18 05:14:55,900 INFO L280 TraceCheckUtils]: 55: Hoare triple {3928#false} ~x~0.base, ~x~0.offset := #t~mem14.base, #t~mem14.offset; {3928#false} is VALID [2020-07-18 05:14:55,900 INFO L280 TraceCheckUtils]: 56: Hoare triple {3928#false} havoc #t~mem14.base, #t~mem14.offset; {3928#false} is VALID [2020-07-18 05:14:55,900 INFO L280 TraceCheckUtils]: 57: Hoare triple {3928#false} SUMMARY for call #t~mem15 := read~int(~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1027-7 {3928#false} is VALID [2020-07-18 05:14:55,901 INFO L280 TraceCheckUtils]: 58: Hoare triple {3928#false} assume !(1 != #t~mem15); {3928#false} is VALID [2020-07-18 05:14:55,901 INFO L280 TraceCheckUtils]: 59: Hoare triple {3928#false} havoc #t~mem15; {3928#false} is VALID [2020-07-18 05:14:55,901 INFO L280 TraceCheckUtils]: 60: Hoare triple {3928#false} assume !false; {3928#false} is VALID [2020-07-18 05:14:55,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-18 05:14:55,905 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2022769820] [2020-07-18 05:14:55,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:14:55,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-18 05:14:55,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880189860] [2020-07-18 05:14:55,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2020-07-18 05:14:55,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:14:55,907 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-18 05:14:55,967 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:14:55,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-18 05:14:55,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:14:55,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-18 05:14:55,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 05:14:55,968 INFO L87 Difference]: Start difference. First operand 158 states and 169 transitions. Second operand 4 states. [2020-07-18 05:14:56,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:14:56,748 INFO L93 Difference]: Finished difference Result 244 states and 261 transitions. [2020-07-18 05:14:56,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-18 05:14:56,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2020-07-18 05:14:56,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:14:56,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 05:14:56,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 244 transitions. [2020-07-18 05:14:56,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 05:14:56,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 244 transitions. [2020-07-18 05:14:56,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 244 transitions. [2020-07-18 05:14:57,011 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 244 edges. 244 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:14:57,015 INFO L225 Difference]: With dead ends: 244 [2020-07-18 05:14:57,015 INFO L226 Difference]: Without dead ends: 159 [2020-07-18 05:14:57,016 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-18 05:14:57,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2020-07-18 05:14:57,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2020-07-18 05:14:57,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:14:57,311 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand 159 states. [2020-07-18 05:14:57,311 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 159 states. [2020-07-18 05:14:57,311 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 159 states. [2020-07-18 05:14:57,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:14:57,316 INFO L93 Difference]: Finished difference Result 159 states and 170 transitions. [2020-07-18 05:14:57,316 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 170 transitions. [2020-07-18 05:14:57,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:14:57,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:14:57,317 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 159 states. [2020-07-18 05:14:57,317 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 159 states. [2020-07-18 05:14:57,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:14:57,321 INFO L93 Difference]: Finished difference Result 159 states and 170 transitions. [2020-07-18 05:14:57,321 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 170 transitions. [2020-07-18 05:14:57,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:14:57,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:14:57,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:14:57,322 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:14:57,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-07-18 05:14:57,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 170 transitions. [2020-07-18 05:14:57,327 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 170 transitions. Word has length 61 [2020-07-18 05:14:57,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:14:57,328 INFO L479 AbstractCegarLoop]: Abstraction has 159 states and 170 transitions. [2020-07-18 05:14:57,328 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-18 05:14:57,328 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 159 states and 170 transitions. [2020-07-18 05:14:57,570 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:14:57,570 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 170 transitions. [2020-07-18 05:14:57,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-07-18 05:14:57,571 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:14:57,571 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 05:14:57,571 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 05:14:57,571 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:14:57,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:14:57,572 INFO L82 PathProgramCache]: Analyzing trace with hash -158274674, now seen corresponding path program 1 times [2020-07-18 05:14:57,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:14:57,572 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1073498397] [2020-07-18 05:14:57,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:14:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:14:57,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:14:57,749 INFO L280 TraceCheckUtils]: 0: Hoare triple {5074#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {5062#true} is VALID [2020-07-18 05:14:57,750 INFO L280 TraceCheckUtils]: 1: Hoare triple {5062#true} #valid := #valid[0 := 0]; {5062#true} is VALID [2020-07-18 05:14:57,750 INFO L280 TraceCheckUtils]: 2: Hoare triple {5062#true} assume 0 < #StackHeapBarrier; {5062#true} is VALID [2020-07-18 05:14:57,750 INFO L280 TraceCheckUtils]: 3: Hoare triple {5062#true} assume true; {5062#true} is VALID [2020-07-18 05:14:57,750 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {5062#true} {5062#true} #330#return; {5062#true} is VALID [2020-07-18 05:14:57,752 INFO L263 TraceCheckUtils]: 0: Hoare triple {5062#true} call ULTIMATE.init(); {5074#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 05:14:57,752 INFO L280 TraceCheckUtils]: 1: Hoare triple {5074#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {5062#true} is VALID [2020-07-18 05:14:57,752 INFO L280 TraceCheckUtils]: 2: Hoare triple {5062#true} #valid := #valid[0 := 0]; {5062#true} is VALID [2020-07-18 05:14:57,752 INFO L280 TraceCheckUtils]: 3: Hoare triple {5062#true} assume 0 < #StackHeapBarrier; {5062#true} is VALID [2020-07-18 05:14:57,753 INFO L280 TraceCheckUtils]: 4: Hoare triple {5062#true} assume true; {5062#true} is VALID [2020-07-18 05:14:57,753 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {5062#true} {5062#true} #330#return; {5062#true} is VALID [2020-07-18 05:14:57,753 INFO L263 TraceCheckUtils]: 6: Hoare triple {5062#true} call #t~ret29 := main(); {5062#true} is VALID [2020-07-18 05:14:57,753 INFO L280 TraceCheckUtils]: 7: Hoare triple {5062#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {5062#true} is VALID [2020-07-18 05:14:57,754 INFO L280 TraceCheckUtils]: 8: Hoare triple {5062#true} ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {5062#true} is VALID [2020-07-18 05:14:57,754 INFO L280 TraceCheckUtils]: 9: Hoare triple {5062#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L987 {5062#true} is VALID [2020-07-18 05:14:57,754 INFO L280 TraceCheckUtils]: 10: Hoare triple {5062#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L987-1 {5062#true} is VALID [2020-07-18 05:14:57,754 INFO L280 TraceCheckUtils]: 11: Hoare triple {5062#true} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L988 {5062#true} is VALID [2020-07-18 05:14:57,755 INFO L280 TraceCheckUtils]: 12: Hoare triple {5062#true} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {5062#true} is VALID [2020-07-18 05:14:57,755 INFO L280 TraceCheckUtils]: 13: Hoare triple {5062#true} ~marked~0 := 0; {5062#true} is VALID [2020-07-18 05:14:57,755 INFO L280 TraceCheckUtils]: 14: Hoare triple {5062#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {5062#true} is VALID [2020-07-18 05:14:57,755 INFO L280 TraceCheckUtils]: 15: Hoare triple {5062#true} assume !!(0 != #t~nondet1 || 0 == ~marked~0); {5062#true} is VALID [2020-07-18 05:14:57,756 INFO L280 TraceCheckUtils]: 16: Hoare triple {5062#true} havoc #t~nondet1; {5062#true} is VALID [2020-07-18 05:14:57,756 INFO L280 TraceCheckUtils]: 17: Hoare triple {5062#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12); srcloc: L998 {5062#true} is VALID [2020-07-18 05:14:57,756 INFO L280 TraceCheckUtils]: 18: Hoare triple {5062#true} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L998-1 {5062#true} is VALID [2020-07-18 05:14:57,756 INFO L280 TraceCheckUtils]: 19: Hoare triple {5062#true} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L998-2 {5062#true} is VALID [2020-07-18 05:14:57,757 INFO L280 TraceCheckUtils]: 20: Hoare triple {5062#true} SUMMARY for call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4); srcloc: L999 {5062#true} is VALID [2020-07-18 05:14:57,757 INFO L280 TraceCheckUtils]: 21: Hoare triple {5062#true} havoc #t~mem3.base, #t~mem3.offset; {5062#true} is VALID [2020-07-18 05:14:57,757 INFO L280 TraceCheckUtils]: 22: Hoare triple {5062#true} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1000 {5062#true} is VALID [2020-07-18 05:14:57,758 INFO L280 TraceCheckUtils]: 23: Hoare triple {5062#true} ~x~0.base, ~x~0.offset := #t~mem4.base, #t~mem4.offset; {5062#true} is VALID [2020-07-18 05:14:57,758 INFO L280 TraceCheckUtils]: 24: Hoare triple {5062#true} havoc #t~mem4.base, #t~mem4.offset; {5062#true} is VALID [2020-07-18 05:14:57,758 INFO L280 TraceCheckUtils]: 25: Hoare triple {5062#true} SUMMARY for call write~$Pointer$(0, 0, ~x~0.base, ~x~0.offset, 4); srcloc: L1001 {5062#true} is VALID [2020-07-18 05:14:57,758 INFO L280 TraceCheckUtils]: 26: Hoare triple {5062#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {5062#true} is VALID [2020-07-18 05:14:57,759 INFO L280 TraceCheckUtils]: 27: Hoare triple {5062#true} assume 0 != #t~nondet5; {5062#true} is VALID [2020-07-18 05:14:57,759 INFO L280 TraceCheckUtils]: 28: Hoare triple {5062#true} havoc #t~nondet5; {5062#true} is VALID [2020-07-18 05:14:57,759 INFO L280 TraceCheckUtils]: 29: Hoare triple {5062#true} ~marked~0 := 1; {5062#true} is VALID [2020-07-18 05:14:57,759 INFO L280 TraceCheckUtils]: 30: Hoare triple {5062#true} assume 0 != ~marked~0; {5062#true} is VALID [2020-07-18 05:14:57,760 INFO L280 TraceCheckUtils]: 31: Hoare triple {5062#true} SUMMARY for call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1009 {5062#true} is VALID [2020-07-18 05:14:57,760 INFO L280 TraceCheckUtils]: 32: Hoare triple {5062#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {5062#true} is VALID [2020-07-18 05:14:57,760 INFO L280 TraceCheckUtils]: 33: Hoare triple {5062#true} assume !(0 != #t~nondet1 || 0 == ~marked~0); {5062#true} is VALID [2020-07-18 05:14:57,760 INFO L280 TraceCheckUtils]: 34: Hoare triple {5062#true} havoc #t~nondet1; {5062#true} is VALID [2020-07-18 05:14:57,761 INFO L280 TraceCheckUtils]: 35: Hoare triple {5062#true} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {5062#true} is VALID [2020-07-18 05:14:57,761 INFO L280 TraceCheckUtils]: 36: Hoare triple {5062#true} assume !!(0 != ~x~0.base || 0 != ~x~0.offset); {5062#true} is VALID [2020-07-18 05:14:57,761 INFO L280 TraceCheckUtils]: 37: Hoare triple {5062#true} goto; {5062#true} is VALID [2020-07-18 05:14:57,761 INFO L280 TraceCheckUtils]: 38: Hoare triple {5062#true} ~marked~0 := 0; {5062#true} is VALID [2020-07-18 05:14:57,762 INFO L280 TraceCheckUtils]: 39: Hoare triple {5062#true} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1019-17 {5069#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~mem6.base|) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) |main_#t~mem6.offset|))} is VALID [2020-07-18 05:14:57,763 INFO L280 TraceCheckUtils]: 40: Hoare triple {5069#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~mem6.base|) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) |main_#t~mem6.offset|))} #t~short9 := #t~mem6.base != 0 || #t~mem6.offset != 0; {5070#(or (and (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) |main_#t~short9|)} is VALID [2020-07-18 05:14:57,764 INFO L280 TraceCheckUtils]: 41: Hoare triple {5070#(or (and (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) |main_#t~short9|)} assume !#t~short9; {5071#(and (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-18 05:14:57,765 INFO L280 TraceCheckUtils]: 42: Hoare triple {5071#(and (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} assume !#t~short9; {5071#(and (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-18 05:14:57,766 INFO L280 TraceCheckUtils]: 43: Hoare triple {5071#(and (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} havoc #t~mem8; {5071#(and (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-18 05:14:57,766 INFO L280 TraceCheckUtils]: 44: Hoare triple {5071#(and (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} havoc #t~mem6.base, #t~mem6.offset; {5071#(and (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-18 05:14:57,767 INFO L280 TraceCheckUtils]: 45: Hoare triple {5071#(and (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} havoc #t~short9; {5071#(and (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-18 05:14:57,768 INFO L280 TraceCheckUtils]: 46: Hoare triple {5071#(and (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} havoc #t~mem7.base, #t~mem7.offset; {5071#(and (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-18 05:14:57,769 INFO L280 TraceCheckUtils]: 47: Hoare triple {5071#(and (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} SUMMARY for call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1027-8 {5072#(and (= 0 |main_#t~mem11.offset|) (= 0 |main_#t~mem11.base|))} is VALID [2020-07-18 05:14:57,770 INFO L280 TraceCheckUtils]: 48: Hoare triple {5072#(and (= 0 |main_#t~mem11.offset|) (= 0 |main_#t~mem11.base|))} #t~short13 := #t~mem11.base != 0 || #t~mem11.offset != 0; {5073#(not |main_#t~short13|)} is VALID [2020-07-18 05:14:57,770 INFO L280 TraceCheckUtils]: 49: Hoare triple {5073#(not |main_#t~short13|)} assume #t~short13; {5063#false} is VALID [2020-07-18 05:14:57,771 INFO L280 TraceCheckUtils]: 50: Hoare triple {5063#false} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647; {5063#false} is VALID [2020-07-18 05:14:57,771 INFO L280 TraceCheckUtils]: 51: Hoare triple {5063#false} #t~short13 := 0 != #t~nondet12; {5063#false} is VALID [2020-07-18 05:14:57,771 INFO L280 TraceCheckUtils]: 52: Hoare triple {5063#false} assume !!#t~short13; {5063#false} is VALID [2020-07-18 05:14:57,772 INFO L280 TraceCheckUtils]: 53: Hoare triple {5063#false} havoc #t~mem11.base, #t~mem11.offset; {5063#false} is VALID [2020-07-18 05:14:57,772 INFO L280 TraceCheckUtils]: 54: Hoare triple {5063#false} havoc #t~nondet12; {5063#false} is VALID [2020-07-18 05:14:57,772 INFO L280 TraceCheckUtils]: 55: Hoare triple {5063#false} havoc #t~short13; {5063#false} is VALID [2020-07-18 05:14:57,772 INFO L280 TraceCheckUtils]: 56: Hoare triple {5063#false} SUMMARY for call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1026 {5063#false} is VALID [2020-07-18 05:14:57,773 INFO L280 TraceCheckUtils]: 57: Hoare triple {5063#false} ~x~0.base, ~x~0.offset := #t~mem14.base, #t~mem14.offset; {5063#false} is VALID [2020-07-18 05:14:57,773 INFO L280 TraceCheckUtils]: 58: Hoare triple {5063#false} havoc #t~mem14.base, #t~mem14.offset; {5063#false} is VALID [2020-07-18 05:14:57,773 INFO L280 TraceCheckUtils]: 59: Hoare triple {5063#false} SUMMARY for call #t~mem15 := read~int(~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1027-7 {5063#false} is VALID [2020-07-18 05:14:57,773 INFO L280 TraceCheckUtils]: 60: Hoare triple {5063#false} assume !(1 != #t~mem15); {5063#false} is VALID [2020-07-18 05:14:57,774 INFO L280 TraceCheckUtils]: 61: Hoare triple {5063#false} havoc #t~mem15; {5063#false} is VALID [2020-07-18 05:14:57,774 INFO L280 TraceCheckUtils]: 62: Hoare triple {5063#false} assume !false; {5063#false} is VALID [2020-07-18 05:14:57,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-18 05:14:57,786 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1073498397] [2020-07-18 05:14:57,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:14:57,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-18 05:14:57,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104225697] [2020-07-18 05:14:57,787 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2020-07-18 05:14:57,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:14:57,787 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-18 05:14:57,847 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-18 05:14:57,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-18 05:14:57,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:14:57,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-18 05:14:57,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-18 05:14:57,849 INFO L87 Difference]: Start difference. First operand 159 states and 170 transitions. Second operand 8 states. [2020-07-18 05:14:59,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:14:59,409 INFO L93 Difference]: Finished difference Result 271 states and 289 transitions. [2020-07-18 05:14:59,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-18 05:14:59,409 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2020-07-18 05:14:59,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:14:59,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 05:14:59,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 271 transitions. [2020-07-18 05:14:59,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 05:14:59,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 271 transitions. [2020-07-18 05:14:59,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 271 transitions. [2020-07-18 05:14:59,709 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 271 edges. 271 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:14:59,713 INFO L225 Difference]: With dead ends: 271 [2020-07-18 05:14:59,713 INFO L226 Difference]: Without dead ends: 185 [2020-07-18 05:14:59,714 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-07-18 05:14:59,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-07-18 05:15:00,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 167. [2020-07-18 05:15:00,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:15:00,097 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand 167 states. [2020-07-18 05:15:00,097 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand 167 states. [2020-07-18 05:15:00,097 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 167 states. [2020-07-18 05:15:00,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:15:00,103 INFO L93 Difference]: Finished difference Result 185 states and 197 transitions. [2020-07-18 05:15:00,103 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 197 transitions. [2020-07-18 05:15:00,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:15:00,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:15:00,104 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand 185 states. [2020-07-18 05:15:00,105 INFO L87 Difference]: Start difference. First operand 167 states. Second operand 185 states. [2020-07-18 05:15:00,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:15:00,111 INFO L93 Difference]: Finished difference Result 185 states and 197 transitions. [2020-07-18 05:15:00,111 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 197 transitions. [2020-07-18 05:15:00,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:15:00,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:15:00,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:15:00,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:15:00,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2020-07-18 05:15:00,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 179 transitions. [2020-07-18 05:15:00,121 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 179 transitions. Word has length 63 [2020-07-18 05:15:00,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:15:00,121 INFO L479 AbstractCegarLoop]: Abstraction has 167 states and 179 transitions. [2020-07-18 05:15:00,121 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-18 05:15:00,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 167 states and 179 transitions. [2020-07-18 05:15:00,389 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:15:00,389 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 179 transitions. [2020-07-18 05:15:00,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-18 05:15:00,390 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:15:00,391 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 05:15:00,391 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 05:15:00,392 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:15:00,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:15:00,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1072824646, now seen corresponding path program 1 times [2020-07-18 05:15:00,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:15:00,392 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [128539934] [2020-07-18 05:15:00,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:15:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-18 05:15:00,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-18 05:15:00,565 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-18 05:15:00,566 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-18 05:15:00,566 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 05:15:00,627 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-18 05:15:00,627 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-18 05:15:00,627 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-18 05:15:00,627 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-18 05:15:00,627 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 05:15:00,628 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 05:15:00,628 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 05:15:00,628 WARN L170 areAnnotationChecker]: L986 has no Hoare annotation [2020-07-18 05:15:00,628 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-18 05:15:00,628 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-18 05:15:00,628 WARN L170 areAnnotationChecker]: L987 has no Hoare annotation [2020-07-18 05:15:00,628 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-18 05:15:00,628 WARN L170 areAnnotationChecker]: L987-1 has no Hoare annotation [2020-07-18 05:15:00,628 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-18 05:15:00,629 WARN L170 areAnnotationChecker]: L988 has no Hoare annotation [2020-07-18 05:15:00,629 WARN L170 areAnnotationChecker]: L989 has no Hoare annotation [2020-07-18 05:15:00,629 WARN L170 areAnnotationChecker]: L992 has no Hoare annotation [2020-07-18 05:15:00,629 WARN L170 areAnnotationChecker]: L1011-1 has no Hoare annotation [2020-07-18 05:15:00,629 WARN L170 areAnnotationChecker]: L1011-1 has no Hoare annotation [2020-07-18 05:15:00,629 WARN L170 areAnnotationChecker]: L995-5 has no Hoare annotation [2020-07-18 05:15:00,629 WARN L170 areAnnotationChecker]: L995-1 has no Hoare annotation [2020-07-18 05:15:00,629 WARN L170 areAnnotationChecker]: L995-1 has no Hoare annotation [2020-07-18 05:15:00,629 WARN L170 areAnnotationChecker]: L1016-4 has no Hoare annotation [2020-07-18 05:15:00,630 WARN L170 areAnnotationChecker]: L1016-4 has no Hoare annotation [2020-07-18 05:15:00,630 WARN L170 areAnnotationChecker]: L1016-4 has no Hoare annotation [2020-07-18 05:15:00,630 WARN L170 areAnnotationChecker]: L995-2 has no Hoare annotation [2020-07-18 05:15:00,630 WARN L170 areAnnotationChecker]: L995-4 has no Hoare annotation [2020-07-18 05:15:00,630 WARN L170 areAnnotationChecker]: L1016-5 has no Hoare annotation [2020-07-18 05:15:00,630 WARN L170 areAnnotationChecker]: L1016-1 has no Hoare annotation [2020-07-18 05:15:00,630 WARN L170 areAnnotationChecker]: L1016-1 has no Hoare annotation [2020-07-18 05:15:00,630 WARN L170 areAnnotationChecker]: L1016-3 has no Hoare annotation [2020-07-18 05:15:00,630 WARN L170 areAnnotationChecker]: L1016-3 has no Hoare annotation [2020-07-18 05:15:00,631 WARN L170 areAnnotationChecker]: L998 has no Hoare annotation [2020-07-18 05:15:00,631 WARN L170 areAnnotationChecker]: L1019-17 has no Hoare annotation [2020-07-18 05:15:00,631 WARN L170 areAnnotationChecker]: L1019-17 has no Hoare annotation [2020-07-18 05:15:00,631 WARN L170 areAnnotationChecker]: L998-1 has no Hoare annotation [2020-07-18 05:15:00,631 WARN L170 areAnnotationChecker]: L1027-8 has no Hoare annotation [2020-07-18 05:15:00,631 WARN L170 areAnnotationChecker]: L1027-8 has no Hoare annotation [2020-07-18 05:15:00,631 WARN L170 areAnnotationChecker]: L1019-1 has no Hoare annotation [2020-07-18 05:15:00,631 WARN L170 areAnnotationChecker]: L998-2 has no Hoare annotation [2020-07-18 05:15:00,631 WARN L170 areAnnotationChecker]: L1024-13 has no Hoare annotation [2020-07-18 05:15:00,632 WARN L170 areAnnotationChecker]: L1024 has no Hoare annotation [2020-07-18 05:15:00,632 WARN L170 areAnnotationChecker]: L1019-2 has no Hoare annotation [2020-07-18 05:15:00,632 WARN L170 areAnnotationChecker]: L1019-2 has no Hoare annotation [2020-07-18 05:15:00,632 WARN L170 areAnnotationChecker]: L999 has no Hoare annotation [2020-07-18 05:15:00,632 WARN L170 areAnnotationChecker]: L1030 has no Hoare annotation [2020-07-18 05:15:00,632 WARN L170 areAnnotationChecker]: L1024-1 has no Hoare annotation [2020-07-18 05:15:00,632 WARN L170 areAnnotationChecker]: L1024-1 has no Hoare annotation [2020-07-18 05:15:00,632 WARN L170 areAnnotationChecker]: L1019-3 has no Hoare annotation [2020-07-18 05:15:00,633 WARN L170 areAnnotationChecker]: L1019-7 has no Hoare annotation [2020-07-18 05:15:00,633 WARN L170 areAnnotationChecker]: L1019-7 has no Hoare annotation [2020-07-18 05:15:00,633 WARN L170 areAnnotationChecker]: L999-1 has no Hoare annotation [2020-07-18 05:15:00,633 WARN L170 areAnnotationChecker]: L1031 has no Hoare annotation [2020-07-18 05:15:00,633 WARN L170 areAnnotationChecker]: L1024-2 has no Hoare annotation [2020-07-18 05:15:00,633 WARN L170 areAnnotationChecker]: L1024-5 has no Hoare annotation [2020-07-18 05:15:00,633 WARN L170 areAnnotationChecker]: L1024-5 has no Hoare annotation [2020-07-18 05:15:00,633 WARN L170 areAnnotationChecker]: L1019-4 has no Hoare annotation [2020-07-18 05:15:00,633 WARN L170 areAnnotationChecker]: L1019-8 has no Hoare annotation [2020-07-18 05:15:00,634 WARN L170 areAnnotationChecker]: L1019-13 has no Hoare annotation [2020-07-18 05:15:00,634 WARN L170 areAnnotationChecker]: L1000 has no Hoare annotation [2020-07-18 05:15:00,634 WARN L170 areAnnotationChecker]: L1031-1 has no Hoare annotation [2020-07-18 05:15:00,634 WARN L170 areAnnotationChecker]: L1024-3 has no Hoare annotation [2020-07-18 05:15:00,634 WARN L170 areAnnotationChecker]: L1024-6 has no Hoare annotation [2020-07-18 05:15:00,634 WARN L170 areAnnotationChecker]: L1024-10 has no Hoare annotation [2020-07-18 05:15:00,634 WARN L170 areAnnotationChecker]: L1019-5 has no Hoare annotation [2020-07-18 05:15:00,634 WARN L170 areAnnotationChecker]: L1019-9 has no Hoare annotation [2020-07-18 05:15:00,635 WARN L170 areAnnotationChecker]: L1019-14 has no Hoare annotation [2020-07-18 05:15:00,635 WARN L170 areAnnotationChecker]: L1000-1 has no Hoare annotation [2020-07-18 05:15:00,635 WARN L170 areAnnotationChecker]: L1032 has no Hoare annotation [2020-07-18 05:15:00,635 WARN L170 areAnnotationChecker]: L1024-7 has no Hoare annotation [2020-07-18 05:15:00,635 WARN L170 areAnnotationChecker]: L1024-11 has no Hoare annotation [2020-07-18 05:15:00,635 WARN L170 areAnnotationChecker]: L1019-10 has no Hoare annotation [2020-07-18 05:15:00,635 WARN L170 areAnnotationChecker]: L1019-15 has no Hoare annotation [2020-07-18 05:15:00,635 WARN L170 areAnnotationChecker]: L1000-2 has no Hoare annotation [2020-07-18 05:15:00,636 WARN L170 areAnnotationChecker]: L1033 has no Hoare annotation [2020-07-18 05:15:00,636 WARN L170 areAnnotationChecker]: L1024-8 has no Hoare annotation [2020-07-18 05:15:00,636 WARN L170 areAnnotationChecker]: L1024-12 has no Hoare annotation [2020-07-18 05:15:00,636 WARN L170 areAnnotationChecker]: L1019-11 has no Hoare annotation [2020-07-18 05:15:00,636 WARN L170 areAnnotationChecker]: L1019-16 has no Hoare annotation [2020-07-18 05:15:00,636 WARN L170 areAnnotationChecker]: L1001 has no Hoare annotation [2020-07-18 05:15:00,636 WARN L170 areAnnotationChecker]: L1034 has no Hoare annotation [2020-07-18 05:15:00,636 WARN L170 areAnnotationChecker]: L1034 has no Hoare annotation [2020-07-18 05:15:00,636 WARN L170 areAnnotationChecker]: L1026 has no Hoare annotation [2020-07-18 05:15:00,637 WARN L170 areAnnotationChecker]: L1021 has no Hoare annotation [2020-07-18 05:15:00,637 WARN L170 areAnnotationChecker]: L1001-1 has no Hoare annotation [2020-07-18 05:15:00,637 WARN L170 areAnnotationChecker]: L1034-1 has no Hoare annotation [2020-07-18 05:15:00,637 WARN L170 areAnnotationChecker]: L1034-2 has no Hoare annotation [2020-07-18 05:15:00,637 WARN L170 areAnnotationChecker]: L1026-1 has no Hoare annotation [2020-07-18 05:15:00,637 WARN L170 areAnnotationChecker]: L1021-1 has no Hoare annotation [2020-07-18 05:15:00,637 WARN L170 areAnnotationChecker]: L1003 has no Hoare annotation [2020-07-18 05:15:00,637 WARN L170 areAnnotationChecker]: L1003 has no Hoare annotation [2020-07-18 05:15:00,637 WARN L170 areAnnotationChecker]: L1036 has no Hoare annotation [2020-07-18 05:15:00,638 WARN L170 areAnnotationChecker]: L1040 has no Hoare annotation [2020-07-18 05:15:00,638 WARN L170 areAnnotationChecker]: L1026-2 has no Hoare annotation [2020-07-18 05:15:00,638 WARN L170 areAnnotationChecker]: L1021-2 has no Hoare annotation [2020-07-18 05:15:00,638 WARN L170 areAnnotationChecker]: L1003-1 has no Hoare annotation [2020-07-18 05:15:00,638 WARN L170 areAnnotationChecker]: L1003-3 has no Hoare annotation [2020-07-18 05:15:00,638 WARN L170 areAnnotationChecker]: L1042-1 has no Hoare annotation [2020-07-18 05:15:00,638 WARN L170 areAnnotationChecker]: L1040-1 has no Hoare annotation [2020-07-18 05:15:00,638 WARN L170 areAnnotationChecker]: L1027-7 has no Hoare annotation [2020-07-18 05:15:00,638 WARN L170 areAnnotationChecker]: L1027-7 has no Hoare annotation [2020-07-18 05:15:00,638 WARN L170 areAnnotationChecker]: L1005 has no Hoare annotation [2020-07-18 05:15:00,639 WARN L170 areAnnotationChecker]: L1003-4 has no Hoare annotation [2020-07-18 05:15:00,639 WARN L170 areAnnotationChecker]: L1003-4 has no Hoare annotation [2020-07-18 05:15:00,639 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2020-07-18 05:15:00,639 WARN L170 areAnnotationChecker]: L1040-2 has no Hoare annotation [2020-07-18 05:15:00,639 WARN L170 areAnnotationChecker]: L1027-1 has no Hoare annotation [2020-07-18 05:15:00,639 WARN L170 areAnnotationChecker]: L1027-1 has no Hoare annotation [2020-07-18 05:15:00,639 WARN L170 areAnnotationChecker]: L1009 has no Hoare annotation [2020-07-18 05:15:00,639 WARN L170 areAnnotationChecker]: L1011 has no Hoare annotation [2020-07-18 05:15:00,640 WARN L170 areAnnotationChecker]: L1048-11 has no Hoare annotation [2020-07-18 05:15:00,640 WARN L170 areAnnotationChecker]: L1048-11 has no Hoare annotation [2020-07-18 05:15:00,640 WARN L170 areAnnotationChecker]: L1041 has no Hoare annotation [2020-07-18 05:15:00,640 WARN L170 areAnnotationChecker]: L1027-2 has no Hoare annotation [2020-07-18 05:15:00,640 WARN L170 areAnnotationChecker]: L1027-5 has no Hoare annotation [2020-07-18 05:15:00,640 WARN L170 areAnnotationChecker]: L1055-1 has no Hoare annotation [2020-07-18 05:15:00,640 WARN L170 areAnnotationChecker]: L1055-1 has no Hoare annotation [2020-07-18 05:15:00,640 WARN L170 areAnnotationChecker]: L1055-1 has no Hoare annotation [2020-07-18 05:15:00,640 WARN L170 areAnnotationChecker]: L1048-1 has no Hoare annotation [2020-07-18 05:15:00,641 WARN L170 areAnnotationChecker]: L1048-1 has no Hoare annotation [2020-07-18 05:15:00,641 WARN L170 areAnnotationChecker]: L1041-1 has no Hoare annotation [2020-07-18 05:15:00,641 WARN L170 areAnnotationChecker]: L1027-3 has no Hoare annotation [2020-07-18 05:15:00,641 WARN L170 areAnnotationChecker]: L1027-3 has no Hoare annotation [2020-07-18 05:15:00,641 WARN L170 areAnnotationChecker]: L1027-6 has no Hoare annotation [2020-07-18 05:15:00,641 WARN L170 areAnnotationChecker]: L1027-6 has no Hoare annotation [2020-07-18 05:15:00,641 WARN L170 areAnnotationChecker]: L1055-2 has no Hoare annotation [2020-07-18 05:15:00,641 WARN L170 areAnnotationChecker]: L1057 has no Hoare annotation [2020-07-18 05:15:00,642 WARN L170 areAnnotationChecker]: L1048-2 has no Hoare annotation [2020-07-18 05:15:00,642 WARN L170 areAnnotationChecker]: L1048-5 has no Hoare annotation [2020-07-18 05:15:00,642 WARN L170 areAnnotationChecker]: L1048-5 has no Hoare annotation [2020-07-18 05:15:00,642 WARN L170 areAnnotationChecker]: L1041-2 has no Hoare annotation [2020-07-18 05:15:00,642 WARN L170 areAnnotationChecker]: L1068-1 has no Hoare annotation [2020-07-18 05:15:00,642 WARN L170 areAnnotationChecker]: L1068-1 has no Hoare annotation [2020-07-18 05:15:00,642 WARN L170 areAnnotationChecker]: L1068-1 has no Hoare annotation [2020-07-18 05:15:00,642 WARN L170 areAnnotationChecker]: L1057-1 has no Hoare annotation [2020-07-18 05:15:00,642 WARN L170 areAnnotationChecker]: L1048-3 has no Hoare annotation [2020-07-18 05:15:00,642 WARN L170 areAnnotationChecker]: L1048-6 has no Hoare annotation [2020-07-18 05:15:00,643 WARN L170 areAnnotationChecker]: L1048-9 has no Hoare annotation [2020-07-18 05:15:00,643 WARN L170 areAnnotationChecker]: L1042 has no Hoare annotation [2020-07-18 05:15:00,643 WARN L170 areAnnotationChecker]: L1064-2 has no Hoare annotation [2020-07-18 05:15:00,643 WARN L170 areAnnotationChecker]: L1066 has no Hoare annotation [2020-07-18 05:15:00,643 WARN L170 areAnnotationChecker]: L1057-2 has no Hoare annotation [2020-07-18 05:15:00,643 WARN L170 areAnnotationChecker]: L1048-7 has no Hoare annotation [2020-07-18 05:15:00,643 WARN L170 areAnnotationChecker]: L1048-10 has no Hoare annotation [2020-07-18 05:15:00,643 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-18 05:15:00,643 WARN L170 areAnnotationChecker]: L1067 has no Hoare annotation [2020-07-18 05:15:00,643 WARN L170 areAnnotationChecker]: L1058-7 has no Hoare annotation [2020-07-18 05:15:00,644 WARN L170 areAnnotationChecker]: L1058-7 has no Hoare annotation [2020-07-18 05:15:00,644 WARN L170 areAnnotationChecker]: L1050 has no Hoare annotation [2020-07-18 05:15:00,644 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-18 05:15:00,644 WARN L170 areAnnotationChecker]: L1067-1 has no Hoare annotation [2020-07-18 05:15:00,644 WARN L170 areAnnotationChecker]: L1058-1 has no Hoare annotation [2020-07-18 05:15:00,644 WARN L170 areAnnotationChecker]: L1058-1 has no Hoare annotation [2020-07-18 05:15:00,644 WARN L170 areAnnotationChecker]: L1059-3 has no Hoare annotation [2020-07-18 05:15:00,644 WARN L170 areAnnotationChecker]: L1059-3 has no Hoare annotation [2020-07-18 05:15:00,644 WARN L170 areAnnotationChecker]: L1059-3 has no Hoare annotation [2020-07-18 05:15:00,645 WARN L170 areAnnotationChecker]: L1050-1 has no Hoare annotation [2020-07-18 05:15:00,645 WARN L170 areAnnotationChecker]: L1067-2 has no Hoare annotation [2020-07-18 05:15:00,645 WARN L170 areAnnotationChecker]: L1058-2 has no Hoare annotation [2020-07-18 05:15:00,645 WARN L170 areAnnotationChecker]: L1058-5 has no Hoare annotation [2020-07-18 05:15:00,645 WARN L170 areAnnotationChecker]: L1059-4 has no Hoare annotation [2020-07-18 05:15:00,645 WARN L170 areAnnotationChecker]: L1059 has no Hoare annotation [2020-07-18 05:15:00,645 WARN L170 areAnnotationChecker]: L1059 has no Hoare annotation [2020-07-18 05:15:00,645 WARN L170 areAnnotationChecker]: L1059-2 has no Hoare annotation [2020-07-18 05:15:00,645 WARN L170 areAnnotationChecker]: L1059-2 has no Hoare annotation [2020-07-18 05:15:00,645 WARN L170 areAnnotationChecker]: L1050-2 has no Hoare annotation [2020-07-18 05:15:00,646 WARN L170 areAnnotationChecker]: L1068 has no Hoare annotation [2020-07-18 05:15:00,646 WARN L170 areAnnotationChecker]: L1058-3 has no Hoare annotation [2020-07-18 05:15:00,646 WARN L170 areAnnotationChecker]: L1058-3 has no Hoare annotation [2020-07-18 05:15:00,646 WARN L170 areAnnotationChecker]: L1058-6 has no Hoare annotation [2020-07-18 05:15:00,646 WARN L170 areAnnotationChecker]: L1058-6 has no Hoare annotation [2020-07-18 05:15:00,646 WARN L170 areAnnotationChecker]: L1060 has no Hoare annotation [2020-07-18 05:15:00,646 WARN L170 areAnnotationChecker]: L1051-7 has no Hoare annotation [2020-07-18 05:15:00,646 WARN L170 areAnnotationChecker]: L1051-7 has no Hoare annotation [2020-07-18 05:15:00,646 WARN L170 areAnnotationChecker]: L1060-1 has no Hoare annotation [2020-07-18 05:15:00,647 WARN L170 areAnnotationChecker]: L1051-1 has no Hoare annotation [2020-07-18 05:15:00,647 WARN L170 areAnnotationChecker]: L1051-1 has no Hoare annotation [2020-07-18 05:15:00,647 WARN L170 areAnnotationChecker]: L1052-3 has no Hoare annotation [2020-07-18 05:15:00,647 WARN L170 areAnnotationChecker]: L1052-3 has no Hoare annotation [2020-07-18 05:15:00,647 WARN L170 areAnnotationChecker]: L1052-3 has no Hoare annotation [2020-07-18 05:15:00,647 WARN L170 areAnnotationChecker]: L1051-2 has no Hoare annotation [2020-07-18 05:15:00,647 WARN L170 areAnnotationChecker]: L1051-5 has no Hoare annotation [2020-07-18 05:15:00,647 WARN L170 areAnnotationChecker]: L1052-4 has no Hoare annotation [2020-07-18 05:15:00,647 WARN L170 areAnnotationChecker]: L1052 has no Hoare annotation [2020-07-18 05:15:00,647 WARN L170 areAnnotationChecker]: L1052 has no Hoare annotation [2020-07-18 05:15:00,648 WARN L170 areAnnotationChecker]: L1052-2 has no Hoare annotation [2020-07-18 05:15:00,648 WARN L170 areAnnotationChecker]: L1052-2 has no Hoare annotation [2020-07-18 05:15:00,648 WARN L170 areAnnotationChecker]: L1051-3 has no Hoare annotation [2020-07-18 05:15:00,648 WARN L170 areAnnotationChecker]: L1051-3 has no Hoare annotation [2020-07-18 05:15:00,648 WARN L170 areAnnotationChecker]: L1051-6 has no Hoare annotation [2020-07-18 05:15:00,648 WARN L170 areAnnotationChecker]: L1051-6 has no Hoare annotation [2020-07-18 05:15:00,648 WARN L170 areAnnotationChecker]: L1053 has no Hoare annotation [2020-07-18 05:15:00,648 WARN L170 areAnnotationChecker]: L1053-1 has no Hoare annotation [2020-07-18 05:15:00,648 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-18 05:15:00,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 05:15:00 BoogieIcfgContainer [2020-07-18 05:15:00,652 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 05:15:00,656 INFO L168 Benchmark]: Toolchain (without parser) took 12978.85 ms. Allocated memory was 141.0 MB in the beginning and 381.7 MB in the end (delta: 240.6 MB). Free memory was 101.9 MB in the beginning and 159.1 MB in the end (delta: -57.2 MB). Peak memory consumption was 183.4 MB. Max. memory is 7.1 GB. [2020-07-18 05:15:00,657 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 141.0 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-18 05:15:00,657 INFO L168 Benchmark]: CACSL2BoogieTranslator took 718.37 ms. Allocated memory was 141.0 MB in the beginning and 202.4 MB in the end (delta: 61.3 MB). Free memory was 101.5 MB in the beginning and 166.4 MB in the end (delta: -65.0 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2020-07-18 05:15:00,658 INFO L168 Benchmark]: Boogie Preprocessor took 111.09 ms. Allocated memory is still 202.4 MB. Free memory was 166.4 MB in the beginning and 162.3 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. [2020-07-18 05:15:00,659 INFO L168 Benchmark]: RCFGBuilder took 1020.50 ms. Allocated memory was 202.4 MB in the beginning and 234.4 MB in the end (delta: 32.0 MB). Free memory was 162.3 MB in the beginning and 194.6 MB in the end (delta: -32.3 MB). Peak memory consumption was 80.0 MB. Max. memory is 7.1 GB. [2020-07-18 05:15:00,660 INFO L168 Benchmark]: TraceAbstraction took 11119.39 ms. Allocated memory was 234.4 MB in the beginning and 381.7 MB in the end (delta: 147.3 MB). Free memory was 194.6 MB in the beginning and 159.1 MB in the end (delta: 35.5 MB). Peak memory consumption was 182.9 MB. Max. memory is 7.1 GB. [2020-07-18 05:15:00,664 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.22 ms. Allocated memory is still 141.0 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 718.37 ms. Allocated memory was 141.0 MB in the beginning and 202.4 MB in the end (delta: 61.3 MB). Free memory was 101.5 MB in the beginning and 166.4 MB in the end (delta: -65.0 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 111.09 ms. Allocated memory is still 202.4 MB. Free memory was 166.4 MB in the beginning and 162.3 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1020.50 ms. Allocated memory was 202.4 MB in the beginning and 234.4 MB in the end (delta: 32.0 MB). Free memory was 162.3 MB in the beginning and 194.6 MB in the end (delta: -32.3 MB). Peak memory consumption was 80.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11119.39 ms. Allocated memory was 234.4 MB in the beginning and 381.7 MB in the end (delta: 147.3 MB). Free memory was 194.6 MB in the beginning and 159.1 MB in the end (delta: 35.5 MB). Peak memory consumption was 182.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1027]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L986] SLL* head = malloc(sizeof(SLL)); VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L987] head->next = ((void*)0) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L988] head->prev = ((void*)0) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L989] head->data = 0 VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L991] SLL* x = head; VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, x={-1:0}] [L992] int marked = 0; VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, marked=0, x={-1:0}] [L995] COND TRUE __VERIFIER_nondet_int() || !marked VAL [__VERIFIER_nondet_int()=1, head={-1:0}, malloc(sizeof(SLL))={-1:0}, marked=0, x={-1:0}] [L998] x->next = malloc(sizeof(SLL)) VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, marked=0, x={-1:0}] [L999] EXPR x->next VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, marked=0, x={-1:0}, x->next={-2:0}] [L999] x->next->prev = x VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, marked=0, x={-1:0}, x->next={-2:0}] [L1000] EXPR x->next VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, marked=0, x={-1:0}, x->next={-2:0}] [L1000] x = x->next VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, marked=0, x={-2:0}, x->next={-2:0}] [L1001] x->next = ((void*)0) VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, marked=0, x={-2:0}] [L1003] COND TRUE __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=1, head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, marked=0, x={-2:0}] [L1005] marked = 1 VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, marked=1, x={-2:0}] [L1008] COND TRUE \read(marked) VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, marked=1, x={-2:0}] [L1009] x->data = 1 VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, marked=1, x={-2:0}] [L995] COND FALSE !(__VERIFIER_nondet_int() || !marked) VAL [__VERIFIER_nondet_int()=0, head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, marked=1, x={-2:0}] [L1014] x = head VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, marked=1, x={-1:0}] [L1016] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, marked=1, x={-1:0}] [L1017] marked = 0 VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, marked=0, x={-1:0}] [L1019] EXPR x->next VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, marked=0, x={-1:0}, x->next={-2:0}] [L1019] x->next != ((void*)0) && x->next->data == 0 VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, marked=0, x={-1:0}, x->next={-2:0}, x->next != ((void*)0) && x->next->data == 0=1] [L1019] EXPR x->next VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, marked=0, x={-1:0}, x->next={-2:0}, x->next={-2:0}, x->next != ((void*)0) && x->next->data == 0=1] [L1019] EXPR x->next->data VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, marked=0, x={-1:0}, x->next={-2:0}, x->next={-2:0}, x->next != ((void*)0) && x->next->data == 0=1, x->next->data=1] [L1019] x->next != ((void*)0) && x->next->data == 0 VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, marked=0, x={-1:0}, x->next={-2:0}, x->next={-2:0}, x->next != ((void*)0) && x->next->data == 0=0, x->next->data=1] [L1019] COND FALSE !(x->next != ((void*)0) && x->next->data == 0) VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, marked=0, x={-1:0}, x->next={-2:0}, x->next={-2:0}, x->next != ((void*)0) && x->next->data == 0=0, x->next->data=1] [L1024] EXPR x->next VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, marked=0, x={-1:0}, x->next={-2:0}] [L1024] x->next != ((void*)0) && __VERIFIER_nondet_int() VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, marked=0, x={-1:0}, x->next={-2:0}, x->next != ((void*)0) && __VERIFIER_nondet_int()=1] [L1024] x->next != ((void*)0) && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=1, head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, marked=0, x={-1:0}, x->next={-2:0}, x->next != ((void*)0) && __VERIFIER_nondet_int()=1] [L1024] COND TRUE x->next != ((void*)0) && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=1, head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, marked=0, x={-1:0}, x->next={-2:0}, x->next != ((void*)0) && __VERIFIER_nondet_int()=1] [L1026] EXPR x->next VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, marked=0, x={-1:0}, x->next={-2:0}] [L1026] x = x->next VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, marked=0, x={-2:0}, x->next={-2:0}] [L1027] EXPR x->data VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, marked=0, x={-2:0}, x->data=1] [L1027] COND TRUE !(x->data != 1) VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, marked=0, x={-2:0}, x->data=1] [L1027] __VERIFIER_error() VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, marked=0, x={-2:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 156 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.9s, OverallIterations: 6, TraceHistogramMax: 2, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 729 SDtfs, 770 SDslu, 802 SDs, 0 SdLazy, 995 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 5 MinimizatonAttempts, 125 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 266 NumberOfCodeBlocks, 266 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 195 ConstructedInterpolants, 0 QuantifiedInterpolants, 22075 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 6/6 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...