/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-01-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 01:08:09,611 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 01:08:09,614 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 01:08:09,626 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 01:08:09,627 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 01:08:09,628 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 01:08:09,629 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 01:08:09,631 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 01:08:09,633 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 01:08:09,633 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 01:08:09,634 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 01:08:09,635 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 01:08:09,636 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 01:08:09,637 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 01:08:09,638 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 01:08:09,639 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 01:08:09,640 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 01:08:09,640 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 01:08:09,642 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 01:08:09,644 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 01:08:09,645 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 01:08:09,646 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 01:08:09,648 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 01:08:09,648 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 01:08:09,651 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 01:08:09,651 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 01:08:09,651 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 01:08:09,652 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 01:08:09,652 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 01:08:09,653 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 01:08:09,654 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 01:08:09,654 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 01:08:09,655 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 01:08:09,656 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 01:08:09,657 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 01:08:09,657 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 01:08:09,658 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 01:08:09,658 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 01:08:09,658 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 01:08:09,659 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 01:08:09,660 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 01:08:09,660 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:09,669 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 01:08:09,670 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 01:08:09,671 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 01:08:09,671 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 01:08:09,671 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 01:08:09,671 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 01:08:09,672 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 01:08:09,672 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 01:08:09,672 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 01:08:09,672 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 01:08:09,672 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 01:08:09,672 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 01:08:09,673 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 01:08:09,673 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 01:08:09,673 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 01:08:09,673 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 01:08:09,673 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 01:08:09,674 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 01:08:09,674 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 01:08:09,674 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 01:08:09,674 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 01:08:09,674 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 01:08:09,675 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:09,976 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 01:08:09,991 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 01:08:09,994 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 01:08:09,996 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 01:08:09,996 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 01:08:09,997 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-01-1.i [2020-07-11 01:08:10,073 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/068079a9f/f473057dd085431abb7efcb429699e48/FLAG77f095ff4 [2020-07-11 01:08:10,633 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 01:08:10,634 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i [2020-07-11 01:08:10,650 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/068079a9f/f473057dd085431abb7efcb429699e48/FLAG77f095ff4 [2020-07-11 01:08:10,914 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/068079a9f/f473057dd085431abb7efcb429699e48 [2020-07-11 01:08:10,924 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 01:08:10,926 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 01:08:10,927 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 01:08:10,927 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 01:08:10,931 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 01:08:10,933 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 01:08:10" (1/1) ... [2020-07-11 01:08:10,936 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:10, skipping insertion in model container [2020-07-11 01:08:10,936 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 01:08:10" (1/1) ... [2020-07-11 01:08:10,944 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 01:08:10,986 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 01:08:11,509 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 01:08:11,529 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 01:08:11,600 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 01:08:11,663 INFO L208 MainTranslator]: Completed translation [2020-07-11 01:08:11,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:08:11 WrapperNode [2020-07-11 01:08:11,664 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 01:08:11,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 01:08:11,665 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 01:08:11,665 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 01:08:11,679 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:11" (1/1) ... [2020-07-11 01:08:11,680 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:11" (1/1) ... [2020-07-11 01:08:11,697 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:11" (1/1) ... [2020-07-11 01:08:11,698 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:11" (1/1) ... [2020-07-11 01:08:11,739 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:11" (1/1) ... [2020-07-11 01:08:11,750 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:11" (1/1) ... [2020-07-11 01:08:11,754 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:11" (1/1) ... [2020-07-11 01:08:11,762 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 01:08:11,762 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 01:08:11,763 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 01:08:11,763 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 01:08:11,764 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:08:11" (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:11,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 01:08:11,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 01:08:11,827 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 01:08:11,827 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-11 01:08:11,828 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-11 01:08:11,828 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-11 01:08:11,828 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-11 01:08:11,828 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-11 01:08:11,828 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-11 01:08:11,828 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-11 01:08:11,828 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-11 01:08:11,829 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-11 01:08:11,829 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-11 01:08:11,829 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-11 01:08:11,829 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-11 01:08:11,829 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-11 01:08:11,829 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-11 01:08:11,830 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-11 01:08:11,830 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-11 01:08:11,830 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-11 01:08:11,830 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-11 01:08:11,830 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-11 01:08:11,831 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-11 01:08:11,831 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-11 01:08:11,831 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-11 01:08:11,831 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-11 01:08:11,831 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-11 01:08:11,831 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-11 01:08:11,832 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-11 01:08:11,832 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-11 01:08:11,832 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-11 01:08:11,832 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-11 01:08:11,832 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-11 01:08:11,832 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-11 01:08:11,833 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-11 01:08:11,833 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-11 01:08:11,833 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-11 01:08:11,833 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-11 01:08:11,833 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-11 01:08:11,833 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-11 01:08:11,834 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-11 01:08:11,834 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-11 01:08:11,834 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-11 01:08:11,834 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-11 01:08:11,834 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-11 01:08:11,834 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-11 01:08:11,835 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-11 01:08:11,835 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-11 01:08:11,835 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-11 01:08:11,835 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-11 01:08:11,835 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-11 01:08:11,835 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-11 01:08:11,835 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-11 01:08:11,836 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-11 01:08:11,836 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-11 01:08:11,836 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-11 01:08:11,836 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-11 01:08:11,836 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-11 01:08:11,836 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-11 01:08:11,836 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-11 01:08:11,837 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-11 01:08:11,837 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-11 01:08:11,837 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-11 01:08:11,837 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-11 01:08:11,837 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-11 01:08:11,837 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-11 01:08:11,837 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-11 01:08:11,837 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-11 01:08:11,837 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-11 01:08:11,837 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-11 01:08:11,838 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-11 01:08:11,838 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-11 01:08:11,838 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-11 01:08:11,838 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-11 01:08:11,838 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-11 01:08:11,838 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-11 01:08:11,838 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-11 01:08:11,839 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-11 01:08:11,839 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-11 01:08:11,839 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-11 01:08:11,839 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-11 01:08:11,839 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-11 01:08:11,839 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-11 01:08:11,839 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-11 01:08:11,840 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-11 01:08:11,840 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-11 01:08:11,840 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-11 01:08:11,840 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-11 01:08:11,840 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-11 01:08:11,840 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-11 01:08:11,840 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-11 01:08:11,841 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-11 01:08:11,841 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-11 01:08:11,841 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-11 01:08:11,841 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-11 01:08:11,841 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-11 01:08:11,841 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-11 01:08:11,842 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-11 01:08:11,842 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-11 01:08:11,842 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-11 01:08:11,842 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-11 01:08:11,842 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-11 01:08:11,842 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-11 01:08:11,842 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-11 01:08:11,843 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-11 01:08:11,843 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-11 01:08:11,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 01:08:11,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 01:08:11,843 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 01:08:11,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-11 01:08:11,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-11 01:08:11,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-11 01:08:11,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-11 01:08:11,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 01:08:11,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 01:08:12,838 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 01:08:12,838 INFO L295 CfgBuilder]: Removed 30 assume(true) statements. [2020-07-11 01:08:12,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 01:08:12 BoogieIcfgContainer [2020-07-11 01:08:12,844 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 01:08:12,845 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 01:08:12,845 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 01:08:12,848 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 01:08:12,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 01:08:10" (1/3) ... [2020-07-11 01:08:12,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d4b89b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 01:08:12, skipping insertion in model container [2020-07-11 01:08:12,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:08:11" (2/3) ... [2020-07-11 01:08:12,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d4b89b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 01:08:12, skipping insertion in model container [2020-07-11 01:08:12,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 01:08:12" (3/3) ... [2020-07-11 01:08:12,852 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-01-1.i [2020-07-11 01:08:12,863 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 01:08:12,872 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2020-07-11 01:08:12,886 INFO L251 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2020-07-11 01:08:12,910 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 01:08:12,910 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 01:08:12,910 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 01:08:12,910 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 01:08:12,911 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 01:08:12,911 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 01:08:12,911 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 01:08:12,911 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 01:08:12,934 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states. [2020-07-11 01:08:12,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-11 01:08:12,945 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:08:12,946 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:08:12,947 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:08:12,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:08:12,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1409190174, now seen corresponding path program 1 times [2020-07-11 01:08:12,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:08:12,963 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1006711891] [2020-07-11 01:08:12,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:08:13,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:08:13,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:08:13,248 INFO L280 TraceCheckUtils]: 0: Hoare triple {183#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {174#true} is VALID [2020-07-11 01:08:13,249 INFO L280 TraceCheckUtils]: 1: Hoare triple {174#true} #valid := #valid[0 := 0]; {174#true} is VALID [2020-07-11 01:08:13,250 INFO L280 TraceCheckUtils]: 2: Hoare triple {174#true} assume 0 < #StackHeapBarrier; {174#true} is VALID [2020-07-11 01:08:13,251 INFO L280 TraceCheckUtils]: 3: Hoare triple {174#true} assume true; {174#true} is VALID [2020-07-11 01:08:13,252 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {174#true} {174#true} #414#return; {174#true} is VALID [2020-07-11 01:08:13,256 INFO L263 TraceCheckUtils]: 0: Hoare triple {174#true} call ULTIMATE.init(); {183#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:08:13,257 INFO L280 TraceCheckUtils]: 1: Hoare triple {183#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {174#true} is VALID [2020-07-11 01:08:13,257 INFO L280 TraceCheckUtils]: 2: Hoare triple {174#true} #valid := #valid[0 := 0]; {174#true} is VALID [2020-07-11 01:08:13,257 INFO L280 TraceCheckUtils]: 3: Hoare triple {174#true} assume 0 < #StackHeapBarrier; {174#true} is VALID [2020-07-11 01:08:13,258 INFO L280 TraceCheckUtils]: 4: Hoare triple {174#true} assume true; {174#true} is VALID [2020-07-11 01:08:13,258 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {174#true} {174#true} #414#return; {174#true} is VALID [2020-07-11 01:08:13,258 INFO L263 TraceCheckUtils]: 6: Hoare triple {174#true} call #t~ret28 := main(); {174#true} is VALID [2020-07-11 01:08:13,259 INFO L280 TraceCheckUtils]: 7: Hoare triple {174#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {181#(not (= 0 |main_#t~malloc0.base|))} is VALID [2020-07-11 01:08:13,260 INFO L280 TraceCheckUtils]: 8: Hoare triple {181#(not (= 0 |main_#t~malloc0.base|))} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {182#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:13,261 INFO L280 TraceCheckUtils]: 9: Hoare triple {182#(not (= 0 main_~list~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L993 {182#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:13,262 INFO L280 TraceCheckUtils]: 10: Hoare triple {182#(not (= 0 main_~list~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-1 {182#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:13,264 INFO L280 TraceCheckUtils]: 11: Hoare triple {182#(not (= 0 main_~list~0.base))} assume !(~list~0.base != 0 || ~list~0.offset != 0); {175#false} is VALID [2020-07-11 01:08:13,264 INFO L280 TraceCheckUtils]: 12: Hoare triple {175#false} assume !false; {175#false} is VALID [2020-07-11 01:08:13,266 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:13,267 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1006711891] [2020-07-11 01:08:13,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:08:13,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-11 01:08:13,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955550546] [2020-07-11 01:08:13,280 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-11 01:08:13,282 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:08:13,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 01:08:13,316 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:13,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 01:08:13,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:08:13,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 01:08:13,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-11 01:08:13,329 INFO L87 Difference]: Start difference. First operand 171 states. Second operand 5 states. [2020-07-11 01:08:14,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:14,916 INFO L93 Difference]: Finished difference Result 359 states and 475 transitions. [2020-07-11 01:08:14,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-11 01:08:14,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-11 01:08:14,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:08:14,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 01:08:14,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2020-07-11 01:08:14,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 01:08:14,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2020-07-11 01:08:14,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2020-07-11 01:08:15,630 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 475 edges. 475 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:15,662 INFO L225 Difference]: With dead ends: 359 [2020-07-11 01:08:15,663 INFO L226 Difference]: Without dead ends: 194 [2020-07-11 01:08:15,672 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-11 01:08:15,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-07-11 01:08:16,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 164. [2020-07-11 01:08:16,017 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:08:16,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand 164 states. [2020-07-11 01:08:16,018 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand 164 states. [2020-07-11 01:08:16,018 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 164 states. [2020-07-11 01:08:16,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:16,032 INFO L93 Difference]: Finished difference Result 194 states and 204 transitions. [2020-07-11 01:08:16,032 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 204 transitions. [2020-07-11 01:08:16,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:08:16,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:08:16,035 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 194 states. [2020-07-11 01:08:16,035 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 194 states. [2020-07-11 01:08:16,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:16,047 INFO L93 Difference]: Finished difference Result 194 states and 204 transitions. [2020-07-11 01:08:16,047 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 204 transitions. [2020-07-11 01:08:16,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:08:16,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:08:16,050 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:08:16,050 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:08:16,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-07-11 01:08:16,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 173 transitions. [2020-07-11 01:08:16,060 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 173 transitions. Word has length 13 [2020-07-11 01:08:16,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:08:16,060 INFO L479 AbstractCegarLoop]: Abstraction has 164 states and 173 transitions. [2020-07-11 01:08:16,060 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 01:08:16,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 164 states and 173 transitions. [2020-07-11 01:08:16,322 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:16,323 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 173 transitions. [2020-07-11 01:08:16,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-11 01:08:16,324 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:08:16,324 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] [2020-07-11 01:08:16,324 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 01:08:16,325 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:08:16,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:08:16,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1469410252, now seen corresponding path program 1 times [2020-07-11 01:08:16,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:08:16,326 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [517193562] [2020-07-11 01:08:16,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:08:16,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:08:16,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:08:16,403 INFO L280 TraceCheckUtils]: 0: Hoare triple {1630#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1622#true} is VALID [2020-07-11 01:08:16,404 INFO L280 TraceCheckUtils]: 1: Hoare triple {1622#true} #valid := #valid[0 := 0]; {1622#true} is VALID [2020-07-11 01:08:16,404 INFO L280 TraceCheckUtils]: 2: Hoare triple {1622#true} assume 0 < #StackHeapBarrier; {1622#true} is VALID [2020-07-11 01:08:16,404 INFO L280 TraceCheckUtils]: 3: Hoare triple {1622#true} assume true; {1622#true} is VALID [2020-07-11 01:08:16,405 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1622#true} {1622#true} #414#return; {1622#true} is VALID [2020-07-11 01:08:16,406 INFO L263 TraceCheckUtils]: 0: Hoare triple {1622#true} call ULTIMATE.init(); {1630#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:08:16,406 INFO L280 TraceCheckUtils]: 1: Hoare triple {1630#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1622#true} is VALID [2020-07-11 01:08:16,407 INFO L280 TraceCheckUtils]: 2: Hoare triple {1622#true} #valid := #valid[0 := 0]; {1622#true} is VALID [2020-07-11 01:08:16,407 INFO L280 TraceCheckUtils]: 3: Hoare triple {1622#true} assume 0 < #StackHeapBarrier; {1622#true} is VALID [2020-07-11 01:08:16,407 INFO L280 TraceCheckUtils]: 4: Hoare triple {1622#true} assume true; {1622#true} is VALID [2020-07-11 01:08:16,408 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1622#true} {1622#true} #414#return; {1622#true} is VALID [2020-07-11 01:08:16,408 INFO L263 TraceCheckUtils]: 6: Hoare triple {1622#true} call #t~ret28 := main(); {1622#true} is VALID [2020-07-11 01:08:16,408 INFO L280 TraceCheckUtils]: 7: Hoare triple {1622#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {1622#true} is VALID [2020-07-11 01:08:16,408 INFO L280 TraceCheckUtils]: 8: Hoare triple {1622#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {1622#true} is VALID [2020-07-11 01:08:16,409 INFO L280 TraceCheckUtils]: 9: Hoare triple {1622#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L993 {1622#true} is VALID [2020-07-11 01:08:16,409 INFO L280 TraceCheckUtils]: 10: Hoare triple {1622#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-1 {1622#true} is VALID [2020-07-11 01:08:16,409 INFO L280 TraceCheckUtils]: 11: Hoare triple {1622#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {1622#true} is VALID [2020-07-11 01:08:16,410 INFO L280 TraceCheckUtils]: 12: Hoare triple {1622#true} goto; {1622#true} is VALID [2020-07-11 01:08:16,410 INFO L280 TraceCheckUtils]: 13: Hoare triple {1622#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1622#true} is VALID [2020-07-11 01:08:16,410 INFO L280 TraceCheckUtils]: 14: Hoare triple {1622#true} assume 0 != #t~nondet1; {1622#true} is VALID [2020-07-11 01:08:16,411 INFO L280 TraceCheckUtils]: 15: Hoare triple {1622#true} havoc #t~nondet1; {1622#true} is VALID [2020-07-11 01:08:16,411 INFO L280 TraceCheckUtils]: 16: Hoare triple {1622#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-7 {1622#true} is VALID [2020-07-11 01:08:16,411 INFO L280 TraceCheckUtils]: 17: Hoare triple {1622#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-34 {1622#true} is VALID [2020-07-11 01:08:16,411 INFO L280 TraceCheckUtils]: 18: Hoare triple {1622#true} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {1622#true} is VALID [2020-07-11 01:08:16,412 INFO L280 TraceCheckUtils]: 19: Hoare triple {1622#true} assume #t~short7; {1629#|main_#t~short7|} is VALID [2020-07-11 01:08:16,413 INFO L280 TraceCheckUtils]: 20: Hoare triple {1629#|main_#t~short7|} assume !#t~short7; {1623#false} is VALID [2020-07-11 01:08:16,413 INFO L280 TraceCheckUtils]: 21: Hoare triple {1623#false} havoc #t~mem5.base, #t~mem5.offset; {1623#false} is VALID [2020-07-11 01:08:16,414 INFO L280 TraceCheckUtils]: 22: Hoare triple {1623#false} havoc #t~mem6.base, #t~mem6.offset; {1623#false} is VALID [2020-07-11 01:08:16,414 INFO L280 TraceCheckUtils]: 23: Hoare triple {1623#false} havoc #t~short7; {1623#false} is VALID [2020-07-11 01:08:16,414 INFO L280 TraceCheckUtils]: 24: Hoare triple {1623#false} assume !false; {1623#false} is VALID [2020-07-11 01:08:16,416 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:16,416 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [517193562] [2020-07-11 01:08:16,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:08:16,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-11 01:08:16,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221223798] [2020-07-11 01:08:16,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-07-11 01:08:16,419 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:08:16,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-11 01:08:16,467 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:16,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-11 01:08:16,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:08:16,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-11 01:08:16,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-11 01:08:16,468 INFO L87 Difference]: Start difference. First operand 164 states and 173 transitions. Second operand 4 states. [2020-07-11 01:08:17,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:17,471 INFO L93 Difference]: Finished difference Result 170 states and 179 transitions. [2020-07-11 01:08:17,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-11 01:08:17,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-07-11 01:08:17,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:08:17,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 01:08:17,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 179 transitions. [2020-07-11 01:08:17,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 01:08:17,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 179 transitions. [2020-07-11 01:08:17,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 179 transitions. [2020-07-11 01:08:17,757 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:17,763 INFO L225 Difference]: With dead ends: 170 [2020-07-11 01:08:17,763 INFO L226 Difference]: Without dead ends: 165 [2020-07-11 01:08:17,764 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-11 01:08:17,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-07-11 01:08:18,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2020-07-11 01:08:18,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:08:18,125 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand 165 states. [2020-07-11 01:08:18,125 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 165 states. [2020-07-11 01:08:18,125 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 165 states. [2020-07-11 01:08:18,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:18,132 INFO L93 Difference]: Finished difference Result 165 states and 174 transitions. [2020-07-11 01:08:18,132 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 174 transitions. [2020-07-11 01:08:18,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:08:18,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:08:18,134 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 165 states. [2020-07-11 01:08:18,134 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 165 states. [2020-07-11 01:08:18,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:18,141 INFO L93 Difference]: Finished difference Result 165 states and 174 transitions. [2020-07-11 01:08:18,141 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 174 transitions. [2020-07-11 01:08:18,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:08:18,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:08:18,143 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:08:18,143 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:08:18,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-07-11 01:08:18,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 174 transitions. [2020-07-11 01:08:18,149 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 174 transitions. Word has length 25 [2020-07-11 01:08:18,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:08:18,149 INFO L479 AbstractCegarLoop]: Abstraction has 165 states and 174 transitions. [2020-07-11 01:08:18,150 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-11 01:08:18,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 165 states and 174 transitions. [2020-07-11 01:08:18,423 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:18,423 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 174 transitions. [2020-07-11 01:08:18,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-11 01:08:18,424 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:08:18,425 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:08:18,425 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 01:08:18,425 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:08:18,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:08:18,426 INFO L82 PathProgramCache]: Analyzing trace with hash -155961871, now seen corresponding path program 1 times [2020-07-11 01:08:18,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:08:18,426 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1802156789] [2020-07-11 01:08:18,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:08:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:08:18,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:08:18,612 INFO L280 TraceCheckUtils]: 0: Hoare triple {2645#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2633#true} is VALID [2020-07-11 01:08:18,613 INFO L280 TraceCheckUtils]: 1: Hoare triple {2633#true} #valid := #valid[0 := 0]; {2633#true} is VALID [2020-07-11 01:08:18,613 INFO L280 TraceCheckUtils]: 2: Hoare triple {2633#true} assume 0 < #StackHeapBarrier; {2633#true} is VALID [2020-07-11 01:08:18,613 INFO L280 TraceCheckUtils]: 3: Hoare triple {2633#true} assume true; {2633#true} is VALID [2020-07-11 01:08:18,614 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2633#true} {2633#true} #414#return; {2633#true} is VALID [2020-07-11 01:08:18,615 INFO L263 TraceCheckUtils]: 0: Hoare triple {2633#true} call ULTIMATE.init(); {2645#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:08:18,615 INFO L280 TraceCheckUtils]: 1: Hoare triple {2645#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2633#true} is VALID [2020-07-11 01:08:18,616 INFO L280 TraceCheckUtils]: 2: Hoare triple {2633#true} #valid := #valid[0 := 0]; {2633#true} is VALID [2020-07-11 01:08:18,616 INFO L280 TraceCheckUtils]: 3: Hoare triple {2633#true} assume 0 < #StackHeapBarrier; {2633#true} is VALID [2020-07-11 01:08:18,616 INFO L280 TraceCheckUtils]: 4: Hoare triple {2633#true} assume true; {2633#true} is VALID [2020-07-11 01:08:18,616 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2633#true} {2633#true} #414#return; {2633#true} is VALID [2020-07-11 01:08:18,617 INFO L263 TraceCheckUtils]: 6: Hoare triple {2633#true} call #t~ret28 := main(); {2633#true} is VALID [2020-07-11 01:08:18,617 INFO L280 TraceCheckUtils]: 7: Hoare triple {2633#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {2633#true} is VALID [2020-07-11 01:08:18,617 INFO L280 TraceCheckUtils]: 8: Hoare triple {2633#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {2633#true} is VALID [2020-07-11 01:08:18,618 INFO L280 TraceCheckUtils]: 9: Hoare triple {2633#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L993 {2633#true} is VALID [2020-07-11 01:08:18,618 INFO L280 TraceCheckUtils]: 10: Hoare triple {2633#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-1 {2633#true} is VALID [2020-07-11 01:08:18,618 INFO L280 TraceCheckUtils]: 11: Hoare triple {2633#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {2633#true} is VALID [2020-07-11 01:08:18,618 INFO L280 TraceCheckUtils]: 12: Hoare triple {2633#true} goto; {2633#true} is VALID [2020-07-11 01:08:18,619 INFO L280 TraceCheckUtils]: 13: Hoare triple {2633#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2633#true} is VALID [2020-07-11 01:08:18,619 INFO L280 TraceCheckUtils]: 14: Hoare triple {2633#true} assume 0 != #t~nondet1; {2633#true} is VALID [2020-07-11 01:08:18,619 INFO L280 TraceCheckUtils]: 15: Hoare triple {2633#true} havoc #t~nondet1; {2633#true} is VALID [2020-07-11 01:08:18,620 INFO L280 TraceCheckUtils]: 16: Hoare triple {2633#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-7 {2633#true} is VALID [2020-07-11 01:08:18,620 INFO L280 TraceCheckUtils]: 17: Hoare triple {2633#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-34 {2640#(and (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)) |main_#t~mem5.base|))} is VALID [2020-07-11 01:08:18,624 INFO L280 TraceCheckUtils]: 18: Hoare triple {2640#(and (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)) |main_#t~mem5.base|))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {2641#(or |main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))))} is VALID [2020-07-11 01:08:18,625 INFO L280 TraceCheckUtils]: 19: Hoare triple {2641#(or |main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))))} assume !#t~short7; {2642#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:08:18,626 INFO L280 TraceCheckUtils]: 20: Hoare triple {2642#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-22 {2643#(and (= 0 |main_#t~mem6.offset|) (= 0 |main_#t~mem6.base|))} is VALID [2020-07-11 01:08:18,627 INFO L280 TraceCheckUtils]: 21: Hoare triple {2643#(and (= 0 |main_#t~mem6.offset|) (= 0 |main_#t~mem6.base|))} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {2644#|main_#t~short7|} is VALID [2020-07-11 01:08:18,628 INFO L280 TraceCheckUtils]: 22: Hoare triple {2644#|main_#t~short7|} assume !#t~short7; {2634#false} is VALID [2020-07-11 01:08:18,628 INFO L280 TraceCheckUtils]: 23: Hoare triple {2634#false} havoc #t~mem5.base, #t~mem5.offset; {2634#false} is VALID [2020-07-11 01:08:18,628 INFO L280 TraceCheckUtils]: 24: Hoare triple {2634#false} havoc #t~mem6.base, #t~mem6.offset; {2634#false} is VALID [2020-07-11 01:08:18,629 INFO L280 TraceCheckUtils]: 25: Hoare triple {2634#false} havoc #t~short7; {2634#false} is VALID [2020-07-11 01:08:18,629 INFO L280 TraceCheckUtils]: 26: Hoare triple {2634#false} assume !false; {2634#false} is VALID [2020-07-11 01:08:18,631 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:18,631 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1802156789] [2020-07-11 01:08:18,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:08:18,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-11 01:08:18,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746477116] [2020-07-11 01:08:18,632 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-07-11 01:08:18,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:08:18,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-11 01:08:18,680 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:18,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-11 01:08:18,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:08:18,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-11 01:08:18,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-11 01:08:18,682 INFO L87 Difference]: Start difference. First operand 165 states and 174 transitions. Second operand 8 states. [2020-07-11 01:08:21,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:21,161 INFO L93 Difference]: Finished difference Result 255 states and 270 transitions. [2020-07-11 01:08:21,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-11 01:08:21,162 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-07-11 01:08:21,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:08:21,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 01:08:21,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 270 transitions. [2020-07-11 01:08:21,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 01:08:21,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 270 transitions. [2020-07-11 01:08:21,172 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 270 transitions. [2020-07-11 01:08:21,564 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 270 edges. 270 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:21,571 INFO L225 Difference]: With dead ends: 255 [2020-07-11 01:08:21,571 INFO L226 Difference]: Without dead ends: 250 [2020-07-11 01:08:21,572 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2020-07-11 01:08:21,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2020-07-11 01:08:22,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 159. [2020-07-11 01:08:22,047 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:08:22,047 INFO L82 GeneralOperation]: Start isEquivalent. First operand 250 states. Second operand 159 states. [2020-07-11 01:08:22,047 INFO L74 IsIncluded]: Start isIncluded. First operand 250 states. Second operand 159 states. [2020-07-11 01:08:22,048 INFO L87 Difference]: Start difference. First operand 250 states. Second operand 159 states. [2020-07-11 01:08:22,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:22,057 INFO L93 Difference]: Finished difference Result 250 states and 265 transitions. [2020-07-11 01:08:22,058 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 265 transitions. [2020-07-11 01:08:22,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:08:22,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:08:22,059 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 250 states. [2020-07-11 01:08:22,059 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 250 states. [2020-07-11 01:08:22,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:22,068 INFO L93 Difference]: Finished difference Result 250 states and 265 transitions. [2020-07-11 01:08:22,068 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 265 transitions. [2020-07-11 01:08:22,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:08:22,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:08:22,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:08:22,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:08:22,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-07-11 01:08:22,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 168 transitions. [2020-07-11 01:08:22,075 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 168 transitions. Word has length 27 [2020-07-11 01:08:22,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:08:22,075 INFO L479 AbstractCegarLoop]: Abstraction has 159 states and 168 transitions. [2020-07-11 01:08:22,075 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-11 01:08:22,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 159 states and 168 transitions. [2020-07-11 01:08:22,362 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:22,362 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 168 transitions. [2020-07-11 01:08:22,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-11 01:08:22,363 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:08:22,363 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:08:22,364 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 01:08:22,366 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:08:22,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:08:22,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1500955686, now seen corresponding path program 1 times [2020-07-11 01:08:22,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:08:22,367 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2133090369] [2020-07-11 01:08:22,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:08:22,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:08:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:08:22,507 INFO L280 TraceCheckUtils]: 0: Hoare triple {4002#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3992#true} is VALID [2020-07-11 01:08:22,507 INFO L280 TraceCheckUtils]: 1: Hoare triple {3992#true} #valid := #valid[0 := 0]; {3992#true} is VALID [2020-07-11 01:08:22,507 INFO L280 TraceCheckUtils]: 2: Hoare triple {3992#true} assume 0 < #StackHeapBarrier; {3992#true} is VALID [2020-07-11 01:08:22,508 INFO L280 TraceCheckUtils]: 3: Hoare triple {3992#true} assume true; {3992#true} is VALID [2020-07-11 01:08:22,508 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3992#true} {3992#true} #414#return; {3992#true} is VALID [2020-07-11 01:08:22,509 INFO L263 TraceCheckUtils]: 0: Hoare triple {3992#true} call ULTIMATE.init(); {4002#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:08:22,509 INFO L280 TraceCheckUtils]: 1: Hoare triple {4002#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3992#true} is VALID [2020-07-11 01:08:22,509 INFO L280 TraceCheckUtils]: 2: Hoare triple {3992#true} #valid := #valid[0 := 0]; {3992#true} is VALID [2020-07-11 01:08:22,509 INFO L280 TraceCheckUtils]: 3: Hoare triple {3992#true} assume 0 < #StackHeapBarrier; {3992#true} is VALID [2020-07-11 01:08:22,510 INFO L280 TraceCheckUtils]: 4: Hoare triple {3992#true} assume true; {3992#true} is VALID [2020-07-11 01:08:22,510 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3992#true} {3992#true} #414#return; {3992#true} is VALID [2020-07-11 01:08:22,510 INFO L263 TraceCheckUtils]: 6: Hoare triple {3992#true} call #t~ret28 := main(); {3992#true} is VALID [2020-07-11 01:08:22,510 INFO L280 TraceCheckUtils]: 7: Hoare triple {3992#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {3992#true} is VALID [2020-07-11 01:08:22,510 INFO L280 TraceCheckUtils]: 8: Hoare triple {3992#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {3992#true} is VALID [2020-07-11 01:08:22,511 INFO L280 TraceCheckUtils]: 9: Hoare triple {3992#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L993 {3992#true} is VALID [2020-07-11 01:08:22,511 INFO L280 TraceCheckUtils]: 10: Hoare triple {3992#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-1 {3992#true} is VALID [2020-07-11 01:08:22,511 INFO L280 TraceCheckUtils]: 11: Hoare triple {3992#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {3992#true} is VALID [2020-07-11 01:08:22,512 INFO L280 TraceCheckUtils]: 12: Hoare triple {3992#true} goto; {3992#true} is VALID [2020-07-11 01:08:22,512 INFO L280 TraceCheckUtils]: 13: Hoare triple {3992#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3992#true} is VALID [2020-07-11 01:08:22,512 INFO L280 TraceCheckUtils]: 14: Hoare triple {3992#true} assume 0 != #t~nondet1; {3992#true} is VALID [2020-07-11 01:08:22,512 INFO L280 TraceCheckUtils]: 15: Hoare triple {3992#true} havoc #t~nondet1; {3992#true} is VALID [2020-07-11 01:08:22,514 INFO L280 TraceCheckUtils]: 16: Hoare triple {3992#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-7 {3999#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:08:22,515 INFO L280 TraceCheckUtils]: 17: Hoare triple {3999#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-34 {4000#(and (= 0 |main_#t~mem5.offset|) (= 0 |main_#t~mem5.base|))} is VALID [2020-07-11 01:08:22,515 INFO L280 TraceCheckUtils]: 18: Hoare triple {4000#(and (= 0 |main_#t~mem5.offset|) (= 0 |main_#t~mem5.base|))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {4001#(not |main_#t~short7|)} is VALID [2020-07-11 01:08:22,516 INFO L280 TraceCheckUtils]: 19: Hoare triple {4001#(not |main_#t~short7|)} assume #t~short7; {3993#false} is VALID [2020-07-11 01:08:22,516 INFO L280 TraceCheckUtils]: 20: Hoare triple {3993#false} assume !!#t~short7; {3993#false} is VALID [2020-07-11 01:08:22,516 INFO L280 TraceCheckUtils]: 21: Hoare triple {3993#false} havoc #t~mem5.base, #t~mem5.offset; {3993#false} is VALID [2020-07-11 01:08:22,517 INFO L280 TraceCheckUtils]: 22: Hoare triple {3993#false} havoc #t~mem6.base, #t~mem6.offset; {3993#false} is VALID [2020-07-11 01:08:22,517 INFO L280 TraceCheckUtils]: 23: Hoare triple {3993#false} havoc #t~short7; {3993#false} is VALID [2020-07-11 01:08:22,518 INFO L280 TraceCheckUtils]: 24: Hoare triple {3993#false} goto; {3993#false} is VALID [2020-07-11 01:08:22,518 INFO L280 TraceCheckUtils]: 25: Hoare triple {3993#false} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {3993#false} is VALID [2020-07-11 01:08:22,519 INFO L280 TraceCheckUtils]: 26: Hoare triple {3993#false} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {3993#false} is VALID [2020-07-11 01:08:22,519 INFO L280 TraceCheckUtils]: 27: Hoare triple {3993#false} assume !(0 != #t~nondet8); {3993#false} is VALID [2020-07-11 01:08:22,519 INFO L280 TraceCheckUtils]: 28: Hoare triple {3993#false} havoc #t~nondet8; {3993#false} is VALID [2020-07-11 01:08:22,520 INFO L280 TraceCheckUtils]: 29: Hoare triple {3993#false} ~end~0.base, ~end~0.offset := 0, 0; {3993#false} is VALID [2020-07-11 01:08:22,520 INFO L280 TraceCheckUtils]: 30: Hoare triple {3993#false} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {3993#false} is VALID [2020-07-11 01:08:22,520 INFO L280 TraceCheckUtils]: 31: Hoare triple {3993#false} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {3993#false} is VALID [2020-07-11 01:08:22,520 INFO L280 TraceCheckUtils]: 32: Hoare triple {3993#false} assume !false; {3993#false} is VALID [2020-07-11 01:08:22,522 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:22,522 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2133090369] [2020-07-11 01:08:22,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:08:22,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-11 01:08:22,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970621551] [2020-07-11 01:08:22,524 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2020-07-11 01:08:22,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:08:22,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 01:08:22,569 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:22,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 01:08:22,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:08:22,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 01:08:22,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-11 01:08:22,571 INFO L87 Difference]: Start difference. First operand 159 states and 168 transitions. Second operand 6 states. [2020-07-11 01:08:24,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:24,672 INFO L93 Difference]: Finished difference Result 377 states and 399 transitions. [2020-07-11 01:08:24,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-11 01:08:24,672 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2020-07-11 01:08:24,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:08:24,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 01:08:24,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 399 transitions. [2020-07-11 01:08:24,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 01:08:24,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 399 transitions. [2020-07-11 01:08:24,683 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 399 transitions. [2020-07-11 01:08:25,208 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 399 edges. 399 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:25,215 INFO L225 Difference]: With dead ends: 377 [2020-07-11 01:08:25,215 INFO L226 Difference]: Without dead ends: 249 [2020-07-11 01:08:25,216 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:25,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2020-07-11 01:08:25,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 162. [2020-07-11 01:08:25,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:08:25,654 INFO L82 GeneralOperation]: Start isEquivalent. First operand 249 states. Second operand 162 states. [2020-07-11 01:08:25,654 INFO L74 IsIncluded]: Start isIncluded. First operand 249 states. Second operand 162 states. [2020-07-11 01:08:25,654 INFO L87 Difference]: Start difference. First operand 249 states. Second operand 162 states. [2020-07-11 01:08:25,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:25,665 INFO L93 Difference]: Finished difference Result 249 states and 263 transitions. [2020-07-11 01:08:25,665 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 263 transitions. [2020-07-11 01:08:25,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:08:25,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:08:25,667 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 249 states. [2020-07-11 01:08:25,667 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 249 states. [2020-07-11 01:08:25,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:25,679 INFO L93 Difference]: Finished difference Result 249 states and 263 transitions. [2020-07-11 01:08:25,679 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 263 transitions. [2020-07-11 01:08:25,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:08:25,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:08:25,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:08:25,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:08:25,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-07-11 01:08:25,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 171 transitions. [2020-07-11 01:08:25,686 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 171 transitions. Word has length 33 [2020-07-11 01:08:25,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:08:25,689 INFO L479 AbstractCegarLoop]: Abstraction has 162 states and 171 transitions. [2020-07-11 01:08:25,689 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 01:08:25,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 162 states and 171 transitions. [2020-07-11 01:08:25,970 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:25,970 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 171 transitions. [2020-07-11 01:08:25,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-11 01:08:25,971 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:08:25,971 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:08:25,972 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 01:08:25,972 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:08:25,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:08:25,972 INFO L82 PathProgramCache]: Analyzing trace with hash -820684573, now seen corresponding path program 1 times [2020-07-11 01:08:25,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:08:25,973 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1512727865] [2020-07-11 01:08:25,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:08:26,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:08:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:08:26,141 INFO L280 TraceCheckUtils]: 0: Hoare triple {5595#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {5585#true} is VALID [2020-07-11 01:08:26,141 INFO L280 TraceCheckUtils]: 1: Hoare triple {5585#true} #valid := #valid[0 := 0]; {5585#true} is VALID [2020-07-11 01:08:26,141 INFO L280 TraceCheckUtils]: 2: Hoare triple {5585#true} assume 0 < #StackHeapBarrier; {5585#true} is VALID [2020-07-11 01:08:26,142 INFO L280 TraceCheckUtils]: 3: Hoare triple {5585#true} assume true; {5585#true} is VALID [2020-07-11 01:08:26,142 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {5585#true} {5585#true} #414#return; {5585#true} is VALID [2020-07-11 01:08:26,144 INFO L263 TraceCheckUtils]: 0: Hoare triple {5585#true} call ULTIMATE.init(); {5595#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:08:26,144 INFO L280 TraceCheckUtils]: 1: Hoare triple {5595#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {5585#true} is VALID [2020-07-11 01:08:26,145 INFO L280 TraceCheckUtils]: 2: Hoare triple {5585#true} #valid := #valid[0 := 0]; {5585#true} is VALID [2020-07-11 01:08:26,145 INFO L280 TraceCheckUtils]: 3: Hoare triple {5585#true} assume 0 < #StackHeapBarrier; {5585#true} is VALID [2020-07-11 01:08:26,145 INFO L280 TraceCheckUtils]: 4: Hoare triple {5585#true} assume true; {5585#true} is VALID [2020-07-11 01:08:26,145 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {5585#true} {5585#true} #414#return; {5585#true} is VALID [2020-07-11 01:08:26,146 INFO L263 TraceCheckUtils]: 6: Hoare triple {5585#true} call #t~ret28 := main(); {5585#true} is VALID [2020-07-11 01:08:26,146 INFO L280 TraceCheckUtils]: 7: Hoare triple {5585#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {5592#(not (= 0 |main_#t~malloc0.base|))} is VALID [2020-07-11 01:08:26,147 INFO L280 TraceCheckUtils]: 8: Hoare triple {5592#(not (= 0 |main_#t~malloc0.base|))} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {5593#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:26,148 INFO L280 TraceCheckUtils]: 9: Hoare triple {5593#(not (= 0 main_~list~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L993 {5593#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:26,149 INFO L280 TraceCheckUtils]: 10: Hoare triple {5593#(not (= 0 main_~list~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-1 {5593#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:26,150 INFO L280 TraceCheckUtils]: 11: Hoare triple {5593#(not (= 0 main_~list~0.base))} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {5593#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:26,151 INFO L280 TraceCheckUtils]: 12: Hoare triple {5593#(not (= 0 main_~list~0.base))} goto; {5593#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:26,152 INFO L280 TraceCheckUtils]: 13: Hoare triple {5593#(not (= 0 main_~list~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {5593#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:26,153 INFO L280 TraceCheckUtils]: 14: Hoare triple {5593#(not (= 0 main_~list~0.base))} assume 0 != #t~nondet1; {5593#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:26,154 INFO L280 TraceCheckUtils]: 15: Hoare triple {5593#(not (= 0 main_~list~0.base))} havoc #t~nondet1; {5593#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:26,155 INFO L280 TraceCheckUtils]: 16: Hoare triple {5593#(not (= 0 main_~list~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-7 {5593#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:26,156 INFO L280 TraceCheckUtils]: 17: Hoare triple {5593#(not (= 0 main_~list~0.base))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-34 {5593#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:26,157 INFO L280 TraceCheckUtils]: 18: Hoare triple {5593#(not (= 0 main_~list~0.base))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {5593#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:26,158 INFO L280 TraceCheckUtils]: 19: Hoare triple {5593#(not (= 0 main_~list~0.base))} assume !#t~short7; {5593#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:26,159 INFO L280 TraceCheckUtils]: 20: Hoare triple {5593#(not (= 0 main_~list~0.base))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-22 {5593#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:26,161 INFO L280 TraceCheckUtils]: 21: Hoare triple {5593#(not (= 0 main_~list~0.base))} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {5593#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:26,162 INFO L280 TraceCheckUtils]: 22: Hoare triple {5593#(not (= 0 main_~list~0.base))} assume !!#t~short7; {5593#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:26,164 INFO L280 TraceCheckUtils]: 23: Hoare triple {5593#(not (= 0 main_~list~0.base))} havoc #t~mem5.base, #t~mem5.offset; {5593#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:26,165 INFO L280 TraceCheckUtils]: 24: Hoare triple {5593#(not (= 0 main_~list~0.base))} havoc #t~mem6.base, #t~mem6.offset; {5593#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:26,166 INFO L280 TraceCheckUtils]: 25: Hoare triple {5593#(not (= 0 main_~list~0.base))} havoc #t~short7; {5593#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:26,167 INFO L280 TraceCheckUtils]: 26: Hoare triple {5593#(not (= 0 main_~list~0.base))} goto; {5593#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:26,167 INFO L280 TraceCheckUtils]: 27: Hoare triple {5593#(not (= 0 main_~list~0.base))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {5593#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:26,168 INFO L280 TraceCheckUtils]: 28: Hoare triple {5593#(not (= 0 main_~list~0.base))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {5593#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:26,169 INFO L280 TraceCheckUtils]: 29: Hoare triple {5593#(not (= 0 main_~list~0.base))} assume !(0 != #t~nondet8); {5593#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:26,169 INFO L280 TraceCheckUtils]: 30: Hoare triple {5593#(not (= 0 main_~list~0.base))} havoc #t~nondet8; {5593#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:26,170 INFO L280 TraceCheckUtils]: 31: Hoare triple {5593#(not (= 0 main_~list~0.base))} ~end~0.base, ~end~0.offset := 0, 0; {5593#(not (= 0 main_~list~0.base))} is VALID [2020-07-11 01:08:26,171 INFO L280 TraceCheckUtils]: 32: Hoare triple {5593#(not (= 0 main_~list~0.base))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {5594#(not (= 0 main_~end~0.base))} is VALID [2020-07-11 01:08:26,172 INFO L280 TraceCheckUtils]: 33: Hoare triple {5594#(not (= 0 main_~end~0.base))} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {5586#false} is VALID [2020-07-11 01:08:26,172 INFO L280 TraceCheckUtils]: 34: Hoare triple {5586#false} assume !false; {5586#false} is VALID [2020-07-11 01:08:26,174 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:26,174 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1512727865] [2020-07-11 01:08:26,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:08:26,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-11 01:08:26,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305487798] [2020-07-11 01:08:26,175 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2020-07-11 01:08:26,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:08:26,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 01:08:26,218 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:26,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 01:08:26,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:08:26,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 01:08:26,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-11 01:08:26,219 INFO L87 Difference]: Start difference. First operand 162 states and 171 transitions. Second operand 6 states. [2020-07-11 01:08:28,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:28,095 INFO L93 Difference]: Finished difference Result 270 states and 285 transitions. [2020-07-11 01:08:28,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 01:08:28,096 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2020-07-11 01:08:28,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:08:28,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 01:08:28,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 282 transitions. [2020-07-11 01:08:28,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 01:08:28,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 282 transitions. [2020-07-11 01:08:28,104 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 282 transitions. [2020-07-11 01:08:28,517 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 282 edges. 282 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:28,523 INFO L225 Difference]: With dead ends: 270 [2020-07-11 01:08:28,523 INFO L226 Difference]: Without dead ends: 238 [2020-07-11 01:08:28,524 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:28,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-07-11 01:08:29,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 161. [2020-07-11 01:08:29,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:08:29,007 INFO L82 GeneralOperation]: Start isEquivalent. First operand 238 states. Second operand 161 states. [2020-07-11 01:08:29,007 INFO L74 IsIncluded]: Start isIncluded. First operand 238 states. Second operand 161 states. [2020-07-11 01:08:29,007 INFO L87 Difference]: Start difference. First operand 238 states. Second operand 161 states. [2020-07-11 01:08:29,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:29,024 INFO L93 Difference]: Finished difference Result 238 states and 251 transitions. [2020-07-11 01:08:29,025 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 251 transitions. [2020-07-11 01:08:29,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:08:29,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:08:29,026 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand 238 states. [2020-07-11 01:08:29,026 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 238 states. [2020-07-11 01:08:29,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:29,033 INFO L93 Difference]: Finished difference Result 238 states and 251 transitions. [2020-07-11 01:08:29,033 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 251 transitions. [2020-07-11 01:08:29,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:08:29,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:08:29,035 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:08:29,035 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:08:29,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2020-07-11 01:08:29,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 170 transitions. [2020-07-11 01:08:29,039 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 170 transitions. Word has length 35 [2020-07-11 01:08:29,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:08:29,039 INFO L479 AbstractCegarLoop]: Abstraction has 161 states and 170 transitions. [2020-07-11 01:08:29,040 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 01:08:29,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 161 states and 170 transitions. [2020-07-11 01:08:29,360 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:29,360 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 170 transitions. [2020-07-11 01:08:29,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-11 01:08:29,361 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:08:29,361 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:08:29,362 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-11 01:08:29,362 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:08:29,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:08:29,364 INFO L82 PathProgramCache]: Analyzing trace with hash -2091807586, now seen corresponding path program 1 times [2020-07-11 01:08:29,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:08:29,364 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [958785343] [2020-07-11 01:08:29,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:08:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:08:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:08:29,628 INFO L280 TraceCheckUtils]: 0: Hoare triple {6956#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {6940#true} is VALID [2020-07-11 01:08:29,628 INFO L280 TraceCheckUtils]: 1: Hoare triple {6940#true} #valid := #valid[0 := 0]; {6940#true} is VALID [2020-07-11 01:08:29,628 INFO L280 TraceCheckUtils]: 2: Hoare triple {6940#true} assume 0 < #StackHeapBarrier; {6940#true} is VALID [2020-07-11 01:08:29,628 INFO L280 TraceCheckUtils]: 3: Hoare triple {6940#true} assume true; {6940#true} is VALID [2020-07-11 01:08:29,629 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {6940#true} {6940#true} #414#return; {6940#true} is VALID [2020-07-11 01:08:29,636 INFO L263 TraceCheckUtils]: 0: Hoare triple {6940#true} call ULTIMATE.init(); {6956#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:08:29,636 INFO L280 TraceCheckUtils]: 1: Hoare triple {6956#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {6940#true} is VALID [2020-07-11 01:08:29,636 INFO L280 TraceCheckUtils]: 2: Hoare triple {6940#true} #valid := #valid[0 := 0]; {6940#true} is VALID [2020-07-11 01:08:29,636 INFO L280 TraceCheckUtils]: 3: Hoare triple {6940#true} assume 0 < #StackHeapBarrier; {6940#true} is VALID [2020-07-11 01:08:29,636 INFO L280 TraceCheckUtils]: 4: Hoare triple {6940#true} assume true; {6940#true} is VALID [2020-07-11 01:08:29,637 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {6940#true} {6940#true} #414#return; {6940#true} is VALID [2020-07-11 01:08:29,637 INFO L263 TraceCheckUtils]: 6: Hoare triple {6940#true} call #t~ret28 := main(); {6940#true} is VALID [2020-07-11 01:08:29,638 INFO L280 TraceCheckUtils]: 7: Hoare triple {6940#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {6947#(= 1 (select |#valid| |main_#t~malloc0.base|))} is VALID [2020-07-11 01:08:29,638 INFO L280 TraceCheckUtils]: 8: Hoare triple {6947#(= 1 (select |#valid| |main_#t~malloc0.base|))} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {6948#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-11 01:08:29,639 INFO L280 TraceCheckUtils]: 9: Hoare triple {6948#(= 1 (select |#valid| main_~list~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L993 {6948#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-11 01:08:29,639 INFO L280 TraceCheckUtils]: 10: Hoare triple {6948#(= 1 (select |#valid| main_~list~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-1 {6948#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-11 01:08:29,640 INFO L280 TraceCheckUtils]: 11: Hoare triple {6948#(= 1 (select |#valid| main_~list~0.base))} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {6948#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-11 01:08:29,641 INFO L280 TraceCheckUtils]: 12: Hoare triple {6948#(= 1 (select |#valid| main_~list~0.base))} goto; {6948#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-11 01:08:29,642 INFO L280 TraceCheckUtils]: 13: Hoare triple {6948#(= 1 (select |#valid| main_~list~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {6948#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-11 01:08:29,642 INFO L280 TraceCheckUtils]: 14: Hoare triple {6948#(= 1 (select |#valid| main_~list~0.base))} assume 0 != #t~nondet1; {6948#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-11 01:08:29,643 INFO L280 TraceCheckUtils]: 15: Hoare triple {6948#(= 1 (select |#valid| main_~list~0.base))} havoc #t~nondet1; {6948#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-11 01:08:29,643 INFO L280 TraceCheckUtils]: 16: Hoare triple {6948#(= 1 (select |#valid| main_~list~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-7 {6948#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-11 01:08:29,644 INFO L280 TraceCheckUtils]: 17: Hoare triple {6948#(= 1 (select |#valid| main_~list~0.base))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-34 {6948#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-11 01:08:29,645 INFO L280 TraceCheckUtils]: 18: Hoare triple {6948#(= 1 (select |#valid| main_~list~0.base))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {6948#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-11 01:08:29,645 INFO L280 TraceCheckUtils]: 19: Hoare triple {6948#(= 1 (select |#valid| main_~list~0.base))} assume !#t~short7; {6948#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-11 01:08:29,646 INFO L280 TraceCheckUtils]: 20: Hoare triple {6948#(= 1 (select |#valid| main_~list~0.base))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-22 {6948#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-11 01:08:29,646 INFO L280 TraceCheckUtils]: 21: Hoare triple {6948#(= 1 (select |#valid| main_~list~0.base))} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {6948#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-11 01:08:29,647 INFO L280 TraceCheckUtils]: 22: Hoare triple {6948#(= 1 (select |#valid| main_~list~0.base))} assume !!#t~short7; {6948#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-11 01:08:29,648 INFO L280 TraceCheckUtils]: 23: Hoare triple {6948#(= 1 (select |#valid| main_~list~0.base))} havoc #t~mem5.base, #t~mem5.offset; {6948#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-11 01:08:29,649 INFO L280 TraceCheckUtils]: 24: Hoare triple {6948#(= 1 (select |#valid| main_~list~0.base))} havoc #t~mem6.base, #t~mem6.offset; {6948#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-11 01:08:29,651 INFO L280 TraceCheckUtils]: 25: Hoare triple {6948#(= 1 (select |#valid| main_~list~0.base))} havoc #t~short7; {6948#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-11 01:08:29,652 INFO L280 TraceCheckUtils]: 26: Hoare triple {6948#(= 1 (select |#valid| main_~list~0.base))} goto; {6948#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-11 01:08:29,653 INFO L280 TraceCheckUtils]: 27: Hoare triple {6948#(= 1 (select |#valid| main_~list~0.base))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {6949#(= 1 (select |#valid| main_~end~0.base))} is VALID [2020-07-11 01:08:29,654 INFO L280 TraceCheckUtils]: 28: Hoare triple {6949#(= 1 (select |#valid| main_~end~0.base))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {6949#(= 1 (select |#valid| main_~end~0.base))} is VALID [2020-07-11 01:08:29,657 INFO L280 TraceCheckUtils]: 29: Hoare triple {6949#(= 1 (select |#valid| main_~end~0.base))} assume !!(0 != #t~nondet8); {6949#(= 1 (select |#valid| main_~end~0.base))} is VALID [2020-07-11 01:08:29,658 INFO L280 TraceCheckUtils]: 30: Hoare triple {6949#(= 1 (select |#valid| main_~end~0.base))} havoc #t~nondet8; {6949#(= 1 (select |#valid| main_~end~0.base))} is VALID [2020-07-11 01:08:29,658 INFO L280 TraceCheckUtils]: 31: Hoare triple {6949#(= 1 (select |#valid| main_~end~0.base))} SUMMARY for call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(12); srcloc: L1003 {6950#(and (not (= 0 |main_#t~malloc9.base|)) (not (= |main_#t~malloc9.base| main_~end~0.base)))} is VALID [2020-07-11 01:08:29,659 INFO L280 TraceCheckUtils]: 32: Hoare triple {6950#(and (not (= 0 |main_#t~malloc9.base|)) (not (= |main_#t~malloc9.base| main_~end~0.base)))} SUMMARY for call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~end~0.base, ~end~0.offset, 4); srcloc: L1003-1 {6951#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)))} is VALID [2020-07-11 01:08:29,660 INFO L280 TraceCheckUtils]: 33: Hoare triple {6951#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~end~0.base)))} SUMMARY for call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1003-2 {6952#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= |main_#t~mem10.base| main_~end~0.base)))} is VALID [2020-07-11 01:08:29,661 INFO L280 TraceCheckUtils]: 34: Hoare triple {6952#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= |main_#t~mem10.base| main_~end~0.base)))} SUMMARY for call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem10.base, 4 + #t~mem10.offset, 4); srcloc: L1004 {6953#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-11 01:08:29,661 INFO L280 TraceCheckUtils]: 35: Hoare triple {6953#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} havoc #t~mem10.base, #t~mem10.offset; {6953#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-11 01:08:29,662 INFO L280 TraceCheckUtils]: 36: Hoare triple {6953#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} SUMMARY for call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1005 {6954#(not (= 0 |main_#t~mem11.base|))} is VALID [2020-07-11 01:08:29,663 INFO L280 TraceCheckUtils]: 37: Hoare triple {6954#(not (= 0 |main_#t~mem11.base|))} ~end~0.base, ~end~0.offset := #t~mem11.base, #t~mem11.offset; {6955#(not (= 0 main_~end~0.base))} is VALID [2020-07-11 01:08:29,663 INFO L280 TraceCheckUtils]: 38: Hoare triple {6955#(not (= 0 main_~end~0.base))} havoc #t~mem11.base, #t~mem11.offset; {6955#(not (= 0 main_~end~0.base))} is VALID [2020-07-11 01:08:29,664 INFO L280 TraceCheckUtils]: 39: Hoare triple {6955#(not (= 0 main_~end~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); srcloc: L1006 {6955#(not (= 0 main_~end~0.base))} is VALID [2020-07-11 01:08:29,664 INFO L280 TraceCheckUtils]: 40: Hoare triple {6955#(not (= 0 main_~end~0.base))} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {6941#false} is VALID [2020-07-11 01:08:29,665 INFO L280 TraceCheckUtils]: 41: Hoare triple {6941#false} assume !false; {6941#false} is VALID [2020-07-11 01:08:29,668 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:29,668 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [958785343] [2020-07-11 01:08:29,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:08:29,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-11 01:08:29,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984994584] [2020-07-11 01:08:29,669 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2020-07-11 01:08:29,670 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:08:29,670 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-11 01:08:29,731 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:29,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-11 01:08:29,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:08:29,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-11 01:08:29,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-07-11 01:08:29,733 INFO L87 Difference]: Start difference. First operand 161 states and 170 transitions. Second operand 12 states. [2020-07-11 01:08:34,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:34,131 INFO L93 Difference]: Finished difference Result 286 states and 302 transitions. [2020-07-11 01:08:34,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-11 01:08:34,131 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2020-07-11 01:08:34,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:08:34,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-11 01:08:34,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 299 transitions. [2020-07-11 01:08:34,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-11 01:08:34,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 299 transitions. [2020-07-11 01:08:34,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 299 transitions. [2020-07-11 01:08:34,597 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 299 edges. 299 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:34,604 INFO L225 Difference]: With dead ends: 286 [2020-07-11 01:08:34,604 INFO L226 Difference]: Without dead ends: 282 [2020-07-11 01:08:34,605 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2020-07-11 01:08:34,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-07-11 01:08:35,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 176. [2020-07-11 01:08:35,414 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:08:35,414 INFO L82 GeneralOperation]: Start isEquivalent. First operand 282 states. Second operand 176 states. [2020-07-11 01:08:35,414 INFO L74 IsIncluded]: Start isIncluded. First operand 282 states. Second operand 176 states. [2020-07-11 01:08:35,415 INFO L87 Difference]: Start difference. First operand 282 states. Second operand 176 states. [2020-07-11 01:08:35,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:35,422 INFO L93 Difference]: Finished difference Result 282 states and 298 transitions. [2020-07-11 01:08:35,423 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 298 transitions. [2020-07-11 01:08:35,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:08:35,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:08:35,424 INFO L74 IsIncluded]: Start isIncluded. First operand 176 states. Second operand 282 states. [2020-07-11 01:08:35,424 INFO L87 Difference]: Start difference. First operand 176 states. Second operand 282 states. [2020-07-11 01:08:35,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:35,432 INFO L93 Difference]: Finished difference Result 282 states and 298 transitions. [2020-07-11 01:08:35,432 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 298 transitions. [2020-07-11 01:08:35,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:08:35,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:08:35,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:08:35,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:08:35,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-07-11 01:08:35,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 186 transitions. [2020-07-11 01:08:35,438 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 186 transitions. Word has length 42 [2020-07-11 01:08:35,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:08:35,438 INFO L479 AbstractCegarLoop]: Abstraction has 176 states and 186 transitions. [2020-07-11 01:08:35,438 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-11 01:08:35,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 176 states and 186 transitions. [2020-07-11 01:08:35,816 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:35,816 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 186 transitions. [2020-07-11 01:08:35,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-11 01:08:35,817 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:08:35,817 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:08:35,818 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-11 01:08:35,818 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:08:35,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:08:35,819 INFO L82 PathProgramCache]: Analyzing trace with hash 654436304, now seen corresponding path program 1 times [2020-07-11 01:08:35,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:08:35,819 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [518491218] [2020-07-11 01:08:35,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:08:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:08:35,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:08:35,938 INFO L280 TraceCheckUtils]: 0: Hoare triple {8471#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {8463#true} is VALID [2020-07-11 01:08:35,938 INFO L280 TraceCheckUtils]: 1: Hoare triple {8463#true} #valid := #valid[0 := 0]; {8463#true} is VALID [2020-07-11 01:08:35,939 INFO L280 TraceCheckUtils]: 2: Hoare triple {8463#true} assume 0 < #StackHeapBarrier; {8463#true} is VALID [2020-07-11 01:08:35,939 INFO L280 TraceCheckUtils]: 3: Hoare triple {8463#true} assume true; {8463#true} is VALID [2020-07-11 01:08:35,940 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {8463#true} {8463#true} #414#return; {8463#true} is VALID [2020-07-11 01:08:35,941 INFO L263 TraceCheckUtils]: 0: Hoare triple {8463#true} call ULTIMATE.init(); {8471#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:08:35,941 INFO L280 TraceCheckUtils]: 1: Hoare triple {8471#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {8463#true} is VALID [2020-07-11 01:08:35,941 INFO L280 TraceCheckUtils]: 2: Hoare triple {8463#true} #valid := #valid[0 := 0]; {8463#true} is VALID [2020-07-11 01:08:35,941 INFO L280 TraceCheckUtils]: 3: Hoare triple {8463#true} assume 0 < #StackHeapBarrier; {8463#true} is VALID [2020-07-11 01:08:35,942 INFO L280 TraceCheckUtils]: 4: Hoare triple {8463#true} assume true; {8463#true} is VALID [2020-07-11 01:08:35,942 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {8463#true} {8463#true} #414#return; {8463#true} is VALID [2020-07-11 01:08:35,942 INFO L263 TraceCheckUtils]: 6: Hoare triple {8463#true} call #t~ret28 := main(); {8463#true} is VALID [2020-07-11 01:08:35,942 INFO L280 TraceCheckUtils]: 7: Hoare triple {8463#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {8463#true} is VALID [2020-07-11 01:08:35,942 INFO L280 TraceCheckUtils]: 8: Hoare triple {8463#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {8463#true} is VALID [2020-07-11 01:08:35,942 INFO L280 TraceCheckUtils]: 9: Hoare triple {8463#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L993 {8463#true} is VALID [2020-07-11 01:08:35,943 INFO L280 TraceCheckUtils]: 10: Hoare triple {8463#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-1 {8463#true} is VALID [2020-07-11 01:08:35,943 INFO L280 TraceCheckUtils]: 11: Hoare triple {8463#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {8463#true} is VALID [2020-07-11 01:08:35,943 INFO L280 TraceCheckUtils]: 12: Hoare triple {8463#true} goto; {8463#true} is VALID [2020-07-11 01:08:35,943 INFO L280 TraceCheckUtils]: 13: Hoare triple {8463#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {8463#true} is VALID [2020-07-11 01:08:35,943 INFO L280 TraceCheckUtils]: 14: Hoare triple {8463#true} assume 0 != #t~nondet1; {8463#true} is VALID [2020-07-11 01:08:35,943 INFO L280 TraceCheckUtils]: 15: Hoare triple {8463#true} havoc #t~nondet1; {8463#true} is VALID [2020-07-11 01:08:35,944 INFO L280 TraceCheckUtils]: 16: Hoare triple {8463#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-7 {8463#true} is VALID [2020-07-11 01:08:35,944 INFO L280 TraceCheckUtils]: 17: Hoare triple {8463#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-34 {8463#true} is VALID [2020-07-11 01:08:35,944 INFO L280 TraceCheckUtils]: 18: Hoare triple {8463#true} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {8463#true} is VALID [2020-07-11 01:08:35,944 INFO L280 TraceCheckUtils]: 19: Hoare triple {8463#true} assume !#t~short7; {8463#true} is VALID [2020-07-11 01:08:35,944 INFO L280 TraceCheckUtils]: 20: Hoare triple {8463#true} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-22 {8463#true} is VALID [2020-07-11 01:08:35,944 INFO L280 TraceCheckUtils]: 21: Hoare triple {8463#true} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {8463#true} is VALID [2020-07-11 01:08:35,945 INFO L280 TraceCheckUtils]: 22: Hoare triple {8463#true} assume !!#t~short7; {8463#true} is VALID [2020-07-11 01:08:35,945 INFO L280 TraceCheckUtils]: 23: Hoare triple {8463#true} havoc #t~mem5.base, #t~mem5.offset; {8463#true} is VALID [2020-07-11 01:08:35,945 INFO L280 TraceCheckUtils]: 24: Hoare triple {8463#true} havoc #t~mem6.base, #t~mem6.offset; {8463#true} is VALID [2020-07-11 01:08:35,945 INFO L280 TraceCheckUtils]: 25: Hoare triple {8463#true} havoc #t~short7; {8463#true} is VALID [2020-07-11 01:08:35,945 INFO L280 TraceCheckUtils]: 26: Hoare triple {8463#true} goto; {8463#true} is VALID [2020-07-11 01:08:35,945 INFO L280 TraceCheckUtils]: 27: Hoare triple {8463#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {8463#true} is VALID [2020-07-11 01:08:35,946 INFO L280 TraceCheckUtils]: 28: Hoare triple {8463#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {8463#true} is VALID [2020-07-11 01:08:35,946 INFO L280 TraceCheckUtils]: 29: Hoare triple {8463#true} assume !(0 != #t~nondet8); {8463#true} is VALID [2020-07-11 01:08:35,946 INFO L280 TraceCheckUtils]: 30: Hoare triple {8463#true} havoc #t~nondet8; {8463#true} is VALID [2020-07-11 01:08:35,946 INFO L280 TraceCheckUtils]: 31: Hoare triple {8463#true} ~end~0.base, ~end~0.offset := 0, 0; {8463#true} is VALID [2020-07-11 01:08:35,946 INFO L280 TraceCheckUtils]: 32: Hoare triple {8463#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {8463#true} is VALID [2020-07-11 01:08:35,947 INFO L280 TraceCheckUtils]: 33: Hoare triple {8463#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {8463#true} is VALID [2020-07-11 01:08:35,947 INFO L280 TraceCheckUtils]: 34: Hoare triple {8463#true} goto; {8463#true} is VALID [2020-07-11 01:08:35,947 INFO L280 TraceCheckUtils]: 35: Hoare triple {8463#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {8463#true} is VALID [2020-07-11 01:08:35,948 INFO L280 TraceCheckUtils]: 36: Hoare triple {8463#true} ~len~0 := 0; {8470#(= 0 main_~len~0)} is VALID [2020-07-11 01:08:35,948 INFO L280 TraceCheckUtils]: 37: Hoare triple {8470#(= 0 main_~len~0)} SUMMARY for call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~end~0.base, 8 + ~end~0.offset, 4); srcloc: L1020 {8470#(= 0 main_~len~0)} is VALID [2020-07-11 01:08:35,949 INFO L280 TraceCheckUtils]: 38: Hoare triple {8470#(= 0 main_~len~0)} ~inner~0.base, ~inner~0.offset := #t~mem19.base, #t~mem19.offset; {8470#(= 0 main_~len~0)} is VALID [2020-07-11 01:08:35,949 INFO L280 TraceCheckUtils]: 39: Hoare triple {8470#(= 0 main_~len~0)} havoc #t~mem19.base, #t~mem19.offset; {8470#(= 0 main_~len~0)} is VALID [2020-07-11 01:08:35,950 INFO L280 TraceCheckUtils]: 40: Hoare triple {8470#(= 0 main_~len~0)} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {8470#(= 0 main_~len~0)} is VALID [2020-07-11 01:08:35,950 INFO L280 TraceCheckUtils]: 41: Hoare triple {8470#(= 0 main_~len~0)} assume !(~len~0 <= 1); {8464#false} is VALID [2020-07-11 01:08:35,950 INFO L280 TraceCheckUtils]: 42: Hoare triple {8464#false} assume !false; {8464#false} is VALID [2020-07-11 01:08:35,952 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:35,952 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [518491218] [2020-07-11 01:08:35,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:08:35,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-11 01:08:35,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192094495] [2020-07-11 01:08:35,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2020-07-11 01:08:35,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:08:35,954 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-11 01:08:36,013 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:36,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-11 01:08:36,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:08:36,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-11 01:08:36,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-11 01:08:36,014 INFO L87 Difference]: Start difference. First operand 176 states and 186 transitions. Second operand 4 states. [2020-07-11 01:08:37,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:37,824 INFO L93 Difference]: Finished difference Result 282 states and 301 transitions. [2020-07-11 01:08:37,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-11 01:08:37,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2020-07-11 01:08:37,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:08:37,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 01:08:37,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 281 transitions. [2020-07-11 01:08:37,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 01:08:37,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 281 transitions. [2020-07-11 01:08:37,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 281 transitions. [2020-07-11 01:08:38,189 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 281 edges. 281 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:38,195 INFO L225 Difference]: With dead ends: 282 [2020-07-11 01:08:38,196 INFO L226 Difference]: Without dead ends: 215 [2020-07-11 01:08:38,199 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-11 01:08:38,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2020-07-11 01:08:38,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 179. [2020-07-11 01:08:38,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:08:38,990 INFO L82 GeneralOperation]: Start isEquivalent. First operand 215 states. Second operand 179 states. [2020-07-11 01:08:38,990 INFO L74 IsIncluded]: Start isIncluded. First operand 215 states. Second operand 179 states. [2020-07-11 01:08:38,990 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 179 states. [2020-07-11 01:08:38,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:38,997 INFO L93 Difference]: Finished difference Result 215 states and 228 transitions. [2020-07-11 01:08:38,997 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 228 transitions. [2020-07-11 01:08:38,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:08:38,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:08:38,998 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand 215 states. [2020-07-11 01:08:38,998 INFO L87 Difference]: Start difference. First operand 179 states. Second operand 215 states. [2020-07-11 01:08:39,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:39,003 INFO L93 Difference]: Finished difference Result 215 states and 228 transitions. [2020-07-11 01:08:39,004 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 228 transitions. [2020-07-11 01:08:39,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:08:39,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:08:39,005 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:08:39,005 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:08:39,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-07-11 01:08:39,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 190 transitions. [2020-07-11 01:08:39,009 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 190 transitions. Word has length 43 [2020-07-11 01:08:39,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:08:39,009 INFO L479 AbstractCegarLoop]: Abstraction has 179 states and 190 transitions. [2020-07-11 01:08:39,009 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-11 01:08:39,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 179 states and 190 transitions. [2020-07-11 01:08:39,425 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:39,425 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 190 transitions. [2020-07-11 01:08:39,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-07-11 01:08:39,426 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:08:39,426 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:08:39,426 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-11 01:08:39,428 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:08:39,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:08:39,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1847672787, now seen corresponding path program 1 times [2020-07-11 01:08:39,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:08:39,429 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2038324510] [2020-07-11 01:08:39,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:08:39,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:08:39,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:08:39,550 INFO L280 TraceCheckUtils]: 0: Hoare triple {9834#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {9826#true} is VALID [2020-07-11 01:08:39,550 INFO L280 TraceCheckUtils]: 1: Hoare triple {9826#true} #valid := #valid[0 := 0]; {9826#true} is VALID [2020-07-11 01:08:39,550 INFO L280 TraceCheckUtils]: 2: Hoare triple {9826#true} assume 0 < #StackHeapBarrier; {9826#true} is VALID [2020-07-11 01:08:39,551 INFO L280 TraceCheckUtils]: 3: Hoare triple {9826#true} assume true; {9826#true} is VALID [2020-07-11 01:08:39,551 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {9826#true} {9826#true} #414#return; {9826#true} is VALID [2020-07-11 01:08:39,554 INFO L263 TraceCheckUtils]: 0: Hoare triple {9826#true} call ULTIMATE.init(); {9834#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:08:39,555 INFO L280 TraceCheckUtils]: 1: Hoare triple {9834#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {9826#true} is VALID [2020-07-11 01:08:39,555 INFO L280 TraceCheckUtils]: 2: Hoare triple {9826#true} #valid := #valid[0 := 0]; {9826#true} is VALID [2020-07-11 01:08:39,555 INFO L280 TraceCheckUtils]: 3: Hoare triple {9826#true} assume 0 < #StackHeapBarrier; {9826#true} is VALID [2020-07-11 01:08:39,555 INFO L280 TraceCheckUtils]: 4: Hoare triple {9826#true} assume true; {9826#true} is VALID [2020-07-11 01:08:39,556 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {9826#true} {9826#true} #414#return; {9826#true} is VALID [2020-07-11 01:08:39,556 INFO L263 TraceCheckUtils]: 6: Hoare triple {9826#true} call #t~ret28 := main(); {9826#true} is VALID [2020-07-11 01:08:39,556 INFO L280 TraceCheckUtils]: 7: Hoare triple {9826#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {9826#true} is VALID [2020-07-11 01:08:39,556 INFO L280 TraceCheckUtils]: 8: Hoare triple {9826#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {9826#true} is VALID [2020-07-11 01:08:39,556 INFO L280 TraceCheckUtils]: 9: Hoare triple {9826#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L993 {9826#true} is VALID [2020-07-11 01:08:39,557 INFO L280 TraceCheckUtils]: 10: Hoare triple {9826#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-1 {9826#true} is VALID [2020-07-11 01:08:39,557 INFO L280 TraceCheckUtils]: 11: Hoare triple {9826#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {9826#true} is VALID [2020-07-11 01:08:39,557 INFO L280 TraceCheckUtils]: 12: Hoare triple {9826#true} goto; {9826#true} is VALID [2020-07-11 01:08:39,557 INFO L280 TraceCheckUtils]: 13: Hoare triple {9826#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {9826#true} is VALID [2020-07-11 01:08:39,557 INFO L280 TraceCheckUtils]: 14: Hoare triple {9826#true} assume 0 != #t~nondet1; {9826#true} is VALID [2020-07-11 01:08:39,558 INFO L280 TraceCheckUtils]: 15: Hoare triple {9826#true} havoc #t~nondet1; {9826#true} is VALID [2020-07-11 01:08:39,558 INFO L280 TraceCheckUtils]: 16: Hoare triple {9826#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-7 {9826#true} is VALID [2020-07-11 01:08:39,558 INFO L280 TraceCheckUtils]: 17: Hoare triple {9826#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-34 {9826#true} is VALID [2020-07-11 01:08:39,558 INFO L280 TraceCheckUtils]: 18: Hoare triple {9826#true} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {9826#true} is VALID [2020-07-11 01:08:39,558 INFO L280 TraceCheckUtils]: 19: Hoare triple {9826#true} assume !#t~short7; {9826#true} is VALID [2020-07-11 01:08:39,559 INFO L280 TraceCheckUtils]: 20: Hoare triple {9826#true} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-22 {9826#true} is VALID [2020-07-11 01:08:39,559 INFO L280 TraceCheckUtils]: 21: Hoare triple {9826#true} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {9826#true} is VALID [2020-07-11 01:08:39,559 INFO L280 TraceCheckUtils]: 22: Hoare triple {9826#true} assume !!#t~short7; {9826#true} is VALID [2020-07-11 01:08:39,559 INFO L280 TraceCheckUtils]: 23: Hoare triple {9826#true} havoc #t~mem5.base, #t~mem5.offset; {9826#true} is VALID [2020-07-11 01:08:39,559 INFO L280 TraceCheckUtils]: 24: Hoare triple {9826#true} havoc #t~mem6.base, #t~mem6.offset; {9826#true} is VALID [2020-07-11 01:08:39,560 INFO L280 TraceCheckUtils]: 25: Hoare triple {9826#true} havoc #t~short7; {9826#true} is VALID [2020-07-11 01:08:39,560 INFO L280 TraceCheckUtils]: 26: Hoare triple {9826#true} goto; {9826#true} is VALID [2020-07-11 01:08:39,560 INFO L280 TraceCheckUtils]: 27: Hoare triple {9826#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {9826#true} is VALID [2020-07-11 01:08:39,560 INFO L280 TraceCheckUtils]: 28: Hoare triple {9826#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {9826#true} is VALID [2020-07-11 01:08:39,560 INFO L280 TraceCheckUtils]: 29: Hoare triple {9826#true} assume !(0 != #t~nondet8); {9826#true} is VALID [2020-07-11 01:08:39,561 INFO L280 TraceCheckUtils]: 30: Hoare triple {9826#true} havoc #t~nondet8; {9826#true} is VALID [2020-07-11 01:08:39,561 INFO L280 TraceCheckUtils]: 31: Hoare triple {9826#true} ~end~0.base, ~end~0.offset := 0, 0; {9826#true} is VALID [2020-07-11 01:08:39,561 INFO L280 TraceCheckUtils]: 32: Hoare triple {9826#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {9826#true} is VALID [2020-07-11 01:08:39,561 INFO L280 TraceCheckUtils]: 33: Hoare triple {9826#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {9826#true} is VALID [2020-07-11 01:08:39,561 INFO L280 TraceCheckUtils]: 34: Hoare triple {9826#true} goto; {9826#true} is VALID [2020-07-11 01:08:39,564 INFO L280 TraceCheckUtils]: 35: Hoare triple {9826#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {9826#true} is VALID [2020-07-11 01:08:39,565 INFO L280 TraceCheckUtils]: 36: Hoare triple {9826#true} ~len~0 := 0; {9826#true} is VALID [2020-07-11 01:08:39,565 INFO L280 TraceCheckUtils]: 37: Hoare triple {9826#true} SUMMARY for call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~end~0.base, 8 + ~end~0.offset, 4); srcloc: L1020 {9826#true} is VALID [2020-07-11 01:08:39,565 INFO L280 TraceCheckUtils]: 38: Hoare triple {9826#true} ~inner~0.base, ~inner~0.offset := #t~mem19.base, #t~mem19.offset; {9826#true} is VALID [2020-07-11 01:08:39,565 INFO L280 TraceCheckUtils]: 39: Hoare triple {9826#true} havoc #t~mem19.base, #t~mem19.offset; {9826#true} is VALID [2020-07-11 01:08:39,568 INFO L280 TraceCheckUtils]: 40: Hoare triple {9826#true} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {9833#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} is VALID [2020-07-11 01:08:39,569 INFO L280 TraceCheckUtils]: 41: Hoare triple {9833#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} assume 0 == ~len~0; {9833#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} is VALID [2020-07-11 01:08:39,570 INFO L280 TraceCheckUtils]: 42: Hoare triple {9833#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} ~len~0 := 1; {9833#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} is VALID [2020-07-11 01:08:39,571 INFO L280 TraceCheckUtils]: 43: Hoare triple {9833#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {9827#false} is VALID [2020-07-11 01:08:39,571 INFO L280 TraceCheckUtils]: 44: Hoare triple {9827#false} assume !false; {9827#false} is VALID [2020-07-11 01:08:39,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 01:08:39,573 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2038324510] [2020-07-11 01:08:39,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:08:39,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-11 01:08:39,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018956110] [2020-07-11 01:08:39,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2020-07-11 01:08:39,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:08:39,574 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-11 01:08:39,626 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-11 01:08:39,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-11 01:08:39,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:08:39,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-11 01:08:39,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-11 01:08:39,627 INFO L87 Difference]: Start difference. First operand 179 states and 190 transitions. Second operand 4 states. [2020-07-11 01:08:41,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:41,021 INFO L93 Difference]: Finished difference Result 179 states and 190 transitions. [2020-07-11 01:08:41,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-11 01:08:41,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2020-07-11 01:08:41,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:08:41,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 01:08:41,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2020-07-11 01:08:41,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 01:08:41,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2020-07-11 01:08:41,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 166 transitions. [2020-07-11 01:08:41,274 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:41,281 INFO L225 Difference]: With dead ends: 179 [2020-07-11 01:08:41,281 INFO L226 Difference]: Without dead ends: 177 [2020-07-11 01:08:41,281 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-11 01:08:41,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2020-07-11 01:08:42,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2020-07-11 01:08:42,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:08:42,049 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand 177 states. [2020-07-11 01:08:42,049 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand 177 states. [2020-07-11 01:08:42,049 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 177 states. [2020-07-11 01:08:42,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:42,054 INFO L93 Difference]: Finished difference Result 177 states and 188 transitions. [2020-07-11 01:08:42,054 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 188 transitions. [2020-07-11 01:08:42,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:08:42,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:08:42,055 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand 177 states. [2020-07-11 01:08:42,055 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 177 states. [2020-07-11 01:08:42,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:42,059 INFO L93 Difference]: Finished difference Result 177 states and 188 transitions. [2020-07-11 01:08:42,059 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 188 transitions. [2020-07-11 01:08:42,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:08:42,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:08:42,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:08:42,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:08:42,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-07-11 01:08:42,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 188 transitions. [2020-07-11 01:08:42,064 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 188 transitions. Word has length 45 [2020-07-11 01:08:42,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:08:42,064 INFO L479 AbstractCegarLoop]: Abstraction has 177 states and 188 transitions. [2020-07-11 01:08:42,064 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-11 01:08:42,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 177 states and 188 transitions. [2020-07-11 01:08:42,593 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:42,593 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 188 transitions. [2020-07-11 01:08:42,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-11 01:08:42,594 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:08:42,595 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:08:42,595 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-11 01:08:42,595 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:08:42,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:08:42,595 INFO L82 PathProgramCache]: Analyzing trace with hash 11890970, now seen corresponding path program 1 times [2020-07-11 01:08:42,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:08:42,596 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1888678796] [2020-07-11 01:08:42,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:08:42,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:08:42,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:08:42,918 INFO L280 TraceCheckUtils]: 0: Hoare triple {10918#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {10903#true} is VALID [2020-07-11 01:08:42,918 INFO L280 TraceCheckUtils]: 1: Hoare triple {10903#true} #valid := #valid[0 := 0]; {10903#true} is VALID [2020-07-11 01:08:42,918 INFO L280 TraceCheckUtils]: 2: Hoare triple {10903#true} assume 0 < #StackHeapBarrier; {10903#true} is VALID [2020-07-11 01:08:42,919 INFO L280 TraceCheckUtils]: 3: Hoare triple {10903#true} assume true; {10903#true} is VALID [2020-07-11 01:08:42,919 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {10903#true} {10903#true} #414#return; {10903#true} is VALID [2020-07-11 01:08:42,920 INFO L263 TraceCheckUtils]: 0: Hoare triple {10903#true} call ULTIMATE.init(); {10918#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:08:42,920 INFO L280 TraceCheckUtils]: 1: Hoare triple {10918#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {10903#true} is VALID [2020-07-11 01:08:42,920 INFO L280 TraceCheckUtils]: 2: Hoare triple {10903#true} #valid := #valid[0 := 0]; {10903#true} is VALID [2020-07-11 01:08:42,921 INFO L280 TraceCheckUtils]: 3: Hoare triple {10903#true} assume 0 < #StackHeapBarrier; {10903#true} is VALID [2020-07-11 01:08:42,921 INFO L280 TraceCheckUtils]: 4: Hoare triple {10903#true} assume true; {10903#true} is VALID [2020-07-11 01:08:42,921 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {10903#true} {10903#true} #414#return; {10903#true} is VALID [2020-07-11 01:08:42,921 INFO L263 TraceCheckUtils]: 6: Hoare triple {10903#true} call #t~ret28 := main(); {10903#true} is VALID [2020-07-11 01:08:42,924 INFO L280 TraceCheckUtils]: 7: Hoare triple {10903#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {10910#(= 0 |main_#t~malloc0.offset|)} is VALID [2020-07-11 01:08:42,925 INFO L280 TraceCheckUtils]: 8: Hoare triple {10910#(= 0 |main_#t~malloc0.offset|)} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {10911#(= 0 main_~list~0.offset)} is VALID [2020-07-11 01:08:42,925 INFO L280 TraceCheckUtils]: 9: Hoare triple {10911#(= 0 main_~list~0.offset)} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L993 {10911#(= 0 main_~list~0.offset)} is VALID [2020-07-11 01:08:42,926 INFO L280 TraceCheckUtils]: 10: Hoare triple {10911#(= 0 main_~list~0.offset)} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-1 {10911#(= 0 main_~list~0.offset)} is VALID [2020-07-11 01:08:42,927 INFO L280 TraceCheckUtils]: 11: Hoare triple {10911#(= 0 main_~list~0.offset)} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {10911#(= 0 main_~list~0.offset)} is VALID [2020-07-11 01:08:42,927 INFO L280 TraceCheckUtils]: 12: Hoare triple {10911#(= 0 main_~list~0.offset)} goto; {10911#(= 0 main_~list~0.offset)} is VALID [2020-07-11 01:08:42,928 INFO L280 TraceCheckUtils]: 13: Hoare triple {10911#(= 0 main_~list~0.offset)} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {10911#(= 0 main_~list~0.offset)} is VALID [2020-07-11 01:08:42,929 INFO L280 TraceCheckUtils]: 14: Hoare triple {10911#(= 0 main_~list~0.offset)} assume 0 != #t~nondet1; {10911#(= 0 main_~list~0.offset)} is VALID [2020-07-11 01:08:42,929 INFO L280 TraceCheckUtils]: 15: Hoare triple {10911#(= 0 main_~list~0.offset)} havoc #t~nondet1; {10911#(= 0 main_~list~0.offset)} is VALID [2020-07-11 01:08:42,930 INFO L280 TraceCheckUtils]: 16: Hoare triple {10911#(= 0 main_~list~0.offset)} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-7 {10911#(= 0 main_~list~0.offset)} is VALID [2020-07-11 01:08:42,931 INFO L280 TraceCheckUtils]: 17: Hoare triple {10911#(= 0 main_~list~0.offset)} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-34 {10912#(and (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 main_~list~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)) |main_#t~mem5.base|))} is VALID [2020-07-11 01:08:42,932 INFO L280 TraceCheckUtils]: 18: Hoare triple {10912#(and (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 main_~list~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)) |main_#t~mem5.base|))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {10913#(or |main_#t~short7| (and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))))} is VALID [2020-07-11 01:08:42,933 INFO L280 TraceCheckUtils]: 19: Hoare triple {10913#(or |main_#t~short7| (and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))))} assume !#t~short7; {10914#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:08:42,935 INFO L280 TraceCheckUtils]: 20: Hoare triple {10914#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-22 {10914#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:08:42,936 INFO L280 TraceCheckUtils]: 21: Hoare triple {10914#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {10914#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:08:42,937 INFO L280 TraceCheckUtils]: 22: Hoare triple {10914#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !!#t~short7; {10914#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:08:42,938 INFO L280 TraceCheckUtils]: 23: Hoare triple {10914#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} havoc #t~mem5.base, #t~mem5.offset; {10914#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:08:42,939 INFO L280 TraceCheckUtils]: 24: Hoare triple {10914#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} havoc #t~mem6.base, #t~mem6.offset; {10914#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:08:42,940 INFO L280 TraceCheckUtils]: 25: Hoare triple {10914#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} havoc #t~short7; {10914#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:08:42,941 INFO L280 TraceCheckUtils]: 26: Hoare triple {10914#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} goto; {10914#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:08:42,942 INFO L280 TraceCheckUtils]: 27: Hoare triple {10914#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {10914#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:08:42,943 INFO L280 TraceCheckUtils]: 28: Hoare triple {10914#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {10914#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:08:42,944 INFO L280 TraceCheckUtils]: 29: Hoare triple {10914#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !(0 != #t~nondet8); {10914#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:08:42,945 INFO L280 TraceCheckUtils]: 30: Hoare triple {10914#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} havoc #t~nondet8; {10914#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:08:42,946 INFO L280 TraceCheckUtils]: 31: Hoare triple {10914#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} ~end~0.base, ~end~0.offset := 0, 0; {10914#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:08:42,947 INFO L280 TraceCheckUtils]: 32: Hoare triple {10914#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {10915#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 main_~end~0.offset))} is VALID [2020-07-11 01:08:42,948 INFO L280 TraceCheckUtils]: 33: Hoare triple {10915#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 main_~end~0.offset))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {10915#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 main_~end~0.offset))} is VALID [2020-07-11 01:08:42,949 INFO L280 TraceCheckUtils]: 34: Hoare triple {10915#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 main_~end~0.offset))} goto; {10915#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 main_~end~0.offset))} is VALID [2020-07-11 01:08:42,950 INFO L280 TraceCheckUtils]: 35: Hoare triple {10915#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 main_~end~0.offset))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {10915#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 main_~end~0.offset))} is VALID [2020-07-11 01:08:42,951 INFO L280 TraceCheckUtils]: 36: Hoare triple {10915#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 main_~end~0.offset))} ~len~0 := 0; {10915#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 main_~end~0.offset))} is VALID [2020-07-11 01:08:42,952 INFO L280 TraceCheckUtils]: 37: Hoare triple {10915#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 main_~end~0.offset))} SUMMARY for call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~end~0.base, 8 + ~end~0.offset, 4); srcloc: L1020 {10916#(and (= 0 |main_#t~mem19.offset|) (= 0 |main_#t~mem19.base|))} is VALID [2020-07-11 01:08:42,952 INFO L280 TraceCheckUtils]: 38: Hoare triple {10916#(and (= 0 |main_#t~mem19.offset|) (= 0 |main_#t~mem19.base|))} ~inner~0.base, ~inner~0.offset := #t~mem19.base, #t~mem19.offset; {10917#(and (= 0 main_~inner~0.base) (= 0 main_~inner~0.offset))} is VALID [2020-07-11 01:08:42,953 INFO L280 TraceCheckUtils]: 39: Hoare triple {10917#(and (= 0 main_~inner~0.base) (= 0 main_~inner~0.offset))} havoc #t~mem19.base, #t~mem19.offset; {10917#(and (= 0 main_~inner~0.base) (= 0 main_~inner~0.offset))} is VALID [2020-07-11 01:08:42,954 INFO L280 TraceCheckUtils]: 40: Hoare triple {10917#(and (= 0 main_~inner~0.base) (= 0 main_~inner~0.offset))} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {10904#false} is VALID [2020-07-11 01:08:42,954 INFO L280 TraceCheckUtils]: 41: Hoare triple {10904#false} assume 0 == ~len~0; {10904#false} is VALID [2020-07-11 01:08:42,954 INFO L280 TraceCheckUtils]: 42: Hoare triple {10904#false} ~len~0 := 1; {10904#false} is VALID [2020-07-11 01:08:42,954 INFO L280 TraceCheckUtils]: 43: Hoare triple {10904#false} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {10904#false} is VALID [2020-07-11 01:08:42,955 INFO L280 TraceCheckUtils]: 44: Hoare triple {10904#false} goto; {10904#false} is VALID [2020-07-11 01:08:42,955 INFO L280 TraceCheckUtils]: 45: Hoare triple {10904#false} SUMMARY for call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~inner~0.base, 8 + ~inner~0.offset, 4); srcloc: L1028-6 {10904#false} is VALID [2020-07-11 01:08:42,955 INFO L280 TraceCheckUtils]: 46: Hoare triple {10904#false} assume !(0 == #t~mem20.base && 0 == #t~mem20.offset); {10904#false} is VALID [2020-07-11 01:08:42,955 INFO L280 TraceCheckUtils]: 47: Hoare triple {10904#false} havoc #t~mem20.base, #t~mem20.offset; {10904#false} is VALID [2020-07-11 01:08:42,956 INFO L280 TraceCheckUtils]: 48: Hoare triple {10904#false} assume !false; {10904#false} is VALID [2020-07-11 01:08:42,964 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,964 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1888678796] [2020-07-11 01:08:42,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:08:42,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-11 01:08:42,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304207743] [2020-07-11 01:08:42,971 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2020-07-11 01:08:42,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:08:42,971 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-11 01:08:43,041 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:43,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-11 01:08:43,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:08:43,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-11 01:08:43,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-07-11 01:08:43,043 INFO L87 Difference]: Start difference. First operand 177 states and 188 transitions. Second operand 11 states. [2020-07-11 01:08:48,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:48,275 INFO L93 Difference]: Finished difference Result 374 states and 398 transitions. [2020-07-11 01:08:48,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-11 01:08:48,275 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2020-07-11 01:08:48,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:08:48,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 01:08:48,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 370 transitions. [2020-07-11 01:08:48,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 01:08:48,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 370 transitions. [2020-07-11 01:08:48,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 370 transitions. [2020-07-11 01:08:48,891 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 370 edges. 370 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:48,898 INFO L225 Difference]: With dead ends: 374 [2020-07-11 01:08:48,898 INFO L226 Difference]: Without dead ends: 306 [2020-07-11 01:08:48,900 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2020-07-11 01:08:48,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2020-07-11 01:08:50,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 196. [2020-07-11 01:08:50,104 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:08:50,104 INFO L82 GeneralOperation]: Start isEquivalent. First operand 306 states. Second operand 196 states. [2020-07-11 01:08:50,104 INFO L74 IsIncluded]: Start isIncluded. First operand 306 states. Second operand 196 states. [2020-07-11 01:08:50,104 INFO L87 Difference]: Start difference. First operand 306 states. Second operand 196 states. [2020-07-11 01:08:50,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:50,111 INFO L93 Difference]: Finished difference Result 306 states and 324 transitions. [2020-07-11 01:08:50,112 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 324 transitions. [2020-07-11 01:08:50,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:08:50,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:08:50,113 INFO L74 IsIncluded]: Start isIncluded. First operand 196 states. Second operand 306 states. [2020-07-11 01:08:50,113 INFO L87 Difference]: Start difference. First operand 196 states. Second operand 306 states. [2020-07-11 01:08:50,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:08:50,120 INFO L93 Difference]: Finished difference Result 306 states and 324 transitions. [2020-07-11 01:08:50,120 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 324 transitions. [2020-07-11 01:08:50,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:08:50,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:08:50,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:08:50,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:08:50,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2020-07-11 01:08:50,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 208 transitions. [2020-07-11 01:08:50,124 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 208 transitions. Word has length 49 [2020-07-11 01:08:50,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:08:50,124 INFO L479 AbstractCegarLoop]: Abstraction has 196 states and 208 transitions. [2020-07-11 01:08:50,124 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-11 01:08:50,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 196 states and 208 transitions. [2020-07-11 01:08:50,672 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:50,672 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 208 transitions. [2020-07-11 01:08:50,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-11 01:08:50,674 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:08:50,674 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:08:50,674 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-11 01:08:50,674 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:08:50,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:08:50,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1643041774, now seen corresponding path program 1 times [2020-07-11 01:08:50,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:08:50,675 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1603617260] [2020-07-11 01:08:50,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:08:50,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:08:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:08:51,253 INFO L280 TraceCheckUtils]: 0: Hoare triple {12717#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {12699#true} is VALID [2020-07-11 01:08:51,253 INFO L280 TraceCheckUtils]: 1: Hoare triple {12699#true} #valid := #valid[0 := 0]; {12699#true} is VALID [2020-07-11 01:08:51,254 INFO L280 TraceCheckUtils]: 2: Hoare triple {12699#true} assume 0 < #StackHeapBarrier; {12699#true} is VALID [2020-07-11 01:08:51,254 INFO L280 TraceCheckUtils]: 3: Hoare triple {12699#true} assume true; {12699#true} is VALID [2020-07-11 01:08:51,254 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {12699#true} {12699#true} #414#return; {12699#true} is VALID [2020-07-11 01:08:51,255 INFO L263 TraceCheckUtils]: 0: Hoare triple {12699#true} call ULTIMATE.init(); {12717#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:08:51,255 INFO L280 TraceCheckUtils]: 1: Hoare triple {12717#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {12699#true} is VALID [2020-07-11 01:08:51,255 INFO L280 TraceCheckUtils]: 2: Hoare triple {12699#true} #valid := #valid[0 := 0]; {12699#true} is VALID [2020-07-11 01:08:51,256 INFO L280 TraceCheckUtils]: 3: Hoare triple {12699#true} assume 0 < #StackHeapBarrier; {12699#true} is VALID [2020-07-11 01:08:51,256 INFO L280 TraceCheckUtils]: 4: Hoare triple {12699#true} assume true; {12699#true} is VALID [2020-07-11 01:08:51,256 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {12699#true} {12699#true} #414#return; {12699#true} is VALID [2020-07-11 01:08:51,256 INFO L263 TraceCheckUtils]: 6: Hoare triple {12699#true} call #t~ret28 := main(); {12699#true} is VALID [2020-07-11 01:08:51,257 INFO L280 TraceCheckUtils]: 7: Hoare triple {12699#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {12706#(and (= 1 (select |#valid| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|))} is VALID [2020-07-11 01:08:51,258 INFO L280 TraceCheckUtils]: 8: Hoare triple {12706#(and (= 1 (select |#valid| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|))} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {12707#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-11 01:08:51,259 INFO L280 TraceCheckUtils]: 9: Hoare triple {12707#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L993 {12707#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-11 01:08:51,260 INFO L280 TraceCheckUtils]: 10: Hoare triple {12707#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-1 {12707#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-11 01:08:51,261 INFO L280 TraceCheckUtils]: 11: Hoare triple {12707#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {12707#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-11 01:08:51,262 INFO L280 TraceCheckUtils]: 12: Hoare triple {12707#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} goto; {12707#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-11 01:08:51,263 INFO L280 TraceCheckUtils]: 13: Hoare triple {12707#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {12707#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-11 01:08:51,264 INFO L280 TraceCheckUtils]: 14: Hoare triple {12707#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} assume !(0 != #t~nondet1); {12707#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-11 01:08:51,266 INFO L280 TraceCheckUtils]: 15: Hoare triple {12707#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} havoc #t~nondet1; {12707#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-11 01:08:51,267 INFO L280 TraceCheckUtils]: 16: Hoare triple {12707#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12); srcloc: L995-10 {12708#(and (= 0 |main_#t~malloc2.offset|) (= 0 main_~list~0.offset) (not (= |main_#t~malloc2.base| main_~list~0.base)))} is VALID [2020-07-11 01:08:51,268 INFO L280 TraceCheckUtils]: 17: Hoare triple {12708#(and (= 0 |main_#t~malloc2.offset|) (= 0 main_~list~0.offset) (not (= |main_#t~malloc2.base| main_~list~0.base)))} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-11 {12709#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)) main_~list~0.base)))} is VALID [2020-07-11 01:08:51,276 INFO L280 TraceCheckUtils]: 18: Hoare triple {12709#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)) main_~list~0.base)))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-12 {12710#(and (= 0 main_~list~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)) |main_#t~mem3.base|) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (not (= |main_#t~mem3.base| main_~list~0.base)))} is VALID [2020-07-11 01:08:51,277 INFO L280 TraceCheckUtils]: 19: Hoare triple {12710#(and (= 0 main_~list~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)) |main_#t~mem3.base|) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (not (= |main_#t~mem3.base| main_~list~0.base)))} SUMMARY for call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4); srcloc: L995-13 {12709#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)) main_~list~0.base)))} is VALID [2020-07-11 01:08:51,280 INFO L280 TraceCheckUtils]: 20: Hoare triple {12709#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)) main_~list~0.base)))} havoc #t~mem3.base, #t~mem3.offset; {12709#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)) main_~list~0.base)))} is VALID [2020-07-11 01:08:51,284 INFO L280 TraceCheckUtils]: 21: Hoare triple {12709#(and (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)) main_~list~0.base)))} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-15 {12711#(and (= 0 main_~list~0.offset) (not (= |main_#t~mem4.base| main_~list~0.base)) (= 0 |main_#t~mem4.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)) |main_#t~mem4.base|))} is VALID [2020-07-11 01:08:51,288 INFO L280 TraceCheckUtils]: 22: Hoare triple {12711#(and (= 0 main_~list~0.offset) (not (= |main_#t~mem4.base| main_~list~0.base)) (= 0 |main_#t~mem4.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)) |main_#t~mem4.base|))} SUMMARY for call write~$Pointer$(0, 0, #t~mem4.base, 8 + #t~mem4.offset, 4); srcloc: L995-16 {12712#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:08:51,290 INFO L280 TraceCheckUtils]: 23: Hoare triple {12712#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} havoc #t~mem4.base, #t~mem4.offset; {12712#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:08:51,293 INFO L280 TraceCheckUtils]: 24: Hoare triple {12712#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-34 {12712#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:08:51,294 INFO L280 TraceCheckUtils]: 25: Hoare triple {12712#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {12712#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:08:51,295 INFO L280 TraceCheckUtils]: 26: Hoare triple {12712#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume #t~short7; {12712#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:08:51,296 INFO L280 TraceCheckUtils]: 27: Hoare triple {12712#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !!#t~short7; {12712#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:08:51,297 INFO L280 TraceCheckUtils]: 28: Hoare triple {12712#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} havoc #t~mem5.base, #t~mem5.offset; {12712#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:08:51,297 INFO L280 TraceCheckUtils]: 29: Hoare triple {12712#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} havoc #t~mem6.base, #t~mem6.offset; {12712#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:08:51,298 INFO L280 TraceCheckUtils]: 30: Hoare triple {12712#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} havoc #t~short7; {12712#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:08:51,299 INFO L280 TraceCheckUtils]: 31: Hoare triple {12712#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} goto; {12712#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:08:51,300 INFO L280 TraceCheckUtils]: 32: Hoare triple {12712#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {12712#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:08:51,301 INFO L280 TraceCheckUtils]: 33: Hoare triple {12712#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {12712#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:08:51,302 INFO L280 TraceCheckUtils]: 34: Hoare triple {12712#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !(0 != #t~nondet8); {12712#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:08:51,303 INFO L280 TraceCheckUtils]: 35: Hoare triple {12712#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} havoc #t~nondet8; {12712#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:08:51,304 INFO L280 TraceCheckUtils]: 36: Hoare triple {12712#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} ~end~0.base, ~end~0.offset := 0, 0; {12712#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:08:51,307 INFO L280 TraceCheckUtils]: 37: Hoare triple {12712#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {12713#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))))} is VALID [2020-07-11 01:08:51,308 INFO L280 TraceCheckUtils]: 38: Hoare triple {12713#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {12713#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))))} is VALID [2020-07-11 01:08:51,309 INFO L280 TraceCheckUtils]: 39: Hoare triple {12713#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))))} goto; {12713#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))))} is VALID [2020-07-11 01:08:51,310 INFO L280 TraceCheckUtils]: 40: Hoare triple {12713#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {12713#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))))} is VALID [2020-07-11 01:08:51,311 INFO L280 TraceCheckUtils]: 41: Hoare triple {12713#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))))} ~len~0 := 0; {12713#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))))} is VALID [2020-07-11 01:08:51,312 INFO L280 TraceCheckUtils]: 42: Hoare triple {12713#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))))} SUMMARY for call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~end~0.base, 8 + ~end~0.offset, 4); srcloc: L1020 {12714#(and (= (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) 8) 0) (= 0 |main_#t~mem19.offset|) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) 8)))} is VALID [2020-07-11 01:08:51,313 INFO L280 TraceCheckUtils]: 43: Hoare triple {12714#(and (= (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) 8) 0) (= 0 |main_#t~mem19.offset|) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) 8)))} ~inner~0.base, ~inner~0.offset := #t~mem19.base, #t~mem19.offset; {12715#(and (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} is VALID [2020-07-11 01:08:51,314 INFO L280 TraceCheckUtils]: 44: Hoare triple {12715#(and (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} havoc #t~mem19.base, #t~mem19.offset; {12715#(and (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} is VALID [2020-07-11 01:08:51,314 INFO L280 TraceCheckUtils]: 45: Hoare triple {12715#(and (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {12715#(and (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} is VALID [2020-07-11 01:08:51,315 INFO L280 TraceCheckUtils]: 46: Hoare triple {12715#(and (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} assume 0 == ~len~0; {12715#(and (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} is VALID [2020-07-11 01:08:51,316 INFO L280 TraceCheckUtils]: 47: Hoare triple {12715#(and (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} ~len~0 := 1; {12715#(and (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} is VALID [2020-07-11 01:08:51,317 INFO L280 TraceCheckUtils]: 48: Hoare triple {12715#(and (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {12715#(and (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} is VALID [2020-07-11 01:08:51,317 INFO L280 TraceCheckUtils]: 49: Hoare triple {12715#(and (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} goto; {12715#(and (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} is VALID [2020-07-11 01:08:51,318 INFO L280 TraceCheckUtils]: 50: Hoare triple {12715#(and (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} SUMMARY for call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~inner~0.base, 8 + ~inner~0.offset, 4); srcloc: L1028-6 {12716#(and (= 0 |main_#t~mem20.base|) (= 0 |main_#t~mem20.offset|))} is VALID [2020-07-11 01:08:51,319 INFO L280 TraceCheckUtils]: 51: Hoare triple {12716#(and (= 0 |main_#t~mem20.base|) (= 0 |main_#t~mem20.offset|))} assume !(0 == #t~mem20.base && 0 == #t~mem20.offset); {12700#false} is VALID [2020-07-11 01:08:51,319 INFO L280 TraceCheckUtils]: 52: Hoare triple {12700#false} havoc #t~mem20.base, #t~mem20.offset; {12700#false} is VALID [2020-07-11 01:08:51,319 INFO L280 TraceCheckUtils]: 53: Hoare triple {12700#false} assume !false; {12700#false} is VALID [2020-07-11 01:08:51,329 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:51,330 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1603617260] [2020-07-11 01:08:51,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:08:51,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-11 01:08:51,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183718261] [2020-07-11 01:08:51,331 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2020-07-11 01:08:51,331 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:08:51,331 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-11 01:08:51,429 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:08:51,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-11 01:08:51,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:08:51,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-11 01:08:51,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2020-07-11 01:08:51,430 INFO L87 Difference]: Start difference. First operand 196 states and 208 transitions. Second operand 14 states. [2020-07-11 01:09:04,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:09:04,237 INFO L93 Difference]: Finished difference Result 589 states and 622 transitions. [2020-07-11 01:09:04,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-07-11 01:09:04,238 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2020-07-11 01:09:04,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:09:04,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-11 01:09:04,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 551 transitions. [2020-07-11 01:09:04,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-11 01:09:04,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 551 transitions. [2020-07-11 01:09:04,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 551 transitions. [2020-07-11 01:09:05,460 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 551 edges. 551 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:09:05,476 INFO L225 Difference]: With dead ends: 589 [2020-07-11 01:09:05,476 INFO L226 Difference]: Without dead ends: 586 [2020-07-11 01:09:05,477 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=252, Invalid=804, Unknown=0, NotChecked=0, Total=1056 [2020-07-11 01:09:05,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-07-11 01:09:07,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 213. [2020-07-11 01:09:07,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:09:07,531 INFO L82 GeneralOperation]: Start isEquivalent. First operand 586 states. Second operand 213 states. [2020-07-11 01:09:07,532 INFO L74 IsIncluded]: Start isIncluded. First operand 586 states. Second operand 213 states. [2020-07-11 01:09:07,532 INFO L87 Difference]: Start difference. First operand 586 states. Second operand 213 states. [2020-07-11 01:09:07,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:09:07,551 INFO L93 Difference]: Finished difference Result 586 states and 619 transitions. [2020-07-11 01:09:07,552 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 619 transitions. [2020-07-11 01:09:07,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:09:07,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:09:07,553 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states. Second operand 586 states. [2020-07-11 01:09:07,553 INFO L87 Difference]: Start difference. First operand 213 states. Second operand 586 states. [2020-07-11 01:09:07,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:09:07,573 INFO L93 Difference]: Finished difference Result 586 states and 619 transitions. [2020-07-11 01:09:07,573 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 619 transitions. [2020-07-11 01:09:07,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:09:07,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:09:07,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:09:07,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:09:07,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-07-11 01:09:07,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 226 transitions. [2020-07-11 01:09:07,580 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 226 transitions. Word has length 54 [2020-07-11 01:09:07,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:09:07,580 INFO L479 AbstractCegarLoop]: Abstraction has 213 states and 226 transitions. [2020-07-11 01:09:07,580 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-11 01:09:07,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 213 states and 226 transitions. [2020-07-11 01:09:08,392 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:09:08,392 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 226 transitions. [2020-07-11 01:09:08,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-11 01:09:08,393 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:09:08,393 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:09:08,394 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-11 01:09:08,394 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:09:08,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:09:08,394 INFO L82 PathProgramCache]: Analyzing trace with hash 358720869, now seen corresponding path program 1 times [2020-07-11 01:09:08,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:09:08,395 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [137112770] [2020-07-11 01:09:08,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:09:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:09:08,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:09:08,581 INFO L280 TraceCheckUtils]: 0: Hoare triple {15546#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {15534#true} is VALID [2020-07-11 01:09:08,581 INFO L280 TraceCheckUtils]: 1: Hoare triple {15534#true} #valid := #valid[0 := 0]; {15534#true} is VALID [2020-07-11 01:09:08,581 INFO L280 TraceCheckUtils]: 2: Hoare triple {15534#true} assume 0 < #StackHeapBarrier; {15534#true} is VALID [2020-07-11 01:09:08,581 INFO L280 TraceCheckUtils]: 3: Hoare triple {15534#true} assume true; {15534#true} is VALID [2020-07-11 01:09:08,582 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {15534#true} {15534#true} #414#return; {15534#true} is VALID [2020-07-11 01:09:08,583 INFO L263 TraceCheckUtils]: 0: Hoare triple {15534#true} call ULTIMATE.init(); {15546#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:09:08,583 INFO L280 TraceCheckUtils]: 1: Hoare triple {15546#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {15534#true} is VALID [2020-07-11 01:09:08,583 INFO L280 TraceCheckUtils]: 2: Hoare triple {15534#true} #valid := #valid[0 := 0]; {15534#true} is VALID [2020-07-11 01:09:08,583 INFO L280 TraceCheckUtils]: 3: Hoare triple {15534#true} assume 0 < #StackHeapBarrier; {15534#true} is VALID [2020-07-11 01:09:08,584 INFO L280 TraceCheckUtils]: 4: Hoare triple {15534#true} assume true; {15534#true} is VALID [2020-07-11 01:09:08,584 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {15534#true} {15534#true} #414#return; {15534#true} is VALID [2020-07-11 01:09:08,584 INFO L263 TraceCheckUtils]: 6: Hoare triple {15534#true} call #t~ret28 := main(); {15534#true} is VALID [2020-07-11 01:09:08,584 INFO L280 TraceCheckUtils]: 7: Hoare triple {15534#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {15534#true} is VALID [2020-07-11 01:09:08,584 INFO L280 TraceCheckUtils]: 8: Hoare triple {15534#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {15534#true} is VALID [2020-07-11 01:09:08,585 INFO L280 TraceCheckUtils]: 9: Hoare triple {15534#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L993 {15534#true} is VALID [2020-07-11 01:09:08,585 INFO L280 TraceCheckUtils]: 10: Hoare triple {15534#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-1 {15534#true} is VALID [2020-07-11 01:09:08,585 INFO L280 TraceCheckUtils]: 11: Hoare triple {15534#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {15534#true} is VALID [2020-07-11 01:09:08,585 INFO L280 TraceCheckUtils]: 12: Hoare triple {15534#true} goto; {15534#true} is VALID [2020-07-11 01:09:08,585 INFO L280 TraceCheckUtils]: 13: Hoare triple {15534#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {15534#true} is VALID [2020-07-11 01:09:08,586 INFO L280 TraceCheckUtils]: 14: Hoare triple {15534#true} assume 0 != #t~nondet1; {15534#true} is VALID [2020-07-11 01:09:08,586 INFO L280 TraceCheckUtils]: 15: Hoare triple {15534#true} havoc #t~nondet1; {15534#true} is VALID [2020-07-11 01:09:08,586 INFO L280 TraceCheckUtils]: 16: Hoare triple {15534#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-7 {15534#true} is VALID [2020-07-11 01:09:08,587 INFO L280 TraceCheckUtils]: 17: Hoare triple {15534#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-34 {15541#(and (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)) |main_#t~mem5.base|))} is VALID [2020-07-11 01:09:08,588 INFO L280 TraceCheckUtils]: 18: Hoare triple {15541#(and (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)) |main_#t~mem5.base|))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {15542#(or |main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))))} is VALID [2020-07-11 01:09:08,589 INFO L280 TraceCheckUtils]: 19: Hoare triple {15542#(or |main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))))} assume !#t~short7; {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:09:08,590 INFO L280 TraceCheckUtils]: 20: Hoare triple {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-22 {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:09:08,591 INFO L280 TraceCheckUtils]: 21: Hoare triple {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:09:08,592 INFO L280 TraceCheckUtils]: 22: Hoare triple {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !!#t~short7; {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:09:08,592 INFO L280 TraceCheckUtils]: 23: Hoare triple {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} havoc #t~mem5.base, #t~mem5.offset; {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:09:08,593 INFO L280 TraceCheckUtils]: 24: Hoare triple {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} havoc #t~mem6.base, #t~mem6.offset; {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:09:08,593 INFO L280 TraceCheckUtils]: 25: Hoare triple {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} havoc #t~short7; {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:09:08,594 INFO L280 TraceCheckUtils]: 26: Hoare triple {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} goto; {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:09:08,595 INFO L280 TraceCheckUtils]: 27: Hoare triple {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:09:08,595 INFO L280 TraceCheckUtils]: 28: Hoare triple {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:09:08,596 INFO L280 TraceCheckUtils]: 29: Hoare triple {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !(0 != #t~nondet8); {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:09:08,597 INFO L280 TraceCheckUtils]: 30: Hoare triple {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} havoc #t~nondet8; {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:09:08,598 INFO L280 TraceCheckUtils]: 31: Hoare triple {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} ~end~0.base, ~end~0.offset := 0, 0; {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:09:08,598 INFO L280 TraceCheckUtils]: 32: Hoare triple {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:09:08,599 INFO L280 TraceCheckUtils]: 33: Hoare triple {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:09:08,600 INFO L280 TraceCheckUtils]: 34: Hoare triple {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} goto; {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:09:08,601 INFO L280 TraceCheckUtils]: 35: Hoare triple {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:09:08,601 INFO L280 TraceCheckUtils]: 36: Hoare triple {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} ~len~0 := 0; {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:09:08,602 INFO L280 TraceCheckUtils]: 37: Hoare triple {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} SUMMARY for call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~end~0.base, 8 + ~end~0.offset, 4); srcloc: L1020 {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:09:08,603 INFO L280 TraceCheckUtils]: 38: Hoare triple {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} ~inner~0.base, ~inner~0.offset := #t~mem19.base, #t~mem19.offset; {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:09:08,604 INFO L280 TraceCheckUtils]: 39: Hoare triple {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} havoc #t~mem19.base, #t~mem19.offset; {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:09:08,604 INFO L280 TraceCheckUtils]: 40: Hoare triple {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:09:08,605 INFO L280 TraceCheckUtils]: 41: Hoare triple {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !!(~len~0 <= 1); {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:09:08,606 INFO L280 TraceCheckUtils]: 42: Hoare triple {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} goto; {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:09:08,607 INFO L280 TraceCheckUtils]: 43: Hoare triple {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} SUMMARY for call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1032-4 {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:09:08,608 INFO L280 TraceCheckUtils]: 44: Hoare triple {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} ~end~0.base, ~end~0.offset := #t~mem23.base, #t~mem23.offset; {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:09:08,608 INFO L280 TraceCheckUtils]: 45: Hoare triple {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} havoc #t~mem23.base, #t~mem23.offset; {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:09:08,609 INFO L280 TraceCheckUtils]: 46: Hoare triple {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:09:08,610 INFO L280 TraceCheckUtils]: 47: Hoare triple {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !!(0 != ~list~0.base || 0 != ~list~0.offset); {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-11 01:09:08,611 INFO L280 TraceCheckUtils]: 48: Hoare triple {15543#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} SUMMARY for call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L1040 {15544#(and (= 0 |main_#t~mem24.offset|) (= 0 |main_#t~mem24.base|))} is VALID [2020-07-11 01:09:08,612 INFO L280 TraceCheckUtils]: 49: Hoare triple {15544#(and (= 0 |main_#t~mem24.offset|) (= 0 |main_#t~mem24.base|))} ~end~0.base, ~end~0.offset := #t~mem24.base, #t~mem24.offset; {15545#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} is VALID [2020-07-11 01:09:08,612 INFO L280 TraceCheckUtils]: 50: Hoare triple {15545#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} havoc #t~mem24.base, #t~mem24.offset; {15545#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} is VALID [2020-07-11 01:09:08,613 INFO L280 TraceCheckUtils]: 51: Hoare triple {15545#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} assume 0 != ~end~0.base || 0 != ~end~0.offset; {15535#false} is VALID [2020-07-11 01:09:08,613 INFO L280 TraceCheckUtils]: 52: Hoare triple {15535#false} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {15535#false} is VALID [2020-07-11 01:09:08,613 INFO L280 TraceCheckUtils]: 53: Hoare triple {15535#false} assume !false; {15535#false} is VALID [2020-07-11 01:09:08,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-11 01:09:08,623 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [137112770] [2020-07-11 01:09:08,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:09:08,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-11 01:09:08,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537268422] [2020-07-11 01:09:08,625 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2020-07-11 01:09:08,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:09:08,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-11 01:09:08,715 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:09:08,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-11 01:09:08,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:09:08,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-11 01:09:08,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-11 01:09:08,716 INFO L87 Difference]: Start difference. First operand 213 states and 226 transitions. Second operand 8 states. [2020-07-11 01:09:13,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:09:13,109 INFO L93 Difference]: Finished difference Result 297 states and 316 transitions. [2020-07-11 01:09:13,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-11 01:09:13,110 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2020-07-11 01:09:13,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:09:13,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 01:09:13,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 267 transitions. [2020-07-11 01:09:13,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 01:09:13,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 267 transitions. [2020-07-11 01:09:13,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 267 transitions. [2020-07-11 01:09:13,494 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 267 edges. 267 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:09:13,499 INFO L225 Difference]: With dead ends: 297 [2020-07-11 01:09:13,500 INFO L226 Difference]: Without dead ends: 267 [2020-07-11 01:09:13,500 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-07-11 01:09:13,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2020-07-11 01:09:15,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 248. [2020-07-11 01:09:15,900 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:09:15,900 INFO L82 GeneralOperation]: Start isEquivalent. First operand 267 states. Second operand 248 states. [2020-07-11 01:09:15,900 INFO L74 IsIncluded]: Start isIncluded. First operand 267 states. Second operand 248 states. [2020-07-11 01:09:15,900 INFO L87 Difference]: Start difference. First operand 267 states. Second operand 248 states. [2020-07-11 01:09:15,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:09:15,907 INFO L93 Difference]: Finished difference Result 267 states and 284 transitions. [2020-07-11 01:09:15,907 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 284 transitions. [2020-07-11 01:09:15,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:09:15,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:09:15,908 INFO L74 IsIncluded]: Start isIncluded. First operand 248 states. Second operand 267 states. [2020-07-11 01:09:15,908 INFO L87 Difference]: Start difference. First operand 248 states. Second operand 267 states. [2020-07-11 01:09:15,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:09:15,914 INFO L93 Difference]: Finished difference Result 267 states and 284 transitions. [2020-07-11 01:09:15,914 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 284 transitions. [2020-07-11 01:09:15,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:09:15,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:09:15,915 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:09:15,915 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:09:15,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2020-07-11 01:09:15,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 268 transitions. [2020-07-11 01:09:15,920 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 268 transitions. Word has length 54 [2020-07-11 01:09:15,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:09:15,920 INFO L479 AbstractCegarLoop]: Abstraction has 248 states and 268 transitions. [2020-07-11 01:09:15,920 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-11 01:09:15,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 248 states and 268 transitions. [2020-07-11 01:09:16,895 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 268 edges. 268 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:09:16,895 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 268 transitions. [2020-07-11 01:09:16,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-11 01:09:16,897 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:09:16,897 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:09:16,897 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-11 01:09:16,897 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:09:16,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:09:16,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1270543956, now seen corresponding path program 1 times [2020-07-11 01:09:16,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:09:16,898 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [433460459] [2020-07-11 01:09:16,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:09:16,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:09:16,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:09:16,956 INFO L280 TraceCheckUtils]: 0: Hoare triple {17189#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {17181#true} is VALID [2020-07-11 01:09:16,956 INFO L280 TraceCheckUtils]: 1: Hoare triple {17181#true} #valid := #valid[0 := 0]; {17181#true} is VALID [2020-07-11 01:09:16,956 INFO L280 TraceCheckUtils]: 2: Hoare triple {17181#true} assume 0 < #StackHeapBarrier; {17181#true} is VALID [2020-07-11 01:09:16,957 INFO L280 TraceCheckUtils]: 3: Hoare triple {17181#true} assume true; {17181#true} is VALID [2020-07-11 01:09:16,957 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {17181#true} {17181#true} #414#return; {17181#true} is VALID [2020-07-11 01:09:16,958 INFO L263 TraceCheckUtils]: 0: Hoare triple {17181#true} call ULTIMATE.init(); {17189#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:09:16,958 INFO L280 TraceCheckUtils]: 1: Hoare triple {17189#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {17181#true} is VALID [2020-07-11 01:09:16,958 INFO L280 TraceCheckUtils]: 2: Hoare triple {17181#true} #valid := #valid[0 := 0]; {17181#true} is VALID [2020-07-11 01:09:16,958 INFO L280 TraceCheckUtils]: 3: Hoare triple {17181#true} assume 0 < #StackHeapBarrier; {17181#true} is VALID [2020-07-11 01:09:16,959 INFO L280 TraceCheckUtils]: 4: Hoare triple {17181#true} assume true; {17181#true} is VALID [2020-07-11 01:09:16,959 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {17181#true} {17181#true} #414#return; {17181#true} is VALID [2020-07-11 01:09:16,959 INFO L263 TraceCheckUtils]: 6: Hoare triple {17181#true} call #t~ret28 := main(); {17181#true} is VALID [2020-07-11 01:09:16,959 INFO L280 TraceCheckUtils]: 7: Hoare triple {17181#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {17181#true} is VALID [2020-07-11 01:09:16,959 INFO L280 TraceCheckUtils]: 8: Hoare triple {17181#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {17181#true} is VALID [2020-07-11 01:09:16,960 INFO L280 TraceCheckUtils]: 9: Hoare triple {17181#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L993 {17181#true} is VALID [2020-07-11 01:09:16,960 INFO L280 TraceCheckUtils]: 10: Hoare triple {17181#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-1 {17181#true} is VALID [2020-07-11 01:09:16,960 INFO L280 TraceCheckUtils]: 11: Hoare triple {17181#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {17181#true} is VALID [2020-07-11 01:09:16,960 INFO L280 TraceCheckUtils]: 12: Hoare triple {17181#true} goto; {17181#true} is VALID [2020-07-11 01:09:16,960 INFO L280 TraceCheckUtils]: 13: Hoare triple {17181#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {17181#true} is VALID [2020-07-11 01:09:16,960 INFO L280 TraceCheckUtils]: 14: Hoare triple {17181#true} assume 0 != #t~nondet1; {17181#true} is VALID [2020-07-11 01:09:16,961 INFO L280 TraceCheckUtils]: 15: Hoare triple {17181#true} havoc #t~nondet1; {17181#true} is VALID [2020-07-11 01:09:16,961 INFO L280 TraceCheckUtils]: 16: Hoare triple {17181#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-7 {17181#true} is VALID [2020-07-11 01:09:16,961 INFO L280 TraceCheckUtils]: 17: Hoare triple {17181#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-34 {17181#true} is VALID [2020-07-11 01:09:16,961 INFO L280 TraceCheckUtils]: 18: Hoare triple {17181#true} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {17181#true} is VALID [2020-07-11 01:09:16,961 INFO L280 TraceCheckUtils]: 19: Hoare triple {17181#true} assume !#t~short7; {17181#true} is VALID [2020-07-11 01:09:16,962 INFO L280 TraceCheckUtils]: 20: Hoare triple {17181#true} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-22 {17181#true} is VALID [2020-07-11 01:09:16,962 INFO L280 TraceCheckUtils]: 21: Hoare triple {17181#true} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {17181#true} is VALID [2020-07-11 01:09:16,962 INFO L280 TraceCheckUtils]: 22: Hoare triple {17181#true} assume !!#t~short7; {17181#true} is VALID [2020-07-11 01:09:16,962 INFO L280 TraceCheckUtils]: 23: Hoare triple {17181#true} havoc #t~mem5.base, #t~mem5.offset; {17181#true} is VALID [2020-07-11 01:09:16,962 INFO L280 TraceCheckUtils]: 24: Hoare triple {17181#true} havoc #t~mem6.base, #t~mem6.offset; {17181#true} is VALID [2020-07-11 01:09:16,962 INFO L280 TraceCheckUtils]: 25: Hoare triple {17181#true} havoc #t~short7; {17181#true} is VALID [2020-07-11 01:09:16,963 INFO L280 TraceCheckUtils]: 26: Hoare triple {17181#true} goto; {17181#true} is VALID [2020-07-11 01:09:16,963 INFO L280 TraceCheckUtils]: 27: Hoare triple {17181#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {17181#true} is VALID [2020-07-11 01:09:16,963 INFO L280 TraceCheckUtils]: 28: Hoare triple {17181#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {17181#true} is VALID [2020-07-11 01:09:16,963 INFO L280 TraceCheckUtils]: 29: Hoare triple {17181#true} assume !!(0 != #t~nondet8); {17181#true} is VALID [2020-07-11 01:09:16,963 INFO L280 TraceCheckUtils]: 30: Hoare triple {17181#true} havoc #t~nondet8; {17181#true} is VALID [2020-07-11 01:09:16,964 INFO L280 TraceCheckUtils]: 31: Hoare triple {17181#true} SUMMARY for call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(12); srcloc: L1003 {17181#true} is VALID [2020-07-11 01:09:16,964 INFO L280 TraceCheckUtils]: 32: Hoare triple {17181#true} SUMMARY for call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~end~0.base, ~end~0.offset, 4); srcloc: L1003-1 {17181#true} is VALID [2020-07-11 01:09:16,964 INFO L280 TraceCheckUtils]: 33: Hoare triple {17181#true} SUMMARY for call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1003-2 {17181#true} is VALID [2020-07-11 01:09:16,964 INFO L280 TraceCheckUtils]: 34: Hoare triple {17181#true} SUMMARY for call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem10.base, 4 + #t~mem10.offset, 4); srcloc: L1004 {17181#true} is VALID [2020-07-11 01:09:16,965 INFO L280 TraceCheckUtils]: 35: Hoare triple {17181#true} havoc #t~mem10.base, #t~mem10.offset; {17181#true} is VALID [2020-07-11 01:09:16,965 INFO L280 TraceCheckUtils]: 36: Hoare triple {17181#true} SUMMARY for call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1005 {17181#true} is VALID [2020-07-11 01:09:16,965 INFO L280 TraceCheckUtils]: 37: Hoare triple {17181#true} ~end~0.base, ~end~0.offset := #t~mem11.base, #t~mem11.offset; {17181#true} is VALID [2020-07-11 01:09:16,965 INFO L280 TraceCheckUtils]: 38: Hoare triple {17181#true} havoc #t~mem11.base, #t~mem11.offset; {17181#true} is VALID [2020-07-11 01:09:16,965 INFO L280 TraceCheckUtils]: 39: Hoare triple {17181#true} SUMMARY for call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); srcloc: L1006 {17181#true} is VALID [2020-07-11 01:09:16,966 INFO L280 TraceCheckUtils]: 40: Hoare triple {17181#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {17181#true} is VALID [2020-07-11 01:09:16,966 INFO L280 TraceCheckUtils]: 41: Hoare triple {17181#true} goto; {17181#true} is VALID [2020-07-11 01:09:16,966 INFO L280 TraceCheckUtils]: 42: Hoare triple {17181#true} assume !!(~end~0.base != 0 || ~end~0.offset != 0); {17181#true} is VALID [2020-07-11 01:09:16,966 INFO L280 TraceCheckUtils]: 43: Hoare triple {17181#true} goto; {17181#true} is VALID [2020-07-11 01:09:16,966 INFO L280 TraceCheckUtils]: 44: Hoare triple {17181#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647; {17181#true} is VALID [2020-07-11 01:09:16,967 INFO L280 TraceCheckUtils]: 45: Hoare triple {17181#true} assume 0 != #t~nondet12; {17181#true} is VALID [2020-07-11 01:09:16,967 INFO L280 TraceCheckUtils]: 46: Hoare triple {17181#true} havoc #t~nondet12; {17181#true} is VALID [2020-07-11 01:09:16,967 INFO L280 TraceCheckUtils]: 47: Hoare triple {17181#true} SUMMARY for call write~$Pointer$(0, 0, ~end~0.base, 8 + ~end~0.offset, 4); srcloc: L1008-7 {17181#true} is VALID [2020-07-11 01:09:16,967 INFO L280 TraceCheckUtils]: 48: Hoare triple {17181#true} SUMMARY for call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~end~0.base, 8 + ~end~0.offset, 4); srcloc: L1008-34 {17181#true} is VALID [2020-07-11 01:09:16,967 INFO L280 TraceCheckUtils]: 49: Hoare triple {17181#true} #t~short18 := #t~mem16.base != 0 || #t~mem16.offset != 0; {17181#true} is VALID [2020-07-11 01:09:16,980 INFO L280 TraceCheckUtils]: 50: Hoare triple {17181#true} assume #t~short18; {17188#|main_#t~short18|} is VALID [2020-07-11 01:09:16,988 INFO L280 TraceCheckUtils]: 51: Hoare triple {17188#|main_#t~short18|} assume !#t~short18; {17182#false} is VALID [2020-07-11 01:09:16,989 INFO L280 TraceCheckUtils]: 52: Hoare triple {17182#false} havoc #t~mem16.base, #t~mem16.offset; {17182#false} is VALID [2020-07-11 01:09:16,989 INFO L280 TraceCheckUtils]: 53: Hoare triple {17182#false} havoc #t~short18; {17182#false} is VALID [2020-07-11 01:09:16,989 INFO L280 TraceCheckUtils]: 54: Hoare triple {17182#false} havoc #t~mem17.base, #t~mem17.offset; {17182#false} is VALID [2020-07-11 01:09:16,989 INFO L280 TraceCheckUtils]: 55: Hoare triple {17182#false} assume !false; {17182#false} is VALID [2020-07-11 01:09:16,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 01:09:16,992 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [433460459] [2020-07-11 01:09:16,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:09:16,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-11 01:09:16,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073341420] [2020-07-11 01:09:16,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2020-07-11 01:09:16,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:09:16,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-11 01:09:17,072 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:09:17,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-11 01:09:17,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:09:17,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-11 01:09:17,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-11 01:09:17,074 INFO L87 Difference]: Start difference. First operand 248 states and 268 transitions. Second operand 4 states. [2020-07-11 01:09:20,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:09:20,104 INFO L93 Difference]: Finished difference Result 254 states and 274 transitions. [2020-07-11 01:09:20,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-11 01:09:20,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2020-07-11 01:09:20,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:09:20,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 01:09:20,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 170 transitions. [2020-07-11 01:09:20,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 01:09:20,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 170 transitions. [2020-07-11 01:09:20,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 170 transitions. [2020-07-11 01:09:20,333 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:09:20,338 INFO L225 Difference]: With dead ends: 254 [2020-07-11 01:09:20,338 INFO L226 Difference]: Without dead ends: 249 [2020-07-11 01:09:20,339 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-11 01:09:20,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2020-07-11 01:09:22,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2020-07-11 01:09:22,959 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:09:22,959 INFO L82 GeneralOperation]: Start isEquivalent. First operand 249 states. Second operand 249 states. [2020-07-11 01:09:22,959 INFO L74 IsIncluded]: Start isIncluded. First operand 249 states. Second operand 249 states. [2020-07-11 01:09:22,960 INFO L87 Difference]: Start difference. First operand 249 states. Second operand 249 states. [2020-07-11 01:09:22,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:09:22,964 INFO L93 Difference]: Finished difference Result 249 states and 269 transitions. [2020-07-11 01:09:22,964 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 269 transitions. [2020-07-11 01:09:22,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:09:22,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:09:22,965 INFO L74 IsIncluded]: Start isIncluded. First operand 249 states. Second operand 249 states. [2020-07-11 01:09:22,965 INFO L87 Difference]: Start difference. First operand 249 states. Second operand 249 states. [2020-07-11 01:09:22,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:09:22,969 INFO L93 Difference]: Finished difference Result 249 states and 269 transitions. [2020-07-11 01:09:22,969 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 269 transitions. [2020-07-11 01:09:22,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:09:22,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:09:22,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:09:22,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:09:22,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2020-07-11 01:09:22,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 269 transitions. [2020-07-11 01:09:22,975 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 269 transitions. Word has length 56 [2020-07-11 01:09:22,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:09:22,975 INFO L479 AbstractCegarLoop]: Abstraction has 249 states and 269 transitions. [2020-07-11 01:09:22,975 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-11 01:09:22,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 249 states and 269 transitions. [2020-07-11 01:09:23,932 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 269 edges. 269 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:09:23,932 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 269 transitions. [2020-07-11 01:09:23,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-11 01:09:23,934 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:09:23,934 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:09:23,934 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-11 01:09:23,934 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:09:23,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:09:23,935 INFO L82 PathProgramCache]: Analyzing trace with hash 2002844954, now seen corresponding path program 1 times [2020-07-11 01:09:23,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:09:23,935 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [455358702] [2020-07-11 01:09:23,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:09:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 01:09:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 01:09:24,002 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-11 01:09:24,003 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-11 01:09:24,003 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-11 01:09:24,073 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-11 01:09:24,073 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 01:09:24,073 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 01:09:24,074 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-11 01:09:24,074 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 01:09:24,074 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 01:09:24,074 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 01:09:24,074 WARN L170 areAnnotationChecker]: L992 has no Hoare annotation [2020-07-11 01:09:24,079 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-11 01:09:24,079 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-11 01:09:24,080 WARN L170 areAnnotationChecker]: L993 has no Hoare annotation [2020-07-11 01:09:24,080 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-11 01:09:24,080 WARN L170 areAnnotationChecker]: L993-1 has no Hoare annotation [2020-07-11 01:09:24,080 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-11 01:09:24,080 WARN L170 areAnnotationChecker]: L995-3 has no Hoare annotation [2020-07-11 01:09:24,080 WARN L170 areAnnotationChecker]: L995-3 has no Hoare annotation [2020-07-11 01:09:24,080 WARN L170 areAnnotationChecker]: L995-3 has no Hoare annotation [2020-07-11 01:09:24,080 WARN L170 areAnnotationChecker]: L995-4 has no Hoare annotation [2020-07-11 01:09:24,084 WARN L170 areAnnotationChecker]: L995 has no Hoare annotation [2020-07-11 01:09:24,084 WARN L170 areAnnotationChecker]: L995 has no Hoare annotation [2020-07-11 01:09:24,085 WARN L170 areAnnotationChecker]: L995-2 has no Hoare annotation [2020-07-11 01:09:24,085 WARN L170 areAnnotationChecker]: L995-2 has no Hoare annotation [2020-07-11 01:09:24,085 WARN L170 areAnnotationChecker]: L995-5 has no Hoare annotation [2020-07-11 01:09:24,085 WARN L170 areAnnotationChecker]: L995-5 has no Hoare annotation [2020-07-11 01:09:24,085 WARN L170 areAnnotationChecker]: L995-6 has no Hoare annotation [2020-07-11 01:09:24,085 WARN L170 areAnnotationChecker]: L995-9 has no Hoare annotation [2020-07-11 01:09:24,085 WARN L170 areAnnotationChecker]: L995-7 has no Hoare annotation [2020-07-11 01:09:24,085 WARN L170 areAnnotationChecker]: L995-10 has no Hoare annotation [2020-07-11 01:09:24,086 WARN L170 areAnnotationChecker]: L995-34 has no Hoare annotation [2020-07-11 01:09:24,086 WARN L170 areAnnotationChecker]: L995-34 has no Hoare annotation [2020-07-11 01:09:24,086 WARN L170 areAnnotationChecker]: L995-11 has no Hoare annotation [2020-07-11 01:09:24,086 WARN L170 areAnnotationChecker]: L995-19 has no Hoare annotation [2020-07-11 01:09:24,086 WARN L170 areAnnotationChecker]: L995-35 has no Hoare annotation [2020-07-11 01:09:24,086 WARN L170 areAnnotationChecker]: L995-12 has no Hoare annotation [2020-07-11 01:09:24,086 WARN L170 areAnnotationChecker]: L995-20 has no Hoare annotation [2020-07-11 01:09:24,086 WARN L170 areAnnotationChecker]: L995-20 has no Hoare annotation [2020-07-11 01:09:24,086 WARN L170 areAnnotationChecker]: L1008-35 has no Hoare annotation [2020-07-11 01:09:24,087 WARN L170 areAnnotationChecker]: L1008-35 has no Hoare annotation [2020-07-11 01:09:24,087 WARN L170 areAnnotationChecker]: L995-13 has no Hoare annotation [2020-07-11 01:09:24,087 WARN L170 areAnnotationChecker]: L995-24 has no Hoare annotation [2020-07-11 01:09:24,087 WARN L170 areAnnotationChecker]: L995-24 has no Hoare annotation [2020-07-11 01:09:24,087 WARN L170 areAnnotationChecker]: L995-22 has no Hoare annotation [2020-07-11 01:09:24,087 WARN L170 areAnnotationChecker]: L1000-5 has no Hoare annotation [2020-07-11 01:09:24,087 WARN L170 areAnnotationChecker]: L1000-1 has no Hoare annotation [2020-07-11 01:09:24,087 WARN L170 areAnnotationChecker]: L1000-1 has no Hoare annotation [2020-07-11 01:09:24,087 WARN L170 areAnnotationChecker]: L995-14 has no Hoare annotation [2020-07-11 01:09:24,088 WARN L170 areAnnotationChecker]: L995-25 has no Hoare annotation [2020-07-11 01:09:24,088 WARN L170 areAnnotationChecker]: L995-30 has no Hoare annotation [2020-07-11 01:09:24,088 WARN L170 areAnnotationChecker]: L995-23 has no Hoare annotation [2020-07-11 01:09:24,088 WARN L170 areAnnotationChecker]: L1012 has no Hoare annotation [2020-07-11 01:09:24,088 WARN L170 areAnnotationChecker]: L1000-2 has no Hoare annotation [2020-07-11 01:09:24,088 WARN L170 areAnnotationChecker]: L1000-4 has no Hoare annotation [2020-07-11 01:09:24,088 WARN L170 areAnnotationChecker]: L995-15 has no Hoare annotation [2020-07-11 01:09:24,088 WARN L170 areAnnotationChecker]: L995-26 has no Hoare annotation [2020-07-11 01:09:24,089 WARN L170 areAnnotationChecker]: L995-31 has no Hoare annotation [2020-07-11 01:09:24,089 WARN L170 areAnnotationChecker]: L1015-4 has no Hoare annotation [2020-07-11 01:09:24,089 WARN L170 areAnnotationChecker]: L1015-4 has no Hoare annotation [2020-07-11 01:09:24,089 WARN L170 areAnnotationChecker]: L1015-4 has no Hoare annotation [2020-07-11 01:09:24,089 WARN L170 areAnnotationChecker]: L1003 has no Hoare annotation [2020-07-11 01:09:24,089 WARN L170 areAnnotationChecker]: L995-16 has no Hoare annotation [2020-07-11 01:09:24,089 WARN L170 areAnnotationChecker]: L995-27 has no Hoare annotation [2020-07-11 01:09:24,089 WARN L170 areAnnotationChecker]: L995-32 has no Hoare annotation [2020-07-11 01:09:24,089 WARN L170 areAnnotationChecker]: L1017-1 has no Hoare annotation [2020-07-11 01:09:24,090 WARN L170 areAnnotationChecker]: L1017-1 has no Hoare annotation [2020-07-11 01:09:24,090 WARN L170 areAnnotationChecker]: L1017-1 has no Hoare annotation [2020-07-11 01:09:24,090 WARN L170 areAnnotationChecker]: L1015-1 has no Hoare annotation [2020-07-11 01:09:24,090 WARN L170 areAnnotationChecker]: L1015-1 has no Hoare annotation [2020-07-11 01:09:24,090 WARN L170 areAnnotationChecker]: L1015-3 has no Hoare annotation [2020-07-11 01:09:24,090 WARN L170 areAnnotationChecker]: L1015-3 has no Hoare annotation [2020-07-11 01:09:24,090 WARN L170 areAnnotationChecker]: L1003-1 has no Hoare annotation [2020-07-11 01:09:24,090 WARN L170 areAnnotationChecker]: L995-17 has no Hoare annotation [2020-07-11 01:09:24,090 WARN L170 areAnnotationChecker]: L995-28 has no Hoare annotation [2020-07-11 01:09:24,091 WARN L170 areAnnotationChecker]: L995-28 has no Hoare annotation [2020-07-11 01:09:24,091 WARN L170 areAnnotationChecker]: L995-33 has no Hoare annotation [2020-07-11 01:09:24,091 WARN L170 areAnnotationChecker]: L995-33 has no Hoare annotation [2020-07-11 01:09:24,091 WARN L170 areAnnotationChecker]: L1038-1 has no Hoare annotation [2020-07-11 01:09:24,091 WARN L170 areAnnotationChecker]: L1038-1 has no Hoare annotation [2020-07-11 01:09:24,091 WARN L170 areAnnotationChecker]: L1038-1 has no Hoare annotation [2020-07-11 01:09:24,092 WARN L170 areAnnotationChecker]: L1019 has no Hoare annotation [2020-07-11 01:09:24,092 WARN L170 areAnnotationChecker]: L1003-2 has no Hoare annotation [2020-07-11 01:09:24,092 WARN L170 areAnnotationChecker]: L1038-2 has no Hoare annotation [2020-07-11 01:09:24,092 WARN L170 areAnnotationChecker]: L1040 has no Hoare annotation [2020-07-11 01:09:24,092 WARN L170 areAnnotationChecker]: L1020 has no Hoare annotation [2020-07-11 01:09:24,092 WARN L170 areAnnotationChecker]: L1004 has no Hoare annotation [2020-07-11 01:09:24,092 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-11 01:09:24,092 WARN L170 areAnnotationChecker]: L1040-1 has no Hoare annotation [2020-07-11 01:09:24,092 WARN L170 areAnnotationChecker]: L1020-1 has no Hoare annotation [2020-07-11 01:09:24,093 WARN L170 areAnnotationChecker]: L1004-1 has no Hoare annotation [2020-07-11 01:09:24,093 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-11 01:09:24,093 WARN L170 areAnnotationChecker]: L1040-2 has no Hoare annotation [2020-07-11 01:09:24,093 WARN L170 areAnnotationChecker]: L1020-2 has no Hoare annotation [2020-07-11 01:09:24,093 WARN L170 areAnnotationChecker]: L1005 has no Hoare annotation [2020-07-11 01:09:24,093 WARN L170 areAnnotationChecker]: L1042 has no Hoare annotation [2020-07-11 01:09:24,093 WARN L170 areAnnotationChecker]: L1042 has no Hoare annotation [2020-07-11 01:09:24,093 WARN L170 areAnnotationChecker]: L1021-2 has no Hoare annotation [2020-07-11 01:09:24,093 WARN L170 areAnnotationChecker]: L1021-2 has no Hoare annotation [2020-07-11 01:09:24,094 WARN L170 areAnnotationChecker]: L1021-2 has no Hoare annotation [2020-07-11 01:09:24,094 WARN L170 areAnnotationChecker]: L1005-1 has no Hoare annotation [2020-07-11 01:09:24,094 WARN L170 areAnnotationChecker]: L1044-4 has no Hoare annotation [2020-07-11 01:09:24,094 WARN L170 areAnnotationChecker]: L1044-4 has no Hoare annotation [2020-07-11 01:09:24,094 WARN L170 areAnnotationChecker]: L1044-4 has no Hoare annotation [2020-07-11 01:09:24,094 WARN L170 areAnnotationChecker]: L1042-2 has no Hoare annotation [2020-07-11 01:09:24,094 WARN L170 areAnnotationChecker]: L1032-3 has no Hoare annotation [2020-07-11 01:09:24,094 WARN L170 areAnnotationChecker]: L1032-3 has no Hoare annotation [2020-07-11 01:09:24,095 WARN L170 areAnnotationChecker]: L1032-3 has no Hoare annotation [2020-07-11 01:09:24,095 WARN L170 areAnnotationChecker]: L1023 has no Hoare annotation [2020-07-11 01:09:24,095 WARN L170 areAnnotationChecker]: L1023 has no Hoare annotation [2020-07-11 01:09:24,095 WARN L170 areAnnotationChecker]: L1005-2 has no Hoare annotation [2020-07-11 01:09:24,095 WARN L170 areAnnotationChecker]: L1045-6 has no Hoare annotation [2020-07-11 01:09:24,095 WARN L170 areAnnotationChecker]: L1045-6 has no Hoare annotation [2020-07-11 01:09:24,095 WARN L170 areAnnotationChecker]: L1044-1 has no Hoare annotation [2020-07-11 01:09:24,095 WARN L170 areAnnotationChecker]: L1044-1 has no Hoare annotation [2020-07-11 01:09:24,095 WARN L170 areAnnotationChecker]: L1044-3 has no Hoare annotation [2020-07-11 01:09:24,096 WARN L170 areAnnotationChecker]: L1044-3 has no Hoare annotation [2020-07-11 01:09:24,096 WARN L170 areAnnotationChecker]: L1050 has no Hoare annotation [2020-07-11 01:09:24,096 WARN L170 areAnnotationChecker]: L1032-4 has no Hoare annotation [2020-07-11 01:09:24,096 WARN L170 areAnnotationChecker]: L1032 has no Hoare annotation [2020-07-11 01:09:24,096 WARN L170 areAnnotationChecker]: L1032 has no Hoare annotation [2020-07-11 01:09:24,096 WARN L170 areAnnotationChecker]: L1032-2 has no Hoare annotation [2020-07-11 01:09:24,096 WARN L170 areAnnotationChecker]: L1032-2 has no Hoare annotation [2020-07-11 01:09:24,097 WARN L170 areAnnotationChecker]: L1024 has no Hoare annotation [2020-07-11 01:09:24,097 WARN L170 areAnnotationChecker]: L1026 has no Hoare annotation [2020-07-11 01:09:24,097 WARN L170 areAnnotationChecker]: L1006 has no Hoare annotation [2020-07-11 01:09:24,097 WARN L170 areAnnotationChecker]: L1045 has no Hoare annotation [2020-07-11 01:09:24,097 WARN L170 areAnnotationChecker]: L1045 has no Hoare annotation [2020-07-11 01:09:24,097 WARN L170 areAnnotationChecker]: L1046-6 has no Hoare annotation [2020-07-11 01:09:24,097 WARN L170 areAnnotationChecker]: L1046-6 has no Hoare annotation [2020-07-11 01:09:24,097 WARN L170 areAnnotationChecker]: L1050-1 has no Hoare annotation [2020-07-11 01:09:24,097 WARN L170 areAnnotationChecker]: L1034 has no Hoare annotation [2020-07-11 01:09:24,098 WARN L170 areAnnotationChecker]: L1027-3 has no Hoare annotation [2020-07-11 01:09:24,098 WARN L170 areAnnotationChecker]: L1027-3 has no Hoare annotation [2020-07-11 01:09:24,098 WARN L170 areAnnotationChecker]: L1027-3 has no Hoare annotation [2020-07-11 01:09:24,098 WARN L170 areAnnotationChecker]: L1007-3 has no Hoare annotation [2020-07-11 01:09:24,098 WARN L170 areAnnotationChecker]: L1007-3 has no Hoare annotation [2020-07-11 01:09:24,098 WARN L170 areAnnotationChecker]: L1007-3 has no Hoare annotation [2020-07-11 01:09:24,098 WARN L170 areAnnotationChecker]: L1045-1 has no Hoare annotation [2020-07-11 01:09:24,098 WARN L170 areAnnotationChecker]: L1045-4 has no Hoare annotation [2020-07-11 01:09:24,098 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2020-07-11 01:09:24,099 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2020-07-11 01:09:24,099 WARN L170 areAnnotationChecker]: L1046-7 has no Hoare annotation [2020-07-11 01:09:24,099 WARN L170 areAnnotationChecker]: L1051 has no Hoare annotation [2020-07-11 01:09:24,099 WARN L170 areAnnotationChecker]: L1034-1 has no Hoare annotation [2020-07-11 01:09:24,099 WARN L170 areAnnotationChecker]: L1028-6 has no Hoare annotation [2020-07-11 01:09:24,099 WARN L170 areAnnotationChecker]: L1028-6 has no Hoare annotation [2020-07-11 01:09:24,099 WARN L170 areAnnotationChecker]: L1027 has no Hoare annotation [2020-07-11 01:09:24,099 WARN L170 areAnnotationChecker]: L1027 has no Hoare annotation [2020-07-11 01:09:24,099 WARN L170 areAnnotationChecker]: L1027-2 has no Hoare annotation [2020-07-11 01:09:24,100 WARN L170 areAnnotationChecker]: L1027-2 has no Hoare annotation [2020-07-11 01:09:24,100 WARN L170 areAnnotationChecker]: L1008-3 has no Hoare annotation [2020-07-11 01:09:24,100 WARN L170 areAnnotationChecker]: L1008-3 has no Hoare annotation [2020-07-11 01:09:24,100 WARN L170 areAnnotationChecker]: L1008-3 has no Hoare annotation [2020-07-11 01:09:24,100 WARN L170 areAnnotationChecker]: L1007 has no Hoare annotation [2020-07-11 01:09:24,100 WARN L170 areAnnotationChecker]: L1007 has no Hoare annotation [2020-07-11 01:09:24,100 WARN L170 areAnnotationChecker]: L1007-2 has no Hoare annotation [2020-07-11 01:09:24,100 WARN L170 areAnnotationChecker]: L1007-2 has no Hoare annotation [2020-07-11 01:09:24,100 WARN L170 areAnnotationChecker]: L1045-2 has no Hoare annotation [2020-07-11 01:09:24,100 WARN L170 areAnnotationChecker]: L1045-2 has no Hoare annotation [2020-07-11 01:09:24,101 WARN L170 areAnnotationChecker]: L1045-5 has no Hoare annotation [2020-07-11 01:09:24,101 WARN L170 areAnnotationChecker]: L1045-5 has no Hoare annotation [2020-07-11 01:09:24,101 WARN L170 areAnnotationChecker]: L1046-1 has no Hoare annotation [2020-07-11 01:09:24,101 WARN L170 areAnnotationChecker]: L1046-4 has no Hoare annotation [2020-07-11 01:09:24,101 WARN L170 areAnnotationChecker]: L1047 has no Hoare annotation [2020-07-11 01:09:24,101 WARN L170 areAnnotationChecker]: L1051-1 has no Hoare annotation [2020-07-11 01:09:24,101 WARN L170 areAnnotationChecker]: L1028 has no Hoare annotation [2020-07-11 01:09:24,101 WARN L170 areAnnotationChecker]: L1028 has no Hoare annotation [2020-07-11 01:09:24,101 WARN L170 areAnnotationChecker]: L1029-6 has no Hoare annotation [2020-07-11 01:09:24,101 WARN L170 areAnnotationChecker]: L1029-6 has no Hoare annotation [2020-07-11 01:09:24,102 WARN L170 areAnnotationChecker]: L1008-4 has no Hoare annotation [2020-07-11 01:09:24,102 WARN L170 areAnnotationChecker]: L1008 has no Hoare annotation [2020-07-11 01:09:24,102 WARN L170 areAnnotationChecker]: L1008 has no Hoare annotation [2020-07-11 01:09:24,102 WARN L170 areAnnotationChecker]: L1008-2 has no Hoare annotation [2020-07-11 01:09:24,102 WARN L170 areAnnotationChecker]: L1008-2 has no Hoare annotation [2020-07-11 01:09:24,102 WARN L170 areAnnotationChecker]: L1046-2 has no Hoare annotation [2020-07-11 01:09:24,102 WARN L170 areAnnotationChecker]: L1046-2 has no Hoare annotation [2020-07-11 01:09:24,102 WARN L170 areAnnotationChecker]: L1046-5 has no Hoare annotation [2020-07-11 01:09:24,102 WARN L170 areAnnotationChecker]: L1046-5 has no Hoare annotation [2020-07-11 01:09:24,103 WARN L170 areAnnotationChecker]: L1028-1 has no Hoare annotation [2020-07-11 01:09:24,103 WARN L170 areAnnotationChecker]: L1028-4 has no Hoare annotation [2020-07-11 01:09:24,103 WARN L170 areAnnotationChecker]: L1029 has no Hoare annotation [2020-07-11 01:09:24,103 WARN L170 areAnnotationChecker]: L1029 has no Hoare annotation [2020-07-11 01:09:24,103 WARN L170 areAnnotationChecker]: L1029-7 has no Hoare annotation [2020-07-11 01:09:24,103 WARN L170 areAnnotationChecker]: L1008-5 has no Hoare annotation [2020-07-11 01:09:24,103 WARN L170 areAnnotationChecker]: L1008-5 has no Hoare annotation [2020-07-11 01:09:24,103 WARN L170 areAnnotationChecker]: L1028-2 has no Hoare annotation [2020-07-11 01:09:24,103 WARN L170 areAnnotationChecker]: L1028-2 has no Hoare annotation [2020-07-11 01:09:24,104 WARN L170 areAnnotationChecker]: L1028-5 has no Hoare annotation [2020-07-11 01:09:24,104 WARN L170 areAnnotationChecker]: L1028-5 has no Hoare annotation [2020-07-11 01:09:24,104 WARN L170 areAnnotationChecker]: L1029-1 has no Hoare annotation [2020-07-11 01:09:24,104 WARN L170 areAnnotationChecker]: L1029-4 has no Hoare annotation [2020-07-11 01:09:24,104 WARN L170 areAnnotationChecker]: L1030 has no Hoare annotation [2020-07-11 01:09:24,104 WARN L170 areAnnotationChecker]: L1008-6 has no Hoare annotation [2020-07-11 01:09:24,104 WARN L170 areAnnotationChecker]: L1008-9 has no Hoare annotation [2020-07-11 01:09:24,104 WARN L170 areAnnotationChecker]: L1029-2 has no Hoare annotation [2020-07-11 01:09:24,104 WARN L170 areAnnotationChecker]: L1029-2 has no Hoare annotation [2020-07-11 01:09:24,104 WARN L170 areAnnotationChecker]: L1029-5 has no Hoare annotation [2020-07-11 01:09:24,104 WARN L170 areAnnotationChecker]: L1029-5 has no Hoare annotation [2020-07-11 01:09:24,105 WARN L170 areAnnotationChecker]: L1030-1 has no Hoare annotation [2020-07-11 01:09:24,105 WARN L170 areAnnotationChecker]: L1008-7 has no Hoare annotation [2020-07-11 01:09:24,105 WARN L170 areAnnotationChecker]: L1008-10 has no Hoare annotation [2020-07-11 01:09:24,105 WARN L170 areAnnotationChecker]: L1008-34 has no Hoare annotation [2020-07-11 01:09:24,105 WARN L170 areAnnotationChecker]: L1008-34 has no Hoare annotation [2020-07-11 01:09:24,105 WARN L170 areAnnotationChecker]: L1008-11 has no Hoare annotation [2020-07-11 01:09:24,105 WARN L170 areAnnotationChecker]: L1008-19 has no Hoare annotation [2020-07-11 01:09:24,105 WARN L170 areAnnotationChecker]: L1008-12 has no Hoare annotation [2020-07-11 01:09:24,105 WARN L170 areAnnotationChecker]: L1008-20 has no Hoare annotation [2020-07-11 01:09:24,105 WARN L170 areAnnotationChecker]: L1008-20 has no Hoare annotation [2020-07-11 01:09:24,106 WARN L170 areAnnotationChecker]: L1008-13 has no Hoare annotation [2020-07-11 01:09:24,106 WARN L170 areAnnotationChecker]: L1008-24 has no Hoare annotation [2020-07-11 01:09:24,106 WARN L170 areAnnotationChecker]: L1008-24 has no Hoare annotation [2020-07-11 01:09:24,106 WARN L170 areAnnotationChecker]: L1008-22 has no Hoare annotation [2020-07-11 01:09:24,106 WARN L170 areAnnotationChecker]: L1008-14 has no Hoare annotation [2020-07-11 01:09:24,106 WARN L170 areAnnotationChecker]: L1008-25 has no Hoare annotation [2020-07-11 01:09:24,106 WARN L170 areAnnotationChecker]: L1008-30 has no Hoare annotation [2020-07-11 01:09:24,106 WARN L170 areAnnotationChecker]: L1008-23 has no Hoare annotation [2020-07-11 01:09:24,106 WARN L170 areAnnotationChecker]: L1008-15 has no Hoare annotation [2020-07-11 01:09:24,106 WARN L170 areAnnotationChecker]: L1008-26 has no Hoare annotation [2020-07-11 01:09:24,107 WARN L170 areAnnotationChecker]: L1008-31 has no Hoare annotation [2020-07-11 01:09:24,107 WARN L170 areAnnotationChecker]: L1008-16 has no Hoare annotation [2020-07-11 01:09:24,107 WARN L170 areAnnotationChecker]: L1008-27 has no Hoare annotation [2020-07-11 01:09:24,107 WARN L170 areAnnotationChecker]: L1008-32 has no Hoare annotation [2020-07-11 01:09:24,107 WARN L170 areAnnotationChecker]: L1008-17 has no Hoare annotation [2020-07-11 01:09:24,107 WARN L170 areAnnotationChecker]: L1008-28 has no Hoare annotation [2020-07-11 01:09:24,107 WARN L170 areAnnotationChecker]: L1008-28 has no Hoare annotation [2020-07-11 01:09:24,107 WARN L170 areAnnotationChecker]: L1008-33 has no Hoare annotation [2020-07-11 01:09:24,107 WARN L170 areAnnotationChecker]: L1008-33 has no Hoare annotation [2020-07-11 01:09:24,108 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:09:24,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 01:09:24 BoogieIcfgContainer [2020-07-11 01:09:24,120 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 01:09:24,127 INFO L168 Benchmark]: Toolchain (without parser) took 73197.73 ms. Allocated memory was 144.7 MB in the beginning and 513.3 MB in the end (delta: 368.6 MB). Free memory was 101.3 MB in the beginning and 172.7 MB in the end (delta: -71.4 MB). Peak memory consumption was 297.2 MB. Max. memory is 7.1 GB. [2020-07-11 01:09:24,130 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 144.7 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-11 01:09:24,130 INFO L168 Benchmark]: CACSL2BoogieTranslator took 737.60 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 101.1 MB in the beginning and 168.6 MB in the end (delta: -67.4 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2020-07-11 01:09:24,131 INFO L168 Benchmark]: Boogie Preprocessor took 97.29 ms. Allocated memory is still 201.9 MB. Free memory was 168.6 MB in the beginning and 163.8 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. [2020-07-11 01:09:24,131 INFO L168 Benchmark]: RCFGBuilder took 1081.27 ms. Allocated memory was 201.9 MB in the beginning and 234.4 MB in the end (delta: 32.5 MB). Free memory was 163.8 MB in the beginning and 192.9 MB in the end (delta: -29.1 MB). Peak memory consumption was 81.5 MB. Max. memory is 7.1 GB. [2020-07-11 01:09:24,132 INFO L168 Benchmark]: TraceAbstraction took 71275.73 ms. Allocated memory was 234.4 MB in the beginning and 513.3 MB in the end (delta: 278.9 MB). Free memory was 191.5 MB in the beginning and 172.7 MB in the end (delta: 18.7 MB). Peak memory consumption was 297.7 MB. Max. memory is 7.1 GB. [2020-07-11 01:09:24,134 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.21 ms. Allocated memory is still 144.7 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 737.60 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 101.1 MB in the beginning and 168.6 MB in the end (delta: -67.4 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 97.29 ms. Allocated memory is still 201.9 MB. Free memory was 168.6 MB in the beginning and 163.8 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1081.27 ms. Allocated memory was 201.9 MB in the beginning and 234.4 MB in the end (delta: 32.5 MB). Free memory was 163.8 MB in the beginning and 192.9 MB in the end (delta: -29.1 MB). Peak memory consumption was 81.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 71275.73 ms. Allocated memory was 234.4 MB in the beginning and 513.3 MB in the end (delta: 278.9 MB). Free memory was 191.5 MB in the beginning and 172.7 MB in the end (delta: 18.7 MB). Peak memory consumption was 297.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1029]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L992] SLL* list = malloc(sizeof(SLL)); VAL [list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L993] list->next = ((void*)0) VAL [list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L994] list->prev = ((void*)0) VAL [list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L995] COND FALSE !(!(list != ((void*)0))) VAL [list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L995] COND FALSE !(__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L995] list->inner = malloc(sizeof(SLL)) VAL [list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] [L995] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] [L995] list->inner->next = ((void*)0) VAL [list={-1:0}, list->inner={-2:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] [L995] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] [L995] list->inner->inner = ((void*)0) VAL [list={-1:0}, list->inner={-2:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L995] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] [L995] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={-1:0}, list->inner={-2:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L995] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) VAL [list={-1:0}, list->inner={-2:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L997] SLL* end = list; VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1011] end = ((void*)0) VAL [end={0:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1012] end = list VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1015] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1017] COND TRUE ((void*)0) != end VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1019] int len = 0; VAL [end={-1:0}, len=0, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1020] EXPR end->inner VAL [end={-1:0}, end->inner={-2:0}, len=0, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1020] SLL* inner = end->inner; VAL [end={-1:0}, end->inner={-2:0}, inner={-2:0}, len=0, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1021] COND TRUE ((void*)0) != inner VAL [end={-1:0}, inner={-2:0}, len=0, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1023] COND TRUE len == 0 VAL [end={-1:0}, inner={-2:0}, len=0, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1024] len = 1 VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1027] COND FALSE !(!(((void*)0) != inner)) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1028] EXPR inner->inner VAL [end={-1:0}, inner={-2:0}, inner->inner={0:0}, len=1, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1028] COND FALSE !(!(((void*)0) == inner->inner)) VAL [end={-1:0}, inner={-2:0}, inner->inner={0:0}, len=1, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1029] EXPR inner->next VAL [end={-1:0}, inner={-2:0}, inner->next={0:0}, len=1, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1029] COND TRUE !(((void*)0) != inner->next) VAL [end={-1:0}, inner={-2:0}, inner->next={0:0}, len=1, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1029] __VERIFIER_error() VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 171 locations, 13 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 71.0s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 48.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1955 SDtfs, 3708 SDslu, 5613 SDs, 0 SdLazy, 4052 SolverSat, 117 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=249occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 13.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 929 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 534 NumberOfCodeBlocks, 534 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 464 ConstructedInterpolants, 0 QuantifiedInterpolants, 152284 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 1/1 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...