/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-267fbe0 [2020-07-18 05:14:28,811 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 05:14:28,814 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 05:14:28,832 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 05:14:28,833 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 05:14:28,834 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 05:14:28,836 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 05:14:28,847 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 05:14:28,850 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 05:14:28,853 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 05:14:28,855 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 05:14:28,857 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 05:14:28,857 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 05:14:28,859 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 05:14:28,861 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 05:14:28,863 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 05:14:28,864 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 05:14:28,865 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 05:14:28,867 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 05:14:28,872 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 05:14:28,877 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 05:14:28,880 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 05:14:28,881 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 05:14:28,882 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 05:14:28,885 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 05:14:28,885 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 05:14:28,885 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 05:14:28,888 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 05:14:28,889 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 05:14:28,891 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 05:14:28,891 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 05:14:28,892 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 05:14:28,893 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 05:14:28,894 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 05:14:28,895 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 05:14:28,895 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 05:14:28,895 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 05:14:28,896 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 05:14:28,896 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 05:14:28,896 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 05:14:28,898 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 05:14:28,899 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 05:14:28,927 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 05:14:28,928 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 05:14:28,929 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 05:14:28,932 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 05:14:28,933 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 05:14:28,933 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 05:14:28,933 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 05:14:28,933 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 05:14:28,933 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 05:14:28,933 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 05:14:28,934 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 05:14:28,934 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 05:14:28,934 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 05:14:28,934 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 05:14:28,934 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 05:14:28,935 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 05:14:28,935 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 05:14:28,935 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 05:14:28,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 05:14:28,938 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 05:14:28,938 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 05:14:28,938 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 05:14:28,938 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-18 05:14:29,248 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 05:14:29,268 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 05:14:29,273 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 05:14:29,275 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 05:14:29,275 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 05:14:29,276 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-18 05:14:29,353 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53a2cd974/6aeccfe151ad478ab5c3eb57c9247b0a/FLAGc36bf0902 [2020-07-18 05:14:29,907 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 05:14:29,908 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i [2020-07-18 05:14:29,919 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53a2cd974/6aeccfe151ad478ab5c3eb57c9247b0a/FLAGc36bf0902 [2020-07-18 05:14:30,177 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53a2cd974/6aeccfe151ad478ab5c3eb57c9247b0a [2020-07-18 05:14:30,187 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 05:14:30,189 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 05:14:30,190 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 05:14:30,191 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 05:14:30,194 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 05:14:30,196 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 05:14:30" (1/1) ... [2020-07-18 05:14:30,199 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74099987 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:14:30, skipping insertion in model container [2020-07-18 05:14:30,199 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 05:14:30" (1/1) ... [2020-07-18 05:14:30,207 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 05:14:30,261 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 05:14:30,765 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 05:14:30,783 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 05:14:30,891 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 05:14:30,955 INFO L208 MainTranslator]: Completed translation [2020-07-18 05:14:30,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:14:30 WrapperNode [2020-07-18 05:14:30,956 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 05:14:30,956 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 05:14:30,956 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 05:14:30,957 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 05:14:30,972 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:14:30" (1/1) ... [2020-07-18 05:14:30,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:14:30" (1/1) ... [2020-07-18 05:14:30,989 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:14:30" (1/1) ... [2020-07-18 05:14:30,989 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:14:30" (1/1) ... [2020-07-18 05:14:31,022 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:14:30" (1/1) ... [2020-07-18 05:14:31,045 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:14:30" (1/1) ... [2020-07-18 05:14:31,050 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:14:30" (1/1) ... [2020-07-18 05:14:31,060 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 05:14:31,060 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 05:14:31,060 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 05:14:31,060 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 05:14:31,062 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:14:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 05:14:31,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 05:14:31,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 05:14:31,125 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 05:14:31,125 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-18 05:14:31,126 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-18 05:14:31,126 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-18 05:14:31,126 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-18 05:14:31,126 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-18 05:14:31,126 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-18 05:14:31,126 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-18 05:14:31,126 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-18 05:14:31,126 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-18 05:14:31,127 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-18 05:14:31,127 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-18 05:14:31,127 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-18 05:14:31,127 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-18 05:14:31,127 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-18 05:14:31,127 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-18 05:14:31,128 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-18 05:14:31,128 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-18 05:14:31,128 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-18 05:14:31,128 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-18 05:14:31,129 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-18 05:14:31,129 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-18 05:14:31,130 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-18 05:14:31,130 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-18 05:14:31,130 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-18 05:14:31,130 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-18 05:14:31,130 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-18 05:14:31,130 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-18 05:14:31,130 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-18 05:14:31,131 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-18 05:14:31,131 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-18 05:14:31,131 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-18 05:14:31,131 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-18 05:14:31,131 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-18 05:14:31,131 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-18 05:14:31,132 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-18 05:14:31,132 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-18 05:14:31,132 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-18 05:14:31,132 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-18 05:14:31,132 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-18 05:14:31,132 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-18 05:14:31,132 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-18 05:14:31,133 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-18 05:14:31,133 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-18 05:14:31,133 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-18 05:14:31,133 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-18 05:14:31,133 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-18 05:14:31,133 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-18 05:14:31,133 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-18 05:14:31,134 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-18 05:14:31,134 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-18 05:14:31,134 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-18 05:14:31,134 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-18 05:14:31,134 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-18 05:14:31,134 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-18 05:14:31,134 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-18 05:14:31,134 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-18 05:14:31,134 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-18 05:14:31,135 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-18 05:14:31,135 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-18 05:14:31,135 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-18 05:14:31,135 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-18 05:14:31,135 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-18 05:14:31,135 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-18 05:14:31,135 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-18 05:14:31,135 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-18 05:14:31,135 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-18 05:14:31,135 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-18 05:14:31,135 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-18 05:14:31,136 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-18 05:14:31,136 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-18 05:14:31,136 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-18 05:14:31,136 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-18 05:14:31,136 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-18 05:14:31,136 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-18 05:14:31,136 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-18 05:14:31,137 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-18 05:14:31,137 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-18 05:14:31,137 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-18 05:14:31,137 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-18 05:14:31,137 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-18 05:14:31,137 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-18 05:14:31,137 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-18 05:14:31,138 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-18 05:14:31,138 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-18 05:14:31,138 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-18 05:14:31,138 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-18 05:14:31,138 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-18 05:14:31,138 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-18 05:14:31,139 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-18 05:14:31,139 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-18 05:14:31,139 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-18 05:14:31,139 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-18 05:14:31,139 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-18 05:14:31,139 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-18 05:14:31,139 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-18 05:14:31,140 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-18 05:14:31,140 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-18 05:14:31,140 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-18 05:14:31,140 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-18 05:14:31,140 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-18 05:14:31,140 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-18 05:14:31,141 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-18 05:14:31,141 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-18 05:14:31,141 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 05:14:31,141 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 05:14:31,141 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 05:14:31,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-18 05:14:31,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-18 05:14:31,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-18 05:14:31,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-18 05:14:31,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 05:14:31,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 05:14:32,181 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 05:14:32,181 INFO L295 CfgBuilder]: Removed 30 assume(true) statements. [2020-07-18 05:14:32,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 05:14:32 BoogieIcfgContainer [2020-07-18 05:14:32,187 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 05:14:32,188 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 05:14:32,188 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 05:14:32,192 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 05:14:32,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 05:14:30" (1/3) ... [2020-07-18 05:14:32,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d40138e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 05:14:32, skipping insertion in model container [2020-07-18 05:14:32,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:14:30" (2/3) ... [2020-07-18 05:14:32,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d40138e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 05:14:32, skipping insertion in model container [2020-07-18 05:14:32,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 05:14:32" (3/3) ... [2020-07-18 05:14:32,195 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-01-1.i [2020-07-18 05:14:32,206 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 05:14:32,215 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2020-07-18 05:14:32,230 INFO L251 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2020-07-18 05:14:32,254 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 05:14:32,254 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 05:14:32,254 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-18 05:14:32,255 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 05:14:32,255 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 05:14:32,255 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 05:14:32,255 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 05:14:32,256 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 05:14:32,278 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states. [2020-07-18 05:14:32,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-18 05:14:32,289 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:14:32,290 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 05:14:32,291 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-18 05:14:32,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:14:32,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1409190174, now seen corresponding path program 1 times [2020-07-18 05:14:32,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:14:32,306 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [452659357] [2020-07-18 05:14:32,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:14:32,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:14:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:14:32,550 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-18 05:14:32,550 INFO L280 TraceCheckUtils]: 1: Hoare triple {174#true} #valid := #valid[0 := 0]; {174#true} is VALID [2020-07-18 05:14:32,551 INFO L280 TraceCheckUtils]: 2: Hoare triple {174#true} assume 0 < #StackHeapBarrier; {174#true} is VALID [2020-07-18 05:14:32,551 INFO L280 TraceCheckUtils]: 3: Hoare triple {174#true} assume true; {174#true} is VALID [2020-07-18 05:14:32,552 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {174#true} {174#true} #414#return; {174#true} is VALID [2020-07-18 05:14:32,557 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-18 05:14:32,557 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-18 05:14:32,558 INFO L280 TraceCheckUtils]: 2: Hoare triple {174#true} #valid := #valid[0 := 0]; {174#true} is VALID [2020-07-18 05:14:32,558 INFO L280 TraceCheckUtils]: 3: Hoare triple {174#true} assume 0 < #StackHeapBarrier; {174#true} is VALID [2020-07-18 05:14:32,559 INFO L280 TraceCheckUtils]: 4: Hoare triple {174#true} assume true; {174#true} is VALID [2020-07-18 05:14:32,559 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {174#true} {174#true} #414#return; {174#true} is VALID [2020-07-18 05:14:32,559 INFO L263 TraceCheckUtils]: 6: Hoare triple {174#true} call #t~ret28 := main(); {174#true} is VALID [2020-07-18 05:14:32,561 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-18 05:14:32,562 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-18 05:14:32,564 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-18 05:14:32,566 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-18 05:14:32,568 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-18 05:14:32,568 INFO L280 TraceCheckUtils]: 12: Hoare triple {175#false} assume !false; {175#false} is VALID [2020-07-18 05:14:32,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 05:14:32,571 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [452659357] [2020-07-18 05:14:32,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:14:32,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 05:14:32,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808848064] [2020-07-18 05:14:32,581 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-18 05:14:32,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:14:32,588 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 05:14:32,618 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-18 05:14:32,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 05:14:32,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:14:32,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 05:14:32,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 05:14:32,631 INFO L87 Difference]: Start difference. First operand 171 states. Second operand 5 states. [2020-07-18 05:14:33,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:14:33,993 INFO L93 Difference]: Finished difference Result 359 states and 475 transitions. [2020-07-18 05:14:33,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-18 05:14:33,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-18 05:14:33,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:14:33,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 05:14:34,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2020-07-18 05:14:34,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 05:14:34,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2020-07-18 05:14:34,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2020-07-18 05:14:34,611 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-18 05:14:34,662 INFO L225 Difference]: With dead ends: 359 [2020-07-18 05:14:34,662 INFO L226 Difference]: Without dead ends: 194 [2020-07-18 05:14:34,675 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-18 05:14:34,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-07-18 05:14:34,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 164. [2020-07-18 05:14:34,993 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:14:34,994 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand 164 states. [2020-07-18 05:14:34,995 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand 164 states. [2020-07-18 05:14:34,995 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 164 states. [2020-07-18 05:14:35,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:14:35,014 INFO L93 Difference]: Finished difference Result 194 states and 204 transitions. [2020-07-18 05:14:35,015 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 204 transitions. [2020-07-18 05:14:35,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:14:35,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:14:35,017 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 194 states. [2020-07-18 05:14:35,018 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 194 states. [2020-07-18 05:14:35,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:14:35,036 INFO L93 Difference]: Finished difference Result 194 states and 204 transitions. [2020-07-18 05:14:35,036 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 204 transitions. [2020-07-18 05:14:35,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:14:35,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:14:35,038 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:14:35,039 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:14:35,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-07-18 05:14:35,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 173 transitions. [2020-07-18 05:14:35,052 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 173 transitions. Word has length 13 [2020-07-18 05:14:35,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:14:35,053 INFO L479 AbstractCegarLoop]: Abstraction has 164 states and 173 transitions. [2020-07-18 05:14:35,053 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 05:14:35,053 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 164 states and 173 transitions. [2020-07-18 05:14:35,281 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-18 05:14:35,281 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 173 transitions. [2020-07-18 05:14:35,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-18 05:14:35,283 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:14:35,283 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-18 05:14:35,284 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 05:14:35,284 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-18 05:14:35,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:14:35,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1469410252, now seen corresponding path program 1 times [2020-07-18 05:14:35,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:14:35,285 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [284571034] [2020-07-18 05:14:35,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:14:35,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:14:35,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:14:35,385 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-18 05:14:35,386 INFO L280 TraceCheckUtils]: 1: Hoare triple {1622#true} #valid := #valid[0 := 0]; {1622#true} is VALID [2020-07-18 05:14:35,386 INFO L280 TraceCheckUtils]: 2: Hoare triple {1622#true} assume 0 < #StackHeapBarrier; {1622#true} is VALID [2020-07-18 05:14:35,386 INFO L280 TraceCheckUtils]: 3: Hoare triple {1622#true} assume true; {1622#true} is VALID [2020-07-18 05:14:35,387 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1622#true} {1622#true} #414#return; {1622#true} is VALID [2020-07-18 05:14:35,388 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-18 05:14:35,388 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-18 05:14:35,388 INFO L280 TraceCheckUtils]: 2: Hoare triple {1622#true} #valid := #valid[0 := 0]; {1622#true} is VALID [2020-07-18 05:14:35,389 INFO L280 TraceCheckUtils]: 3: Hoare triple {1622#true} assume 0 < #StackHeapBarrier; {1622#true} is VALID [2020-07-18 05:14:35,389 INFO L280 TraceCheckUtils]: 4: Hoare triple {1622#true} assume true; {1622#true} is VALID [2020-07-18 05:14:35,389 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1622#true} {1622#true} #414#return; {1622#true} is VALID [2020-07-18 05:14:35,390 INFO L263 TraceCheckUtils]: 6: Hoare triple {1622#true} call #t~ret28 := main(); {1622#true} is VALID [2020-07-18 05:14:35,390 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-18 05:14:35,390 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-18 05:14:35,390 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-18 05:14:35,391 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-18 05:14:35,391 INFO L280 TraceCheckUtils]: 11: Hoare triple {1622#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {1622#true} is VALID [2020-07-18 05:14:35,391 INFO L280 TraceCheckUtils]: 12: Hoare triple {1622#true} goto; {1622#true} is VALID [2020-07-18 05:14:35,392 INFO L280 TraceCheckUtils]: 13: Hoare triple {1622#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1622#true} is VALID [2020-07-18 05:14:35,392 INFO L280 TraceCheckUtils]: 14: Hoare triple {1622#true} assume 0 != #t~nondet1; {1622#true} is VALID [2020-07-18 05:14:35,392 INFO L280 TraceCheckUtils]: 15: Hoare triple {1622#true} havoc #t~nondet1; {1622#true} is VALID [2020-07-18 05:14:35,393 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-18 05:14:35,393 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-18 05:14:35,393 INFO L280 TraceCheckUtils]: 18: Hoare triple {1622#true} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {1622#true} is VALID [2020-07-18 05:14:35,394 INFO L280 TraceCheckUtils]: 19: Hoare triple {1622#true} assume #t~short7; {1629#|main_#t~short7|} is VALID [2020-07-18 05:14:35,395 INFO L280 TraceCheckUtils]: 20: Hoare triple {1629#|main_#t~short7|} assume !#t~short7; {1623#false} is VALID [2020-07-18 05:14:35,395 INFO L280 TraceCheckUtils]: 21: Hoare triple {1623#false} havoc #t~short7; {1623#false} is VALID [2020-07-18 05:14:35,395 INFO L280 TraceCheckUtils]: 22: Hoare triple {1623#false} havoc #t~mem5.base, #t~mem5.offset; {1623#false} is VALID [2020-07-18 05:14:35,395 INFO L280 TraceCheckUtils]: 23: Hoare triple {1623#false} havoc #t~mem6.base, #t~mem6.offset; {1623#false} is VALID [2020-07-18 05:14:35,396 INFO L280 TraceCheckUtils]: 24: Hoare triple {1623#false} assume !false; {1623#false} is VALID [2020-07-18 05:14:35,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 05:14:35,399 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [284571034] [2020-07-18 05:14:35,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:14:35,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-18 05:14:35,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84990573] [2020-07-18 05:14:35,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-07-18 05:14:35,402 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:14:35,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-18 05:14:35,424 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-18 05:14:35,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-18 05:14:35,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:14:35,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-18 05:14:35,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 05:14:35,426 INFO L87 Difference]: Start difference. First operand 164 states and 173 transitions. Second operand 4 states. [2020-07-18 05:14:36,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:14:36,264 INFO L93 Difference]: Finished difference Result 170 states and 179 transitions. [2020-07-18 05:14:36,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-18 05:14:36,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-07-18 05:14:36,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:14:36,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 05:14:36,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 179 transitions. [2020-07-18 05:14:36,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 05:14:36,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 179 transitions. [2020-07-18 05:14:36,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 179 transitions. [2020-07-18 05:14:36,460 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:14:36,468 INFO L225 Difference]: With dead ends: 170 [2020-07-18 05:14:36,468 INFO L226 Difference]: Without dead ends: 165 [2020-07-18 05:14:36,469 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 05:14:36,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-07-18 05:14:36,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2020-07-18 05:14:36,701 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:14:36,701 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand 165 states. [2020-07-18 05:14:36,701 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 165 states. [2020-07-18 05:14:36,701 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 165 states. [2020-07-18 05:14:36,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:14:36,714 INFO L93 Difference]: Finished difference Result 165 states and 174 transitions. [2020-07-18 05:14:36,714 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 174 transitions. [2020-07-18 05:14:36,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:14:36,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:14:36,716 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 165 states. [2020-07-18 05:14:36,716 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 165 states. [2020-07-18 05:14:36,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:14:36,722 INFO L93 Difference]: Finished difference Result 165 states and 174 transitions. [2020-07-18 05:14:36,722 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 174 transitions. [2020-07-18 05:14:36,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:14:36,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:14:36,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:14:36,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:14:36,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-07-18 05:14:36,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 174 transitions. [2020-07-18 05:14:36,730 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 174 transitions. Word has length 25 [2020-07-18 05:14:36,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:14:36,730 INFO L479 AbstractCegarLoop]: Abstraction has 165 states and 174 transitions. [2020-07-18 05:14:36,731 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-18 05:14:36,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 165 states and 174 transitions. [2020-07-18 05:14:36,950 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-18 05:14:36,950 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 174 transitions. [2020-07-18 05:14:36,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-18 05:14:36,951 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:14:36,951 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-18 05:14:36,952 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 05:14:36,952 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-18 05:14:36,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:14:36,952 INFO L82 PathProgramCache]: Analyzing trace with hash -155961871, now seen corresponding path program 1 times [2020-07-18 05:14:36,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:14:36,953 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [405537006] [2020-07-18 05:14:36,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:14:36,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:14:37,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:14:37,111 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-18 05:14:37,111 INFO L280 TraceCheckUtils]: 1: Hoare triple {2633#true} #valid := #valid[0 := 0]; {2633#true} is VALID [2020-07-18 05:14:37,111 INFO L280 TraceCheckUtils]: 2: Hoare triple {2633#true} assume 0 < #StackHeapBarrier; {2633#true} is VALID [2020-07-18 05:14:37,112 INFO L280 TraceCheckUtils]: 3: Hoare triple {2633#true} assume true; {2633#true} is VALID [2020-07-18 05:14:37,112 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2633#true} {2633#true} #414#return; {2633#true} is VALID [2020-07-18 05:14:37,113 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-18 05:14:37,113 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-18 05:14:37,114 INFO L280 TraceCheckUtils]: 2: Hoare triple {2633#true} #valid := #valid[0 := 0]; {2633#true} is VALID [2020-07-18 05:14:37,114 INFO L280 TraceCheckUtils]: 3: Hoare triple {2633#true} assume 0 < #StackHeapBarrier; {2633#true} is VALID [2020-07-18 05:14:37,114 INFO L280 TraceCheckUtils]: 4: Hoare triple {2633#true} assume true; {2633#true} is VALID [2020-07-18 05:14:37,115 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2633#true} {2633#true} #414#return; {2633#true} is VALID [2020-07-18 05:14:37,115 INFO L263 TraceCheckUtils]: 6: Hoare triple {2633#true} call #t~ret28 := main(); {2633#true} is VALID [2020-07-18 05:14:37,115 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-18 05:14:37,115 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-18 05:14:37,116 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-18 05:14:37,116 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-18 05:14:37,116 INFO L280 TraceCheckUtils]: 11: Hoare triple {2633#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {2633#true} is VALID [2020-07-18 05:14:37,117 INFO L280 TraceCheckUtils]: 12: Hoare triple {2633#true} goto; {2633#true} is VALID [2020-07-18 05:14:37,117 INFO L280 TraceCheckUtils]: 13: Hoare triple {2633#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2633#true} is VALID [2020-07-18 05:14:37,117 INFO L280 TraceCheckUtils]: 14: Hoare triple {2633#true} assume 0 != #t~nondet1; {2633#true} is VALID [2020-07-18 05:14:37,117 INFO L280 TraceCheckUtils]: 15: Hoare triple {2633#true} havoc #t~nondet1; {2633#true} is VALID [2020-07-18 05:14:37,118 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-18 05:14:37,119 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-18 05:14:37,120 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-18 05:14:37,121 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-18 05:14:37,122 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-18 05:14:37,123 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-18 05:14:37,123 INFO L280 TraceCheckUtils]: 22: Hoare triple {2644#|main_#t~short7|} assume !#t~short7; {2634#false} is VALID [2020-07-18 05:14:37,124 INFO L280 TraceCheckUtils]: 23: Hoare triple {2634#false} havoc #t~short7; {2634#false} is VALID [2020-07-18 05:14:37,124 INFO L280 TraceCheckUtils]: 24: Hoare triple {2634#false} havoc #t~mem5.base, #t~mem5.offset; {2634#false} is VALID [2020-07-18 05:14:37,124 INFO L280 TraceCheckUtils]: 25: Hoare triple {2634#false} havoc #t~mem6.base, #t~mem6.offset; {2634#false} is VALID [2020-07-18 05:14:37,125 INFO L280 TraceCheckUtils]: 26: Hoare triple {2634#false} assume !false; {2634#false} is VALID [2020-07-18 05:14:37,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 05:14:37,127 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [405537006] [2020-07-18 05:14:37,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:14:37,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-18 05:14:37,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455916828] [2020-07-18 05:14:37,128 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-07-18 05:14:37,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:14:37,128 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-18 05:14:37,162 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-18 05:14:37,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-18 05:14:37,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:14:37,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-18 05:14:37,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-18 05:14:37,163 INFO L87 Difference]: Start difference. First operand 165 states and 174 transitions. Second operand 8 states. [2020-07-18 05:14:39,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:14:39,107 INFO L93 Difference]: Finished difference Result 256 states and 271 transitions. [2020-07-18 05:14:39,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-18 05:14:39,107 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-07-18 05:14:39,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:14:39,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 05:14:39,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 271 transitions. [2020-07-18 05:14:39,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 05:14:39,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 271 transitions. [2020-07-18 05:14:39,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 271 transitions. [2020-07-18 05:14:39,414 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 271 edges. 271 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:14:39,420 INFO L225 Difference]: With dead ends: 256 [2020-07-18 05:14:39,420 INFO L226 Difference]: Without dead ends: 251 [2020-07-18 05:14:39,421 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2020-07-18 05:14:39,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2020-07-18 05:14:39,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 159. [2020-07-18 05:14:39,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:14:39,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 251 states. Second operand 159 states. [2020-07-18 05:14:39,787 INFO L74 IsIncluded]: Start isIncluded. First operand 251 states. Second operand 159 states. [2020-07-18 05:14:39,787 INFO L87 Difference]: Start difference. First operand 251 states. Second operand 159 states. [2020-07-18 05:14:39,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:14:39,797 INFO L93 Difference]: Finished difference Result 251 states and 266 transitions. [2020-07-18 05:14:39,797 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 266 transitions. [2020-07-18 05:14:39,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:14:39,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:14:39,798 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 251 states. [2020-07-18 05:14:39,799 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 251 states. [2020-07-18 05:14:39,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:14:39,808 INFO L93 Difference]: Finished difference Result 251 states and 266 transitions. [2020-07-18 05:14:39,808 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 266 transitions. [2020-07-18 05:14:39,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:14:39,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:14:39,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:14:39,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:14:39,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-07-18 05:14:39,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 168 transitions. [2020-07-18 05:14:39,815 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 168 transitions. Word has length 27 [2020-07-18 05:14:39,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:14:39,815 INFO L479 AbstractCegarLoop]: Abstraction has 159 states and 168 transitions. [2020-07-18 05:14:39,816 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-18 05:14:39,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 159 states and 168 transitions. [2020-07-18 05:14:40,062 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-18 05:14:40,063 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 168 transitions. [2020-07-18 05:14:40,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-18 05:14:40,064 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:14:40,064 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-18 05:14:40,065 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 05:14:40,065 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-18 05:14:40,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:14:40,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1500955686, now seen corresponding path program 1 times [2020-07-18 05:14:40,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:14:40,066 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [572645515] [2020-07-18 05:14:40,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:14:40,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:14:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:14:40,181 INFO L280 TraceCheckUtils]: 0: Hoare triple {4004#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3994#true} is VALID [2020-07-18 05:14:40,182 INFO L280 TraceCheckUtils]: 1: Hoare triple {3994#true} #valid := #valid[0 := 0]; {3994#true} is VALID [2020-07-18 05:14:40,182 INFO L280 TraceCheckUtils]: 2: Hoare triple {3994#true} assume 0 < #StackHeapBarrier; {3994#true} is VALID [2020-07-18 05:14:40,182 INFO L280 TraceCheckUtils]: 3: Hoare triple {3994#true} assume true; {3994#true} is VALID [2020-07-18 05:14:40,182 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3994#true} {3994#true} #414#return; {3994#true} is VALID [2020-07-18 05:14:40,183 INFO L263 TraceCheckUtils]: 0: Hoare triple {3994#true} call ULTIMATE.init(); {4004#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 05:14:40,183 INFO L280 TraceCheckUtils]: 1: Hoare triple {4004#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3994#true} is VALID [2020-07-18 05:14:40,184 INFO L280 TraceCheckUtils]: 2: Hoare triple {3994#true} #valid := #valid[0 := 0]; {3994#true} is VALID [2020-07-18 05:14:40,184 INFO L280 TraceCheckUtils]: 3: Hoare triple {3994#true} assume 0 < #StackHeapBarrier; {3994#true} is VALID [2020-07-18 05:14:40,184 INFO L280 TraceCheckUtils]: 4: Hoare triple {3994#true} assume true; {3994#true} is VALID [2020-07-18 05:14:40,184 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3994#true} {3994#true} #414#return; {3994#true} is VALID [2020-07-18 05:14:40,184 INFO L263 TraceCheckUtils]: 6: Hoare triple {3994#true} call #t~ret28 := main(); {3994#true} is VALID [2020-07-18 05:14:40,185 INFO L280 TraceCheckUtils]: 7: Hoare triple {3994#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {3994#true} is VALID [2020-07-18 05:14:40,185 INFO L280 TraceCheckUtils]: 8: Hoare triple {3994#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {3994#true} is VALID [2020-07-18 05:14:40,185 INFO L280 TraceCheckUtils]: 9: Hoare triple {3994#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L993 {3994#true} is VALID [2020-07-18 05:14:40,185 INFO L280 TraceCheckUtils]: 10: Hoare triple {3994#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-1 {3994#true} is VALID [2020-07-18 05:14:40,185 INFO L280 TraceCheckUtils]: 11: Hoare triple {3994#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {3994#true} is VALID [2020-07-18 05:14:40,185 INFO L280 TraceCheckUtils]: 12: Hoare triple {3994#true} goto; {3994#true} is VALID [2020-07-18 05:14:40,186 INFO L280 TraceCheckUtils]: 13: Hoare triple {3994#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3994#true} is VALID [2020-07-18 05:14:40,186 INFO L280 TraceCheckUtils]: 14: Hoare triple {3994#true} assume 0 != #t~nondet1; {3994#true} is VALID [2020-07-18 05:14:40,186 INFO L280 TraceCheckUtils]: 15: Hoare triple {3994#true} havoc #t~nondet1; {3994#true} is VALID [2020-07-18 05:14:40,187 INFO L280 TraceCheckUtils]: 16: Hoare triple {3994#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-7 {4001#(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-18 05:14:40,188 INFO L280 TraceCheckUtils]: 17: Hoare triple {4001#(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 {4002#(and (= 0 |main_#t~mem5.offset|) (= 0 |main_#t~mem5.base|))} is VALID [2020-07-18 05:14:40,189 INFO L280 TraceCheckUtils]: 18: Hoare triple {4002#(and (= 0 |main_#t~mem5.offset|) (= 0 |main_#t~mem5.base|))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {4003#(not |main_#t~short7|)} is VALID [2020-07-18 05:14:40,189 INFO L280 TraceCheckUtils]: 19: Hoare triple {4003#(not |main_#t~short7|)} assume #t~short7; {3995#false} is VALID [2020-07-18 05:14:40,189 INFO L280 TraceCheckUtils]: 20: Hoare triple {3995#false} assume !!#t~short7; {3995#false} is VALID [2020-07-18 05:14:40,190 INFO L280 TraceCheckUtils]: 21: Hoare triple {3995#false} havoc #t~short7; {3995#false} is VALID [2020-07-18 05:14:40,190 INFO L280 TraceCheckUtils]: 22: Hoare triple {3995#false} havoc #t~mem5.base, #t~mem5.offset; {3995#false} is VALID [2020-07-18 05:14:40,190 INFO L280 TraceCheckUtils]: 23: Hoare triple {3995#false} havoc #t~mem6.base, #t~mem6.offset; {3995#false} is VALID [2020-07-18 05:14:40,190 INFO L280 TraceCheckUtils]: 24: Hoare triple {3995#false} goto; {3995#false} is VALID [2020-07-18 05:14:40,191 INFO L280 TraceCheckUtils]: 25: Hoare triple {3995#false} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {3995#false} is VALID [2020-07-18 05:14:40,191 INFO L280 TraceCheckUtils]: 26: Hoare triple {3995#false} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {3995#false} is VALID [2020-07-18 05:14:40,191 INFO L280 TraceCheckUtils]: 27: Hoare triple {3995#false} assume !(0 != #t~nondet8); {3995#false} is VALID [2020-07-18 05:14:40,191 INFO L280 TraceCheckUtils]: 28: Hoare triple {3995#false} havoc #t~nondet8; {3995#false} is VALID [2020-07-18 05:14:40,192 INFO L280 TraceCheckUtils]: 29: Hoare triple {3995#false} ~end~0.base, ~end~0.offset := 0, 0; {3995#false} is VALID [2020-07-18 05:14:40,192 INFO L280 TraceCheckUtils]: 30: Hoare triple {3995#false} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {3995#false} is VALID [2020-07-18 05:14:40,192 INFO L280 TraceCheckUtils]: 31: Hoare triple {3995#false} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {3995#false} is VALID [2020-07-18 05:14:40,192 INFO L280 TraceCheckUtils]: 32: Hoare triple {3995#false} assume !false; {3995#false} is VALID [2020-07-18 05:14:40,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 05:14:40,194 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [572645515] [2020-07-18 05:14:40,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:14:40,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-18 05:14:40,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008020113] [2020-07-18 05:14:40,196 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2020-07-18 05:14:40,196 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:14:40,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 05:14:40,237 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-18 05:14:40,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 05:14:40,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:14:40,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 05:14:40,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-18 05:14:40,239 INFO L87 Difference]: Start difference. First operand 159 states and 168 transitions. Second operand 6 states. [2020-07-18 05:14:41,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:14:41,929 INFO L93 Difference]: Finished difference Result 377 states and 399 transitions. [2020-07-18 05:14:41,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-18 05:14:41,930 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2020-07-18 05:14:41,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:14:41,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 05:14:41,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 399 transitions. [2020-07-18 05:14:41,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 05:14:41,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 399 transitions. [2020-07-18 05:14:41,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 399 transitions. [2020-07-18 05:14:42,351 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-18 05:14:42,357 INFO L225 Difference]: With dead ends: 377 [2020-07-18 05:14:42,357 INFO L226 Difference]: Without dead ends: 249 [2020-07-18 05:14:42,359 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-18 05:14:42,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2020-07-18 05:14:42,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 162. [2020-07-18 05:14:42,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:14:42,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 249 states. Second operand 162 states. [2020-07-18 05:14:42,697 INFO L74 IsIncluded]: Start isIncluded. First operand 249 states. Second operand 162 states. [2020-07-18 05:14:42,697 INFO L87 Difference]: Start difference. First operand 249 states. Second operand 162 states. [2020-07-18 05:14:42,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:14:42,707 INFO L93 Difference]: Finished difference Result 249 states and 263 transitions. [2020-07-18 05:14:42,708 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 263 transitions. [2020-07-18 05:14:42,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:14:42,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:14:42,709 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 249 states. [2020-07-18 05:14:42,709 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 249 states. [2020-07-18 05:14:42,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:14:42,718 INFO L93 Difference]: Finished difference Result 249 states and 263 transitions. [2020-07-18 05:14:42,718 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 263 transitions. [2020-07-18 05:14:42,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:14:42,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:14:42,719 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:14:42,719 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:14:42,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-07-18 05:14:42,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 171 transitions. [2020-07-18 05:14:42,724 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 171 transitions. Word has length 33 [2020-07-18 05:14:42,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:14:42,726 INFO L479 AbstractCegarLoop]: Abstraction has 162 states and 171 transitions. [2020-07-18 05:14:42,727 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 05:14:42,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 162 states and 171 transitions. [2020-07-18 05:14:42,962 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:14:42,962 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 171 transitions. [2020-07-18 05:14:42,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-18 05:14:42,963 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:14:42,963 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-18 05:14:42,963 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 05:14:42,964 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-18 05:14:42,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:14:42,964 INFO L82 PathProgramCache]: Analyzing trace with hash -820684573, now seen corresponding path program 1 times [2020-07-18 05:14:42,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:14:42,965 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [91375064] [2020-07-18 05:14:42,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:14:42,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:14:43,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:14:43,066 INFO L280 TraceCheckUtils]: 0: Hoare triple {5597#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {5587#true} is VALID [2020-07-18 05:14:43,066 INFO L280 TraceCheckUtils]: 1: Hoare triple {5587#true} #valid := #valid[0 := 0]; {5587#true} is VALID [2020-07-18 05:14:43,067 INFO L280 TraceCheckUtils]: 2: Hoare triple {5587#true} assume 0 < #StackHeapBarrier; {5587#true} is VALID [2020-07-18 05:14:43,067 INFO L280 TraceCheckUtils]: 3: Hoare triple {5587#true} assume true; {5587#true} is VALID [2020-07-18 05:14:43,067 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {5587#true} {5587#true} #414#return; {5587#true} is VALID [2020-07-18 05:14:43,068 INFO L263 TraceCheckUtils]: 0: Hoare triple {5587#true} call ULTIMATE.init(); {5597#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 05:14:43,069 INFO L280 TraceCheckUtils]: 1: Hoare triple {5597#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {5587#true} is VALID [2020-07-18 05:14:43,069 INFO L280 TraceCheckUtils]: 2: Hoare triple {5587#true} #valid := #valid[0 := 0]; {5587#true} is VALID [2020-07-18 05:14:43,069 INFO L280 TraceCheckUtils]: 3: Hoare triple {5587#true} assume 0 < #StackHeapBarrier; {5587#true} is VALID [2020-07-18 05:14:43,070 INFO L280 TraceCheckUtils]: 4: Hoare triple {5587#true} assume true; {5587#true} is VALID [2020-07-18 05:14:43,070 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {5587#true} {5587#true} #414#return; {5587#true} is VALID [2020-07-18 05:14:43,070 INFO L263 TraceCheckUtils]: 6: Hoare triple {5587#true} call #t~ret28 := main(); {5587#true} is VALID [2020-07-18 05:14:43,071 INFO L280 TraceCheckUtils]: 7: Hoare triple {5587#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {5594#(not (= 0 |main_#t~malloc0.base|))} is VALID [2020-07-18 05:14:43,071 INFO L280 TraceCheckUtils]: 8: Hoare triple {5594#(not (= 0 |main_#t~malloc0.base|))} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {5595#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 05:14:43,072 INFO L280 TraceCheckUtils]: 9: Hoare triple {5595#(not (= 0 main_~list~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L993 {5595#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 05:14:43,073 INFO L280 TraceCheckUtils]: 10: Hoare triple {5595#(not (= 0 main_~list~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-1 {5595#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 05:14:43,073 INFO L280 TraceCheckUtils]: 11: Hoare triple {5595#(not (= 0 main_~list~0.base))} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {5595#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 05:14:43,074 INFO L280 TraceCheckUtils]: 12: Hoare triple {5595#(not (= 0 main_~list~0.base))} goto; {5595#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 05:14:43,074 INFO L280 TraceCheckUtils]: 13: Hoare triple {5595#(not (= 0 main_~list~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {5595#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 05:14:43,075 INFO L280 TraceCheckUtils]: 14: Hoare triple {5595#(not (= 0 main_~list~0.base))} assume 0 != #t~nondet1; {5595#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 05:14:43,076 INFO L280 TraceCheckUtils]: 15: Hoare triple {5595#(not (= 0 main_~list~0.base))} havoc #t~nondet1; {5595#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 05:14:43,076 INFO L280 TraceCheckUtils]: 16: Hoare triple {5595#(not (= 0 main_~list~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-7 {5595#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 05:14:43,077 INFO L280 TraceCheckUtils]: 17: Hoare triple {5595#(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 {5595#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 05:14:43,077 INFO L280 TraceCheckUtils]: 18: Hoare triple {5595#(not (= 0 main_~list~0.base))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {5595#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 05:14:43,078 INFO L280 TraceCheckUtils]: 19: Hoare triple {5595#(not (= 0 main_~list~0.base))} assume !#t~short7; {5595#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 05:14:43,079 INFO L280 TraceCheckUtils]: 20: Hoare triple {5595#(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 {5595#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 05:14:43,079 INFO L280 TraceCheckUtils]: 21: Hoare triple {5595#(not (= 0 main_~list~0.base))} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {5595#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 05:14:43,080 INFO L280 TraceCheckUtils]: 22: Hoare triple {5595#(not (= 0 main_~list~0.base))} assume !!#t~short7; {5595#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 05:14:43,080 INFO L280 TraceCheckUtils]: 23: Hoare triple {5595#(not (= 0 main_~list~0.base))} havoc #t~short7; {5595#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 05:14:43,081 INFO L280 TraceCheckUtils]: 24: Hoare triple {5595#(not (= 0 main_~list~0.base))} havoc #t~mem5.base, #t~mem5.offset; {5595#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 05:14:43,082 INFO L280 TraceCheckUtils]: 25: Hoare triple {5595#(not (= 0 main_~list~0.base))} havoc #t~mem6.base, #t~mem6.offset; {5595#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 05:14:43,082 INFO L280 TraceCheckUtils]: 26: Hoare triple {5595#(not (= 0 main_~list~0.base))} goto; {5595#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 05:14:43,083 INFO L280 TraceCheckUtils]: 27: Hoare triple {5595#(not (= 0 main_~list~0.base))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {5595#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 05:14:43,083 INFO L280 TraceCheckUtils]: 28: Hoare triple {5595#(not (= 0 main_~list~0.base))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {5595#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 05:14:43,084 INFO L280 TraceCheckUtils]: 29: Hoare triple {5595#(not (= 0 main_~list~0.base))} assume !(0 != #t~nondet8); {5595#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 05:14:43,084 INFO L280 TraceCheckUtils]: 30: Hoare triple {5595#(not (= 0 main_~list~0.base))} havoc #t~nondet8; {5595#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 05:14:43,085 INFO L280 TraceCheckUtils]: 31: Hoare triple {5595#(not (= 0 main_~list~0.base))} ~end~0.base, ~end~0.offset := 0, 0; {5595#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 05:14:43,086 INFO L280 TraceCheckUtils]: 32: Hoare triple {5595#(not (= 0 main_~list~0.base))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {5596#(not (= 0 main_~end~0.base))} is VALID [2020-07-18 05:14:43,086 INFO L280 TraceCheckUtils]: 33: Hoare triple {5596#(not (= 0 main_~end~0.base))} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {5588#false} is VALID [2020-07-18 05:14:43,087 INFO L280 TraceCheckUtils]: 34: Hoare triple {5588#false} assume !false; {5588#false} is VALID [2020-07-18 05:14:43,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 05:14:43,089 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [91375064] [2020-07-18 05:14:43,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:14:43,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-18 05:14:43,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283222753] [2020-07-18 05:14:43,090 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2020-07-18 05:14:43,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:14:43,091 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 05:14:43,125 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-18 05:14:43,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 05:14:43,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:14:43,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 05:14:43,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-18 05:14:43,127 INFO L87 Difference]: Start difference. First operand 162 states and 171 transitions. Second operand 6 states. [2020-07-18 05:14:44,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:14:44,552 INFO L93 Difference]: Finished difference Result 270 states and 285 transitions. [2020-07-18 05:14:44,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 05:14:44,553 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2020-07-18 05:14:44,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:14:44,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 05:14:44,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 282 transitions. [2020-07-18 05:14:44,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 05:14:44,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 282 transitions. [2020-07-18 05:14:44,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 282 transitions. [2020-07-18 05:14:44,850 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-18 05:14:44,856 INFO L225 Difference]: With dead ends: 270 [2020-07-18 05:14:44,856 INFO L226 Difference]: Without dead ends: 238 [2020-07-18 05:14:44,857 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-18 05:14:44,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-07-18 05:14:45,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 161. [2020-07-18 05:14:45,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:14:45,283 INFO L82 GeneralOperation]: Start isEquivalent. First operand 238 states. Second operand 161 states. [2020-07-18 05:14:45,283 INFO L74 IsIncluded]: Start isIncluded. First operand 238 states. Second operand 161 states. [2020-07-18 05:14:45,283 INFO L87 Difference]: Start difference. First operand 238 states. Second operand 161 states. [2020-07-18 05:14:45,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:14:45,301 INFO L93 Difference]: Finished difference Result 238 states and 251 transitions. [2020-07-18 05:14:45,301 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 251 transitions. [2020-07-18 05:14:45,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:14:45,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:14:45,302 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand 238 states. [2020-07-18 05:14:45,302 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 238 states. [2020-07-18 05:14:45,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:14:45,311 INFO L93 Difference]: Finished difference Result 238 states and 251 transitions. [2020-07-18 05:14:45,311 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 251 transitions. [2020-07-18 05:14:45,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:14:45,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:14:45,312 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:14:45,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:14:45,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2020-07-18 05:14:45,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 170 transitions. [2020-07-18 05:14:45,318 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 170 transitions. Word has length 35 [2020-07-18 05:14:45,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:14:45,318 INFO L479 AbstractCegarLoop]: Abstraction has 161 states and 170 transitions. [2020-07-18 05:14:45,318 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 05:14:45,319 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 161 states and 170 transitions. [2020-07-18 05:14:45,592 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:14:45,593 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 170 transitions. [2020-07-18 05:14:45,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-18 05:14:45,594 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:14:45,594 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-18 05:14:45,594 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 05:14:45,595 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-18 05:14:45,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:14:45,595 INFO L82 PathProgramCache]: Analyzing trace with hash -2091807586, now seen corresponding path program 1 times [2020-07-18 05:14:45,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:14:45,596 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [252218316] [2020-07-18 05:14:45,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:14:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:14:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:14:45,872 INFO L280 TraceCheckUtils]: 0: Hoare triple {6958#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {6942#true} is VALID [2020-07-18 05:14:45,873 INFO L280 TraceCheckUtils]: 1: Hoare triple {6942#true} #valid := #valid[0 := 0]; {6942#true} is VALID [2020-07-18 05:14:45,873 INFO L280 TraceCheckUtils]: 2: Hoare triple {6942#true} assume 0 < #StackHeapBarrier; {6942#true} is VALID [2020-07-18 05:14:45,873 INFO L280 TraceCheckUtils]: 3: Hoare triple {6942#true} assume true; {6942#true} is VALID [2020-07-18 05:14:45,873 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {6942#true} {6942#true} #414#return; {6942#true} is VALID [2020-07-18 05:14:45,875 INFO L263 TraceCheckUtils]: 0: Hoare triple {6942#true} call ULTIMATE.init(); {6958#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 05:14:45,875 INFO L280 TraceCheckUtils]: 1: Hoare triple {6958#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {6942#true} is VALID [2020-07-18 05:14:45,875 INFO L280 TraceCheckUtils]: 2: Hoare triple {6942#true} #valid := #valid[0 := 0]; {6942#true} is VALID [2020-07-18 05:14:45,875 INFO L280 TraceCheckUtils]: 3: Hoare triple {6942#true} assume 0 < #StackHeapBarrier; {6942#true} is VALID [2020-07-18 05:14:45,875 INFO L280 TraceCheckUtils]: 4: Hoare triple {6942#true} assume true; {6942#true} is VALID [2020-07-18 05:14:45,876 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {6942#true} {6942#true} #414#return; {6942#true} is VALID [2020-07-18 05:14:45,876 INFO L263 TraceCheckUtils]: 6: Hoare triple {6942#true} call #t~ret28 := main(); {6942#true} is VALID [2020-07-18 05:14:45,877 INFO L280 TraceCheckUtils]: 7: Hoare triple {6942#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {6949#(= 1 (select |#valid| |main_#t~malloc0.base|))} is VALID [2020-07-18 05:14:45,878 INFO L280 TraceCheckUtils]: 8: Hoare triple {6949#(= 1 (select |#valid| |main_#t~malloc0.base|))} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {6950#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-18 05:14:45,879 INFO L280 TraceCheckUtils]: 9: Hoare triple {6950#(= 1 (select |#valid| main_~list~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L993 {6950#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-18 05:14:45,879 INFO L280 TraceCheckUtils]: 10: Hoare triple {6950#(= 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 {6950#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-18 05:14:45,880 INFO L280 TraceCheckUtils]: 11: Hoare triple {6950#(= 1 (select |#valid| main_~list~0.base))} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {6950#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-18 05:14:45,881 INFO L280 TraceCheckUtils]: 12: Hoare triple {6950#(= 1 (select |#valid| main_~list~0.base))} goto; {6950#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-18 05:14:45,881 INFO L280 TraceCheckUtils]: 13: Hoare triple {6950#(= 1 (select |#valid| main_~list~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {6950#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-18 05:14:45,882 INFO L280 TraceCheckUtils]: 14: Hoare triple {6950#(= 1 (select |#valid| main_~list~0.base))} assume 0 != #t~nondet1; {6950#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-18 05:14:45,882 INFO L280 TraceCheckUtils]: 15: Hoare triple {6950#(= 1 (select |#valid| main_~list~0.base))} havoc #t~nondet1; {6950#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-18 05:14:45,883 INFO L280 TraceCheckUtils]: 16: Hoare triple {6950#(= 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 {6950#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-18 05:14:45,883 INFO L280 TraceCheckUtils]: 17: Hoare triple {6950#(= 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 {6950#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-18 05:14:45,884 INFO L280 TraceCheckUtils]: 18: Hoare triple {6950#(= 1 (select |#valid| main_~list~0.base))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {6950#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-18 05:14:45,884 INFO L280 TraceCheckUtils]: 19: Hoare triple {6950#(= 1 (select |#valid| main_~list~0.base))} assume !#t~short7; {6950#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-18 05:14:45,885 INFO L280 TraceCheckUtils]: 20: Hoare triple {6950#(= 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 {6950#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-18 05:14:45,885 INFO L280 TraceCheckUtils]: 21: Hoare triple {6950#(= 1 (select |#valid| main_~list~0.base))} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {6950#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-18 05:14:45,886 INFO L280 TraceCheckUtils]: 22: Hoare triple {6950#(= 1 (select |#valid| main_~list~0.base))} assume !!#t~short7; {6950#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-18 05:14:45,886 INFO L280 TraceCheckUtils]: 23: Hoare triple {6950#(= 1 (select |#valid| main_~list~0.base))} havoc #t~short7; {6950#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-18 05:14:45,887 INFO L280 TraceCheckUtils]: 24: Hoare triple {6950#(= 1 (select |#valid| main_~list~0.base))} havoc #t~mem5.base, #t~mem5.offset; {6950#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-18 05:14:45,888 INFO L280 TraceCheckUtils]: 25: Hoare triple {6950#(= 1 (select |#valid| main_~list~0.base))} havoc #t~mem6.base, #t~mem6.offset; {6950#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-18 05:14:45,890 INFO L280 TraceCheckUtils]: 26: Hoare triple {6950#(= 1 (select |#valid| main_~list~0.base))} goto; {6950#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-18 05:14:45,891 INFO L280 TraceCheckUtils]: 27: Hoare triple {6950#(= 1 (select |#valid| main_~list~0.base))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {6951#(= 1 (select |#valid| main_~end~0.base))} is VALID [2020-07-18 05:14:45,891 INFO L280 TraceCheckUtils]: 28: Hoare triple {6951#(= 1 (select |#valid| main_~end~0.base))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {6951#(= 1 (select |#valid| main_~end~0.base))} is VALID [2020-07-18 05:14:45,893 INFO L280 TraceCheckUtils]: 29: Hoare triple {6951#(= 1 (select |#valid| main_~end~0.base))} assume !!(0 != #t~nondet8); {6951#(= 1 (select |#valid| main_~end~0.base))} is VALID [2020-07-18 05:14:45,894 INFO L280 TraceCheckUtils]: 30: Hoare triple {6951#(= 1 (select |#valid| main_~end~0.base))} havoc #t~nondet8; {6951#(= 1 (select |#valid| main_~end~0.base))} is VALID [2020-07-18 05:14:45,895 INFO L280 TraceCheckUtils]: 31: Hoare triple {6951#(= 1 (select |#valid| main_~end~0.base))} SUMMARY for call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(12); srcloc: L1003 {6952#(and (not (= 0 |main_#t~malloc9.base|)) (not (= |main_#t~malloc9.base| main_~end~0.base)))} is VALID [2020-07-18 05:14:45,896 INFO L280 TraceCheckUtils]: 32: Hoare triple {6952#(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 {6953#(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-18 05:14:45,897 INFO L280 TraceCheckUtils]: 33: Hoare triple {6953#(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 {6954#(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-18 05:14:45,898 INFO L280 TraceCheckUtils]: 34: Hoare triple {6954#(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 {6955#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-18 05:14:45,899 INFO L280 TraceCheckUtils]: 35: Hoare triple {6955#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} havoc #t~mem10.base, #t~mem10.offset; {6955#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-18 05:14:45,900 INFO L280 TraceCheckUtils]: 36: Hoare triple {6955#(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 {6956#(not (= 0 |main_#t~mem11.base|))} is VALID [2020-07-18 05:14:45,901 INFO L280 TraceCheckUtils]: 37: Hoare triple {6956#(not (= 0 |main_#t~mem11.base|))} ~end~0.base, ~end~0.offset := #t~mem11.base, #t~mem11.offset; {6957#(not (= 0 main_~end~0.base))} is VALID [2020-07-18 05:14:45,901 INFO L280 TraceCheckUtils]: 38: Hoare triple {6957#(not (= 0 main_~end~0.base))} havoc #t~mem11.base, #t~mem11.offset; {6957#(not (= 0 main_~end~0.base))} is VALID [2020-07-18 05:14:45,902 INFO L280 TraceCheckUtils]: 39: Hoare triple {6957#(not (= 0 main_~end~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); srcloc: L1006 {6957#(not (= 0 main_~end~0.base))} is VALID [2020-07-18 05:14:45,905 INFO L280 TraceCheckUtils]: 40: Hoare triple {6957#(not (= 0 main_~end~0.base))} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {6943#false} is VALID [2020-07-18 05:14:45,906 INFO L280 TraceCheckUtils]: 41: Hoare triple {6943#false} assume !false; {6943#false} is VALID [2020-07-18 05:14:45,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 05:14:45,910 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [252218316] [2020-07-18 05:14:45,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:14:45,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-18 05:14:45,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917064072] [2020-07-18 05:14:45,911 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2020-07-18 05:14:45,911 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:14:45,911 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-18 05:14:45,962 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-18 05:14:45,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-18 05:14:45,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:14:45,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-18 05:14:45,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-07-18 05:14:45,964 INFO L87 Difference]: Start difference. First operand 161 states and 170 transitions. Second operand 12 states. [2020-07-18 05:14:49,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:14:49,417 INFO L93 Difference]: Finished difference Result 286 states and 302 transitions. [2020-07-18 05:14:49,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-18 05:14:49,418 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2020-07-18 05:14:49,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:14:49,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-18 05:14:49,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 299 transitions. [2020-07-18 05:14:49,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-18 05:14:49,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 299 transitions. [2020-07-18 05:14:49,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 299 transitions. [2020-07-18 05:14:49,778 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-18 05:14:49,784 INFO L225 Difference]: With dead ends: 286 [2020-07-18 05:14:49,785 INFO L226 Difference]: Without dead ends: 282 [2020-07-18 05:14:49,785 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2020-07-18 05:14:49,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-07-18 05:14:50,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 176. [2020-07-18 05:14:50,398 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:14:50,398 INFO L82 GeneralOperation]: Start isEquivalent. First operand 282 states. Second operand 176 states. [2020-07-18 05:14:50,398 INFO L74 IsIncluded]: Start isIncluded. First operand 282 states. Second operand 176 states. [2020-07-18 05:14:50,398 INFO L87 Difference]: Start difference. First operand 282 states. Second operand 176 states. [2020-07-18 05:14:50,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:14:50,407 INFO L93 Difference]: Finished difference Result 282 states and 298 transitions. [2020-07-18 05:14:50,407 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 298 transitions. [2020-07-18 05:14:50,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:14:50,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:14:50,408 INFO L74 IsIncluded]: Start isIncluded. First operand 176 states. Second operand 282 states. [2020-07-18 05:14:50,408 INFO L87 Difference]: Start difference. First operand 176 states. Second operand 282 states. [2020-07-18 05:14:50,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:14:50,416 INFO L93 Difference]: Finished difference Result 282 states and 298 transitions. [2020-07-18 05:14:50,416 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 298 transitions. [2020-07-18 05:14:50,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:14:50,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:14:50,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:14:50,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:14:50,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-07-18 05:14:50,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 186 transitions. [2020-07-18 05:14:50,421 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 186 transitions. Word has length 42 [2020-07-18 05:14:50,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:14:50,421 INFO L479 AbstractCegarLoop]: Abstraction has 176 states and 186 transitions. [2020-07-18 05:14:50,421 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-18 05:14:50,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 176 states and 186 transitions. [2020-07-18 05:14:50,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-18 05:14:50,816 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 186 transitions. [2020-07-18 05:14:50,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-18 05:14:50,817 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:14:50,818 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-18 05:14:50,818 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 05:14:50,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-18 05:14:50,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:14:50,819 INFO L82 PathProgramCache]: Analyzing trace with hash 654436304, now seen corresponding path program 1 times [2020-07-18 05:14:50,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:14:50,819 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [61227808] [2020-07-18 05:14:50,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:14:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:14:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:14:50,893 INFO L280 TraceCheckUtils]: 0: Hoare triple {8473#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {8465#true} is VALID [2020-07-18 05:14:50,893 INFO L280 TraceCheckUtils]: 1: Hoare triple {8465#true} #valid := #valid[0 := 0]; {8465#true} is VALID [2020-07-18 05:14:50,894 INFO L280 TraceCheckUtils]: 2: Hoare triple {8465#true} assume 0 < #StackHeapBarrier; {8465#true} is VALID [2020-07-18 05:14:50,894 INFO L280 TraceCheckUtils]: 3: Hoare triple {8465#true} assume true; {8465#true} is VALID [2020-07-18 05:14:50,894 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {8465#true} {8465#true} #414#return; {8465#true} is VALID [2020-07-18 05:14:50,895 INFO L263 TraceCheckUtils]: 0: Hoare triple {8465#true} call ULTIMATE.init(); {8473#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 05:14:50,895 INFO L280 TraceCheckUtils]: 1: Hoare triple {8473#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {8465#true} is VALID [2020-07-18 05:14:50,895 INFO L280 TraceCheckUtils]: 2: Hoare triple {8465#true} #valid := #valid[0 := 0]; {8465#true} is VALID [2020-07-18 05:14:50,895 INFO L280 TraceCheckUtils]: 3: Hoare triple {8465#true} assume 0 < #StackHeapBarrier; {8465#true} is VALID [2020-07-18 05:14:50,896 INFO L280 TraceCheckUtils]: 4: Hoare triple {8465#true} assume true; {8465#true} is VALID [2020-07-18 05:14:50,896 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {8465#true} {8465#true} #414#return; {8465#true} is VALID [2020-07-18 05:14:50,896 INFO L263 TraceCheckUtils]: 6: Hoare triple {8465#true} call #t~ret28 := main(); {8465#true} is VALID [2020-07-18 05:14:50,896 INFO L280 TraceCheckUtils]: 7: Hoare triple {8465#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {8465#true} is VALID [2020-07-18 05:14:50,897 INFO L280 TraceCheckUtils]: 8: Hoare triple {8465#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {8465#true} is VALID [2020-07-18 05:14:50,897 INFO L280 TraceCheckUtils]: 9: Hoare triple {8465#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L993 {8465#true} is VALID [2020-07-18 05:14:50,897 INFO L280 TraceCheckUtils]: 10: Hoare triple {8465#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-1 {8465#true} is VALID [2020-07-18 05:14:50,897 INFO L280 TraceCheckUtils]: 11: Hoare triple {8465#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {8465#true} is VALID [2020-07-18 05:14:50,897 INFO L280 TraceCheckUtils]: 12: Hoare triple {8465#true} goto; {8465#true} is VALID [2020-07-18 05:14:50,898 INFO L280 TraceCheckUtils]: 13: Hoare triple {8465#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {8465#true} is VALID [2020-07-18 05:14:50,898 INFO L280 TraceCheckUtils]: 14: Hoare triple {8465#true} assume 0 != #t~nondet1; {8465#true} is VALID [2020-07-18 05:14:50,898 INFO L280 TraceCheckUtils]: 15: Hoare triple {8465#true} havoc #t~nondet1; {8465#true} is VALID [2020-07-18 05:14:50,898 INFO L280 TraceCheckUtils]: 16: Hoare triple {8465#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-7 {8465#true} is VALID [2020-07-18 05:14:50,899 INFO L280 TraceCheckUtils]: 17: Hoare triple {8465#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-34 {8465#true} is VALID [2020-07-18 05:14:50,899 INFO L280 TraceCheckUtils]: 18: Hoare triple {8465#true} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {8465#true} is VALID [2020-07-18 05:14:50,899 INFO L280 TraceCheckUtils]: 19: Hoare triple {8465#true} assume !#t~short7; {8465#true} is VALID [2020-07-18 05:14:50,899 INFO L280 TraceCheckUtils]: 20: Hoare triple {8465#true} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-22 {8465#true} is VALID [2020-07-18 05:14:50,900 INFO L280 TraceCheckUtils]: 21: Hoare triple {8465#true} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {8465#true} is VALID [2020-07-18 05:14:50,900 INFO L280 TraceCheckUtils]: 22: Hoare triple {8465#true} assume !!#t~short7; {8465#true} is VALID [2020-07-18 05:14:50,900 INFO L280 TraceCheckUtils]: 23: Hoare triple {8465#true} havoc #t~short7; {8465#true} is VALID [2020-07-18 05:14:50,900 INFO L280 TraceCheckUtils]: 24: Hoare triple {8465#true} havoc #t~mem5.base, #t~mem5.offset; {8465#true} is VALID [2020-07-18 05:14:50,900 INFO L280 TraceCheckUtils]: 25: Hoare triple {8465#true} havoc #t~mem6.base, #t~mem6.offset; {8465#true} is VALID [2020-07-18 05:14:50,901 INFO L280 TraceCheckUtils]: 26: Hoare triple {8465#true} goto; {8465#true} is VALID [2020-07-18 05:14:50,901 INFO L280 TraceCheckUtils]: 27: Hoare triple {8465#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {8465#true} is VALID [2020-07-18 05:14:50,901 INFO L280 TraceCheckUtils]: 28: Hoare triple {8465#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {8465#true} is VALID [2020-07-18 05:14:50,901 INFO L280 TraceCheckUtils]: 29: Hoare triple {8465#true} assume !(0 != #t~nondet8); {8465#true} is VALID [2020-07-18 05:14:50,902 INFO L280 TraceCheckUtils]: 30: Hoare triple {8465#true} havoc #t~nondet8; {8465#true} is VALID [2020-07-18 05:14:50,902 INFO L280 TraceCheckUtils]: 31: Hoare triple {8465#true} ~end~0.base, ~end~0.offset := 0, 0; {8465#true} is VALID [2020-07-18 05:14:50,902 INFO L280 TraceCheckUtils]: 32: Hoare triple {8465#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {8465#true} is VALID [2020-07-18 05:14:50,902 INFO L280 TraceCheckUtils]: 33: Hoare triple {8465#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {8465#true} is VALID [2020-07-18 05:14:50,902 INFO L280 TraceCheckUtils]: 34: Hoare triple {8465#true} goto; {8465#true} is VALID [2020-07-18 05:14:50,903 INFO L280 TraceCheckUtils]: 35: Hoare triple {8465#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {8465#true} is VALID [2020-07-18 05:14:50,903 INFO L280 TraceCheckUtils]: 36: Hoare triple {8465#true} ~len~0 := 0; {8472#(= 0 main_~len~0)} is VALID [2020-07-18 05:14:50,910 INFO L280 TraceCheckUtils]: 37: Hoare triple {8472#(= 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 {8472#(= 0 main_~len~0)} is VALID [2020-07-18 05:14:50,911 INFO L280 TraceCheckUtils]: 38: Hoare triple {8472#(= 0 main_~len~0)} ~inner~0.base, ~inner~0.offset := #t~mem19.base, #t~mem19.offset; {8472#(= 0 main_~len~0)} is VALID [2020-07-18 05:14:50,912 INFO L280 TraceCheckUtils]: 39: Hoare triple {8472#(= 0 main_~len~0)} havoc #t~mem19.base, #t~mem19.offset; {8472#(= 0 main_~len~0)} is VALID [2020-07-18 05:14:50,912 INFO L280 TraceCheckUtils]: 40: Hoare triple {8472#(= 0 main_~len~0)} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {8472#(= 0 main_~len~0)} is VALID [2020-07-18 05:14:50,913 INFO L280 TraceCheckUtils]: 41: Hoare triple {8472#(= 0 main_~len~0)} assume !(~len~0 <= 1); {8466#false} is VALID [2020-07-18 05:14:50,913 INFO L280 TraceCheckUtils]: 42: Hoare triple {8466#false} assume !false; {8466#false} is VALID [2020-07-18 05:14:50,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 05:14:50,915 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [61227808] [2020-07-18 05:14:50,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:14:50,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-18 05:14:50,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012792993] [2020-07-18 05:14:50,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2020-07-18 05:14:50,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:14:50,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-18 05:14:50,956 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-18 05:14:50,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-18 05:14:50,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:14:50,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-18 05:14:50,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 05:14:50,957 INFO L87 Difference]: Start difference. First operand 176 states and 186 transitions. Second operand 4 states. [2020-07-18 05:14:52,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:14:52,223 INFO L93 Difference]: Finished difference Result 282 states and 301 transitions. [2020-07-18 05:14:52,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-18 05:14:52,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2020-07-18 05:14:52,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:14:52,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 05:14:52,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 281 transitions. [2020-07-18 05:14:52,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 05:14:52,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 281 transitions. [2020-07-18 05:14:52,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 281 transitions. [2020-07-18 05:14:52,503 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-18 05:14:52,507 INFO L225 Difference]: With dead ends: 282 [2020-07-18 05:14:52,507 INFO L226 Difference]: Without dead ends: 215 [2020-07-18 05:14:52,509 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 05:14:52,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2020-07-18 05:14:53,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 179. [2020-07-18 05:14:53,038 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:14:53,038 INFO L82 GeneralOperation]: Start isEquivalent. First operand 215 states. Second operand 179 states. [2020-07-18 05:14:53,038 INFO L74 IsIncluded]: Start isIncluded. First operand 215 states. Second operand 179 states. [2020-07-18 05:14:53,038 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 179 states. [2020-07-18 05:14:53,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:14:53,045 INFO L93 Difference]: Finished difference Result 215 states and 228 transitions. [2020-07-18 05:14:53,045 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 228 transitions. [2020-07-18 05:14:53,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:14:53,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:14:53,046 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand 215 states. [2020-07-18 05:14:53,046 INFO L87 Difference]: Start difference. First operand 179 states. Second operand 215 states. [2020-07-18 05:14:53,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:14:53,051 INFO L93 Difference]: Finished difference Result 215 states and 228 transitions. [2020-07-18 05:14:53,052 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 228 transitions. [2020-07-18 05:14:53,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:14:53,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:14:53,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:14:53,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:14:53,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-07-18 05:14:53,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 190 transitions. [2020-07-18 05:14:53,057 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 190 transitions. Word has length 43 [2020-07-18 05:14:53,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:14:53,057 INFO L479 AbstractCegarLoop]: Abstraction has 179 states and 190 transitions. [2020-07-18 05:14:53,057 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-18 05:14:53,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 179 states and 190 transitions. [2020-07-18 05:14:53,412 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-18 05:14:53,412 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 190 transitions. [2020-07-18 05:14:53,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-07-18 05:14:53,413 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:14:53,413 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 05:14:53,413 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-18 05:14:53,414 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-18 05:14:53,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:14:53,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1847672787, now seen corresponding path program 1 times [2020-07-18 05:14:53,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:14:53,414 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [409016911] [2020-07-18 05:14:53,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:14:53,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:14:53,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:14:53,528 INFO L280 TraceCheckUtils]: 0: Hoare triple {9836#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {9828#true} is VALID [2020-07-18 05:14:53,529 INFO L280 TraceCheckUtils]: 1: Hoare triple {9828#true} #valid := #valid[0 := 0]; {9828#true} is VALID [2020-07-18 05:14:53,529 INFO L280 TraceCheckUtils]: 2: Hoare triple {9828#true} assume 0 < #StackHeapBarrier; {9828#true} is VALID [2020-07-18 05:14:53,532 INFO L280 TraceCheckUtils]: 3: Hoare triple {9828#true} assume true; {9828#true} is VALID [2020-07-18 05:14:53,532 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {9828#true} {9828#true} #414#return; {9828#true} is VALID [2020-07-18 05:14:53,534 INFO L263 TraceCheckUtils]: 0: Hoare triple {9828#true} call ULTIMATE.init(); {9836#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 05:14:53,534 INFO L280 TraceCheckUtils]: 1: Hoare triple {9836#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {9828#true} is VALID [2020-07-18 05:14:53,534 INFO L280 TraceCheckUtils]: 2: Hoare triple {9828#true} #valid := #valid[0 := 0]; {9828#true} is VALID [2020-07-18 05:14:53,534 INFO L280 TraceCheckUtils]: 3: Hoare triple {9828#true} assume 0 < #StackHeapBarrier; {9828#true} is VALID [2020-07-18 05:14:53,535 INFO L280 TraceCheckUtils]: 4: Hoare triple {9828#true} assume true; {9828#true} is VALID [2020-07-18 05:14:53,535 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {9828#true} {9828#true} #414#return; {9828#true} is VALID [2020-07-18 05:14:53,535 INFO L263 TraceCheckUtils]: 6: Hoare triple {9828#true} call #t~ret28 := main(); {9828#true} is VALID [2020-07-18 05:14:53,535 INFO L280 TraceCheckUtils]: 7: Hoare triple {9828#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {9828#true} is VALID [2020-07-18 05:14:53,535 INFO L280 TraceCheckUtils]: 8: Hoare triple {9828#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {9828#true} is VALID [2020-07-18 05:14:53,536 INFO L280 TraceCheckUtils]: 9: Hoare triple {9828#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L993 {9828#true} is VALID [2020-07-18 05:14:53,536 INFO L280 TraceCheckUtils]: 10: Hoare triple {9828#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-1 {9828#true} is VALID [2020-07-18 05:14:53,536 INFO L280 TraceCheckUtils]: 11: Hoare triple {9828#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {9828#true} is VALID [2020-07-18 05:14:53,536 INFO L280 TraceCheckUtils]: 12: Hoare triple {9828#true} goto; {9828#true} is VALID [2020-07-18 05:14:53,536 INFO L280 TraceCheckUtils]: 13: Hoare triple {9828#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {9828#true} is VALID [2020-07-18 05:14:53,537 INFO L280 TraceCheckUtils]: 14: Hoare triple {9828#true} assume 0 != #t~nondet1; {9828#true} is VALID [2020-07-18 05:14:53,537 INFO L280 TraceCheckUtils]: 15: Hoare triple {9828#true} havoc #t~nondet1; {9828#true} is VALID [2020-07-18 05:14:53,537 INFO L280 TraceCheckUtils]: 16: Hoare triple {9828#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-7 {9828#true} is VALID [2020-07-18 05:14:53,537 INFO L280 TraceCheckUtils]: 17: Hoare triple {9828#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-34 {9828#true} is VALID [2020-07-18 05:14:53,538 INFO L280 TraceCheckUtils]: 18: Hoare triple {9828#true} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {9828#true} is VALID [2020-07-18 05:14:53,538 INFO L280 TraceCheckUtils]: 19: Hoare triple {9828#true} assume !#t~short7; {9828#true} is VALID [2020-07-18 05:14:53,538 INFO L280 TraceCheckUtils]: 20: Hoare triple {9828#true} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-22 {9828#true} is VALID [2020-07-18 05:14:53,539 INFO L280 TraceCheckUtils]: 21: Hoare triple {9828#true} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {9828#true} is VALID [2020-07-18 05:14:53,539 INFO L280 TraceCheckUtils]: 22: Hoare triple {9828#true} assume !!#t~short7; {9828#true} is VALID [2020-07-18 05:14:53,540 INFO L280 TraceCheckUtils]: 23: Hoare triple {9828#true} havoc #t~short7; {9828#true} is VALID [2020-07-18 05:14:53,540 INFO L280 TraceCheckUtils]: 24: Hoare triple {9828#true} havoc #t~mem5.base, #t~mem5.offset; {9828#true} is VALID [2020-07-18 05:14:53,540 INFO L280 TraceCheckUtils]: 25: Hoare triple {9828#true} havoc #t~mem6.base, #t~mem6.offset; {9828#true} is VALID [2020-07-18 05:14:53,540 INFO L280 TraceCheckUtils]: 26: Hoare triple {9828#true} goto; {9828#true} is VALID [2020-07-18 05:14:53,540 INFO L280 TraceCheckUtils]: 27: Hoare triple {9828#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {9828#true} is VALID [2020-07-18 05:14:53,541 INFO L280 TraceCheckUtils]: 28: Hoare triple {9828#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {9828#true} is VALID [2020-07-18 05:14:53,541 INFO L280 TraceCheckUtils]: 29: Hoare triple {9828#true} assume !(0 != #t~nondet8); {9828#true} is VALID [2020-07-18 05:14:53,541 INFO L280 TraceCheckUtils]: 30: Hoare triple {9828#true} havoc #t~nondet8; {9828#true} is VALID [2020-07-18 05:14:53,541 INFO L280 TraceCheckUtils]: 31: Hoare triple {9828#true} ~end~0.base, ~end~0.offset := 0, 0; {9828#true} is VALID [2020-07-18 05:14:53,541 INFO L280 TraceCheckUtils]: 32: Hoare triple {9828#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {9828#true} is VALID [2020-07-18 05:14:53,542 INFO L280 TraceCheckUtils]: 33: Hoare triple {9828#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {9828#true} is VALID [2020-07-18 05:14:53,542 INFO L280 TraceCheckUtils]: 34: Hoare triple {9828#true} goto; {9828#true} is VALID [2020-07-18 05:14:53,544 INFO L280 TraceCheckUtils]: 35: Hoare triple {9828#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {9828#true} is VALID [2020-07-18 05:14:53,545 INFO L280 TraceCheckUtils]: 36: Hoare triple {9828#true} ~len~0 := 0; {9828#true} is VALID [2020-07-18 05:14:53,545 INFO L280 TraceCheckUtils]: 37: Hoare triple {9828#true} SUMMARY for call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~end~0.base, 8 + ~end~0.offset, 4); srcloc: L1020 {9828#true} is VALID [2020-07-18 05:14:53,545 INFO L280 TraceCheckUtils]: 38: Hoare triple {9828#true} ~inner~0.base, ~inner~0.offset := #t~mem19.base, #t~mem19.offset; {9828#true} is VALID [2020-07-18 05:14:53,545 INFO L280 TraceCheckUtils]: 39: Hoare triple {9828#true} havoc #t~mem19.base, #t~mem19.offset; {9828#true} is VALID [2020-07-18 05:14:53,547 INFO L280 TraceCheckUtils]: 40: Hoare triple {9828#true} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {9835#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} is VALID [2020-07-18 05:14:53,547 INFO L280 TraceCheckUtils]: 41: Hoare triple {9835#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} assume 0 == ~len~0; {9835#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} is VALID [2020-07-18 05:14:53,548 INFO L280 TraceCheckUtils]: 42: Hoare triple {9835#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} ~len~0 := 1; {9835#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} is VALID [2020-07-18 05:14:53,549 INFO L280 TraceCheckUtils]: 43: Hoare triple {9835#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {9829#false} is VALID [2020-07-18 05:14:53,549 INFO L280 TraceCheckUtils]: 44: Hoare triple {9829#false} assume !false; {9829#false} is VALID [2020-07-18 05:14:53,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 05:14:53,551 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [409016911] [2020-07-18 05:14:53,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:14:53,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-18 05:14:53,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878831975] [2020-07-18 05:14:53,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2020-07-18 05:14:53,553 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:14:53,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-18 05:14:53,597 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-18 05:14:53,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-18 05:14:53,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:14:53,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-18 05:14:53,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 05:14:53,598 INFO L87 Difference]: Start difference. First operand 179 states and 190 transitions. Second operand 4 states. [2020-07-18 05:14:54,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:14:54,674 INFO L93 Difference]: Finished difference Result 179 states and 190 transitions. [2020-07-18 05:14:54,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-18 05:14:54,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2020-07-18 05:14:54,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:14:54,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 05:14:54,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2020-07-18 05:14:54,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 05:14:54,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2020-07-18 05:14:54,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 166 transitions. [2020-07-18 05:14:54,855 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-18 05:14:54,857 INFO L225 Difference]: With dead ends: 179 [2020-07-18 05:14:54,858 INFO L226 Difference]: Without dead ends: 177 [2020-07-18 05:14:54,859 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 05:14:54,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2020-07-18 05:14:55,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2020-07-18 05:14:55,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:14:55,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand 177 states. [2020-07-18 05:14:55,425 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand 177 states. [2020-07-18 05:14:55,426 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 177 states. [2020-07-18 05:14:55,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:14:55,430 INFO L93 Difference]: Finished difference Result 177 states and 188 transitions. [2020-07-18 05:14:55,430 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 188 transitions. [2020-07-18 05:14:55,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:14:55,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:14:55,431 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand 177 states. [2020-07-18 05:14:55,431 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 177 states. [2020-07-18 05:14:55,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:14:55,435 INFO L93 Difference]: Finished difference Result 177 states and 188 transitions. [2020-07-18 05:14:55,435 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 188 transitions. [2020-07-18 05:14:55,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:14:55,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:14:55,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:14:55,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:14:55,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-07-18 05:14:55,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 188 transitions. [2020-07-18 05:14:55,439 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 188 transitions. Word has length 45 [2020-07-18 05:14:55,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:14:55,440 INFO L479 AbstractCegarLoop]: Abstraction has 177 states and 188 transitions. [2020-07-18 05:14:55,440 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-18 05:14:55,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 177 states and 188 transitions. [2020-07-18 05:14:55,816 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-18 05:14:55,816 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 188 transitions. [2020-07-18 05:14:55,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-18 05:14:55,817 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:14:55,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, 1, 1, 1, 1, 1, 1] [2020-07-18 05:14:55,817 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-18 05:14:55,818 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-18 05:14:55,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:14:55,818 INFO L82 PathProgramCache]: Analyzing trace with hash 11890970, now seen corresponding path program 1 times [2020-07-18 05:14:55,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:14:55,819 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1435039519] [2020-07-18 05:14:55,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:14:55,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:14:56,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:14:56,127 INFO L280 TraceCheckUtils]: 0: Hoare triple {10920#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {10905#true} is VALID [2020-07-18 05:14:56,127 INFO L280 TraceCheckUtils]: 1: Hoare triple {10905#true} #valid := #valid[0 := 0]; {10905#true} is VALID [2020-07-18 05:14:56,127 INFO L280 TraceCheckUtils]: 2: Hoare triple {10905#true} assume 0 < #StackHeapBarrier; {10905#true} is VALID [2020-07-18 05:14:56,128 INFO L280 TraceCheckUtils]: 3: Hoare triple {10905#true} assume true; {10905#true} is VALID [2020-07-18 05:14:56,128 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {10905#true} {10905#true} #414#return; {10905#true} is VALID [2020-07-18 05:14:56,129 INFO L263 TraceCheckUtils]: 0: Hoare triple {10905#true} call ULTIMATE.init(); {10920#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 05:14:56,129 INFO L280 TraceCheckUtils]: 1: Hoare triple {10920#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {10905#true} is VALID [2020-07-18 05:14:56,129 INFO L280 TraceCheckUtils]: 2: Hoare triple {10905#true} #valid := #valid[0 := 0]; {10905#true} is VALID [2020-07-18 05:14:56,129 INFO L280 TraceCheckUtils]: 3: Hoare triple {10905#true} assume 0 < #StackHeapBarrier; {10905#true} is VALID [2020-07-18 05:14:56,129 INFO L280 TraceCheckUtils]: 4: Hoare triple {10905#true} assume true; {10905#true} is VALID [2020-07-18 05:14:56,130 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {10905#true} {10905#true} #414#return; {10905#true} is VALID [2020-07-18 05:14:56,130 INFO L263 TraceCheckUtils]: 6: Hoare triple {10905#true} call #t~ret28 := main(); {10905#true} is VALID [2020-07-18 05:14:56,130 INFO L280 TraceCheckUtils]: 7: Hoare triple {10905#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {10912#(= 0 |main_#t~malloc0.offset|)} is VALID [2020-07-18 05:14:56,131 INFO L280 TraceCheckUtils]: 8: Hoare triple {10912#(= 0 |main_#t~malloc0.offset|)} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {10913#(= 0 main_~list~0.offset)} is VALID [2020-07-18 05:14:56,131 INFO L280 TraceCheckUtils]: 9: Hoare triple {10913#(= 0 main_~list~0.offset)} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L993 {10913#(= 0 main_~list~0.offset)} is VALID [2020-07-18 05:14:56,132 INFO L280 TraceCheckUtils]: 10: Hoare triple {10913#(= 0 main_~list~0.offset)} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-1 {10913#(= 0 main_~list~0.offset)} is VALID [2020-07-18 05:14:56,132 INFO L280 TraceCheckUtils]: 11: Hoare triple {10913#(= 0 main_~list~0.offset)} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {10913#(= 0 main_~list~0.offset)} is VALID [2020-07-18 05:14:56,133 INFO L280 TraceCheckUtils]: 12: Hoare triple {10913#(= 0 main_~list~0.offset)} goto; {10913#(= 0 main_~list~0.offset)} is VALID [2020-07-18 05:14:56,133 INFO L280 TraceCheckUtils]: 13: Hoare triple {10913#(= 0 main_~list~0.offset)} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {10913#(= 0 main_~list~0.offset)} is VALID [2020-07-18 05:14:56,134 INFO L280 TraceCheckUtils]: 14: Hoare triple {10913#(= 0 main_~list~0.offset)} assume 0 != #t~nondet1; {10913#(= 0 main_~list~0.offset)} is VALID [2020-07-18 05:14:56,134 INFO L280 TraceCheckUtils]: 15: Hoare triple {10913#(= 0 main_~list~0.offset)} havoc #t~nondet1; {10913#(= 0 main_~list~0.offset)} is VALID [2020-07-18 05:14:56,135 INFO L280 TraceCheckUtils]: 16: Hoare triple {10913#(= 0 main_~list~0.offset)} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 8 + ~list~0.offset, 4); srcloc: L995-7 {10913#(= 0 main_~list~0.offset)} is VALID [2020-07-18 05:14:56,136 INFO L280 TraceCheckUtils]: 17: Hoare triple {10913#(= 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 {10914#(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-18 05:14:56,137 INFO L280 TraceCheckUtils]: 18: Hoare triple {10914#(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; {10915#(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-18 05:14:56,137 INFO L280 TraceCheckUtils]: 19: Hoare triple {10915#(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; {10916#(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-18 05:14:56,138 INFO L280 TraceCheckUtils]: 20: Hoare triple {10916#(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 {10916#(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-18 05:14:56,139 INFO L280 TraceCheckUtils]: 21: Hoare triple {10916#(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; {10916#(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-18 05:14:56,140 INFO L280 TraceCheckUtils]: 22: Hoare triple {10916#(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; {10916#(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-18 05:14:56,140 INFO L280 TraceCheckUtils]: 23: Hoare triple {10916#(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; {10916#(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-18 05:14:56,141 INFO L280 TraceCheckUtils]: 24: Hoare triple {10916#(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; {10916#(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-18 05:14:56,142 INFO L280 TraceCheckUtils]: 25: Hoare triple {10916#(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; {10916#(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-18 05:14:56,143 INFO L280 TraceCheckUtils]: 26: Hoare triple {10916#(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; {10916#(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-18 05:14:56,144 INFO L280 TraceCheckUtils]: 27: Hoare triple {10916#(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; {10916#(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-18 05:14:56,144 INFO L280 TraceCheckUtils]: 28: Hoare triple {10916#(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; {10916#(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-18 05:14:56,145 INFO L280 TraceCheckUtils]: 29: Hoare triple {10916#(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); {10916#(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-18 05:14:56,146 INFO L280 TraceCheckUtils]: 30: Hoare triple {10916#(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; {10916#(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-18 05:14:56,147 INFO L280 TraceCheckUtils]: 31: Hoare triple {10916#(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; {10916#(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-18 05:14:56,147 INFO L280 TraceCheckUtils]: 32: Hoare triple {10916#(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; {10917#(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-18 05:14:56,148 INFO L280 TraceCheckUtils]: 33: Hoare triple {10917#(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); {10917#(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-18 05:14:56,149 INFO L280 TraceCheckUtils]: 34: Hoare triple {10917#(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; {10917#(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-18 05:14:56,150 INFO L280 TraceCheckUtils]: 35: Hoare triple {10917#(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); {10917#(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-18 05:14:56,150 INFO L280 TraceCheckUtils]: 36: Hoare triple {10917#(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; {10917#(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-18 05:14:56,151 INFO L280 TraceCheckUtils]: 37: Hoare triple {10917#(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 {10918#(and (= 0 |main_#t~mem19.offset|) (= 0 |main_#t~mem19.base|))} is VALID [2020-07-18 05:14:56,152 INFO L280 TraceCheckUtils]: 38: Hoare triple {10918#(and (= 0 |main_#t~mem19.offset|) (= 0 |main_#t~mem19.base|))} ~inner~0.base, ~inner~0.offset := #t~mem19.base, #t~mem19.offset; {10919#(and (= 0 main_~inner~0.base) (= 0 main_~inner~0.offset))} is VALID [2020-07-18 05:14:56,152 INFO L280 TraceCheckUtils]: 39: Hoare triple {10919#(and (= 0 main_~inner~0.base) (= 0 main_~inner~0.offset))} havoc #t~mem19.base, #t~mem19.offset; {10919#(and (= 0 main_~inner~0.base) (= 0 main_~inner~0.offset))} is VALID [2020-07-18 05:14:56,153 INFO L280 TraceCheckUtils]: 40: Hoare triple {10919#(and (= 0 main_~inner~0.base) (= 0 main_~inner~0.offset))} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {10906#false} is VALID [2020-07-18 05:14:56,153 INFO L280 TraceCheckUtils]: 41: Hoare triple {10906#false} assume 0 == ~len~0; {10906#false} is VALID [2020-07-18 05:14:56,153 INFO L280 TraceCheckUtils]: 42: Hoare triple {10906#false} ~len~0 := 1; {10906#false} is VALID [2020-07-18 05:14:56,154 INFO L280 TraceCheckUtils]: 43: Hoare triple {10906#false} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {10906#false} is VALID [2020-07-18 05:14:56,154 INFO L280 TraceCheckUtils]: 44: Hoare triple {10906#false} goto; {10906#false} is VALID [2020-07-18 05:14:56,154 INFO L280 TraceCheckUtils]: 45: Hoare triple {10906#false} SUMMARY for call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~inner~0.base, 8 + ~inner~0.offset, 4); srcloc: L1028-6 {10906#false} is VALID [2020-07-18 05:14:56,154 INFO L280 TraceCheckUtils]: 46: Hoare triple {10906#false} assume !(0 == #t~mem20.base && 0 == #t~mem20.offset); {10906#false} is VALID [2020-07-18 05:14:56,154 INFO L280 TraceCheckUtils]: 47: Hoare triple {10906#false} havoc #t~mem20.base, #t~mem20.offset; {10906#false} is VALID [2020-07-18 05:14:56,155 INFO L280 TraceCheckUtils]: 48: Hoare triple {10906#false} assume !false; {10906#false} is VALID [2020-07-18 05:14:56,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 05:14:56,164 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1435039519] [2020-07-18 05:14:56,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:14:56,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-18 05:14:56,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183027264] [2020-07-18 05:14:56,171 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2020-07-18 05:14:56,171 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:14:56,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-18 05:14:56,226 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-18 05:14:56,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-18 05:14:56,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:14:56,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-18 05:14:56,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-07-18 05:14:56,227 INFO L87 Difference]: Start difference. First operand 177 states and 188 transitions. Second operand 11 states. [2020-07-18 05:15:00,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:15:00,201 INFO L93 Difference]: Finished difference Result 374 states and 398 transitions. [2020-07-18 05:15:00,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-18 05:15:00,201 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2020-07-18 05:15:00,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:15:00,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-18 05:15:00,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 370 transitions. [2020-07-18 05:15:00,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-18 05:15:00,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 370 transitions. [2020-07-18 05:15:00,207 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 370 transitions. [2020-07-18 05:15:00,650 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-18 05:15:00,656 INFO L225 Difference]: With dead ends: 374 [2020-07-18 05:15:00,657 INFO L226 Difference]: Without dead ends: 306 [2020-07-18 05:15:00,657 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2020-07-18 05:15:00,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2020-07-18 05:15:01,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 196. [2020-07-18 05:15:01,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:15:01,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 306 states. Second operand 196 states. [2020-07-18 05:15:01,565 INFO L74 IsIncluded]: Start isIncluded. First operand 306 states. Second operand 196 states. [2020-07-18 05:15:01,565 INFO L87 Difference]: Start difference. First operand 306 states. Second operand 196 states. [2020-07-18 05:15:01,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:15:01,572 INFO L93 Difference]: Finished difference Result 306 states and 324 transitions. [2020-07-18 05:15:01,573 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 324 transitions. [2020-07-18 05:15:01,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:15:01,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:15:01,574 INFO L74 IsIncluded]: Start isIncluded. First operand 196 states. Second operand 306 states. [2020-07-18 05:15:01,574 INFO L87 Difference]: Start difference. First operand 196 states. Second operand 306 states. [2020-07-18 05:15:01,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:15:01,581 INFO L93 Difference]: Finished difference Result 306 states and 324 transitions. [2020-07-18 05:15:01,582 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 324 transitions. [2020-07-18 05:15:01,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:15:01,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:15:01,583 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:15:01,583 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:15:01,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2020-07-18 05:15:01,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 208 transitions. [2020-07-18 05:15:01,586 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 208 transitions. Word has length 49 [2020-07-18 05:15:01,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:15:01,587 INFO L479 AbstractCegarLoop]: Abstraction has 196 states and 208 transitions. [2020-07-18 05:15:01,587 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-18 05:15:01,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 196 states and 208 transitions. [2020-07-18 05:15:02,100 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-18 05:15:02,100 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 208 transitions. [2020-07-18 05:15:02,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-18 05:15:02,102 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:15:02,102 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-18 05:15:02,102 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-18 05:15:02,103 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-18 05:15:02,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:15:02,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1643041774, now seen corresponding path program 1 times [2020-07-18 05:15:02,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:15:02,104 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [970629004] [2020-07-18 05:15:02,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:15:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:15:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:15:02,583 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-18 05:15:02,583 INFO L280 TraceCheckUtils]: 1: Hoare triple {12699#true} #valid := #valid[0 := 0]; {12699#true} is VALID [2020-07-18 05:15:02,584 INFO L280 TraceCheckUtils]: 2: Hoare triple {12699#true} assume 0 < #StackHeapBarrier; {12699#true} is VALID [2020-07-18 05:15:02,584 INFO L280 TraceCheckUtils]: 3: Hoare triple {12699#true} assume true; {12699#true} is VALID [2020-07-18 05:15:02,584 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {12699#true} {12699#true} #414#return; {12699#true} is VALID [2020-07-18 05:15:02,586 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-18 05:15:02,586 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-18 05:15:02,586 INFO L280 TraceCheckUtils]: 2: Hoare triple {12699#true} #valid := #valid[0 := 0]; {12699#true} is VALID [2020-07-18 05:15:02,586 INFO L280 TraceCheckUtils]: 3: Hoare triple {12699#true} assume 0 < #StackHeapBarrier; {12699#true} is VALID [2020-07-18 05:15:02,586 INFO L280 TraceCheckUtils]: 4: Hoare triple {12699#true} assume true; {12699#true} is VALID [2020-07-18 05:15:02,587 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {12699#true} {12699#true} #414#return; {12699#true} is VALID [2020-07-18 05:15:02,587 INFO L263 TraceCheckUtils]: 6: Hoare triple {12699#true} call #t~ret28 := main(); {12699#true} is VALID [2020-07-18 05:15:02,589 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-18 05:15:02,590 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-18 05:15:02,590 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-18 05:15:02,591 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-18 05:15:02,592 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-18 05:15:02,592 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-18 05:15:02,593 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-18 05:15:02,594 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-18 05:15:02,596 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-18 05:15:02,597 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-18 05:15:02,598 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-18 05:15:02,604 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-18 05:15:02,606 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-18 05:15:02,607 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-18 05:15:02,612 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-18 05:15:02,615 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-18 05:15:02,615 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-18 05:15:02,616 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-18 05:15:02,617 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-18 05:15:02,618 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-18 05:15:02,619 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-18 05:15:02,620 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~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-18 05:15:02,621 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~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-18 05:15:02,621 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~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-18 05:15:02,622 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-18 05:15:02,623 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-18 05:15:02,623 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-18 05:15:02,624 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-18 05:15:02,625 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-18 05:15:02,625 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-18 05:15:02,628 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-18 05:15:02,629 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-18 05:15:02,629 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-18 05:15:02,630 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-18 05:15:02,631 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-18 05:15:02,631 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-18 05:15:02,632 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-18 05:15:02,633 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-18 05:15:02,638 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-18 05:15:02,639 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-18 05:15:02,639 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-18 05:15:02,640 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-18 05:15:02,640 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-18 05:15:02,641 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-18 05:15:02,641 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-18 05:15:02,641 INFO L280 TraceCheckUtils]: 52: Hoare triple {12700#false} havoc #t~mem20.base, #t~mem20.offset; {12700#false} is VALID [2020-07-18 05:15:02,642 INFO L280 TraceCheckUtils]: 53: Hoare triple {12700#false} assume !false; {12700#false} is VALID [2020-07-18 05:15:02,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 05:15:02,658 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [970629004] [2020-07-18 05:15:02,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:15:02,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-18 05:15:02,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117273751] [2020-07-18 05:15:02,659 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2020-07-18 05:15:02,659 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:15:02,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-18 05:15:02,739 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-18 05:15:02,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-18 05:15:02,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:15:02,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-18 05:15:02,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2020-07-18 05:15:02,740 INFO L87 Difference]: Start difference. First operand 196 states and 208 transitions. Second operand 14 states. [2020-07-18 05:15:12,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:15:12,915 INFO L93 Difference]: Finished difference Result 589 states and 622 transitions. [2020-07-18 05:15:12,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-07-18 05:15:12,915 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2020-07-18 05:15:12,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:15:12,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-18 05:15:12,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 551 transitions. [2020-07-18 05:15:12,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-18 05:15:12,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 551 transitions. [2020-07-18 05:15:12,921 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 551 transitions. [2020-07-18 05:15:13,915 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-18 05:15:13,930 INFO L225 Difference]: With dead ends: 589 [2020-07-18 05:15:13,930 INFO L226 Difference]: Without dead ends: 586 [2020-07-18 05:15:13,931 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=252, Invalid=804, Unknown=0, NotChecked=0, Total=1056 [2020-07-18 05:15:13,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-07-18 05:15:15,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 213. [2020-07-18 05:15:15,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:15:15,329 INFO L82 GeneralOperation]: Start isEquivalent. First operand 586 states. Second operand 213 states. [2020-07-18 05:15:15,329 INFO L74 IsIncluded]: Start isIncluded. First operand 586 states. Second operand 213 states. [2020-07-18 05:15:15,329 INFO L87 Difference]: Start difference. First operand 586 states. Second operand 213 states. [2020-07-18 05:15:15,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:15:15,349 INFO L93 Difference]: Finished difference Result 586 states and 619 transitions. [2020-07-18 05:15:15,349 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 619 transitions. [2020-07-18 05:15:15,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:15:15,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:15:15,350 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states. Second operand 586 states. [2020-07-18 05:15:15,351 INFO L87 Difference]: Start difference. First operand 213 states. Second operand 586 states. [2020-07-18 05:15:15,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:15:15,368 INFO L93 Difference]: Finished difference Result 586 states and 619 transitions. [2020-07-18 05:15:15,368 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 619 transitions. [2020-07-18 05:15:15,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:15:15,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:15:15,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:15:15,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:15:15,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-07-18 05:15:15,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 226 transitions. [2020-07-18 05:15:15,374 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 226 transitions. Word has length 54 [2020-07-18 05:15:15,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:15:15,374 INFO L479 AbstractCegarLoop]: Abstraction has 213 states and 226 transitions. [2020-07-18 05:15:15,375 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-18 05:15:15,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 213 states and 226 transitions. [2020-07-18 05:15:16,121 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-18 05:15:16,121 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 226 transitions. [2020-07-18 05:15:16,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-18 05:15:16,122 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:15:16,123 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-18 05:15:16,123 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-18 05:15:16,124 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-18 05:15:16,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:15:16,124 INFO L82 PathProgramCache]: Analyzing trace with hash 358720869, now seen corresponding path program 1 times [2020-07-18 05:15:16,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:15:16,124 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1594790417] [2020-07-18 05:15:16,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:15:16,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:15:16,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:15:16,271 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-18 05:15:16,272 INFO L280 TraceCheckUtils]: 1: Hoare triple {15534#true} #valid := #valid[0 := 0]; {15534#true} is VALID [2020-07-18 05:15:16,272 INFO L280 TraceCheckUtils]: 2: Hoare triple {15534#true} assume 0 < #StackHeapBarrier; {15534#true} is VALID [2020-07-18 05:15:16,272 INFO L280 TraceCheckUtils]: 3: Hoare triple {15534#true} assume true; {15534#true} is VALID [2020-07-18 05:15:16,272 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {15534#true} {15534#true} #414#return; {15534#true} is VALID [2020-07-18 05:15:16,273 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-18 05:15:16,274 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-18 05:15:16,274 INFO L280 TraceCheckUtils]: 2: Hoare triple {15534#true} #valid := #valid[0 := 0]; {15534#true} is VALID [2020-07-18 05:15:16,274 INFO L280 TraceCheckUtils]: 3: Hoare triple {15534#true} assume 0 < #StackHeapBarrier; {15534#true} is VALID [2020-07-18 05:15:16,274 INFO L280 TraceCheckUtils]: 4: Hoare triple {15534#true} assume true; {15534#true} is VALID [2020-07-18 05:15:16,274 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {15534#true} {15534#true} #414#return; {15534#true} is VALID [2020-07-18 05:15:16,274 INFO L263 TraceCheckUtils]: 6: Hoare triple {15534#true} call #t~ret28 := main(); {15534#true} is VALID [2020-07-18 05:15:16,275 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-18 05:15:16,275 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-18 05:15:16,275 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-18 05:15:16,275 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-18 05:15:16,275 INFO L280 TraceCheckUtils]: 11: Hoare triple {15534#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {15534#true} is VALID [2020-07-18 05:15:16,276 INFO L280 TraceCheckUtils]: 12: Hoare triple {15534#true} goto; {15534#true} is VALID [2020-07-18 05:15:16,276 INFO L280 TraceCheckUtils]: 13: Hoare triple {15534#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {15534#true} is VALID [2020-07-18 05:15:16,276 INFO L280 TraceCheckUtils]: 14: Hoare triple {15534#true} assume 0 != #t~nondet1; {15534#true} is VALID [2020-07-18 05:15:16,276 INFO L280 TraceCheckUtils]: 15: Hoare triple {15534#true} havoc #t~nondet1; {15534#true} is VALID [2020-07-18 05:15:16,276 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-18 05:15:16,277 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-18 05:15:16,279 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-18 05:15:16,280 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-18 05:15:16,280 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-18 05:15:16,281 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-18 05:15:16,282 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-18 05:15:16,283 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~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-18 05:15:16,284 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~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-18 05:15:16,285 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~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-18 05:15:16,285 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-18 05:15:16,286 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-18 05:15:16,287 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-18 05:15:16,288 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-18 05:15:16,289 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-18 05:15:16,290 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-18 05:15:16,291 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-18 05:15:16,291 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-18 05:15:16,293 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-18 05:15:16,294 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-18 05:15:16,295 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-18 05:15:16,296 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-18 05:15:16,297 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-18 05:15:16,298 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-18 05:15:16,298 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-18 05:15:16,299 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-18 05:15:16,300 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-18 05:15:16,301 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-18 05:15:16,302 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-18 05:15:16,303 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-18 05:15:16,304 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-18 05:15:16,305 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-18 05:15:16,306 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-18 05:15:16,306 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-18 05:15:16,307 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-18 05:15:16,308 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-18 05:15:16,308 INFO L280 TraceCheckUtils]: 52: Hoare triple {15535#false} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {15535#false} is VALID [2020-07-18 05:15:16,309 INFO L280 TraceCheckUtils]: 53: Hoare triple {15535#false} assume !false; {15535#false} is VALID [2020-07-18 05:15:16,330 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-18 05:15:16,330 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1594790417] [2020-07-18 05:15:16,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:15:16,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-18 05:15:16,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404894789] [2020-07-18 05:15:16,332 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2020-07-18 05:15:16,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:15:16,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-18 05:15:16,394 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-18 05:15:16,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-18 05:15:16,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:15:16,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-18 05:15:16,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-18 05:15:16,395 INFO L87 Difference]: Start difference. First operand 213 states and 226 transitions. Second operand 8 states. [2020-07-18 05:15:19,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:15:19,572 INFO L93 Difference]: Finished difference Result 297 states and 316 transitions. [2020-07-18 05:15:19,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-18 05:15:19,572 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2020-07-18 05:15:19,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:15:19,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 05:15:19,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 267 transitions. [2020-07-18 05:15:19,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 05:15:19,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 267 transitions. [2020-07-18 05:15:19,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 267 transitions. [2020-07-18 05:15:19,874 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-18 05:15:19,879 INFO L225 Difference]: With dead ends: 297 [2020-07-18 05:15:19,880 INFO L226 Difference]: Without dead ends: 267 [2020-07-18 05:15:19,880 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-07-18 05:15:19,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2020-07-18 05:15:21,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 248. [2020-07-18 05:15:21,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:15:21,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 267 states. Second operand 248 states. [2020-07-18 05:15:21,489 INFO L74 IsIncluded]: Start isIncluded. First operand 267 states. Second operand 248 states. [2020-07-18 05:15:21,489 INFO L87 Difference]: Start difference. First operand 267 states. Second operand 248 states. [2020-07-18 05:15:21,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:15:21,495 INFO L93 Difference]: Finished difference Result 267 states and 284 transitions. [2020-07-18 05:15:21,495 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 284 transitions. [2020-07-18 05:15:21,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:15:21,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:15:21,496 INFO L74 IsIncluded]: Start isIncluded. First operand 248 states. Second operand 267 states. [2020-07-18 05:15:21,496 INFO L87 Difference]: Start difference. First operand 248 states. Second operand 267 states. [2020-07-18 05:15:21,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:15:21,502 INFO L93 Difference]: Finished difference Result 267 states and 284 transitions. [2020-07-18 05:15:21,502 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 284 transitions. [2020-07-18 05:15:21,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:15:21,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:15:21,503 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:15:21,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:15:21,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2020-07-18 05:15:21,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 268 transitions. [2020-07-18 05:15:21,508 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 268 transitions. Word has length 54 [2020-07-18 05:15:21,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:15:21,509 INFO L479 AbstractCegarLoop]: Abstraction has 248 states and 268 transitions. [2020-07-18 05:15:21,509 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-18 05:15:21,509 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 248 states and 268 transitions. [2020-07-18 05:15:22,348 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-18 05:15:22,349 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 268 transitions. [2020-07-18 05:15:22,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-18 05:15:22,350 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:15:22,350 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-18 05:15:22,350 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-18 05:15:22,351 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-18 05:15:22,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:15:22,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1270543956, now seen corresponding path program 1 times [2020-07-18 05:15:22,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:15:22,352 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2145294688] [2020-07-18 05:15:22,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:15:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:15:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:15:22,405 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-18 05:15:22,405 INFO L280 TraceCheckUtils]: 1: Hoare triple {17181#true} #valid := #valid[0 := 0]; {17181#true} is VALID [2020-07-18 05:15:22,405 INFO L280 TraceCheckUtils]: 2: Hoare triple {17181#true} assume 0 < #StackHeapBarrier; {17181#true} is VALID [2020-07-18 05:15:22,405 INFO L280 TraceCheckUtils]: 3: Hoare triple {17181#true} assume true; {17181#true} is VALID [2020-07-18 05:15:22,406 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {17181#true} {17181#true} #414#return; {17181#true} is VALID [2020-07-18 05:15:22,406 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-18 05:15:22,407 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-18 05:15:22,407 INFO L280 TraceCheckUtils]: 2: Hoare triple {17181#true} #valid := #valid[0 := 0]; {17181#true} is VALID [2020-07-18 05:15:22,407 INFO L280 TraceCheckUtils]: 3: Hoare triple {17181#true} assume 0 < #StackHeapBarrier; {17181#true} is VALID [2020-07-18 05:15:22,407 INFO L280 TraceCheckUtils]: 4: Hoare triple {17181#true} assume true; {17181#true} is VALID [2020-07-18 05:15:22,407 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {17181#true} {17181#true} #414#return; {17181#true} is VALID [2020-07-18 05:15:22,408 INFO L263 TraceCheckUtils]: 6: Hoare triple {17181#true} call #t~ret28 := main(); {17181#true} is VALID [2020-07-18 05:15:22,408 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-18 05:15:22,408 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-18 05:15:22,408 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-18 05:15:22,408 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-18 05:15:22,409 INFO L280 TraceCheckUtils]: 11: Hoare triple {17181#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {17181#true} is VALID [2020-07-18 05:15:22,409 INFO L280 TraceCheckUtils]: 12: Hoare triple {17181#true} goto; {17181#true} is VALID [2020-07-18 05:15:22,409 INFO L280 TraceCheckUtils]: 13: Hoare triple {17181#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {17181#true} is VALID [2020-07-18 05:15:22,409 INFO L280 TraceCheckUtils]: 14: Hoare triple {17181#true} assume 0 != #t~nondet1; {17181#true} is VALID [2020-07-18 05:15:22,410 INFO L280 TraceCheckUtils]: 15: Hoare triple {17181#true} havoc #t~nondet1; {17181#true} is VALID [2020-07-18 05:15:22,410 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-18 05:15:22,410 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-18 05:15:22,410 INFO L280 TraceCheckUtils]: 18: Hoare triple {17181#true} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {17181#true} is VALID [2020-07-18 05:15:22,410 INFO L280 TraceCheckUtils]: 19: Hoare triple {17181#true} assume !#t~short7; {17181#true} is VALID [2020-07-18 05:15:22,411 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-18 05:15:22,411 INFO L280 TraceCheckUtils]: 21: Hoare triple {17181#true} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {17181#true} is VALID [2020-07-18 05:15:22,411 INFO L280 TraceCheckUtils]: 22: Hoare triple {17181#true} assume !!#t~short7; {17181#true} is VALID [2020-07-18 05:15:22,411 INFO L280 TraceCheckUtils]: 23: Hoare triple {17181#true} havoc #t~short7; {17181#true} is VALID [2020-07-18 05:15:22,411 INFO L280 TraceCheckUtils]: 24: Hoare triple {17181#true} havoc #t~mem5.base, #t~mem5.offset; {17181#true} is VALID [2020-07-18 05:15:22,412 INFO L280 TraceCheckUtils]: 25: Hoare triple {17181#true} havoc #t~mem6.base, #t~mem6.offset; {17181#true} is VALID [2020-07-18 05:15:22,412 INFO L280 TraceCheckUtils]: 26: Hoare triple {17181#true} goto; {17181#true} is VALID [2020-07-18 05:15:22,412 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-18 05:15:22,412 INFO L280 TraceCheckUtils]: 28: Hoare triple {17181#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {17181#true} is VALID [2020-07-18 05:15:22,412 INFO L280 TraceCheckUtils]: 29: Hoare triple {17181#true} assume !!(0 != #t~nondet8); {17181#true} is VALID [2020-07-18 05:15:22,412 INFO L280 TraceCheckUtils]: 30: Hoare triple {17181#true} havoc #t~nondet8; {17181#true} is VALID [2020-07-18 05:15:22,413 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-18 05:15:22,413 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-18 05:15:22,413 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-18 05:15:22,413 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-18 05:15:22,414 INFO L280 TraceCheckUtils]: 35: Hoare triple {17181#true} havoc #t~mem10.base, #t~mem10.offset; {17181#true} is VALID [2020-07-18 05:15:22,414 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-18 05:15:22,414 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-18 05:15:22,414 INFO L280 TraceCheckUtils]: 38: Hoare triple {17181#true} havoc #t~mem11.base, #t~mem11.offset; {17181#true} is VALID [2020-07-18 05:15:22,414 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-18 05:15:22,415 INFO L280 TraceCheckUtils]: 40: Hoare triple {17181#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {17181#true} is VALID [2020-07-18 05:15:22,415 INFO L280 TraceCheckUtils]: 41: Hoare triple {17181#true} goto; {17181#true} is VALID [2020-07-18 05:15:22,415 INFO L280 TraceCheckUtils]: 42: Hoare triple {17181#true} assume !!(~end~0.base != 0 || ~end~0.offset != 0); {17181#true} is VALID [2020-07-18 05:15:22,415 INFO L280 TraceCheckUtils]: 43: Hoare triple {17181#true} goto; {17181#true} is VALID [2020-07-18 05:15:22,415 INFO L280 TraceCheckUtils]: 44: Hoare triple {17181#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647; {17181#true} is VALID [2020-07-18 05:15:22,416 INFO L280 TraceCheckUtils]: 45: Hoare triple {17181#true} assume 0 != #t~nondet12; {17181#true} is VALID [2020-07-18 05:15:22,416 INFO L280 TraceCheckUtils]: 46: Hoare triple {17181#true} havoc #t~nondet12; {17181#true} is VALID [2020-07-18 05:15:22,416 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-18 05:15:22,416 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-18 05:15:22,416 INFO L280 TraceCheckUtils]: 49: Hoare triple {17181#true} #t~short18 := #t~mem16.base != 0 || #t~mem16.offset != 0; {17181#true} is VALID [2020-07-18 05:15:22,425 INFO L280 TraceCheckUtils]: 50: Hoare triple {17181#true} assume #t~short18; {17188#|main_#t~short18|} is VALID [2020-07-18 05:15:22,426 INFO L280 TraceCheckUtils]: 51: Hoare triple {17188#|main_#t~short18|} assume !#t~short18; {17182#false} is VALID [2020-07-18 05:15:22,426 INFO L280 TraceCheckUtils]: 52: Hoare triple {17182#false} havoc #t~mem16.base, #t~mem16.offset; {17182#false} is VALID [2020-07-18 05:15:22,426 INFO L280 TraceCheckUtils]: 53: Hoare triple {17182#false} havoc #t~short18; {17182#false} is VALID [2020-07-18 05:15:22,426 INFO L280 TraceCheckUtils]: 54: Hoare triple {17182#false} havoc #t~mem17.base, #t~mem17.offset; {17182#false} is VALID [2020-07-18 05:15:22,426 INFO L280 TraceCheckUtils]: 55: Hoare triple {17182#false} assume !false; {17182#false} is VALID [2020-07-18 05:15:22,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 05:15:22,428 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2145294688] [2020-07-18 05:15:22,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:15:22,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-18 05:15:22,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468309171] [2020-07-18 05:15:22,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2020-07-18 05:15:22,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:15:22,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-18 05:15:22,495 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-18 05:15:22,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-18 05:15:22,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:15:22,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-18 05:15:22,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 05:15:22,496 INFO L87 Difference]: Start difference. First operand 248 states and 268 transitions. Second operand 4 states. [2020-07-18 05:15:24,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:15:24,545 INFO L93 Difference]: Finished difference Result 254 states and 274 transitions. [2020-07-18 05:15:24,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-18 05:15:24,545 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2020-07-18 05:15:24,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:15:24,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 05:15:24,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 170 transitions. [2020-07-18 05:15:24,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 05:15:24,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 170 transitions. [2020-07-18 05:15:24,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 170 transitions. [2020-07-18 05:15:24,729 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:15:24,733 INFO L225 Difference]: With dead ends: 254 [2020-07-18 05:15:24,733 INFO L226 Difference]: Without dead ends: 249 [2020-07-18 05:15:24,734 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 05:15:24,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2020-07-18 05:15:26,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2020-07-18 05:15:26,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:15:26,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 249 states. Second operand 249 states. [2020-07-18 05:15:26,424 INFO L74 IsIncluded]: Start isIncluded. First operand 249 states. Second operand 249 states. [2020-07-18 05:15:26,425 INFO L87 Difference]: Start difference. First operand 249 states. Second operand 249 states. [2020-07-18 05:15:26,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:15:26,431 INFO L93 Difference]: Finished difference Result 249 states and 269 transitions. [2020-07-18 05:15:26,431 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 269 transitions. [2020-07-18 05:15:26,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:15:26,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:15:26,432 INFO L74 IsIncluded]: Start isIncluded. First operand 249 states. Second operand 249 states. [2020-07-18 05:15:26,432 INFO L87 Difference]: Start difference. First operand 249 states. Second operand 249 states. [2020-07-18 05:15:26,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:15:26,438 INFO L93 Difference]: Finished difference Result 249 states and 269 transitions. [2020-07-18 05:15:26,438 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 269 transitions. [2020-07-18 05:15:26,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:15:26,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:15:26,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:15:26,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:15:26,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2020-07-18 05:15:26,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 269 transitions. [2020-07-18 05:15:26,443 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 269 transitions. Word has length 56 [2020-07-18 05:15:26,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:15:26,443 INFO L479 AbstractCegarLoop]: Abstraction has 249 states and 269 transitions. [2020-07-18 05:15:26,443 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-18 05:15:26,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 249 states and 269 transitions. [2020-07-18 05:15:27,359 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-18 05:15:27,359 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 269 transitions. [2020-07-18 05:15:27,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-18 05:15:27,360 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:15:27,360 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-18 05:15:27,361 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-18 05:15:27,361 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-18 05:15:27,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:15:27,361 INFO L82 PathProgramCache]: Analyzing trace with hash 2002844954, now seen corresponding path program 1 times [2020-07-18 05:15:27,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:15:27,361 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [566375787] [2020-07-18 05:15:27,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:15:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-18 05:15:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-18 05:15:27,427 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-18 05:15:27,427 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-18 05:15:27,427 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-18 05:15:27,476 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-18 05:15:27,476 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-18 05:15:27,477 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-18 05:15:27,477 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-18 05:15:27,477 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 05:15:27,477 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 05:15:27,477 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 05:15:27,477 WARN L170 areAnnotationChecker]: L992 has no Hoare annotation [2020-07-18 05:15:27,477 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-18 05:15:27,477 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-18 05:15:27,477 WARN L170 areAnnotationChecker]: L993 has no Hoare annotation [2020-07-18 05:15:27,478 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-18 05:15:27,478 WARN L170 areAnnotationChecker]: L993-1 has no Hoare annotation [2020-07-18 05:15:27,478 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-18 05:15:27,478 WARN L170 areAnnotationChecker]: L995-3 has no Hoare annotation [2020-07-18 05:15:27,478 WARN L170 areAnnotationChecker]: L995-3 has no Hoare annotation [2020-07-18 05:15:27,478 WARN L170 areAnnotationChecker]: L995-3 has no Hoare annotation [2020-07-18 05:15:27,478 WARN L170 areAnnotationChecker]: L995-4 has no Hoare annotation [2020-07-18 05:15:27,478 WARN L170 areAnnotationChecker]: L995 has no Hoare annotation [2020-07-18 05:15:27,479 WARN L170 areAnnotationChecker]: L995 has no Hoare annotation [2020-07-18 05:15:27,479 WARN L170 areAnnotationChecker]: L995-2 has no Hoare annotation [2020-07-18 05:15:27,479 WARN L170 areAnnotationChecker]: L995-2 has no Hoare annotation [2020-07-18 05:15:27,479 WARN L170 areAnnotationChecker]: L995-5 has no Hoare annotation [2020-07-18 05:15:27,479 WARN L170 areAnnotationChecker]: L995-5 has no Hoare annotation [2020-07-18 05:15:27,479 WARN L170 areAnnotationChecker]: L995-6 has no Hoare annotation [2020-07-18 05:15:27,479 WARN L170 areAnnotationChecker]: L995-9 has no Hoare annotation [2020-07-18 05:15:27,479 WARN L170 areAnnotationChecker]: L995-7 has no Hoare annotation [2020-07-18 05:15:27,479 WARN L170 areAnnotationChecker]: L995-10 has no Hoare annotation [2020-07-18 05:15:27,480 WARN L170 areAnnotationChecker]: L995-34 has no Hoare annotation [2020-07-18 05:15:27,480 WARN L170 areAnnotationChecker]: L995-34 has no Hoare annotation [2020-07-18 05:15:27,480 WARN L170 areAnnotationChecker]: L995-11 has no Hoare annotation [2020-07-18 05:15:27,480 WARN L170 areAnnotationChecker]: L995-19 has no Hoare annotation [2020-07-18 05:15:27,480 WARN L170 areAnnotationChecker]: L995-35 has no Hoare annotation [2020-07-18 05:15:27,480 WARN L170 areAnnotationChecker]: L995-12 has no Hoare annotation [2020-07-18 05:15:27,480 WARN L170 areAnnotationChecker]: L995-20 has no Hoare annotation [2020-07-18 05:15:27,480 WARN L170 areAnnotationChecker]: L995-20 has no Hoare annotation [2020-07-18 05:15:27,480 WARN L170 areAnnotationChecker]: L1008-35 has no Hoare annotation [2020-07-18 05:15:27,481 WARN L170 areAnnotationChecker]: L1008-35 has no Hoare annotation [2020-07-18 05:15:27,481 WARN L170 areAnnotationChecker]: L995-13 has no Hoare annotation [2020-07-18 05:15:27,481 WARN L170 areAnnotationChecker]: L995-24 has no Hoare annotation [2020-07-18 05:15:27,481 WARN L170 areAnnotationChecker]: L995-24 has no Hoare annotation [2020-07-18 05:15:27,481 WARN L170 areAnnotationChecker]: L995-22 has no Hoare annotation [2020-07-18 05:15:27,481 WARN L170 areAnnotationChecker]: L1000-5 has no Hoare annotation [2020-07-18 05:15:27,481 WARN L170 areAnnotationChecker]: L1000-1 has no Hoare annotation [2020-07-18 05:15:27,481 WARN L170 areAnnotationChecker]: L1000-1 has no Hoare annotation [2020-07-18 05:15:27,481 WARN L170 areAnnotationChecker]: L995-14 has no Hoare annotation [2020-07-18 05:15:27,482 WARN L170 areAnnotationChecker]: L995-25 has no Hoare annotation [2020-07-18 05:15:27,482 WARN L170 areAnnotationChecker]: L995-30 has no Hoare annotation [2020-07-18 05:15:27,482 WARN L170 areAnnotationChecker]: L995-23 has no Hoare annotation [2020-07-18 05:15:27,482 WARN L170 areAnnotationChecker]: L1012 has no Hoare annotation [2020-07-18 05:15:27,482 WARN L170 areAnnotationChecker]: L1000-2 has no Hoare annotation [2020-07-18 05:15:27,482 WARN L170 areAnnotationChecker]: L1000-4 has no Hoare annotation [2020-07-18 05:15:27,482 WARN L170 areAnnotationChecker]: L995-15 has no Hoare annotation [2020-07-18 05:15:27,482 WARN L170 areAnnotationChecker]: L995-26 has no Hoare annotation [2020-07-18 05:15:27,482 WARN L170 areAnnotationChecker]: L995-31 has no Hoare annotation [2020-07-18 05:15:27,483 WARN L170 areAnnotationChecker]: L1015-4 has no Hoare annotation [2020-07-18 05:15:27,483 WARN L170 areAnnotationChecker]: L1015-4 has no Hoare annotation [2020-07-18 05:15:27,483 WARN L170 areAnnotationChecker]: L1015-4 has no Hoare annotation [2020-07-18 05:15:27,483 WARN L170 areAnnotationChecker]: L1003 has no Hoare annotation [2020-07-18 05:15:27,483 WARN L170 areAnnotationChecker]: L995-16 has no Hoare annotation [2020-07-18 05:15:27,483 WARN L170 areAnnotationChecker]: L995-27 has no Hoare annotation [2020-07-18 05:15:27,483 WARN L170 areAnnotationChecker]: L995-32 has no Hoare annotation [2020-07-18 05:15:27,483 WARN L170 areAnnotationChecker]: L1017-1 has no Hoare annotation [2020-07-18 05:15:27,483 WARN L170 areAnnotationChecker]: L1017-1 has no Hoare annotation [2020-07-18 05:15:27,484 WARN L170 areAnnotationChecker]: L1017-1 has no Hoare annotation [2020-07-18 05:15:27,484 WARN L170 areAnnotationChecker]: L1015-1 has no Hoare annotation [2020-07-18 05:15:27,484 WARN L170 areAnnotationChecker]: L1015-1 has no Hoare annotation [2020-07-18 05:15:27,484 WARN L170 areAnnotationChecker]: L1015-3 has no Hoare annotation [2020-07-18 05:15:27,484 WARN L170 areAnnotationChecker]: L1015-3 has no Hoare annotation [2020-07-18 05:15:27,484 WARN L170 areAnnotationChecker]: L1003-1 has no Hoare annotation [2020-07-18 05:15:27,484 WARN L170 areAnnotationChecker]: L995-17 has no Hoare annotation [2020-07-18 05:15:27,484 WARN L170 areAnnotationChecker]: L995-28 has no Hoare annotation [2020-07-18 05:15:27,484 WARN L170 areAnnotationChecker]: L995-28 has no Hoare annotation [2020-07-18 05:15:27,485 WARN L170 areAnnotationChecker]: L995-33 has no Hoare annotation [2020-07-18 05:15:27,485 WARN L170 areAnnotationChecker]: L995-33 has no Hoare annotation [2020-07-18 05:15:27,485 WARN L170 areAnnotationChecker]: L1038-1 has no Hoare annotation [2020-07-18 05:15:27,485 WARN L170 areAnnotationChecker]: L1038-1 has no Hoare annotation [2020-07-18 05:15:27,485 WARN L170 areAnnotationChecker]: L1038-1 has no Hoare annotation [2020-07-18 05:15:27,485 WARN L170 areAnnotationChecker]: L1019 has no Hoare annotation [2020-07-18 05:15:27,485 WARN L170 areAnnotationChecker]: L1003-2 has no Hoare annotation [2020-07-18 05:15:27,485 WARN L170 areAnnotationChecker]: L1038-2 has no Hoare annotation [2020-07-18 05:15:27,486 WARN L170 areAnnotationChecker]: L1040 has no Hoare annotation [2020-07-18 05:15:27,486 WARN L170 areAnnotationChecker]: L1020 has no Hoare annotation [2020-07-18 05:15:27,486 WARN L170 areAnnotationChecker]: L1004 has no Hoare annotation [2020-07-18 05:15:27,486 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-18 05:15:27,486 WARN L170 areAnnotationChecker]: L1040-1 has no Hoare annotation [2020-07-18 05:15:27,486 WARN L170 areAnnotationChecker]: L1020-1 has no Hoare annotation [2020-07-18 05:15:27,486 WARN L170 areAnnotationChecker]: L1004-1 has no Hoare annotation [2020-07-18 05:15:27,486 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-18 05:15:27,486 WARN L170 areAnnotationChecker]: L1040-2 has no Hoare annotation [2020-07-18 05:15:27,487 WARN L170 areAnnotationChecker]: L1020-2 has no Hoare annotation [2020-07-18 05:15:27,487 WARN L170 areAnnotationChecker]: L1005 has no Hoare annotation [2020-07-18 05:15:27,487 WARN L170 areAnnotationChecker]: L1042 has no Hoare annotation [2020-07-18 05:15:27,487 WARN L170 areAnnotationChecker]: L1042 has no Hoare annotation [2020-07-18 05:15:27,487 WARN L170 areAnnotationChecker]: L1021-2 has no Hoare annotation [2020-07-18 05:15:27,487 WARN L170 areAnnotationChecker]: L1021-2 has no Hoare annotation [2020-07-18 05:15:27,487 WARN L170 areAnnotationChecker]: L1021-2 has no Hoare annotation [2020-07-18 05:15:27,487 WARN L170 areAnnotationChecker]: L1005-1 has no Hoare annotation [2020-07-18 05:15:27,487 WARN L170 areAnnotationChecker]: L1044-4 has no Hoare annotation [2020-07-18 05:15:27,488 WARN L170 areAnnotationChecker]: L1044-4 has no Hoare annotation [2020-07-18 05:15:27,488 WARN L170 areAnnotationChecker]: L1044-4 has no Hoare annotation [2020-07-18 05:15:27,488 WARN L170 areAnnotationChecker]: L1042-2 has no Hoare annotation [2020-07-18 05:15:27,488 WARN L170 areAnnotationChecker]: L1032-3 has no Hoare annotation [2020-07-18 05:15:27,488 WARN L170 areAnnotationChecker]: L1032-3 has no Hoare annotation [2020-07-18 05:15:27,488 WARN L170 areAnnotationChecker]: L1032-3 has no Hoare annotation [2020-07-18 05:15:27,488 WARN L170 areAnnotationChecker]: L1023 has no Hoare annotation [2020-07-18 05:15:27,488 WARN L170 areAnnotationChecker]: L1023 has no Hoare annotation [2020-07-18 05:15:27,488 WARN L170 areAnnotationChecker]: L1005-2 has no Hoare annotation [2020-07-18 05:15:27,489 WARN L170 areAnnotationChecker]: L1045-6 has no Hoare annotation [2020-07-18 05:15:27,489 WARN L170 areAnnotationChecker]: L1045-6 has no Hoare annotation [2020-07-18 05:15:27,489 WARN L170 areAnnotationChecker]: L1044-1 has no Hoare annotation [2020-07-18 05:15:27,489 WARN L170 areAnnotationChecker]: L1044-1 has no Hoare annotation [2020-07-18 05:15:27,489 WARN L170 areAnnotationChecker]: L1044-3 has no Hoare annotation [2020-07-18 05:15:27,489 WARN L170 areAnnotationChecker]: L1044-3 has no Hoare annotation [2020-07-18 05:15:27,489 WARN L170 areAnnotationChecker]: L1050 has no Hoare annotation [2020-07-18 05:15:27,489 WARN L170 areAnnotationChecker]: L1032-4 has no Hoare annotation [2020-07-18 05:15:27,489 WARN L170 areAnnotationChecker]: L1032 has no Hoare annotation [2020-07-18 05:15:27,490 WARN L170 areAnnotationChecker]: L1032 has no Hoare annotation [2020-07-18 05:15:27,490 WARN L170 areAnnotationChecker]: L1032-2 has no Hoare annotation [2020-07-18 05:15:27,490 WARN L170 areAnnotationChecker]: L1032-2 has no Hoare annotation [2020-07-18 05:15:27,490 WARN L170 areAnnotationChecker]: L1024 has no Hoare annotation [2020-07-18 05:15:27,490 WARN L170 areAnnotationChecker]: L1026 has no Hoare annotation [2020-07-18 05:15:27,490 WARN L170 areAnnotationChecker]: L1006 has no Hoare annotation [2020-07-18 05:15:27,490 WARN L170 areAnnotationChecker]: L1045 has no Hoare annotation [2020-07-18 05:15:27,490 WARN L170 areAnnotationChecker]: L1045 has no Hoare annotation [2020-07-18 05:15:27,490 WARN L170 areAnnotationChecker]: L1046-6 has no Hoare annotation [2020-07-18 05:15:27,491 WARN L170 areAnnotationChecker]: L1046-6 has no Hoare annotation [2020-07-18 05:15:27,491 WARN L170 areAnnotationChecker]: L1050-1 has no Hoare annotation [2020-07-18 05:15:27,491 WARN L170 areAnnotationChecker]: L1034 has no Hoare annotation [2020-07-18 05:15:27,491 WARN L170 areAnnotationChecker]: L1027-3 has no Hoare annotation [2020-07-18 05:15:27,491 WARN L170 areAnnotationChecker]: L1027-3 has no Hoare annotation [2020-07-18 05:15:27,491 WARN L170 areAnnotationChecker]: L1027-3 has no Hoare annotation [2020-07-18 05:15:27,491 WARN L170 areAnnotationChecker]: L1007-3 has no Hoare annotation [2020-07-18 05:15:27,491 WARN L170 areAnnotationChecker]: L1007-3 has no Hoare annotation [2020-07-18 05:15:27,492 WARN L170 areAnnotationChecker]: L1007-3 has no Hoare annotation [2020-07-18 05:15:27,492 WARN L170 areAnnotationChecker]: L1045-1 has no Hoare annotation [2020-07-18 05:15:27,492 WARN L170 areAnnotationChecker]: L1045-4 has no Hoare annotation [2020-07-18 05:15:27,492 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2020-07-18 05:15:27,492 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2020-07-18 05:15:27,492 WARN L170 areAnnotationChecker]: L1046-7 has no Hoare annotation [2020-07-18 05:15:27,492 WARN L170 areAnnotationChecker]: L1051 has no Hoare annotation [2020-07-18 05:15:27,492 WARN L170 areAnnotationChecker]: L1034-1 has no Hoare annotation [2020-07-18 05:15:27,492 WARN L170 areAnnotationChecker]: L1028-6 has no Hoare annotation [2020-07-18 05:15:27,493 WARN L170 areAnnotationChecker]: L1028-6 has no Hoare annotation [2020-07-18 05:15:27,493 WARN L170 areAnnotationChecker]: L1027 has no Hoare annotation [2020-07-18 05:15:27,493 WARN L170 areAnnotationChecker]: L1027 has no Hoare annotation [2020-07-18 05:15:27,493 WARN L170 areAnnotationChecker]: L1027-2 has no Hoare annotation [2020-07-18 05:15:27,493 WARN L170 areAnnotationChecker]: L1027-2 has no Hoare annotation [2020-07-18 05:15:27,493 WARN L170 areAnnotationChecker]: L1008-3 has no Hoare annotation [2020-07-18 05:15:27,493 WARN L170 areAnnotationChecker]: L1008-3 has no Hoare annotation [2020-07-18 05:15:27,493 WARN L170 areAnnotationChecker]: L1008-3 has no Hoare annotation [2020-07-18 05:15:27,493 WARN L170 areAnnotationChecker]: L1007 has no Hoare annotation [2020-07-18 05:15:27,494 WARN L170 areAnnotationChecker]: L1007 has no Hoare annotation [2020-07-18 05:15:27,494 WARN L170 areAnnotationChecker]: L1007-2 has no Hoare annotation [2020-07-18 05:15:27,494 WARN L170 areAnnotationChecker]: L1007-2 has no Hoare annotation [2020-07-18 05:15:27,494 WARN L170 areAnnotationChecker]: L1045-2 has no Hoare annotation [2020-07-18 05:15:27,494 WARN L170 areAnnotationChecker]: L1045-2 has no Hoare annotation [2020-07-18 05:15:27,494 WARN L170 areAnnotationChecker]: L1045-5 has no Hoare annotation [2020-07-18 05:15:27,494 WARN L170 areAnnotationChecker]: L1045-5 has no Hoare annotation [2020-07-18 05:15:27,494 WARN L170 areAnnotationChecker]: L1046-1 has no Hoare annotation [2020-07-18 05:15:27,494 WARN L170 areAnnotationChecker]: L1046-4 has no Hoare annotation [2020-07-18 05:15:27,495 WARN L170 areAnnotationChecker]: L1047 has no Hoare annotation [2020-07-18 05:15:27,495 WARN L170 areAnnotationChecker]: L1051-1 has no Hoare annotation [2020-07-18 05:15:27,495 WARN L170 areAnnotationChecker]: L1028 has no Hoare annotation [2020-07-18 05:15:27,495 WARN L170 areAnnotationChecker]: L1028 has no Hoare annotation [2020-07-18 05:15:27,495 WARN L170 areAnnotationChecker]: L1029-6 has no Hoare annotation [2020-07-18 05:15:27,495 WARN L170 areAnnotationChecker]: L1029-6 has no Hoare annotation [2020-07-18 05:15:27,495 WARN L170 areAnnotationChecker]: L1008-4 has no Hoare annotation [2020-07-18 05:15:27,495 WARN L170 areAnnotationChecker]: L1008 has no Hoare annotation [2020-07-18 05:15:27,495 WARN L170 areAnnotationChecker]: L1008 has no Hoare annotation [2020-07-18 05:15:27,496 WARN L170 areAnnotationChecker]: L1008-2 has no Hoare annotation [2020-07-18 05:15:27,496 WARN L170 areAnnotationChecker]: L1008-2 has no Hoare annotation [2020-07-18 05:15:27,496 WARN L170 areAnnotationChecker]: L1046-2 has no Hoare annotation [2020-07-18 05:15:27,496 WARN L170 areAnnotationChecker]: L1046-2 has no Hoare annotation [2020-07-18 05:15:27,496 WARN L170 areAnnotationChecker]: L1046-5 has no Hoare annotation [2020-07-18 05:15:27,496 WARN L170 areAnnotationChecker]: L1046-5 has no Hoare annotation [2020-07-18 05:15:27,496 WARN L170 areAnnotationChecker]: L1028-1 has no Hoare annotation [2020-07-18 05:15:27,496 WARN L170 areAnnotationChecker]: L1028-4 has no Hoare annotation [2020-07-18 05:15:27,496 WARN L170 areAnnotationChecker]: L1029 has no Hoare annotation [2020-07-18 05:15:27,497 WARN L170 areAnnotationChecker]: L1029 has no Hoare annotation [2020-07-18 05:15:27,497 WARN L170 areAnnotationChecker]: L1029-7 has no Hoare annotation [2020-07-18 05:15:27,497 WARN L170 areAnnotationChecker]: L1008-5 has no Hoare annotation [2020-07-18 05:15:27,497 WARN L170 areAnnotationChecker]: L1008-5 has no Hoare annotation [2020-07-18 05:15:27,497 WARN L170 areAnnotationChecker]: L1028-2 has no Hoare annotation [2020-07-18 05:15:27,497 WARN L170 areAnnotationChecker]: L1028-2 has no Hoare annotation [2020-07-18 05:15:27,497 WARN L170 areAnnotationChecker]: L1028-5 has no Hoare annotation [2020-07-18 05:15:27,497 WARN L170 areAnnotationChecker]: L1028-5 has no Hoare annotation [2020-07-18 05:15:27,498 WARN L170 areAnnotationChecker]: L1029-1 has no Hoare annotation [2020-07-18 05:15:27,498 WARN L170 areAnnotationChecker]: L1029-4 has no Hoare annotation [2020-07-18 05:15:27,498 WARN L170 areAnnotationChecker]: L1030 has no Hoare annotation [2020-07-18 05:15:27,498 WARN L170 areAnnotationChecker]: L1008-6 has no Hoare annotation [2020-07-18 05:15:27,498 WARN L170 areAnnotationChecker]: L1008-9 has no Hoare annotation [2020-07-18 05:15:27,498 WARN L170 areAnnotationChecker]: L1029-2 has no Hoare annotation [2020-07-18 05:15:27,498 WARN L170 areAnnotationChecker]: L1029-2 has no Hoare annotation [2020-07-18 05:15:27,498 WARN L170 areAnnotationChecker]: L1029-5 has no Hoare annotation [2020-07-18 05:15:27,498 WARN L170 areAnnotationChecker]: L1029-5 has no Hoare annotation [2020-07-18 05:15:27,499 WARN L170 areAnnotationChecker]: L1030-1 has no Hoare annotation [2020-07-18 05:15:27,499 WARN L170 areAnnotationChecker]: L1008-7 has no Hoare annotation [2020-07-18 05:15:27,499 WARN L170 areAnnotationChecker]: L1008-10 has no Hoare annotation [2020-07-18 05:15:27,499 WARN L170 areAnnotationChecker]: L1008-34 has no Hoare annotation [2020-07-18 05:15:27,499 WARN L170 areAnnotationChecker]: L1008-34 has no Hoare annotation [2020-07-18 05:15:27,499 WARN L170 areAnnotationChecker]: L1008-11 has no Hoare annotation [2020-07-18 05:15:27,499 WARN L170 areAnnotationChecker]: L1008-19 has no Hoare annotation [2020-07-18 05:15:27,499 WARN L170 areAnnotationChecker]: L1008-12 has no Hoare annotation [2020-07-18 05:15:27,499 WARN L170 areAnnotationChecker]: L1008-20 has no Hoare annotation [2020-07-18 05:15:27,500 WARN L170 areAnnotationChecker]: L1008-20 has no Hoare annotation [2020-07-18 05:15:27,500 WARN L170 areAnnotationChecker]: L1008-13 has no Hoare annotation [2020-07-18 05:15:27,500 WARN L170 areAnnotationChecker]: L1008-24 has no Hoare annotation [2020-07-18 05:15:27,500 WARN L170 areAnnotationChecker]: L1008-24 has no Hoare annotation [2020-07-18 05:15:27,500 WARN L170 areAnnotationChecker]: L1008-22 has no Hoare annotation [2020-07-18 05:15:27,500 WARN L170 areAnnotationChecker]: L1008-14 has no Hoare annotation [2020-07-18 05:15:27,500 WARN L170 areAnnotationChecker]: L1008-25 has no Hoare annotation [2020-07-18 05:15:27,500 WARN L170 areAnnotationChecker]: L1008-30 has no Hoare annotation [2020-07-18 05:15:27,500 WARN L170 areAnnotationChecker]: L1008-23 has no Hoare annotation [2020-07-18 05:15:27,501 WARN L170 areAnnotationChecker]: L1008-15 has no Hoare annotation [2020-07-18 05:15:27,501 WARN L170 areAnnotationChecker]: L1008-26 has no Hoare annotation [2020-07-18 05:15:27,501 WARN L170 areAnnotationChecker]: L1008-31 has no Hoare annotation [2020-07-18 05:15:27,501 WARN L170 areAnnotationChecker]: L1008-16 has no Hoare annotation [2020-07-18 05:15:27,501 WARN L170 areAnnotationChecker]: L1008-27 has no Hoare annotation [2020-07-18 05:15:27,501 WARN L170 areAnnotationChecker]: L1008-32 has no Hoare annotation [2020-07-18 05:15:27,501 WARN L170 areAnnotationChecker]: L1008-17 has no Hoare annotation [2020-07-18 05:15:27,501 WARN L170 areAnnotationChecker]: L1008-28 has no Hoare annotation [2020-07-18 05:15:27,501 WARN L170 areAnnotationChecker]: L1008-28 has no Hoare annotation [2020-07-18 05:15:27,502 WARN L170 areAnnotationChecker]: L1008-33 has no Hoare annotation [2020-07-18 05:15:27,502 WARN L170 areAnnotationChecker]: L1008-33 has no Hoare annotation [2020-07-18 05:15:27,502 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-18 05:15:27,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 05:15:27 BoogieIcfgContainer [2020-07-18 05:15:27,506 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 05:15:27,509 INFO L168 Benchmark]: Toolchain (without parser) took 57320.16 ms. Allocated memory was 138.4 MB in the beginning and 583.0 MB in the end (delta: 444.6 MB). Free memory was 102.6 MB in the beginning and 461.2 MB in the end (delta: -358.6 MB). Peak memory consumption was 85.9 MB. Max. memory is 7.1 GB. [2020-07-18 05:15:27,510 INFO L168 Benchmark]: CDTParser took 0.93 ms. Allocated memory is still 138.4 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-18 05:15:27,510 INFO L168 Benchmark]: CACSL2BoogieTranslator took 765.67 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 102.2 MB in the beginning and 169.6 MB in the end (delta: -67.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 7.1 GB. [2020-07-18 05:15:27,511 INFO L168 Benchmark]: Boogie Preprocessor took 103.52 ms. Allocated memory is still 202.9 MB. Free memory was 169.6 MB in the beginning and 165.5 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 7.1 GB. [2020-07-18 05:15:27,511 INFO L168 Benchmark]: RCFGBuilder took 1126.87 ms. Allocated memory was 202.9 MB in the beginning and 236.5 MB in the end (delta: 33.6 MB). Free memory was 165.5 MB in the beginning and 193.6 MB in the end (delta: -28.1 MB). Peak memory consumption was 81.0 MB. Max. memory is 7.1 GB. [2020-07-18 05:15:27,512 INFO L168 Benchmark]: TraceAbstraction took 55317.64 ms. Allocated memory was 236.5 MB in the beginning and 583.0 MB in the end (delta: 346.6 MB). Free memory was 193.6 MB in the beginning and 461.2 MB in the end (delta: -267.7 MB). Peak memory consumption was 78.9 MB. Max. memory is 7.1 GB. [2020-07-18 05:15:27,515 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.93 ms. Allocated memory is still 138.4 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 765.67 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 102.2 MB in the beginning and 169.6 MB in the end (delta: -67.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 103.52 ms. Allocated memory is still 202.9 MB. Free memory was 169.6 MB in the beginning and 165.5 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1126.87 ms. Allocated memory was 202.9 MB in the beginning and 236.5 MB in the end (delta: 33.6 MB). Free memory was 165.5 MB in the beginning and 193.6 MB in the end (delta: -28.1 MB). Peak memory consumption was 81.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 55317.64 ms. Allocated memory was 236.5 MB in the beginning and 583.0 MB in the end (delta: 346.6 MB). Free memory was 193.6 MB in the beginning and 461.2 MB in the end (delta: -267.7 MB). Peak memory consumption was 78.9 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))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L995] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L995] list->inner->next = ((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))={-2:0}, malloc(sizeof(SLL))={-1: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))={-2:0}, malloc(sizeof(SLL))={-1: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))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1011] end = ((void*)0) VAL [end={0:0}, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1: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))={-2:0}, malloc(sizeof(SLL))={-1: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))={-2:0}, malloc(sizeof(SLL))={-1: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))={-2:0}, malloc(sizeof(SLL))={-1: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: 55.1s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 37.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1956 SDtfs, 3763 SDslu, 5609 SDs, 0 SdLazy, 4052 SolverSat, 118 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 2.8s 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: 9.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 930 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s 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...