/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-token-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:08:34,261 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:08:34,264 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:08:34,282 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:08:34,282 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:08:34,284 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:08:34,286 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:08:34,296 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:08:34,299 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:08:34,302 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:08:34,304 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:08:34,306 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:08:34,306 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:08:34,308 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:08:34,310 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:08:34,311 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:08:34,313 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:08:34,313 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:08:34,315 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:08:34,319 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:08:34,324 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:08:34,327 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:08:34,329 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:08:34,329 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:08:34,331 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:08:34,332 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:08:34,332 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:08:34,334 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:08:34,334 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:08:34,336 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:08:34,336 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:08:34,337 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:08:34,338 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:08:34,339 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:08:34,340 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:08:34,340 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:08:34,341 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:08:34,341 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:08:34,341 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:08:34,342 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:08:34,343 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:08:34,344 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:08:34,368 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:08:34,368 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:08:34,373 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:08:34,373 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:08:34,374 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:08:34,374 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:08:34,374 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:08:34,374 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:08:34,374 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:08:34,374 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:08:34,375 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:08:34,375 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:08:34,375 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:08:34,376 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:08:34,376 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:08:34,377 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:08:34,377 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:08:34,377 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:08:34,377 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:08:34,378 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:08:34,379 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:08:34,381 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:08:34,381 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:08:34,382 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:08:34,382 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:08:34,382 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:08:34,382 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:08:34,383 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:08:34,383 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:08:34,383 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:08:34,646 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:08:34,659 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:08:34,663 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:08:34,664 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:08:34,665 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:08:34,665 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-token-2.i [2020-07-10 15:08:34,740 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e86cd086/57522367e1e0402eb3d94290711f4f85/FLAG6be0be366 [2020-07-10 15:08:35,267 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:08:35,267 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-token-2.i [2020-07-10 15:08:35,280 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e86cd086/57522367e1e0402eb3d94290711f4f85/FLAG6be0be366 [2020-07-10 15:08:35,695 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e86cd086/57522367e1e0402eb3d94290711f4f85 [2020-07-10 15:08:35,705 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:08:35,707 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:08:35,708 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:08:35,708 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:08:35,712 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:08:35,714 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:08:35" (1/1) ... [2020-07-10 15:08:35,716 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77af7801 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:08:35, skipping insertion in model container [2020-07-10 15:08:35,717 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:08:35" (1/1) ... [2020-07-10 15:08:35,724 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:08:35,781 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:08:36,196 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:08:36,210 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:08:36,308 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:08:36,358 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:08:36,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:08:36 WrapperNode [2020-07-10 15:08:36,359 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:08:36,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:08:36,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:08:36,360 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:08:36,374 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:08:36" (1/1) ... [2020-07-10 15:08:36,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:08:36" (1/1) ... [2020-07-10 15:08:36,390 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:08:36" (1/1) ... [2020-07-10 15:08:36,391 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:08:36" (1/1) ... [2020-07-10 15:08:36,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:08:36" (1/1) ... [2020-07-10 15:08:36,423 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:08:36" (1/1) ... [2020-07-10 15:08:36,426 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:08:36" (1/1) ... [2020-07-10 15:08:36,433 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:08:36,433 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:08:36,434 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:08:36,434 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:08:36,435 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:08:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:08:36,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:08:36,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:08:36,500 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:08:36,500 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-10 15:08:36,500 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-10 15:08:36,500 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-10 15:08:36,500 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-10 15:08:36,500 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-10 15:08:36,500 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-10 15:08:36,501 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-10 15:08:36,501 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-10 15:08:36,501 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-10 15:08:36,501 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-10 15:08:36,501 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-10 15:08:36,502 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-10 15:08:36,502 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-10 15:08:36,502 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-10 15:08:36,502 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-10 15:08:36,502 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-10 15:08:36,502 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-10 15:08:36,503 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-10 15:08:36,503 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-10 15:08:36,503 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-10 15:08:36,503 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-10 15:08:36,503 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-10 15:08:36,504 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-10 15:08:36,504 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-10 15:08:36,504 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-10 15:08:36,504 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-10 15:08:36,504 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-10 15:08:36,505 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-10 15:08:36,505 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-10 15:08:36,505 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-10 15:08:36,505 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-10 15:08:36,505 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-10 15:08:36,505 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-10 15:08:36,506 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-10 15:08:36,506 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-10 15:08:36,506 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-10 15:08:36,506 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-10 15:08:36,506 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-10 15:08:36,507 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-10 15:08:36,507 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-10 15:08:36,507 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-10 15:08:36,507 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-10 15:08:36,507 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-10 15:08:36,507 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-10 15:08:36,508 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-10 15:08:36,508 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-10 15:08:36,508 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-10 15:08:36,508 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-10 15:08:36,508 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-10 15:08:36,508 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-10 15:08:36,508 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 15:08:36,509 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-10 15:08:36,509 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-10 15:08:36,509 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-10 15:08:36,509 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-10 15:08:36,509 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-10 15:08:36,509 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-10 15:08:36,510 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-10 15:08:36,510 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-10 15:08:36,510 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:08:36,510 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-10 15:08:36,510 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-10 15:08:36,510 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-10 15:08:36,510 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-10 15:08:36,511 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-10 15:08:36,511 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-10 15:08:36,511 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-10 15:08:36,511 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-10 15:08:36,511 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-10 15:08:36,511 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-10 15:08:36,512 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-10 15:08:36,512 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-10 15:08:36,512 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-10 15:08:36,512 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-10 15:08:36,512 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-10 15:08:36,512 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-10 15:08:36,512 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-10 15:08:36,513 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-10 15:08:36,513 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-10 15:08:36,513 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-10 15:08:36,513 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-10 15:08:36,513 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-10 15:08:36,513 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-10 15:08:36,514 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-10 15:08:36,514 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-10 15:08:36,514 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-10 15:08:36,514 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-10 15:08:36,514 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-10 15:08:36,514 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-10 15:08:36,514 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-10 15:08:36,515 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-10 15:08:36,515 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-10 15:08:36,515 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-10 15:08:36,515 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-10 15:08:36,515 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-10 15:08:36,515 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-10 15:08:36,515 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-10 15:08:36,516 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-10 15:08:36,516 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-10 15:08:36,516 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-10 15:08:36,516 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-10 15:08:36,516 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-10 15:08:36,516 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-10 15:08:36,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:08:36,517 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:08:36,517 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:08:36,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:08:36,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-10 15:08:36,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:08:36,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-10 15:08:36,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:08:36,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:08:36,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:08:36,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:08:37,153 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:08:37,154 INFO L295 CfgBuilder]: Removed 15 assume(true) statements. [2020-07-10 15:08:37,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:08:37 BoogieIcfgContainer [2020-07-10 15:08:37,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:08:37,159 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:08:37,159 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:08:37,163 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:08:37,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:08:35" (1/3) ... [2020-07-10 15:08:37,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c89e829 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:08:37, skipping insertion in model container [2020-07-10 15:08:37,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:08:36" (2/3) ... [2020-07-10 15:08:37,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c89e829 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:08:37, skipping insertion in model container [2020-07-10 15:08:37,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:08:37" (3/3) ... [2020-07-10 15:08:37,167 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-token-2.i [2020-07-10 15:08:37,177 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:08:37,185 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-07-10 15:08:37,200 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-07-10 15:08:37,225 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:08:37,225 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:08:37,225 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:08:37,225 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:08:37,226 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:08:37,226 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:08:37,226 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:08:37,226 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:08:37,257 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2020-07-10 15:08:37,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-10 15:08:37,263 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:08:37,264 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:08:37,265 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-10 15:08:37,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:08:37,272 INFO L82 PathProgramCache]: Analyzing trace with hash 68430596, now seen corresponding path program 1 times [2020-07-10 15:08:37,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:08:37,283 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175162453] [2020-07-10 15:08:37,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:08:37,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:37,545 INFO L280 TraceCheckUtils]: 0: Hoare triple {57#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {52#true} is VALID [2020-07-10 15:08:37,545 INFO L280 TraceCheckUtils]: 1: Hoare triple {52#true} assume true; {52#true} is VALID [2020-07-10 15:08:37,546 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {52#true} {52#true} #161#return; {52#true} is VALID [2020-07-10 15:08:37,549 INFO L263 TraceCheckUtils]: 0: Hoare triple {52#true} call ULTIMATE.init(); {57#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:08:37,550 INFO L280 TraceCheckUtils]: 1: Hoare triple {57#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {52#true} is VALID [2020-07-10 15:08:37,550 INFO L280 TraceCheckUtils]: 2: Hoare triple {52#true} assume true; {52#true} is VALID [2020-07-10 15:08:37,551 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {52#true} {52#true} #161#return; {52#true} is VALID [2020-07-10 15:08:37,551 INFO L263 TraceCheckUtils]: 4: Hoare triple {52#true} call #t~ret18 := main(); {52#true} is VALID [2020-07-10 15:08:37,551 INFO L280 TraceCheckUtils]: 5: Hoare triple {52#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4);call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {52#true} is VALID [2020-07-10 15:08:37,555 INFO L280 TraceCheckUtils]: 6: Hoare triple {52#true} assume !true; {53#false} is VALID [2020-07-10 15:08:37,555 INFO L280 TraceCheckUtils]: 7: Hoare triple {53#false} call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~x~0.base, ~x~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem6.base, 4 + #t~mem6.offset, 4);havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call write~int(2, #t~mem7.base, 8 + #t~mem7.offset, 4);havoc #t~mem7.base, #t~mem7.offset;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {53#false} is VALID [2020-07-10 15:08:37,556 INFO L280 TraceCheckUtils]: 8: Hoare triple {53#false} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {53#false} is VALID [2020-07-10 15:08:37,556 INFO L280 TraceCheckUtils]: 9: Hoare triple {53#false} assume !false; {53#false} is VALID [2020-07-10 15:08:37,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:08:37,558 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175162453] [2020-07-10 15:08:37,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:08:37,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:08:37,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139571232] [2020-07-10 15:08:37,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-10 15:08:37,576 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:08:37,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:08:37,604 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:37,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:08:37,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:08:37,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:08:37,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:08:37,616 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 3 states. [2020-07-10 15:08:37,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:37,892 INFO L93 Difference]: Finished difference Result 92 states and 138 transitions. [2020-07-10 15:08:37,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:08:37,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-10 15:08:37,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:08:37,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:08:37,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2020-07-10 15:08:37,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:08:37,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2020-07-10 15:08:37,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 138 transitions. [2020-07-10 15:08:38,132 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:38,163 INFO L225 Difference]: With dead ends: 92 [2020-07-10 15:08:38,163 INFO L226 Difference]: Without dead ends: 43 [2020-07-10 15:08:38,170 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-10 15:08:38,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-10 15:08:38,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-07-10 15:08:38,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:08:38,223 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2020-07-10 15:08:38,223 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2020-07-10 15:08:38,224 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2020-07-10 15:08:38,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:38,231 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2020-07-10 15:08:38,231 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2020-07-10 15:08:38,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:38,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:38,233 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2020-07-10 15:08:38,233 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2020-07-10 15:08:38,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:38,241 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2020-07-10 15:08:38,241 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2020-07-10 15:08:38,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:38,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:38,244 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:08:38,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:08:38,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-10 15:08:38,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2020-07-10 15:08:38,251 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 10 [2020-07-10 15:08:38,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:08:38,252 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2020-07-10 15:08:38,252 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:08:38,252 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2020-07-10 15:08:38,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-10 15:08:38,253 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:08:38,253 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:08:38,253 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:08:38,254 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-10 15:08:38,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:08:38,254 INFO L82 PathProgramCache]: Analyzing trace with hash 67663975, now seen corresponding path program 1 times [2020-07-10 15:08:38,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:08:38,255 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625171165] [2020-07-10 15:08:38,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:08:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:38,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:38,429 INFO L280 TraceCheckUtils]: 0: Hoare triple {314#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {307#true} is VALID [2020-07-10 15:08:38,429 INFO L280 TraceCheckUtils]: 1: Hoare triple {307#true} assume true; {307#true} is VALID [2020-07-10 15:08:38,430 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {307#true} {307#true} #161#return; {307#true} is VALID [2020-07-10 15:08:38,431 INFO L263 TraceCheckUtils]: 0: Hoare triple {307#true} call ULTIMATE.init(); {314#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:08:38,431 INFO L280 TraceCheckUtils]: 1: Hoare triple {314#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {307#true} is VALID [2020-07-10 15:08:38,431 INFO L280 TraceCheckUtils]: 2: Hoare triple {307#true} assume true; {307#true} is VALID [2020-07-10 15:08:38,432 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {307#true} {307#true} #161#return; {307#true} is VALID [2020-07-10 15:08:38,432 INFO L263 TraceCheckUtils]: 4: Hoare triple {307#true} call #t~ret18 := main(); {307#true} is VALID [2020-07-10 15:08:38,434 INFO L280 TraceCheckUtils]: 5: Hoare triple {307#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4);call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {312#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-10 15:08:38,435 INFO L280 TraceCheckUtils]: 6: Hoare triple {312#(= 1 (select |#valid| main_~x~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {312#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-10 15:08:38,438 INFO L280 TraceCheckUtils]: 7: Hoare triple {312#(= 1 (select |#valid| main_~x~0.base))} assume !!(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4);havoc #t~mem3.base, #t~mem3.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);~x~0.base, ~x~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call write~int(0, ~x~0.base, 8 + ~x~0.offset, 4); {313#(not (= 0 main_~x~0.base))} is VALID [2020-07-10 15:08:38,439 INFO L280 TraceCheckUtils]: 8: Hoare triple {313#(not (= 0 main_~x~0.base))} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {308#false} is VALID [2020-07-10 15:08:38,439 INFO L280 TraceCheckUtils]: 9: Hoare triple {308#false} assume !false; {308#false} is VALID [2020-07-10 15:08:38,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:08:38,440 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625171165] [2020-07-10 15:08:38,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:08:38,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:08:38,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833770380] [2020-07-10 15:08:38,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-10 15:08:38,443 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:08:38,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:08:38,459 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:38,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:08:38,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:08:38,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:08:38,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:08:38,460 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 5 states. [2020-07-10 15:08:38,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:38,840 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2020-07-10 15:08:38,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 15:08:38,840 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-10 15:08:38,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:08:38,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:08:38,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2020-07-10 15:08:38,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:08:38,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2020-07-10 15:08:38,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 45 transitions. [2020-07-10 15:08:38,931 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:38,933 INFO L225 Difference]: With dead ends: 43 [2020-07-10 15:08:38,933 INFO L226 Difference]: Without dead ends: 41 [2020-07-10 15:08:38,934 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:08:38,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-10 15:08:38,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-07-10 15:08:38,950 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:08:38,950 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 41 states. [2020-07-10 15:08:38,950 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2020-07-10 15:08:38,950 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2020-07-10 15:08:38,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:38,953 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2020-07-10 15:08:38,953 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2020-07-10 15:08:38,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:38,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:38,954 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2020-07-10 15:08:38,955 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2020-07-10 15:08:38,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:38,957 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2020-07-10 15:08:38,958 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2020-07-10 15:08:38,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:38,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:38,959 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:08:38,959 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:08:38,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-10 15:08:38,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2020-07-10 15:08:38,961 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 10 [2020-07-10 15:08:38,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:08:38,962 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2020-07-10 15:08:38,962 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:08:38,962 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2020-07-10 15:08:38,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-10 15:08:38,963 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:08:38,963 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:08:38,963 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:08:38,963 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-10 15:08:38,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:08:38,964 INFO L82 PathProgramCache]: Analyzing trace with hash 2097539711, now seen corresponding path program 1 times [2020-07-10 15:08:38,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:08:38,965 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995369526] [2020-07-10 15:08:38,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:08:38,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:39,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:39,104 INFO L280 TraceCheckUtils]: 0: Hoare triple {512#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {505#true} is VALID [2020-07-10 15:08:39,105 INFO L280 TraceCheckUtils]: 1: Hoare triple {505#true} assume true; {505#true} is VALID [2020-07-10 15:08:39,105 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {505#true} {505#true} #161#return; {505#true} is VALID [2020-07-10 15:08:39,107 INFO L263 TraceCheckUtils]: 0: Hoare triple {505#true} call ULTIMATE.init(); {512#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:08:39,107 INFO L280 TraceCheckUtils]: 1: Hoare triple {512#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {505#true} is VALID [2020-07-10 15:08:39,108 INFO L280 TraceCheckUtils]: 2: Hoare triple {505#true} assume true; {505#true} is VALID [2020-07-10 15:08:39,108 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {505#true} {505#true} #161#return; {505#true} is VALID [2020-07-10 15:08:39,108 INFO L263 TraceCheckUtils]: 4: Hoare triple {505#true} call #t~ret18 := main(); {505#true} is VALID [2020-07-10 15:08:39,112 INFO L280 TraceCheckUtils]: 5: Hoare triple {505#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4);call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {510#(not (= 0 main_~head~0.base))} is VALID [2020-07-10 15:08:39,113 INFO L280 TraceCheckUtils]: 6: Hoare triple {510#(not (= 0 main_~head~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {510#(not (= 0 main_~head~0.base))} is VALID [2020-07-10 15:08:39,114 INFO L280 TraceCheckUtils]: 7: Hoare triple {510#(not (= 0 main_~head~0.base))} assume !(0 != #t~nondet1);havoc #t~nondet1; {510#(not (= 0 main_~head~0.base))} is VALID [2020-07-10 15:08:39,117 INFO L280 TraceCheckUtils]: 8: Hoare triple {510#(not (= 0 main_~head~0.base))} call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~x~0.base, ~x~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem6.base, 4 + #t~mem6.offset, 4);havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call write~int(2, #t~mem7.base, 8 + #t~mem7.offset, 4);havoc #t~mem7.base, #t~mem7.offset;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {511#(not (= 0 main_~x~0.base))} is VALID [2020-07-10 15:08:39,118 INFO L280 TraceCheckUtils]: 9: Hoare triple {511#(not (= 0 main_~x~0.base))} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {506#false} is VALID [2020-07-10 15:08:39,118 INFO L280 TraceCheckUtils]: 10: Hoare triple {506#false} assume !false; {506#false} is VALID [2020-07-10 15:08:39,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:08:39,120 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995369526] [2020-07-10 15:08:39,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:08:39,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:08:39,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18737519] [2020-07-10 15:08:39,122 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-10 15:08:39,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:08:39,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:08:39,146 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:39,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:08:39,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:08:39,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:08:39,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:08:39,147 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 5 states. [2020-07-10 15:08:39,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:39,520 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2020-07-10 15:08:39,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:08:39,520 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-10 15:08:39,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:08:39,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:08:39,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2020-07-10 15:08:39,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:08:39,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2020-07-10 15:08:39,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2020-07-10 15:08:39,634 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:39,638 INFO L225 Difference]: With dead ends: 67 [2020-07-10 15:08:39,638 INFO L226 Difference]: Without dead ends: 65 [2020-07-10 15:08:39,639 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:08:39,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-07-10 15:08:39,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 39. [2020-07-10 15:08:39,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:08:39,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 39 states. [2020-07-10 15:08:39,669 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 39 states. [2020-07-10 15:08:39,669 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 39 states. [2020-07-10 15:08:39,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:39,675 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2020-07-10 15:08:39,675 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2020-07-10 15:08:39,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:39,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:39,677 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 65 states. [2020-07-10 15:08:39,677 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 65 states. [2020-07-10 15:08:39,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:39,687 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2020-07-10 15:08:39,687 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2020-07-10 15:08:39,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:39,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:39,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:08:39,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:08:39,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-10 15:08:39,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2020-07-10 15:08:39,690 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 11 [2020-07-10 15:08:39,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:08:39,691 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2020-07-10 15:08:39,691 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:08:39,691 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2020-07-10 15:08:39,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-10 15:08:39,692 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:08:39,692 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:08:39,692 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:08:39,692 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-10 15:08:39,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:08:39,693 INFO L82 PathProgramCache]: Analyzing trace with hash -409997773, now seen corresponding path program 1 times [2020-07-10 15:08:39,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:08:39,694 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752043926] [2020-07-10 15:08:39,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:08:39,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:39,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:39,771 INFO L280 TraceCheckUtils]: 0: Hoare triple {784#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {776#true} is VALID [2020-07-10 15:08:39,772 INFO L280 TraceCheckUtils]: 1: Hoare triple {776#true} assume true; {776#true} is VALID [2020-07-10 15:08:39,772 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {776#true} {776#true} #161#return; {776#true} is VALID [2020-07-10 15:08:39,774 INFO L263 TraceCheckUtils]: 0: Hoare triple {776#true} call ULTIMATE.init(); {784#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:08:39,775 INFO L280 TraceCheckUtils]: 1: Hoare triple {784#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {776#true} is VALID [2020-07-10 15:08:39,775 INFO L280 TraceCheckUtils]: 2: Hoare triple {776#true} assume true; {776#true} is VALID [2020-07-10 15:08:39,776 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {776#true} {776#true} #161#return; {776#true} is VALID [2020-07-10 15:08:39,776 INFO L263 TraceCheckUtils]: 4: Hoare triple {776#true} call #t~ret18 := main(); {776#true} is VALID [2020-07-10 15:08:39,776 INFO L280 TraceCheckUtils]: 5: Hoare triple {776#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4);call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {776#true} is VALID [2020-07-10 15:08:39,776 INFO L280 TraceCheckUtils]: 6: Hoare triple {776#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {776#true} is VALID [2020-07-10 15:08:39,777 INFO L280 TraceCheckUtils]: 7: Hoare triple {776#true} assume !(0 != #t~nondet1);havoc #t~nondet1; {776#true} is VALID [2020-07-10 15:08:39,777 INFO L280 TraceCheckUtils]: 8: Hoare triple {776#true} call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~x~0.base, ~x~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem6.base, 4 + #t~mem6.offset, 4);havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call write~int(2, #t~mem7.base, 8 + #t~mem7.offset, 4);havoc #t~mem7.base, #t~mem7.offset;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {776#true} is VALID [2020-07-10 15:08:39,777 INFO L280 TraceCheckUtils]: 9: Hoare triple {776#true} assume !!(0 != ~x~0.base || 0 != ~x~0.offset); {776#true} is VALID [2020-07-10 15:08:39,778 INFO L280 TraceCheckUtils]: 10: Hoare triple {776#true} goto; {776#true} is VALID [2020-07-10 15:08:39,780 INFO L280 TraceCheckUtils]: 11: Hoare triple {776#true} call #t~mem8 := read~int(~x~0.base, 8 + ~x~0.offset, 4); {781#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) |main_#t~mem8|)} is VALID [2020-07-10 15:08:39,781 INFO L280 TraceCheckUtils]: 12: Hoare triple {781#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) |main_#t~mem8|)} assume !(1 != #t~mem8);havoc #t~mem8; {782#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} is VALID [2020-07-10 15:08:39,782 INFO L280 TraceCheckUtils]: 13: Hoare triple {782#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} call #t~mem11 := read~int(~x~0.base, 8 + ~x~0.offset, 4); {783#(= |main_#t~mem11| 1)} is VALID [2020-07-10 15:08:39,783 INFO L280 TraceCheckUtils]: 14: Hoare triple {783#(= |main_#t~mem11| 1)} assume !(1 == #t~mem11);havoc #t~mem11; {777#false} is VALID [2020-07-10 15:08:39,783 INFO L280 TraceCheckUtils]: 15: Hoare triple {777#false} assume !false; {777#false} is VALID [2020-07-10 15:08:39,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:08:39,784 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752043926] [2020-07-10 15:08:39,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:08:39,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:08:39,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712425172] [2020-07-10 15:08:39,785 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-10 15:08:39,785 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:08:39,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:08:39,817 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:39,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:08:39,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:08:39,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:08:39,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:08:39,818 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 6 states. [2020-07-10 15:08:40,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:40,237 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2020-07-10 15:08:40,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:08:40,237 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-10 15:08:40,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:08:40,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:08:40,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2020-07-10 15:08:40,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:08:40,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2020-07-10 15:08:40,241 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2020-07-10 15:08:40,285 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:40,287 INFO L225 Difference]: With dead ends: 39 [2020-07-10 15:08:40,287 INFO L226 Difference]: Without dead ends: 37 [2020-07-10 15:08:40,288 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:08:40,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-10 15:08:40,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-07-10 15:08:40,307 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:08:40,308 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2020-07-10 15:08:40,308 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2020-07-10 15:08:40,308 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2020-07-10 15:08:40,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:40,310 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-10 15:08:40,311 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-10 15:08:40,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:40,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:40,312 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2020-07-10 15:08:40,312 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2020-07-10 15:08:40,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:40,314 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-10 15:08:40,314 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-10 15:08:40,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:40,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:40,315 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:08:40,315 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:08:40,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-10 15:08:40,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2020-07-10 15:08:40,318 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 16 [2020-07-10 15:08:40,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:08:40,318 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2020-07-10 15:08:40,318 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:08:40,318 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-10 15:08:40,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-10 15:08:40,319 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:08:40,320 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:08:40,320 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 15:08:40,320 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-10 15:08:40,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:08:40,321 INFO L82 PathProgramCache]: Analyzing trace with hash -409960037, now seen corresponding path program 1 times [2020-07-10 15:08:40,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:08:40,321 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327548800] [2020-07-10 15:08:40,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:08:40,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:40,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:40,516 INFO L280 TraceCheckUtils]: 0: Hoare triple {967#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {959#true} is VALID [2020-07-10 15:08:40,516 INFO L280 TraceCheckUtils]: 1: Hoare triple {959#true} assume true; {959#true} is VALID [2020-07-10 15:08:40,516 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {959#true} {959#true} #161#return; {959#true} is VALID [2020-07-10 15:08:40,519 INFO L263 TraceCheckUtils]: 0: Hoare triple {959#true} call ULTIMATE.init(); {967#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:08:40,519 INFO L280 TraceCheckUtils]: 1: Hoare triple {967#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {959#true} is VALID [2020-07-10 15:08:40,519 INFO L280 TraceCheckUtils]: 2: Hoare triple {959#true} assume true; {959#true} is VALID [2020-07-10 15:08:40,520 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {959#true} {959#true} #161#return; {959#true} is VALID [2020-07-10 15:08:40,520 INFO L263 TraceCheckUtils]: 4: Hoare triple {959#true} call #t~ret18 := main(); {959#true} is VALID [2020-07-10 15:08:40,522 INFO L280 TraceCheckUtils]: 5: Hoare triple {959#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4);call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {964#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~head~0.offset))} is VALID [2020-07-10 15:08:40,523 INFO L280 TraceCheckUtils]: 6: Hoare triple {964#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~head~0.offset))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {964#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~head~0.offset))} is VALID [2020-07-10 15:08:40,523 INFO L280 TraceCheckUtils]: 7: Hoare triple {964#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~head~0.offset))} assume !(0 != #t~nondet1);havoc #t~nondet1; {964#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~head~0.offset))} is VALID [2020-07-10 15:08:40,526 INFO L280 TraceCheckUtils]: 8: Hoare triple {964#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~head~0.offset))} call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~x~0.base, ~x~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem6.base, 4 + #t~mem6.offset, 4);havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call write~int(2, #t~mem7.base, 8 + #t~mem7.offset, 4);havoc #t~mem7.base, #t~mem7.offset;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {965#(and (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~x~0.offset 0))} is VALID [2020-07-10 15:08:40,527 INFO L280 TraceCheckUtils]: 9: Hoare triple {965#(and (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~x~0.offset 0))} assume !!(0 != ~x~0.base || 0 != ~x~0.offset); {965#(and (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~x~0.offset 0))} is VALID [2020-07-10 15:08:40,528 INFO L280 TraceCheckUtils]: 10: Hoare triple {965#(and (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~x~0.offset 0))} goto; {965#(and (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~x~0.offset 0))} is VALID [2020-07-10 15:08:40,528 INFO L280 TraceCheckUtils]: 11: Hoare triple {965#(and (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~x~0.offset 0))} call #t~mem8 := read~int(~x~0.base, 8 + ~x~0.offset, 4); {966#(= 1 |main_#t~mem8|)} is VALID [2020-07-10 15:08:40,529 INFO L280 TraceCheckUtils]: 12: Hoare triple {966#(= 1 |main_#t~mem8|)} assume !!(1 != #t~mem8);havoc #t~mem8; {960#false} is VALID [2020-07-10 15:08:40,529 INFO L280 TraceCheckUtils]: 13: Hoare triple {960#false} call #t~mem9 := read~int(~x~0.base, 8 + ~x~0.offset, 4); {960#false} is VALID [2020-07-10 15:08:40,530 INFO L280 TraceCheckUtils]: 14: Hoare triple {960#false} assume !(0 == #t~mem9);havoc #t~mem9; {960#false} is VALID [2020-07-10 15:08:40,530 INFO L280 TraceCheckUtils]: 15: Hoare triple {960#false} assume !false; {960#false} is VALID [2020-07-10 15:08:40,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:08:40,531 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327548800] [2020-07-10 15:08:40,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:08:40,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:08:40,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846961053] [2020-07-10 15:08:40,532 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-10 15:08:40,532 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:08:40,533 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:08:40,558 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:40,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:08:40,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:08:40,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:08:40,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:08:40,559 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 6 states. [2020-07-10 15:08:41,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:41,100 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2020-07-10 15:08:41,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:08:41,100 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-10 15:08:41,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:08:41,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:08:41,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2020-07-10 15:08:41,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:08:41,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2020-07-10 15:08:41,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 77 transitions. [2020-07-10 15:08:41,209 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:41,211 INFO L225 Difference]: With dead ends: 72 [2020-07-10 15:08:41,211 INFO L226 Difference]: Without dead ends: 48 [2020-07-10 15:08:41,211 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:08:41,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-10 15:08:41,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2020-07-10 15:08:41,238 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:08:41,238 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 44 states. [2020-07-10 15:08:41,238 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 44 states. [2020-07-10 15:08:41,238 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 44 states. [2020-07-10 15:08:41,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:41,241 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2020-07-10 15:08:41,241 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2020-07-10 15:08:41,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:41,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:41,242 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 48 states. [2020-07-10 15:08:41,242 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 48 states. [2020-07-10 15:08:41,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:41,251 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2020-07-10 15:08:41,251 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2020-07-10 15:08:41,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:41,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:41,252 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:08:41,252 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:08:41,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-10 15:08:41,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2020-07-10 15:08:41,254 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 16 [2020-07-10 15:08:41,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:08:41,255 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2020-07-10 15:08:41,255 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:08:41,255 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2020-07-10 15:08:41,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-10 15:08:41,257 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:08:41,257 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-10 15:08:41,258 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 15:08:41,258 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-10 15:08:41,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:08:41,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1407314597, now seen corresponding path program 1 times [2020-07-10 15:08:41,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:08:41,259 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805193108] [2020-07-10 15:08:41,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:08:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:08:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:08:41,375 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:08:41,375 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:08:41,376 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 15:08:41,420 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:08:41,421 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:08:41,421 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:08:41,421 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:08:41,421 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:08:41,421 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:08:41,421 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:08:41,421 WARN L170 areAnnotationChecker]: L1008-5 has no Hoare annotation [2020-07-10 15:08:41,426 WARN L170 areAnnotationChecker]: L1008-5 has no Hoare annotation [2020-07-10 15:08:41,427 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:08:41,427 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:08:41,427 WARN L170 areAnnotationChecker]: L1001-3 has no Hoare annotation [2020-07-10 15:08:41,427 WARN L170 areAnnotationChecker]: L1001-1 has no Hoare annotation [2020-07-10 15:08:41,427 WARN L170 areAnnotationChecker]: L1001-1 has no Hoare annotation [2020-07-10 15:08:41,427 WARN L170 areAnnotationChecker]: L1017-4 has no Hoare annotation [2020-07-10 15:08:41,427 WARN L170 areAnnotationChecker]: L1017-4 has no Hoare annotation [2020-07-10 15:08:41,427 WARN L170 areAnnotationChecker]: L1017-4 has no Hoare annotation [2020-07-10 15:08:41,427 WARN L170 areAnnotationChecker]: L1008-4 has no Hoare annotation [2020-07-10 15:08:41,428 WARN L170 areAnnotationChecker]: L1008-4 has no Hoare annotation [2020-07-10 15:08:41,428 WARN L170 areAnnotationChecker]: L1008-4 has no Hoare annotation [2020-07-10 15:08:41,428 WARN L170 areAnnotationChecker]: L1019-2 has no Hoare annotation [2020-07-10 15:08:41,428 WARN L170 areAnnotationChecker]: L1019-2 has no Hoare annotation [2020-07-10 15:08:41,428 WARN L170 areAnnotationChecker]: L1017-1 has no Hoare annotation [2020-07-10 15:08:41,428 WARN L170 areAnnotationChecker]: L1017-1 has no Hoare annotation [2020-07-10 15:08:41,428 WARN L170 areAnnotationChecker]: L1017-3 has no Hoare annotation [2020-07-10 15:08:41,428 WARN L170 areAnnotationChecker]: L1017-3 has no Hoare annotation [2020-07-10 15:08:41,429 WARN L170 areAnnotationChecker]: L1008-1 has no Hoare annotation [2020-07-10 15:08:41,429 WARN L170 areAnnotationChecker]: L1008-1 has no Hoare annotation [2020-07-10 15:08:41,429 WARN L170 areAnnotationChecker]: L1008-3 has no Hoare annotation [2020-07-10 15:08:41,429 WARN L170 areAnnotationChecker]: L1008-3 has no Hoare annotation [2020-07-10 15:08:41,429 WARN L170 areAnnotationChecker]: L1024-4 has no Hoare annotation [2020-07-10 15:08:41,429 WARN L170 areAnnotationChecker]: L1024-4 has no Hoare annotation [2020-07-10 15:08:41,429 WARN L170 areAnnotationChecker]: L1019 has no Hoare annotation [2020-07-10 15:08:41,429 WARN L170 areAnnotationChecker]: L1019 has no Hoare annotation [2020-07-10 15:08:41,429 WARN L170 areAnnotationChecker]: L1024 has no Hoare annotation [2020-07-10 15:08:41,430 WARN L170 areAnnotationChecker]: L1024 has no Hoare annotation [2020-07-10 15:08:41,430 WARN L170 areAnnotationChecker]: L1024-5 has no Hoare annotation [2020-07-10 15:08:41,430 WARN L170 areAnnotationChecker]: L1021-5 has no Hoare annotation [2020-07-10 15:08:41,430 WARN L170 areAnnotationChecker]: L1021-5 has no Hoare annotation [2020-07-10 15:08:41,430 WARN L170 areAnnotationChecker]: L1024-1 has no Hoare annotation [2020-07-10 15:08:41,430 WARN L170 areAnnotationChecker]: L1024-1 has no Hoare annotation [2020-07-10 15:08:41,430 WARN L170 areAnnotationChecker]: L1024-3 has no Hoare annotation [2020-07-10 15:08:41,430 WARN L170 areAnnotationChecker]: L1024-3 has no Hoare annotation [2020-07-10 15:08:41,430 WARN L170 areAnnotationChecker]: L1026-5 has no Hoare annotation [2020-07-10 15:08:41,431 WARN L170 areAnnotationChecker]: L1026-5 has no Hoare annotation [2020-07-10 15:08:41,431 WARN L170 areAnnotationChecker]: L1021-1 has no Hoare annotation [2020-07-10 15:08:41,431 WARN L170 areAnnotationChecker]: L1021-1 has no Hoare annotation [2020-07-10 15:08:41,431 WARN L170 areAnnotationChecker]: L1021-6 has no Hoare annotation [2020-07-10 15:08:41,431 WARN L170 areAnnotationChecker]: L1026-1 has no Hoare annotation [2020-07-10 15:08:41,431 WARN L170 areAnnotationChecker]: L1026-1 has no Hoare annotation [2020-07-10 15:08:41,432 WARN L170 areAnnotationChecker]: L1026-6 has no Hoare annotation [2020-07-10 15:08:41,432 WARN L170 areAnnotationChecker]: L1021-2 has no Hoare annotation [2020-07-10 15:08:41,432 WARN L170 areAnnotationChecker]: L1021-2 has no Hoare annotation [2020-07-10 15:08:41,432 WARN L170 areAnnotationChecker]: L1021-4 has no Hoare annotation [2020-07-10 15:08:41,432 WARN L170 areAnnotationChecker]: L1021-4 has no Hoare annotation [2020-07-10 15:08:41,432 WARN L170 areAnnotationChecker]: L1026-2 has no Hoare annotation [2020-07-10 15:08:41,432 WARN L170 areAnnotationChecker]: L1026-2 has no Hoare annotation [2020-07-10 15:08:41,432 WARN L170 areAnnotationChecker]: L1026-4 has no Hoare annotation [2020-07-10 15:08:41,433 WARN L170 areAnnotationChecker]: L1026-4 has no Hoare annotation [2020-07-10 15:08:41,433 WARN L170 areAnnotationChecker]: L1030-3 has no Hoare annotation [2020-07-10 15:08:41,434 WARN L170 areAnnotationChecker]: L1030-3 has no Hoare annotation [2020-07-10 15:08:41,434 WARN L170 areAnnotationChecker]: L1036-4 has no Hoare annotation [2020-07-10 15:08:41,434 WARN L170 areAnnotationChecker]: L1036-4 has no Hoare annotation [2020-07-10 15:08:41,434 WARN L170 areAnnotationChecker]: L1030-1 has no Hoare annotation [2020-07-10 15:08:41,434 WARN L170 areAnnotationChecker]: L1030-1 has no Hoare annotation [2020-07-10 15:08:41,434 WARN L170 areAnnotationChecker]: L1036 has no Hoare annotation [2020-07-10 15:08:41,434 WARN L170 areAnnotationChecker]: L1036 has no Hoare annotation [2020-07-10 15:08:41,435 WARN L170 areAnnotationChecker]: L1036-5 has no Hoare annotation [2020-07-10 15:08:41,435 WARN L170 areAnnotationChecker]: L1036-1 has no Hoare annotation [2020-07-10 15:08:41,435 WARN L170 areAnnotationChecker]: L1036-1 has no Hoare annotation [2020-07-10 15:08:41,435 WARN L170 areAnnotationChecker]: L1036-3 has no Hoare annotation [2020-07-10 15:08:41,435 WARN L170 areAnnotationChecker]: L1036-3 has no Hoare annotation [2020-07-10 15:08:41,435 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:08:41,435 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:08:41,435 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-10 15:08:41,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:08:41 BoogieIcfgContainer [2020-07-10 15:08:41,440 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:08:41,445 INFO L168 Benchmark]: Toolchain (without parser) took 5735.50 ms. Allocated memory was 137.9 MB in the beginning and 284.2 MB in the end (delta: 146.3 MB). Free memory was 100.1 MB in the beginning and 219.6 MB in the end (delta: -119.5 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:08:41,446 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 15:08:41,447 INFO L168 Benchmark]: CACSL2BoogieTranslator took 651.32 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 99.9 MB in the beginning and 168.9 MB in the end (delta: -69.0 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:08:41,454 INFO L168 Benchmark]: Boogie Preprocessor took 73.29 ms. Allocated memory is still 202.9 MB. Free memory was 168.9 MB in the beginning and 164.8 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:08:41,454 INFO L168 Benchmark]: RCFGBuilder took 724.51 ms. Allocated memory is still 202.9 MB. Free memory was 164.8 MB in the beginning and 105.1 MB in the end (delta: 59.8 MB). Peak memory consumption was 59.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:08:41,460 INFO L168 Benchmark]: TraceAbstraction took 4280.65 ms. Allocated memory was 202.9 MB in the beginning and 284.2 MB in the end (delta: 81.3 MB). Free memory was 104.4 MB in the beginning and 219.6 MB in the end (delta: -115.2 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 15:08:41,465 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 651.32 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 99.9 MB in the beginning and 168.9 MB in the end (delta: -69.0 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 73.29 ms. Allocated memory is still 202.9 MB. Free memory was 168.9 MB in the beginning and 164.8 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 724.51 ms. Allocated memory is still 202.9 MB. Free memory was 164.8 MB in the beginning and 105.1 MB in the end (delta: 59.8 MB). Peak memory consumption was 59.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4280.65 ms. Allocated memory was 202.9 MB in the beginning and 284.2 MB in the end (delta: 81.3 MB). Free memory was 104.4 MB in the beginning and 219.6 MB in the end (delta: -115.2 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1026]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L993] SLL* head = malloc(sizeof(SLL)); [L994] head->next = ((void*)0) [L995] head->prev = ((void*)0) [L996] head->data = 0 [L998] SLL* x = head; VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, x={-1:0}] [L1001] COND FALSE !(__VERIFIER_nondet_int()) [L1010] x->data = 1 [L1011] x->next = malloc(sizeof(SLL)) [L1012] EXPR x->next [L1012] x->next->prev = x [L1013] EXPR x->next [L1013] x->next->data = 2 [L1015] x = head VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, x={-1:0}] [L1017] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, x={-1:0}] [L1019] EXPR x->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, x={-1:0}, x->data=1] [L1019] COND FALSE !(1 != x->data) [L1024] EXPR x->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, x={-1:0}, x->data=1] [L1024] COND FALSE !(!(1 == x->data)) [L1025] EXPR x->next [L1025] x = x->next [L1026] EXPR x->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, x={-2:0}, x->data=2] [L1026] COND TRUE !(2 != x->data) [L1026] __VERIFIER_error() VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, x={-2:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 49 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 4.1s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 175 SDtfs, 91 SDslu, 234 SDs, 0 SdLazy, 350 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 30 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 83 NumberOfCodeBlocks, 83 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 2923 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 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...