/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 01:08:39,291 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 01:08:39,293 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 01:08:39,314 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 01:08:39,314 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 01:08:39,316 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 01:08:39,318 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 01:08:39,329 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 01:08:39,332 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 01:08:39,335 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 01:08:39,337 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 01:08:39,340 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 01:08:39,340 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 01:08:39,342 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 01:08:39,344 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 01:08:39,346 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 01:08:39,347 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 01:08:39,348 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 01:08:39,349 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 01:08:39,354 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 01:08:39,359 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 01:08:39,362 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 01:08:39,363 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 01:08:39,364 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 01:08:39,366 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 01:08:39,366 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 01:08:39,367 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 01:08:39,369 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 01:08:39,369 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 01:08:39,372 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 01:08:39,372 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 01:08:39,373 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 01:08:39,374 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 01:08:39,375 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 01:08:39,376 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 01:08:39,376 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 01:08:39,377 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 01:08:39,377 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 01:08:39,377 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 01:08:39,378 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 01:08:39,379 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 01:08:39,380 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 01:08:39,391 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 01:08:39,392 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 01:08:39,394 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 01:08:39,394 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 01:08:39,394 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 01:08:39,395 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 01:08:39,395 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 01:08:39,395 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 01:08:39,395 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 01:08:39,395 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 01:08:39,396 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 01:08:39,397 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 01:08:39,397 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 01:08:39,397 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 01:08:39,397 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 01:08:39,398 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 01:08:39,398 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 01:08:39,398 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 01:08:39,398 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 01:08:39,398 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 01:08:39,399 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 01:08:39,399 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 01:08:39,399 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 01:08:39,737 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 01:08:39,755 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 01:08:39,759 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 01:08:39,760 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 01:08:39,761 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 01:08:39,762 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1-2.i [2020-07-11 01:08:39,838 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acd1dc089/e76c0daddf2543ddaef0d7f4547376bf/FLAGd25852eca [2020-07-11 01:08:40,462 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 01:08:40,462 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1-2.i [2020-07-11 01:08:40,483 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acd1dc089/e76c0daddf2543ddaef0d7f4547376bf/FLAGd25852eca [2020-07-11 01:08:40,737 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acd1dc089/e76c0daddf2543ddaef0d7f4547376bf [2020-07-11 01:08:40,747 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 01:08:40,749 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 01:08:40,754 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 01:08:40,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 01:08:40,758 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 01:08:40,760 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 01:08:40" (1/1) ... [2020-07-11 01:08:40,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37c664e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:08:40, skipping insertion in model container [2020-07-11 01:08:40,764 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 01:08:40" (1/1) ... [2020-07-11 01:08:40,772 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 01:08:40,826 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 01:08:41,311 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 01:08:41,329 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 01:08:41,421 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 01:08:41,471 INFO L208 MainTranslator]: Completed translation [2020-07-11 01:08:41,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:08:41 WrapperNode [2020-07-11 01:08:41,472 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 01:08:41,473 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 01:08:41,473 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 01:08:41,473 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 01:08:41,489 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:08:41" (1/1) ... [2020-07-11 01:08:41,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:08:41" (1/1) ... [2020-07-11 01:08:41,517 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:08:41" (1/1) ... [2020-07-11 01:08:41,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:08:41" (1/1) ... [2020-07-11 01:08:41,555 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:08:41" (1/1) ... [2020-07-11 01:08:41,562 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:08:41" (1/1) ... [2020-07-11 01:08:41,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:08:41" (1/1) ... [2020-07-11 01:08:41,573 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 01:08:41,573 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 01:08:41,574 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 01:08:41,574 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 01:08:41,575 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:08:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 01:08:41,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 01:08:41,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 01:08:41,639 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 01:08:41,640 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-11 01:08:41,640 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-11 01:08:41,640 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-11 01:08:41,640 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-11 01:08:41,641 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-11 01:08:41,641 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-11 01:08:41,641 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-11 01:08:41,641 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-11 01:08:41,642 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-11 01:08:41,643 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-11 01:08:41,643 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-11 01:08:41,643 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-11 01:08:41,644 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-11 01:08:41,644 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-11 01:08:41,644 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-11 01:08:41,644 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-11 01:08:41,645 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-11 01:08:41,646 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-11 01:08:41,646 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-11 01:08:41,648 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-11 01:08:41,648 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-11 01:08:41,649 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-11 01:08:41,649 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-11 01:08:41,649 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-11 01:08:41,650 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-11 01:08:41,650 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-11 01:08:41,650 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-11 01:08:41,651 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-11 01:08:41,651 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-11 01:08:41,652 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-11 01:08:41,653 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-11 01:08:41,653 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-11 01:08:41,653 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-11 01:08:41,654 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-11 01:08:41,654 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-11 01:08:41,654 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-11 01:08:41,654 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-11 01:08:41,654 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-11 01:08:41,654 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-11 01:08:41,654 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-11 01:08:41,655 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-11 01:08:41,655 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-11 01:08:41,655 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-11 01:08:41,655 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-11 01:08:41,656 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-11 01:08:41,656 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-11 01:08:41,656 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-11 01:08:41,656 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-11 01:08:41,656 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-11 01:08:41,656 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-11 01:08:41,656 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-11 01:08:41,657 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-11 01:08:41,657 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-11 01:08:41,657 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-11 01:08:41,657 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-11 01:08:41,657 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-11 01:08:41,657 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-11 01:08:41,658 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-11 01:08:41,658 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-11 01:08:41,658 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-11 01:08:41,658 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-11 01:08:41,658 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-11 01:08:41,658 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-11 01:08:41,658 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-11 01:08:41,659 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-11 01:08:41,659 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-11 01:08:41,659 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-11 01:08:41,659 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-11 01:08:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-11 01:08:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-11 01:08:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-11 01:08:41,661 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-11 01:08:41,661 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-11 01:08:41,661 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-11 01:08:41,661 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-11 01:08:41,662 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-11 01:08:41,662 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-11 01:08:41,663 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-11 01:08:41,663 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-11 01:08:41,663 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-11 01:08:41,663 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-11 01:08:41,663 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-11 01:08:41,663 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-11 01:08:41,664 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-11 01:08:41,665 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-11 01:08:41,665 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-11 01:08:41,665 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-11 01:08:41,665 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-11 01:08:41,666 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-11 01:08:41,666 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-11 01:08:41,666 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-11 01:08:41,667 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-11 01:08:41,667 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-11 01:08:41,667 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-11 01:08:41,667 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-11 01:08:41,667 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-11 01:08:41,667 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-11 01:08:41,668 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-11 01:08:41,668 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-11 01:08:41,668 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-11 01:08:41,669 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-11 01:08:41,669 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-11 01:08:41,669 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-11 01:08:41,669 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 01:08:41,669 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 01:08:41,669 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 01:08:41,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-11 01:08:41,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-11 01:08:41,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-11 01:08:41,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-11 01:08:41,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-11 01:08:41,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-11 01:08:41,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 01:08:41,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 01:08:42,367 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 01:08:42,367 INFO L295 CfgBuilder]: Removed 9 assume(true) statements. [2020-07-11 01:08:42,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 01:08:42 BoogieIcfgContainer [2020-07-11 01:08:42,372 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 01:08:42,373 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 01:08:42,373 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 01:08:42,377 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 01:08:42,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 01:08:40" (1/3) ... [2020-07-11 01:08:42,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22bbcbbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 01:08:42, skipping insertion in model container [2020-07-11 01:08:42,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:08:41" (2/3) ... [2020-07-11 01:08:42,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22bbcbbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 01:08:42, skipping insertion in model container [2020-07-11 01:08:42,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 01:08:42" (3/3) ... [2020-07-11 01:08:42,381 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1-2.i [2020-07-11 01:08:42,392 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 01:08:42,400 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2020-07-11 01:08:42,416 INFO L251 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2020-07-11 01:08:42,441 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 01:08:42,441 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 01:08:42,442 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 01:08:42,442 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 01:08:42,442 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 01:08:42,442 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 01:08:42,442 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 01:08:42,443 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 01:08:42,461 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2020-07-11 01:08:42,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-11 01:08:42,473 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:08:42,474 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:08:42,475 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:08:42,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:08:42,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1234818853, now seen corresponding path program 1 times [2020-07-11 01:08:42,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:08:42,492 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [659737652] [2020-07-11 01:08:42,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:08:42,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:08:42,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:08:42,758 INFO L280 TraceCheckUtils]: 0: Hoare triple {102#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {95#true} is VALID [2020-07-11 01:08:42,759 INFO L280 TraceCheckUtils]: 1: Hoare triple {95#true} #valid := #valid[0 := 0]; {95#true} is VALID [2020-07-11 01:08:42,759 INFO L280 TraceCheckUtils]: 2: Hoare triple {95#true} assume 0 < #StackHeapBarrier; {95#true} is VALID [2020-07-11 01:08:42,760 INFO L280 TraceCheckUtils]: 3: Hoare triple {95#true} assume true; {95#true} is VALID [2020-07-11 01:08:42,760 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {95#true} {95#true} #176#return; {95#true} is VALID [2020-07-11 01:08:42,764 INFO L263 TraceCheckUtils]: 0: Hoare triple {95#true} call ULTIMATE.init(); {102#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:08:42,764 INFO L280 TraceCheckUtils]: 1: Hoare triple {102#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {95#true} is VALID [2020-07-11 01:08:42,765 INFO L280 TraceCheckUtils]: 2: Hoare triple {95#true} #valid := #valid[0 := 0]; {95#true} is VALID [2020-07-11 01:08:42,765 INFO L280 TraceCheckUtils]: 3: Hoare triple {95#true} assume 0 < #StackHeapBarrier; {95#true} is VALID [2020-07-11 01:08:42,765 INFO L280 TraceCheckUtils]: 4: Hoare triple {95#true} assume true; {95#true} is VALID [2020-07-11 01:08:42,765 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {95#true} {95#true} #176#return; {95#true} is VALID [2020-07-11 01:08:42,766 INFO L263 TraceCheckUtils]: 6: Hoare triple {95#true} call #t~ret17 := main(); {95#true} is VALID [2020-07-11 01:08:42,766 INFO L280 TraceCheckUtils]: 7: Hoare triple {95#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {95#true} is VALID [2020-07-11 01:08:42,766 INFO L280 TraceCheckUtils]: 8: Hoare triple {95#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {95#true} is VALID [2020-07-11 01:08:42,767 INFO L280 TraceCheckUtils]: 9: Hoare triple {95#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L996 {95#true} is VALID [2020-07-11 01:08:42,767 INFO L280 TraceCheckUtils]: 10: Hoare triple {95#true} SUMMARY for call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L996-1 {95#true} is VALID [2020-07-11 01:08:42,767 INFO L280 TraceCheckUtils]: 11: Hoare triple {95#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {95#true} is VALID [2020-07-11 01:08:42,768 INFO L280 TraceCheckUtils]: 12: Hoare triple {95#true} assume !true; {96#false} is VALID [2020-07-11 01:08:42,769 INFO L280 TraceCheckUtils]: 13: Hoare triple {96#false} ~end~0.base, ~end~0.offset := 0, 0; {96#false} is VALID [2020-07-11 01:08:42,769 INFO L280 TraceCheckUtils]: 14: Hoare triple {96#false} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {96#false} is VALID [2020-07-11 01:08:42,770 INFO L280 TraceCheckUtils]: 15: Hoare triple {96#false} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {96#false} is VALID [2020-07-11 01:08:42,770 INFO L280 TraceCheckUtils]: 16: Hoare triple {96#false} assume !false; {96#false} is VALID [2020-07-11 01:08:42,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 01:08:42,773 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [659737652] [2020-07-11 01:08:42,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:08:42,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:08:42,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363109208] [2020-07-11 01:08:42,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-07-11 01:08:42,785 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:08:42,790 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:08:42,822 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:42,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:08:42,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:08:42,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:08:42,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:08:42,834 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 3 states. [2020-07-11 01:08:43,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:43,293 INFO L93 Difference]: Finished difference Result 149 states and 180 transitions. [2020-07-11 01:08:43,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:08:43,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-07-11 01:08:43,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:08:43,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:08:43,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2020-07-11 01:08:43,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:08:43,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2020-07-11 01:08:43,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 180 transitions. [2020-07-11 01:08:43,533 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:43,566 INFO L225 Difference]: With dead ends: 149 [2020-07-11 01:08:43,566 INFO L226 Difference]: Without dead ends: 69 [2020-07-11 01:08:43,574 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-11 01:08:43,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-07-11 01:08:43,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-07-11 01:08:43,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:08:43,665 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 69 states. [2020-07-11 01:08:43,666 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 69 states. [2020-07-11 01:08:43,666 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 69 states. [2020-07-11 01:08:43,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:43,677 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2020-07-11 01:08:43,677 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2020-07-11 01:08:43,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:08:43,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:08:43,679 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 69 states. [2020-07-11 01:08:43,679 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 69 states. [2020-07-11 01:08:43,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:43,693 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2020-07-11 01:08:43,693 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2020-07-11 01:08:43,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:08:43,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:08:43,694 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:08:43,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:08:43,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-07-11 01:08:43,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2020-07-11 01:08:43,706 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 17 [2020-07-11 01:08:43,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:08:43,707 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2020-07-11 01:08:43,707 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:08:43,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 69 states and 72 transitions. [2020-07-11 01:08:43,828 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:43,828 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2020-07-11 01:08:43,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-11 01:08:43,829 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:08:43,830 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:08:43,830 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 01:08:43,832 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:08:43,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:08:43,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1418693445, now seen corresponding path program 1 times [2020-07-11 01:08:43,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:08:43,833 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [587761469] [2020-07-11 01:08:43,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:08:43,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:08:44,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:08:44,038 INFO L280 TraceCheckUtils]: 0: Hoare triple {689#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {679#true} is VALID [2020-07-11 01:08:44,038 INFO L280 TraceCheckUtils]: 1: Hoare triple {679#true} #valid := #valid[0 := 0]; {679#true} is VALID [2020-07-11 01:08:44,038 INFO L280 TraceCheckUtils]: 2: Hoare triple {679#true} assume 0 < #StackHeapBarrier; {679#true} is VALID [2020-07-11 01:08:44,039 INFO L280 TraceCheckUtils]: 3: Hoare triple {679#true} assume true; {679#true} is VALID [2020-07-11 01:08:44,039 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {679#true} {679#true} #176#return; {679#true} is VALID [2020-07-11 01:08:44,040 INFO L263 TraceCheckUtils]: 0: Hoare triple {679#true} call ULTIMATE.init(); {689#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:08:44,040 INFO L280 TraceCheckUtils]: 1: Hoare triple {689#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {679#true} is VALID [2020-07-11 01:08:44,041 INFO L280 TraceCheckUtils]: 2: Hoare triple {679#true} #valid := #valid[0 := 0]; {679#true} is VALID [2020-07-11 01:08:44,041 INFO L280 TraceCheckUtils]: 3: Hoare triple {679#true} assume 0 < #StackHeapBarrier; {679#true} is VALID [2020-07-11 01:08:44,041 INFO L280 TraceCheckUtils]: 4: Hoare triple {679#true} assume true; {679#true} is VALID [2020-07-11 01:08:44,042 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {679#true} {679#true} #176#return; {679#true} is VALID [2020-07-11 01:08:44,042 INFO L263 TraceCheckUtils]: 6: Hoare triple {679#true} call #t~ret17 := main(); {679#true} is VALID [2020-07-11 01:08:44,043 INFO L280 TraceCheckUtils]: 7: Hoare triple {679#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {686#(not (= 0 |main_#t~malloc0.base|))} is VALID [2020-07-11 01:08:44,044 INFO L280 TraceCheckUtils]: 8: Hoare triple {686#(not (= 0 |main_#t~malloc0.base|))} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {687#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:44,044 INFO L280 TraceCheckUtils]: 9: Hoare triple {687#(not (= 0 main_~list~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L996 {687#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:44,046 INFO L280 TraceCheckUtils]: 10: Hoare triple {687#(not (= 0 main_~list~0.base))} SUMMARY for call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L996-1 {687#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:44,047 INFO L280 TraceCheckUtils]: 11: Hoare triple {687#(not (= 0 main_~list~0.base))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {687#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:44,048 INFO L280 TraceCheckUtils]: 12: Hoare triple {687#(not (= 0 main_~list~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {687#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:44,050 INFO L280 TraceCheckUtils]: 13: Hoare triple {687#(not (= 0 main_~list~0.base))} assume !(0 != #t~nondet1); {687#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:44,050 INFO L280 TraceCheckUtils]: 14: Hoare triple {687#(not (= 0 main_~list~0.base))} havoc #t~nondet1; {687#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:44,051 INFO L280 TraceCheckUtils]: 15: Hoare triple {687#(not (= 0 main_~list~0.base))} ~end~0.base, ~end~0.offset := 0, 0; {687#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:44,052 INFO L280 TraceCheckUtils]: 16: Hoare triple {687#(not (= 0 main_~list~0.base))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {688#(not (= 0 main_~end~0.base))} is VALID [2020-07-11 01:08:44,052 INFO L280 TraceCheckUtils]: 17: Hoare triple {688#(not (= 0 main_~end~0.base))} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {680#false} is VALID [2020-07-11 01:08:44,053 INFO L280 TraceCheckUtils]: 18: Hoare triple {680#false} assume !false; {680#false} is VALID [2020-07-11 01:08:44,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 01:08:44,056 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [587761469] [2020-07-11 01:08:44,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:08:44,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-11 01:08:44,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515459120] [2020-07-11 01:08:44,058 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-07-11 01:08:44,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:08:44,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 01:08:44,084 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:44,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 01:08:44,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:08:44,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 01:08:44,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-11 01:08:44,086 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 6 states. [2020-07-11 01:08:44,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:44,748 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2020-07-11 01:08:44,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 01:08:44,749 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-07-11 01:08:44,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:08:44,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 01:08:44,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2020-07-11 01:08:44,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 01:08:44,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2020-07-11 01:08:44,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 99 transitions. [2020-07-11 01:08:44,925 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:44,931 INFO L225 Difference]: With dead ends: 94 [2020-07-11 01:08:44,932 INFO L226 Difference]: Without dead ends: 92 [2020-07-11 01:08:44,933 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-11 01:08:44,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-07-11 01:08:45,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 67. [2020-07-11 01:08:45,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:08:45,054 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 67 states. [2020-07-11 01:08:45,054 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 67 states. [2020-07-11 01:08:45,054 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 67 states. [2020-07-11 01:08:45,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:45,059 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2020-07-11 01:08:45,060 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2020-07-11 01:08:45,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:08:45,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:08:45,061 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 92 states. [2020-07-11 01:08:45,061 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 92 states. [2020-07-11 01:08:45,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:45,066 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2020-07-11 01:08:45,066 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2020-07-11 01:08:45,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:08:45,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:08:45,068 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:08:45,068 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:08:45,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-07-11 01:08:45,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2020-07-11 01:08:45,072 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 19 [2020-07-11 01:08:45,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:08:45,072 INFO L479 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2020-07-11 01:08:45,072 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 01:08:45,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 67 states and 70 transitions. [2020-07-11 01:08:45,166 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-11 01:08:45,166 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2020-07-11 01:08:45,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-11 01:08:45,168 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:08:45,168 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:08:45,169 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 01:08:45,169 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:08:45,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:08:45,169 INFO L82 PathProgramCache]: Analyzing trace with hash -407334014, now seen corresponding path program 1 times [2020-07-11 01:08:45,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:08:45,170 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1784183636] [2020-07-11 01:08:45,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:08:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:08:45,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:08:45,337 INFO L280 TraceCheckUtils]: 0: Hoare triple {1214#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1202#true} is VALID [2020-07-11 01:08:45,337 INFO L280 TraceCheckUtils]: 1: Hoare triple {1202#true} #valid := #valid[0 := 0]; {1202#true} is VALID [2020-07-11 01:08:45,337 INFO L280 TraceCheckUtils]: 2: Hoare triple {1202#true} assume 0 < #StackHeapBarrier; {1202#true} is VALID [2020-07-11 01:08:45,338 INFO L280 TraceCheckUtils]: 3: Hoare triple {1202#true} assume true; {1202#true} is VALID [2020-07-11 01:08:45,338 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1202#true} {1202#true} #176#return; {1202#true} is VALID [2020-07-11 01:08:45,339 INFO L263 TraceCheckUtils]: 0: Hoare triple {1202#true} call ULTIMATE.init(); {1214#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:08:45,339 INFO L280 TraceCheckUtils]: 1: Hoare triple {1214#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1202#true} is VALID [2020-07-11 01:08:45,340 INFO L280 TraceCheckUtils]: 2: Hoare triple {1202#true} #valid := #valid[0 := 0]; {1202#true} is VALID [2020-07-11 01:08:45,340 INFO L280 TraceCheckUtils]: 3: Hoare triple {1202#true} assume 0 < #StackHeapBarrier; {1202#true} is VALID [2020-07-11 01:08:45,340 INFO L280 TraceCheckUtils]: 4: Hoare triple {1202#true} assume true; {1202#true} is VALID [2020-07-11 01:08:45,341 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1202#true} {1202#true} #176#return; {1202#true} is VALID [2020-07-11 01:08:45,341 INFO L263 TraceCheckUtils]: 6: Hoare triple {1202#true} call #t~ret17 := main(); {1202#true} is VALID [2020-07-11 01:08:45,342 INFO L280 TraceCheckUtils]: 7: Hoare triple {1202#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {1209#(= 0 |main_#t~malloc0.offset|)} is VALID [2020-07-11 01:08:45,343 INFO L280 TraceCheckUtils]: 8: Hoare triple {1209#(= 0 |main_#t~malloc0.offset|)} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {1210#(= 0 main_~list~0.offset)} is VALID [2020-07-11 01:08:45,343 INFO L280 TraceCheckUtils]: 9: Hoare triple {1210#(= 0 main_~list~0.offset)} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L996 {1210#(= 0 main_~list~0.offset)} is VALID [2020-07-11 01:08:45,345 INFO L280 TraceCheckUtils]: 10: Hoare triple {1210#(= 0 main_~list~0.offset)} SUMMARY for call write~int(~unnamed1~0~BLACK, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L996-1 {1211#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:08:45,346 INFO L280 TraceCheckUtils]: 11: Hoare triple {1211#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1211#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:08:45,347 INFO L280 TraceCheckUtils]: 12: Hoare triple {1211#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1211#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:08:45,348 INFO L280 TraceCheckUtils]: 13: Hoare triple {1211#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !(0 != #t~nondet1); {1211#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:08:45,348 INFO L280 TraceCheckUtils]: 14: Hoare triple {1211#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~nondet1; {1211#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:08:45,349 INFO L280 TraceCheckUtils]: 15: Hoare triple {1211#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := 0, 0; {1211#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-11 01:08:45,350 INFO L280 TraceCheckUtils]: 16: Hoare triple {1211#(and (= 0 main_~list~0.offset) (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1212#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-11 01:08:45,351 INFO L280 TraceCheckUtils]: 17: Hoare triple {1212#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {1212#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-11 01:08:45,352 INFO L280 TraceCheckUtils]: 18: Hoare triple {1212#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} goto; {1212#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} is VALID [2020-07-11 01:08:45,353 INFO L280 TraceCheckUtils]: 19: Hoare triple {1212#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) ~unnamed1~0~BLACK)} SUMMARY for call #t~mem7 := read~int(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1028-6 {1213#(= ~unnamed1~0~BLACK |main_#t~mem7|)} is VALID [2020-07-11 01:08:45,354 INFO L280 TraceCheckUtils]: 20: Hoare triple {1213#(= ~unnamed1~0~BLACK |main_#t~mem7|)} assume !(~unnamed1~0~BLACK == #t~mem7); {1203#false} is VALID [2020-07-11 01:08:45,354 INFO L280 TraceCheckUtils]: 21: Hoare triple {1203#false} havoc #t~mem7; {1203#false} is VALID [2020-07-11 01:08:45,355 INFO L280 TraceCheckUtils]: 22: Hoare triple {1203#false} assume !false; {1203#false} is VALID [2020-07-11 01:08:45,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 01:08:45,357 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1784183636] [2020-07-11 01:08:45,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:08:45,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-11 01:08:45,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585075380] [2020-07-11 01:08:45,358 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-07-11 01:08:45,358 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:08:45,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-11 01:08:45,386 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:45,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-11 01:08:45,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:08:45,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-11 01:08:45,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-11 01:08:45,388 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 8 states. [2020-07-11 01:08:46,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:46,459 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2020-07-11 01:08:46,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-11 01:08:46,459 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-07-11 01:08:46,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:08:46,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 01:08:46,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2020-07-11 01:08:46,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 01:08:46,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2020-07-11 01:08:46,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 127 transitions. [2020-07-11 01:08:46,636 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:46,640 INFO L225 Difference]: With dead ends: 121 [2020-07-11 01:08:46,641 INFO L226 Difference]: Without dead ends: 118 [2020-07-11 01:08:46,641 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2020-07-11 01:08:46,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-07-11 01:08:46,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 76. [2020-07-11 01:08:46,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:08:46,897 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand 76 states. [2020-07-11 01:08:46,898 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 76 states. [2020-07-11 01:08:46,898 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 76 states. [2020-07-11 01:08:46,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:46,909 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2020-07-11 01:08:46,909 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2020-07-11 01:08:46,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:08:46,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:08:46,916 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 118 states. [2020-07-11 01:08:46,916 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 118 states. [2020-07-11 01:08:46,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:46,924 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2020-07-11 01:08:46,924 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2020-07-11 01:08:46,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:08:46,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:08:46,930 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:08:46,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:08:46,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-11 01:08:46,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2020-07-11 01:08:46,936 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 23 [2020-07-11 01:08:46,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:08:46,936 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2020-07-11 01:08:46,937 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-11 01:08:46,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 76 states and 80 transitions. [2020-07-11 01:08:47,049 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:47,049 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2020-07-11 01:08:47,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-11 01:08:47,051 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:08:47,051 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:08:47,051 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 01:08:47,052 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:08:47,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:08:47,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1213824752, now seen corresponding path program 1 times [2020-07-11 01:08:47,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:08:47,052 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1671902376] [2020-07-11 01:08:47,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:08:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 01:08:47,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 01:08:47,121 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-11 01:08:47,121 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-11 01:08:47,122 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 01:08:47,158 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-11 01:08:47,158 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 01:08:47,158 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 01:08:47,158 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-11 01:08:47,158 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 01:08:47,158 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 01:08:47,158 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 01:08:47,159 WARN L170 areAnnotationChecker]: L995 has no Hoare annotation [2020-07-11 01:08:47,159 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-11 01:08:47,159 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-11 01:08:47,159 WARN L170 areAnnotationChecker]: L996 has no Hoare annotation [2020-07-11 01:08:47,159 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-11 01:08:47,159 WARN L170 areAnnotationChecker]: L996-1 has no Hoare annotation [2020-07-11 01:08:47,159 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-11 01:08:47,159 WARN L170 areAnnotationChecker]: L997 has no Hoare annotation [2020-07-11 01:08:47,159 WARN L170 areAnnotationChecker]: L1019 has no Hoare annotation [2020-07-11 01:08:47,160 WARN L170 areAnnotationChecker]: L1019 has no Hoare annotation [2020-07-11 01:08:47,160 WARN L170 areAnnotationChecker]: L1002-5 has no Hoare annotation [2020-07-11 01:08:47,160 WARN L170 areAnnotationChecker]: L1002-1 has no Hoare annotation [2020-07-11 01:08:47,160 WARN L170 areAnnotationChecker]: L1002-1 has no Hoare annotation [2020-07-11 01:08:47,160 WARN L170 areAnnotationChecker]: L1024 has no Hoare annotation [2020-07-11 01:08:47,160 WARN L170 areAnnotationChecker]: L1002-2 has no Hoare annotation [2020-07-11 01:08:47,160 WARN L170 areAnnotationChecker]: L1002-4 has no Hoare annotation [2020-07-11 01:08:47,160 WARN L170 areAnnotationChecker]: L1027-4 has no Hoare annotation [2020-07-11 01:08:47,160 WARN L170 areAnnotationChecker]: L1027-4 has no Hoare annotation [2020-07-11 01:08:47,161 WARN L170 areAnnotationChecker]: L1027-4 has no Hoare annotation [2020-07-11 01:08:47,161 WARN L170 areAnnotationChecker]: L1005 has no Hoare annotation [2020-07-11 01:08:47,161 WARN L170 areAnnotationChecker]: L1028-6 has no Hoare annotation [2020-07-11 01:08:47,161 WARN L170 areAnnotationChecker]: L1028-6 has no Hoare annotation [2020-07-11 01:08:47,161 WARN L170 areAnnotationChecker]: L1027-1 has no Hoare annotation [2020-07-11 01:08:47,161 WARN L170 areAnnotationChecker]: L1027-1 has no Hoare annotation [2020-07-11 01:08:47,161 WARN L170 areAnnotationChecker]: L1027-3 has no Hoare annotation [2020-07-11 01:08:47,161 WARN L170 areAnnotationChecker]: L1027-3 has no Hoare annotation [2020-07-11 01:08:47,161 WARN L170 areAnnotationChecker]: L1005-1 has no Hoare annotation [2020-07-11 01:08:47,162 WARN L170 areAnnotationChecker]: L1028 has no Hoare annotation [2020-07-11 01:08:47,162 WARN L170 areAnnotationChecker]: L1028 has no Hoare annotation [2020-07-11 01:08:47,162 WARN L170 areAnnotationChecker]: L1030-1 has no Hoare annotation [2020-07-11 01:08:47,162 WARN L170 areAnnotationChecker]: L1030-1 has no Hoare annotation [2020-07-11 01:08:47,162 WARN L170 areAnnotationChecker]: L1030-1 has no Hoare annotation [2020-07-11 01:08:47,162 WARN L170 areAnnotationChecker]: L1005-2 has no Hoare annotation [2020-07-11 01:08:47,162 WARN L170 areAnnotationChecker]: L1028-1 has no Hoare annotation [2020-07-11 01:08:47,162 WARN L170 areAnnotationChecker]: L1028-4 has no Hoare annotation [2020-07-11 01:08:47,162 WARN L170 areAnnotationChecker]: L1045-4 has no Hoare annotation [2020-07-11 01:08:47,163 WARN L170 areAnnotationChecker]: L1045-4 has no Hoare annotation [2020-07-11 01:08:47,163 WARN L170 areAnnotationChecker]: L1045-4 has no Hoare annotation [2020-07-11 01:08:47,163 WARN L170 areAnnotationChecker]: L1032 has no Hoare annotation [2020-07-11 01:08:47,163 WARN L170 areAnnotationChecker]: L1006 has no Hoare annotation [2020-07-11 01:08:47,163 WARN L170 areAnnotationChecker]: L1028-2 has no Hoare annotation [2020-07-11 01:08:47,163 WARN L170 areAnnotationChecker]: L1028-2 has no Hoare annotation [2020-07-11 01:08:47,163 WARN L170 areAnnotationChecker]: L1028-5 has no Hoare annotation [2020-07-11 01:08:47,163 WARN L170 areAnnotationChecker]: L1028-5 has no Hoare annotation [2020-07-11 01:08:47,163 WARN L170 areAnnotationChecker]: L1043-1 has no Hoare annotation [2020-07-11 01:08:47,164 WARN L170 areAnnotationChecker]: L1045 has no Hoare annotation [2020-07-11 01:08:47,164 WARN L170 areAnnotationChecker]: L1032-1 has no Hoare annotation [2020-07-11 01:08:47,164 WARN L170 areAnnotationChecker]: L1032-1 has no Hoare annotation [2020-07-11 01:08:47,164 WARN L170 areAnnotationChecker]: L1006-1 has no Hoare annotation [2020-07-11 01:08:47,164 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-11 01:08:47,164 WARN L170 areAnnotationChecker]: L1045-1 has no Hoare annotation [2020-07-11 01:08:47,164 WARN L170 areAnnotationChecker]: L1045-1 has no Hoare annotation [2020-07-11 01:08:47,164 WARN L170 areAnnotationChecker]: L1032-2 has no Hoare annotation [2020-07-11 01:08:47,164 WARN L170 areAnnotationChecker]: L1032-4 has no Hoare annotation [2020-07-11 01:08:47,165 WARN L170 areAnnotationChecker]: L1007 has no Hoare annotation [2020-07-11 01:08:47,165 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-11 01:08:47,165 WARN L170 areAnnotationChecker]: L1045-2 has no Hoare annotation [2020-07-11 01:08:47,165 WARN L170 areAnnotationChecker]: L1045-3 has no Hoare annotation [2020-07-11 01:08:47,165 WARN L170 areAnnotationChecker]: L1034 has no Hoare annotation [2020-07-11 01:08:47,165 WARN L170 areAnnotationChecker]: L1038-6 has no Hoare annotation [2020-07-11 01:08:47,165 WARN L170 areAnnotationChecker]: L1038-6 has no Hoare annotation [2020-07-11 01:08:47,165 WARN L170 areAnnotationChecker]: L1007-1 has no Hoare annotation [2020-07-11 01:08:47,165 WARN L170 areAnnotationChecker]: L1047 has no Hoare annotation [2020-07-11 01:08:47,166 WARN L170 areAnnotationChecker]: L1054 has no Hoare annotation [2020-07-11 01:08:47,166 WARN L170 areAnnotationChecker]: L1034-1 has no Hoare annotation [2020-07-11 01:08:47,166 WARN L170 areAnnotationChecker]: L1038 has no Hoare annotation [2020-07-11 01:08:47,166 WARN L170 areAnnotationChecker]: L1038 has no Hoare annotation [2020-07-11 01:08:47,166 WARN L170 areAnnotationChecker]: L1038-7 has no Hoare annotation [2020-07-11 01:08:47,166 WARN L170 areAnnotationChecker]: L1009 has no Hoare annotation [2020-07-11 01:08:47,166 WARN L170 areAnnotationChecker]: L1009 has no Hoare annotation [2020-07-11 01:08:47,166 WARN L170 areAnnotationChecker]: L1047-1 has no Hoare annotation [2020-07-11 01:08:47,166 WARN L170 areAnnotationChecker]: L1054-1 has no Hoare annotation [2020-07-11 01:08:47,167 WARN L170 areAnnotationChecker]: L1034-2 has no Hoare annotation [2020-07-11 01:08:47,167 WARN L170 areAnnotationChecker]: L1038-1 has no Hoare annotation [2020-07-11 01:08:47,167 WARN L170 areAnnotationChecker]: L1038-4 has no Hoare annotation [2020-07-11 01:08:47,167 WARN L170 areAnnotationChecker]: L1039 has no Hoare annotation [2020-07-11 01:08:47,167 WARN L170 areAnnotationChecker]: L1009-1 has no Hoare annotation [2020-07-11 01:08:47,167 WARN L170 areAnnotationChecker]: L1009-2 has no Hoare annotation [2020-07-11 01:08:47,167 WARN L170 areAnnotationChecker]: L1047-2 has no Hoare annotation [2020-07-11 01:08:47,167 WARN L170 areAnnotationChecker]: L1054-2 has no Hoare annotation [2020-07-11 01:08:47,167 WARN L170 areAnnotationChecker]: L1035 has no Hoare annotation [2020-07-11 01:08:47,168 WARN L170 areAnnotationChecker]: L1038-2 has no Hoare annotation [2020-07-11 01:08:47,168 WARN L170 areAnnotationChecker]: L1038-2 has no Hoare annotation [2020-07-11 01:08:47,168 WARN L170 areAnnotationChecker]: L1038-5 has no Hoare annotation [2020-07-11 01:08:47,168 WARN L170 areAnnotationChecker]: L1038-5 has no Hoare annotation [2020-07-11 01:08:47,168 WARN L170 areAnnotationChecker]: L1039-1 has no Hoare annotation [2020-07-11 01:08:47,168 WARN L170 areAnnotationChecker]: L1011 has no Hoare annotation [2020-07-11 01:08:47,168 WARN L170 areAnnotationChecker]: L1015 has no Hoare annotation [2020-07-11 01:08:47,168 WARN L170 areAnnotationChecker]: L1048 has no Hoare annotation [2020-07-11 01:08:47,168 WARN L170 areAnnotationChecker]: L1055 has no Hoare annotation [2020-07-11 01:08:47,169 WARN L170 areAnnotationChecker]: L1035-1 has no Hoare annotation [2020-07-11 01:08:47,169 WARN L170 areAnnotationChecker]: L1015-1 has no Hoare annotation [2020-07-11 01:08:47,169 WARN L170 areAnnotationChecker]: L1048-1 has no Hoare annotation [2020-07-11 01:08:47,169 WARN L170 areAnnotationChecker]: L1055-1 has no Hoare annotation [2020-07-11 01:08:47,169 WARN L170 areAnnotationChecker]: L1035-2 has no Hoare annotation [2020-07-11 01:08:47,169 WARN L170 areAnnotationChecker]: L1016 has no Hoare annotation [2020-07-11 01:08:47,169 WARN L170 areAnnotationChecker]: L1049 has no Hoare annotation [2020-07-11 01:08:47,169 WARN L170 areAnnotationChecker]: L1016-1 has no Hoare annotation [2020-07-11 01:08:47,169 WARN L170 areAnnotationChecker]: L1049-1 has no Hoare annotation [2020-07-11 01:08:47,169 WARN L170 areAnnotationChecker]: L1017 has no Hoare annotation [2020-07-11 01:08:47,170 WARN L170 areAnnotationChecker]: L1050 has no Hoare annotation [2020-07-11 01:08:47,170 WARN L170 areAnnotationChecker]: L1017-1 has no Hoare annotation [2020-07-11 01:08:47,170 WARN L170 areAnnotationChecker]: L1018 has no Hoare annotation [2020-07-11 01:08:47,170 WARN L170 areAnnotationChecker]: L1018-1 has no Hoare annotation [2020-07-11 01:08:47,170 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-11 01:08:47,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 01:08:47 BoogieIcfgContainer [2020-07-11 01:08:47,174 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 01:08:47,177 INFO L168 Benchmark]: Toolchain (without parser) took 6427.34 ms. Allocated memory was 137.4 MB in the beginning and 292.6 MB in the end (delta: 155.2 MB). Free memory was 100.9 MB in the beginning and 205.3 MB in the end (delta: -104.5 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. [2020-07-11 01:08:47,178 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.4 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-11 01:08:47,179 INFO L168 Benchmark]: CACSL2BoogieTranslator took 718.84 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 100.7 MB in the beginning and 166.5 MB in the end (delta: -65.9 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2020-07-11 01:08:47,180 INFO L168 Benchmark]: Boogie Preprocessor took 100.05 ms. Allocated memory is still 201.3 MB. Free memory was 166.5 MB in the beginning and 163.1 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2020-07-11 01:08:47,180 INFO L168 Benchmark]: RCFGBuilder took 798.68 ms. Allocated memory is still 201.3 MB. Free memory was 163.1 MB in the beginning and 97.8 MB in the end (delta: 65.2 MB). Peak memory consumption was 65.2 MB. Max. memory is 7.1 GB. [2020-07-11 01:08:47,181 INFO L168 Benchmark]: TraceAbstraction took 4800.49 ms. Allocated memory was 201.3 MB in the beginning and 292.6 MB in the end (delta: 91.2 MB). Free memory was 97.1 MB in the beginning and 205.3 MB in the end (delta: -108.2 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-11 01:08:47,185 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 137.4 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 718.84 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 100.7 MB in the beginning and 166.5 MB in the end (delta: -65.9 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 100.05 ms. Allocated memory is still 201.3 MB. Free memory was 166.5 MB in the beginning and 163.1 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 798.68 ms. Allocated memory is still 201.3 MB. Free memory was 163.1 MB in the beginning and 97.8 MB in the end (delta: 65.2 MB). Peak memory consumption was 65.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4800.49 ms. Allocated memory was 201.3 MB in the beginning and 292.6 MB in the end (delta: 91.2 MB). Free memory was 97.1 MB in the beginning and 205.3 MB in the end (delta: -108.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: 1038]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L995] SLL* list = malloc(sizeof(SLL)); VAL [list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L996] list->next = ((void*)0) VAL [list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L997] list->colour = BLACK VAL [list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L999] SLL* end = list; VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L1023] end = ((void*)0) VAL [end={0:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L1024] end = list VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L1027] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L1028] EXPR end->colour VAL [end={-1:0}, end->colour=1, list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L1028] COND FALSE !(!(BLACK == end->colour)) VAL [end={-1:0}, end->colour=1, list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L1030] COND TRUE ((void*)0) != end VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L1032] EXPR end->colour VAL [end={-1:0}, end->colour=1, list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L1032] COND FALSE !(RED == end->colour) VAL [end={-1:0}, end->colour=1, list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L1038] EXPR end->next VAL [end={-1:0}, end->next={0:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L1038] COND TRUE !(end->next) VAL [end={-1:0}, end->next={0:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L1038] __VERIFIER_error() VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 92 locations, 3 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 4.6s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 205 SDtfs, 506 SDslu, 206 SDs, 0 SdLazy, 334 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred 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.5s AutomataMinimizationTime, 3 MinimizatonAttempts, 67 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 56 ConstructedInterpolants, 0 QuantifiedInterpolants, 4396 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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...