/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-01-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 19:04:02,507 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 19:04:02,510 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 19:04:02,528 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 19:04:02,529 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 19:04:02,531 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 19:04:02,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 19:04:02,543 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 19:04:02,546 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 19:04:02,548 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 19:04:02,549 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 19:04:02,550 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 19:04:02,550 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 19:04:02,551 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 19:04:02,552 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 19:04:02,553 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 19:04:02,554 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 19:04:02,555 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 19:04:02,557 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 19:04:02,558 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 19:04:02,560 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 19:04:02,561 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 19:04:02,562 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 19:04:02,562 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 19:04:02,564 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 19:04:02,565 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 19:04:02,565 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 19:04:02,565 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 19:04:02,566 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 19:04:02,567 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 19:04:02,567 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 19:04:02,568 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 19:04:02,568 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 19:04:02,569 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 19:04:02,570 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 19:04:02,570 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 19:04:02,571 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 19:04:02,571 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 19:04:02,571 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 19:04:02,572 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 19:04:02,573 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 19:04:02,574 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 19:04:02,582 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 19:04:02,583 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 19:04:02,584 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 19:04:02,584 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 19:04:02,584 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 19:04:02,585 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 19:04:02,585 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 19:04:02,585 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 19:04:02,585 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 19:04:02,585 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 19:04:02,586 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 19:04:02,586 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 19:04:02,586 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 19:04:02,586 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 19:04:02,586 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 19:04:02,586 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 19:04:02,587 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 19:04:02,587 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 19:04:02,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 19:04:02,587 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 19:04:02,587 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 19:04:02,588 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 19:04:02,588 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 19:04:02,851 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 19:04:02,864 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 19:04:02,868 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 19:04:02,869 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 19:04:02,870 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 19:04:02,870 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-01-2.i [2020-07-10 19:04:02,930 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75f8e40b8/d96f56aa8c81477d815665095071d098/FLAGf120e8130 [2020-07-10 19:04:03,414 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 19:04:03,415 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-2.i [2020-07-10 19:04:03,433 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75f8e40b8/d96f56aa8c81477d815665095071d098/FLAGf120e8130 [2020-07-10 19:04:03,752 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75f8e40b8/d96f56aa8c81477d815665095071d098 [2020-07-10 19:04:03,762 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 19:04:03,763 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 19:04:03,765 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 19:04:03,765 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 19:04:03,768 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 19:04:03,770 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 07:04:03" (1/1) ... [2020-07-10 19:04:03,772 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5282c64b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:04:03, skipping insertion in model container [2020-07-10 19:04:03,772 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 07:04:03" (1/1) ... [2020-07-10 19:04:03,780 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 19:04:03,824 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 19:04:04,292 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 19:04:04,300 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 19:04:04,354 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 19:04:04,410 INFO L208 MainTranslator]: Completed translation [2020-07-10 19:04:04,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:04:04 WrapperNode [2020-07-10 19:04:04,411 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 19:04:04,412 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 19:04:04,412 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 19:04:04,412 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 19:04:04,425 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:04:04" (1/1) ... [2020-07-10 19:04:04,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:04:04" (1/1) ... [2020-07-10 19:04:04,442 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:04:04" (1/1) ... [2020-07-10 19:04:04,442 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:04:04" (1/1) ... [2020-07-10 19:04:04,473 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:04:04" (1/1) ... [2020-07-10 19:04:04,488 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:04:04" (1/1) ... [2020-07-10 19:04:04,492 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:04:04" (1/1) ... [2020-07-10 19:04:04,500 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 19:04:04,501 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 19:04:04,501 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 19:04:04,501 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 19:04:04,502 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:04:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 19:04:04,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 19:04:04,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 19:04:04,565 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 19:04:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-10 19:04:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-10 19:04:04,566 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-10 19:04:04,566 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-10 19:04:04,566 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-10 19:04:04,566 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-10 19:04:04,566 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-10 19:04:04,566 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-10 19:04:04,566 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-10 19:04:04,567 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-10 19:04:04,567 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-10 19:04:04,567 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-10 19:04:04,567 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-10 19:04:04,567 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-10 19:04:04,567 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-10 19:04:04,568 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-10 19:04:04,568 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-10 19:04:04,568 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-10 19:04:04,568 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-10 19:04:04,568 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-10 19:04:04,568 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-10 19:04:04,569 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-10 19:04:04,569 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-10 19:04:04,569 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-10 19:04:04,569 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-10 19:04:04,569 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-10 19:04:04,569 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-10 19:04:04,570 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-10 19:04:04,570 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-10 19:04:04,570 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-10 19:04:04,570 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-10 19:04:04,570 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-10 19:04:04,570 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-10 19:04:04,571 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-10 19:04:04,571 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-10 19:04:04,571 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-10 19:04:04,571 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-10 19:04:04,571 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-10 19:04:04,571 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-10 19:04:04,572 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-10 19:04:04,572 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-10 19:04:04,572 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-10 19:04:04,572 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-10 19:04:04,572 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-10 19:04:04,572 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-10 19:04:04,573 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-10 19:04:04,573 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-10 19:04:04,573 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-10 19:04:04,573 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-10 19:04:04,573 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-10 19:04:04,573 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 19:04:04,573 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-10 19:04:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-10 19:04:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-10 19:04:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-10 19:04:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-10 19:04:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-10 19:04:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-10 19:04:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-10 19:04:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 19:04:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-10 19:04:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-10 19:04:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-10 19:04:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-10 19:04:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-10 19:04:04,576 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-10 19:04:04,576 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-10 19:04:04,576 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-10 19:04:04,576 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-10 19:04:04,576 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-10 19:04:04,576 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-10 19:04:04,576 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-10 19:04:04,576 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-10 19:04:04,577 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-10 19:04:04,577 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-10 19:04:04,577 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-10 19:04:04,577 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-10 19:04:04,577 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-10 19:04:04,577 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-10 19:04:04,578 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-10 19:04:04,578 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-10 19:04:04,578 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-10 19:04:04,578 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-10 19:04:04,578 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-10 19:04:04,578 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-10 19:04:04,578 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-10 19:04:04,579 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-10 19:04:04,579 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-10 19:04:04,579 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-10 19:04:04,579 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-10 19:04:04,579 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-10 19:04:04,579 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-10 19:04:04,579 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-10 19:04:04,580 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-10 19:04:04,580 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-10 19:04:04,580 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-10 19:04:04,580 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-10 19:04:04,580 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-10 19:04:04,580 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-10 19:04:04,581 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-10 19:04:04,581 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-10 19:04:04,581 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-10 19:04:04,581 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-10 19:04:04,581 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 19:04:04,581 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 19:04:04,581 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 19:04:04,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 19:04:04,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-10 19:04:04,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-10 19:04:04,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 19:04:04,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 19:04:04,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 19:04:05,510 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 19:04:05,510 INFO L295 CfgBuilder]: Removed 30 assume(true) statements. [2020-07-10 19:04:05,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 07:04:05 BoogieIcfgContainer [2020-07-10 19:04:05,515 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 19:04:05,517 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 19:04:05,517 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 19:04:05,520 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 19:04:05,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 07:04:03" (1/3) ... [2020-07-10 19:04:05,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f4773b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 07:04:05, skipping insertion in model container [2020-07-10 19:04:05,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:04:04" (2/3) ... [2020-07-10 19:04:05,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f4773b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 07:04:05, skipping insertion in model container [2020-07-10 19:04:05,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 07:04:05" (3/3) ... [2020-07-10 19:04:05,524 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2020-07-10 19:04:05,534 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 19:04:05,542 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2020-07-10 19:04:05,556 INFO L251 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2020-07-10 19:04:05,578 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 19:04:05,579 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 19:04:05,579 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 19:04:05,579 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 19:04:05,579 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 19:04:05,580 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 19:04:05,580 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 19:04:05,580 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 19:04:05,601 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states. [2020-07-10 19:04:05,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-10 19:04:05,614 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:05,615 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 19:04:05,615 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-10 19:04:05,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:05,622 INFO L82 PathProgramCache]: Analyzing trace with hash 885652866, now seen corresponding path program 1 times [2020-07-10 19:04:05,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:05,631 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [621902726] [2020-07-10 19:04:05,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:05,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:05,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:05,876 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-10 19:04:05,877 INFO L280 TraceCheckUtils]: 1: Hoare triple {174#true} #valid := #valid[0 := 0]; {174#true} is VALID [2020-07-10 19:04:05,877 INFO L280 TraceCheckUtils]: 2: Hoare triple {174#true} assume 0 < #StackHeapBarrier; {174#true} is VALID [2020-07-10 19:04:05,878 INFO L280 TraceCheckUtils]: 3: Hoare triple {174#true} assume true; {174#true} is VALID [2020-07-10 19:04:05,878 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {174#true} {174#true} #419#return; {174#true} is VALID [2020-07-10 19:04:05,882 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-10 19:04:05,882 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-10 19:04:05,882 INFO L280 TraceCheckUtils]: 2: Hoare triple {174#true} #valid := #valid[0 := 0]; {174#true} is VALID [2020-07-10 19:04:05,883 INFO L280 TraceCheckUtils]: 3: Hoare triple {174#true} assume 0 < #StackHeapBarrier; {174#true} is VALID [2020-07-10 19:04:05,883 INFO L280 TraceCheckUtils]: 4: Hoare triple {174#true} assume true; {174#true} is VALID [2020-07-10 19:04:05,883 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {174#true} {174#true} #419#return; {174#true} is VALID [2020-07-10 19:04:05,884 INFO L263 TraceCheckUtils]: 6: Hoare triple {174#true} call #t~ret28 := main(); {174#true} is VALID [2020-07-10 19:04:05,885 INFO L280 TraceCheckUtils]: 7: Hoare triple {174#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {181#(not (= 0 |main_#t~malloc0.base|))} is VALID [2020-07-10 19:04:05,886 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-10 19:04:05,887 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: L992 {182#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:05,887 INFO L280 TraceCheckUtils]: 10: Hoare triple {182#(not (= 0 main_~list~0.base))} assume !(~list~0.base != 0 || ~list~0.offset != 0); {175#false} is VALID [2020-07-10 19:04:05,888 INFO L280 TraceCheckUtils]: 11: Hoare triple {175#false} assume !false; {175#false} is VALID [2020-07-10 19:04:05,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:04:05,890 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:05,892 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [621902726] [2020-07-10 19:04:05,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:04:05,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 19:04:05,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562309828] [2020-07-10 19:04:05,900 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-10 19:04:05,903 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:04:05,907 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 19:04:05,929 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:05,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 19:04:05,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:04:05,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 19:04:05,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 19:04:05,942 INFO L87 Difference]: Start difference. First operand 171 states. Second operand 5 states. [2020-07-10 19:04:07,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:07,297 INFO L93 Difference]: Finished difference Result 360 states and 478 transitions. [2020-07-10 19:04:07,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 19:04:07,297 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-10 19:04:07,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:04:07,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 19:04:07,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2020-07-10 19:04:07,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 19:04:07,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2020-07-10 19:04:07,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 478 transitions. [2020-07-10 19:04:07,865 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 478 edges. 478 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:07,891 INFO L225 Difference]: With dead ends: 360 [2020-07-10 19:04:07,891 INFO L226 Difference]: Without dead ends: 194 [2020-07-10 19:04:07,896 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 19:04:07,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-07-10 19:04:08,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 164. [2020-07-10 19:04:08,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:04:08,144 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand 164 states. [2020-07-10 19:04:08,145 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand 164 states. [2020-07-10 19:04:08,145 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 164 states. [2020-07-10 19:04:08,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:08,158 INFO L93 Difference]: Finished difference Result 194 states and 205 transitions. [2020-07-10 19:04:08,158 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 205 transitions. [2020-07-10 19:04:08,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:08,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:08,161 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 194 states. [2020-07-10 19:04:08,161 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 194 states. [2020-07-10 19:04:08,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:08,172 INFO L93 Difference]: Finished difference Result 194 states and 205 transitions. [2020-07-10 19:04:08,172 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 205 transitions. [2020-07-10 19:04:08,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:08,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:08,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:04:08,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:04:08,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-07-10 19:04:08,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 174 transitions. [2020-07-10 19:04:08,184 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 174 transitions. Word has length 12 [2020-07-10 19:04:08,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:04:08,185 INFO L479 AbstractCegarLoop]: Abstraction has 164 states and 174 transitions. [2020-07-10 19:04:08,185 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 19:04:08,185 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 164 states and 174 transitions. [2020-07-10 19:04:08,397 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-10 19:04:08,398 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 174 transitions. [2020-07-10 19:04:08,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 19:04:08,399 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:08,399 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] [2020-07-10 19:04:08,399 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 19:04:08,400 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-10 19:04:08,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:08,400 INFO L82 PathProgramCache]: Analyzing trace with hash 684663316, now seen corresponding path program 1 times [2020-07-10 19:04:08,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:08,401 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1450314496] [2020-07-10 19:04:08,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:08,491 INFO L280 TraceCheckUtils]: 0: Hoare triple {1632#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1624#true} is VALID [2020-07-10 19:04:08,491 INFO L280 TraceCheckUtils]: 1: Hoare triple {1624#true} #valid := #valid[0 := 0]; {1624#true} is VALID [2020-07-10 19:04:08,491 INFO L280 TraceCheckUtils]: 2: Hoare triple {1624#true} assume 0 < #StackHeapBarrier; {1624#true} is VALID [2020-07-10 19:04:08,492 INFO L280 TraceCheckUtils]: 3: Hoare triple {1624#true} assume true; {1624#true} is VALID [2020-07-10 19:04:08,492 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1624#true} {1624#true} #419#return; {1624#true} is VALID [2020-07-10 19:04:08,493 INFO L263 TraceCheckUtils]: 0: Hoare triple {1624#true} call ULTIMATE.init(); {1632#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:04:08,493 INFO L280 TraceCheckUtils]: 1: Hoare triple {1632#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1624#true} is VALID [2020-07-10 19:04:08,494 INFO L280 TraceCheckUtils]: 2: Hoare triple {1624#true} #valid := #valid[0 := 0]; {1624#true} is VALID [2020-07-10 19:04:08,494 INFO L280 TraceCheckUtils]: 3: Hoare triple {1624#true} assume 0 < #StackHeapBarrier; {1624#true} is VALID [2020-07-10 19:04:08,494 INFO L280 TraceCheckUtils]: 4: Hoare triple {1624#true} assume true; {1624#true} is VALID [2020-07-10 19:04:08,495 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1624#true} {1624#true} #419#return; {1624#true} is VALID [2020-07-10 19:04:08,495 INFO L263 TraceCheckUtils]: 6: Hoare triple {1624#true} call #t~ret28 := main(); {1624#true} is VALID [2020-07-10 19:04:08,495 INFO L280 TraceCheckUtils]: 7: Hoare triple {1624#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {1624#true} is VALID [2020-07-10 19:04:08,495 INFO L280 TraceCheckUtils]: 8: Hoare triple {1624#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {1624#true} is VALID [2020-07-10 19:04:08,496 INFO L280 TraceCheckUtils]: 9: Hoare triple {1624#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {1624#true} is VALID [2020-07-10 19:04:08,496 INFO L280 TraceCheckUtils]: 10: Hoare triple {1624#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {1624#true} is VALID [2020-07-10 19:04:08,496 INFO L280 TraceCheckUtils]: 11: Hoare triple {1624#true} goto; {1624#true} is VALID [2020-07-10 19:04:08,497 INFO L280 TraceCheckUtils]: 12: Hoare triple {1624#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1624#true} is VALID [2020-07-10 19:04:08,497 INFO L280 TraceCheckUtils]: 13: Hoare triple {1624#true} assume 0 != #t~nondet1; {1624#true} is VALID [2020-07-10 19:04:08,497 INFO L280 TraceCheckUtils]: 14: Hoare triple {1624#true} havoc #t~nondet1; {1624#true} is VALID [2020-07-10 19:04:08,497 INFO L280 TraceCheckUtils]: 15: Hoare triple {1624#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {1624#true} is VALID [2020-07-10 19:04:08,498 INFO L280 TraceCheckUtils]: 16: Hoare triple {1624#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {1624#true} is VALID [2020-07-10 19:04:08,498 INFO L280 TraceCheckUtils]: 17: Hoare triple {1624#true} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {1624#true} is VALID [2020-07-10 19:04:08,499 INFO L280 TraceCheckUtils]: 18: Hoare triple {1624#true} assume #t~short7; {1631#|main_#t~short7|} is VALID [2020-07-10 19:04:08,499 INFO L280 TraceCheckUtils]: 19: Hoare triple {1631#|main_#t~short7|} assume !#t~short7; {1625#false} is VALID [2020-07-10 19:04:08,500 INFO L280 TraceCheckUtils]: 20: Hoare triple {1625#false} havoc #t~mem5.base, #t~mem5.offset; {1625#false} is VALID [2020-07-10 19:04:08,500 INFO L280 TraceCheckUtils]: 21: Hoare triple {1625#false} havoc #t~mem6.base, #t~mem6.offset; {1625#false} is VALID [2020-07-10 19:04:08,500 INFO L280 TraceCheckUtils]: 22: Hoare triple {1625#false} havoc #t~short7; {1625#false} is VALID [2020-07-10 19:04:08,501 INFO L280 TraceCheckUtils]: 23: Hoare triple {1625#false} assume !false; {1625#false} is VALID [2020-07-10 19:04:08,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:04:08,502 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:08,503 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1450314496] [2020-07-10 19:04:08,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:04:08,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 19:04:08,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90178841] [2020-07-10 19:04:08,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-07-10 19:04:08,505 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:04:08,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 19:04:08,524 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:08,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 19:04:08,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:04:08,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 19:04:08,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 19:04:08,525 INFO L87 Difference]: Start difference. First operand 164 states and 174 transitions. Second operand 4 states. [2020-07-10 19:04:09,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:09,263 INFO L93 Difference]: Finished difference Result 170 states and 180 transitions. [2020-07-10 19:04:09,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 19:04:09,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-07-10 19:04:09,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:04:09,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 19:04:09,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2020-07-10 19:04:09,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 19:04:09,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2020-07-10 19:04:09,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 180 transitions. [2020-07-10 19:04:09,465 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:09,470 INFO L225 Difference]: With dead ends: 170 [2020-07-10 19:04:09,470 INFO L226 Difference]: Without dead ends: 165 [2020-07-10 19:04:09,471 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-10 19:04:09,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-07-10 19:04:09,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2020-07-10 19:04:09,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:04:09,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand 165 states. [2020-07-10 19:04:09,693 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 165 states. [2020-07-10 19:04:09,694 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 165 states. [2020-07-10 19:04:09,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:09,700 INFO L93 Difference]: Finished difference Result 165 states and 175 transitions. [2020-07-10 19:04:09,700 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 175 transitions. [2020-07-10 19:04:09,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:09,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:09,702 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 165 states. [2020-07-10 19:04:09,702 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 165 states. [2020-07-10 19:04:09,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:09,708 INFO L93 Difference]: Finished difference Result 165 states and 175 transitions. [2020-07-10 19:04:09,708 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 175 transitions. [2020-07-10 19:04:09,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:09,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:09,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:04:09,710 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:04:09,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-07-10 19:04:09,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 175 transitions. [2020-07-10 19:04:09,716 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 175 transitions. Word has length 24 [2020-07-10 19:04:09,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:04:09,716 INFO L479 AbstractCegarLoop]: Abstraction has 165 states and 175 transitions. [2020-07-10 19:04:09,716 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 19:04:09,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 165 states and 175 transitions. [2020-07-10 19:04:09,920 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:09,920 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 175 transitions. [2020-07-10 19:04:09,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 19:04:09,921 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:09,922 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] [2020-07-10 19:04:09,922 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 19:04:09,922 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-10 19:04:09,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:09,923 INFO L82 PathProgramCache]: Analyzing trace with hash -265499727, now seen corresponding path program 1 times [2020-07-10 19:04:09,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:09,924 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [746477116] [2020-07-10 19:04:09,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:09,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:10,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:10,110 INFO L280 TraceCheckUtils]: 0: Hoare triple {2647#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2635#true} is VALID [2020-07-10 19:04:10,110 INFO L280 TraceCheckUtils]: 1: Hoare triple {2635#true} #valid := #valid[0 := 0]; {2635#true} is VALID [2020-07-10 19:04:10,110 INFO L280 TraceCheckUtils]: 2: Hoare triple {2635#true} assume 0 < #StackHeapBarrier; {2635#true} is VALID [2020-07-10 19:04:10,111 INFO L280 TraceCheckUtils]: 3: Hoare triple {2635#true} assume true; {2635#true} is VALID [2020-07-10 19:04:10,111 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2635#true} {2635#true} #419#return; {2635#true} is VALID [2020-07-10 19:04:10,116 INFO L263 TraceCheckUtils]: 0: Hoare triple {2635#true} call ULTIMATE.init(); {2647#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:04:10,116 INFO L280 TraceCheckUtils]: 1: Hoare triple {2647#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2635#true} is VALID [2020-07-10 19:04:10,117 INFO L280 TraceCheckUtils]: 2: Hoare triple {2635#true} #valid := #valid[0 := 0]; {2635#true} is VALID [2020-07-10 19:04:10,117 INFO L280 TraceCheckUtils]: 3: Hoare triple {2635#true} assume 0 < #StackHeapBarrier; {2635#true} is VALID [2020-07-10 19:04:10,117 INFO L280 TraceCheckUtils]: 4: Hoare triple {2635#true} assume true; {2635#true} is VALID [2020-07-10 19:04:10,117 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2635#true} {2635#true} #419#return; {2635#true} is VALID [2020-07-10 19:04:10,118 INFO L263 TraceCheckUtils]: 6: Hoare triple {2635#true} call #t~ret28 := main(); {2635#true} is VALID [2020-07-10 19:04:10,118 INFO L280 TraceCheckUtils]: 7: Hoare triple {2635#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {2635#true} is VALID [2020-07-10 19:04:10,118 INFO L280 TraceCheckUtils]: 8: Hoare triple {2635#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {2635#true} is VALID [2020-07-10 19:04:10,118 INFO L280 TraceCheckUtils]: 9: Hoare triple {2635#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {2635#true} is VALID [2020-07-10 19:04:10,119 INFO L280 TraceCheckUtils]: 10: Hoare triple {2635#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {2635#true} is VALID [2020-07-10 19:04:10,119 INFO L280 TraceCheckUtils]: 11: Hoare triple {2635#true} goto; {2635#true} is VALID [2020-07-10 19:04:10,119 INFO L280 TraceCheckUtils]: 12: Hoare triple {2635#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2635#true} is VALID [2020-07-10 19:04:10,120 INFO L280 TraceCheckUtils]: 13: Hoare triple {2635#true} assume 0 != #t~nondet1; {2635#true} is VALID [2020-07-10 19:04:10,120 INFO L280 TraceCheckUtils]: 14: Hoare triple {2635#true} havoc #t~nondet1; {2635#true} is VALID [2020-07-10 19:04:10,120 INFO L280 TraceCheckUtils]: 15: Hoare triple {2635#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {2635#true} is VALID [2020-07-10 19:04:10,123 INFO L280 TraceCheckUtils]: 16: Hoare triple {2635#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {2642#(and (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem5.base|))} is VALID [2020-07-10 19:04:10,124 INFO L280 TraceCheckUtils]: 17: Hoare triple {2642#(and (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem5.base|))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {2643#(or |main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))))} is VALID [2020-07-10 19:04:10,125 INFO L280 TraceCheckUtils]: 18: Hoare triple {2643#(or |main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))))} assume !#t~short7; {2644#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:10,126 INFO L280 TraceCheckUtils]: 19: Hoare triple {2644#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-22 {2645#(and (= 0 |main_#t~mem6.offset|) (= 0 |main_#t~mem6.base|))} is VALID [2020-07-10 19:04:10,127 INFO L280 TraceCheckUtils]: 20: Hoare triple {2645#(and (= 0 |main_#t~mem6.offset|) (= 0 |main_#t~mem6.base|))} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {2646#|main_#t~short7|} is VALID [2020-07-10 19:04:10,128 INFO L280 TraceCheckUtils]: 21: Hoare triple {2646#|main_#t~short7|} assume !#t~short7; {2636#false} is VALID [2020-07-10 19:04:10,128 INFO L280 TraceCheckUtils]: 22: Hoare triple {2636#false} havoc #t~mem5.base, #t~mem5.offset; {2636#false} is VALID [2020-07-10 19:04:10,129 INFO L280 TraceCheckUtils]: 23: Hoare triple {2636#false} havoc #t~mem6.base, #t~mem6.offset; {2636#false} is VALID [2020-07-10 19:04:10,129 INFO L280 TraceCheckUtils]: 24: Hoare triple {2636#false} havoc #t~short7; {2636#false} is VALID [2020-07-10 19:04:10,129 INFO L280 TraceCheckUtils]: 25: Hoare triple {2636#false} assume !false; {2636#false} is VALID [2020-07-10 19:04:10,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:04:10,131 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:10,132 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [746477116] [2020-07-10 19:04:10,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:04:10,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-10 19:04:10,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819768090] [2020-07-10 19:04:10,133 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2020-07-10 19:04:10,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:04:10,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 19:04:10,159 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:10,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 19:04:10,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:04:10,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 19:04:10,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-10 19:04:10,160 INFO L87 Difference]: Start difference. First operand 165 states and 175 transitions. Second operand 8 states. [2020-07-10 19:04:12,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:12,092 INFO L93 Difference]: Finished difference Result 259 states and 276 transitions. [2020-07-10 19:04:12,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-10 19:04:12,092 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2020-07-10 19:04:12,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:04:12,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 19:04:12,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 276 transitions. [2020-07-10 19:04:12,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 19:04:12,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 276 transitions. [2020-07-10 19:04:12,103 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 276 transitions. [2020-07-10 19:04:12,393 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 276 edges. 276 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:12,402 INFO L225 Difference]: With dead ends: 259 [2020-07-10 19:04:12,402 INFO L226 Difference]: Without dead ends: 254 [2020-07-10 19:04:12,403 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2020-07-10 19:04:12,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2020-07-10 19:04:12,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 159. [2020-07-10 19:04:12,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:04:12,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 254 states. Second operand 159 states. [2020-07-10 19:04:12,729 INFO L74 IsIncluded]: Start isIncluded. First operand 254 states. Second operand 159 states. [2020-07-10 19:04:12,730 INFO L87 Difference]: Start difference. First operand 254 states. Second operand 159 states. [2020-07-10 19:04:12,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:12,739 INFO L93 Difference]: Finished difference Result 254 states and 271 transitions. [2020-07-10 19:04:12,740 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 271 transitions. [2020-07-10 19:04:12,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:12,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:12,741 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 254 states. [2020-07-10 19:04:12,741 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 254 states. [2020-07-10 19:04:12,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:12,750 INFO L93 Difference]: Finished difference Result 254 states and 271 transitions. [2020-07-10 19:04:12,750 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 271 transitions. [2020-07-10 19:04:12,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:12,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:12,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:04:12,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:04:12,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-07-10 19:04:12,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 169 transitions. [2020-07-10 19:04:12,757 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 169 transitions. Word has length 26 [2020-07-10 19:04:12,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:04:12,757 INFO L479 AbstractCegarLoop]: Abstraction has 159 states and 169 transitions. [2020-07-10 19:04:12,757 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 19:04:12,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 159 states and 169 transitions. [2020-07-10 19:04:13,026 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:13,026 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 169 transitions. [2020-07-10 19:04:13,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-10 19:04:13,027 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:13,028 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] [2020-07-10 19:04:13,028 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 19:04:13,028 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-10 19:04:13,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:13,029 INFO L82 PathProgramCache]: Analyzing trace with hash 72562886, now seen corresponding path program 1 times [2020-07-10 19:04:13,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:13,029 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1420581973] [2020-07-10 19:04:13,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:13,149 INFO L280 TraceCheckUtils]: 0: Hoare triple {4020#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {4010#true} is VALID [2020-07-10 19:04:13,149 INFO L280 TraceCheckUtils]: 1: Hoare triple {4010#true} #valid := #valid[0 := 0]; {4010#true} is VALID [2020-07-10 19:04:13,150 INFO L280 TraceCheckUtils]: 2: Hoare triple {4010#true} assume 0 < #StackHeapBarrier; {4010#true} is VALID [2020-07-10 19:04:13,150 INFO L280 TraceCheckUtils]: 3: Hoare triple {4010#true} assume true; {4010#true} is VALID [2020-07-10 19:04:13,150 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {4010#true} {4010#true} #419#return; {4010#true} is VALID [2020-07-10 19:04:13,151 INFO L263 TraceCheckUtils]: 0: Hoare triple {4010#true} call ULTIMATE.init(); {4020#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:04:13,151 INFO L280 TraceCheckUtils]: 1: Hoare triple {4020#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {4010#true} is VALID [2020-07-10 19:04:13,152 INFO L280 TraceCheckUtils]: 2: Hoare triple {4010#true} #valid := #valid[0 := 0]; {4010#true} is VALID [2020-07-10 19:04:13,152 INFO L280 TraceCheckUtils]: 3: Hoare triple {4010#true} assume 0 < #StackHeapBarrier; {4010#true} is VALID [2020-07-10 19:04:13,152 INFO L280 TraceCheckUtils]: 4: Hoare triple {4010#true} assume true; {4010#true} is VALID [2020-07-10 19:04:13,152 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4010#true} {4010#true} #419#return; {4010#true} is VALID [2020-07-10 19:04:13,153 INFO L263 TraceCheckUtils]: 6: Hoare triple {4010#true} call #t~ret28 := main(); {4010#true} is VALID [2020-07-10 19:04:13,153 INFO L280 TraceCheckUtils]: 7: Hoare triple {4010#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {4010#true} is VALID [2020-07-10 19:04:13,153 INFO L280 TraceCheckUtils]: 8: Hoare triple {4010#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {4010#true} is VALID [2020-07-10 19:04:13,153 INFO L280 TraceCheckUtils]: 9: Hoare triple {4010#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {4010#true} is VALID [2020-07-10 19:04:13,154 INFO L280 TraceCheckUtils]: 10: Hoare triple {4010#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {4010#true} is VALID [2020-07-10 19:04:13,154 INFO L280 TraceCheckUtils]: 11: Hoare triple {4010#true} goto; {4010#true} is VALID [2020-07-10 19:04:13,154 INFO L280 TraceCheckUtils]: 12: Hoare triple {4010#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4010#true} is VALID [2020-07-10 19:04:13,154 INFO L280 TraceCheckUtils]: 13: Hoare triple {4010#true} assume 0 != #t~nondet1; {4010#true} is VALID [2020-07-10 19:04:13,154 INFO L280 TraceCheckUtils]: 14: Hoare triple {4010#true} havoc #t~nondet1; {4010#true} is VALID [2020-07-10 19:04:13,155 INFO L280 TraceCheckUtils]: 15: Hoare triple {4010#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {4017#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:13,156 INFO L280 TraceCheckUtils]: 16: Hoare triple {4017#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {4018#(and (= 0 |main_#t~mem5.offset|) (= 0 |main_#t~mem5.base|))} is VALID [2020-07-10 19:04:13,159 INFO L280 TraceCheckUtils]: 17: Hoare triple {4018#(and (= 0 |main_#t~mem5.offset|) (= 0 |main_#t~mem5.base|))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {4019#(not |main_#t~short7|)} is VALID [2020-07-10 19:04:13,163 INFO L280 TraceCheckUtils]: 18: Hoare triple {4019#(not |main_#t~short7|)} assume #t~short7; {4011#false} is VALID [2020-07-10 19:04:13,164 INFO L280 TraceCheckUtils]: 19: Hoare triple {4011#false} assume !!#t~short7; {4011#false} is VALID [2020-07-10 19:04:13,164 INFO L280 TraceCheckUtils]: 20: Hoare triple {4011#false} havoc #t~mem5.base, #t~mem5.offset; {4011#false} is VALID [2020-07-10 19:04:13,164 INFO L280 TraceCheckUtils]: 21: Hoare triple {4011#false} havoc #t~mem6.base, #t~mem6.offset; {4011#false} is VALID [2020-07-10 19:04:13,165 INFO L280 TraceCheckUtils]: 22: Hoare triple {4011#false} havoc #t~short7; {4011#false} is VALID [2020-07-10 19:04:13,165 INFO L280 TraceCheckUtils]: 23: Hoare triple {4011#false} goto; {4011#false} is VALID [2020-07-10 19:04:13,165 INFO L280 TraceCheckUtils]: 24: Hoare triple {4011#false} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {4011#false} is VALID [2020-07-10 19:04:13,165 INFO L280 TraceCheckUtils]: 25: Hoare triple {4011#false} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {4011#false} is VALID [2020-07-10 19:04:13,166 INFO L280 TraceCheckUtils]: 26: Hoare triple {4011#false} assume !(0 != #t~nondet8); {4011#false} is VALID [2020-07-10 19:04:13,166 INFO L280 TraceCheckUtils]: 27: Hoare triple {4011#false} havoc #t~nondet8; {4011#false} is VALID [2020-07-10 19:04:13,167 INFO L280 TraceCheckUtils]: 28: Hoare triple {4011#false} ~end~0.base, ~end~0.offset := 0, 0; {4011#false} is VALID [2020-07-10 19:04:13,167 INFO L280 TraceCheckUtils]: 29: Hoare triple {4011#false} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {4011#false} is VALID [2020-07-10 19:04:13,167 INFO L280 TraceCheckUtils]: 30: Hoare triple {4011#false} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {4011#false} is VALID [2020-07-10 19:04:13,167 INFO L280 TraceCheckUtils]: 31: Hoare triple {4011#false} assume !false; {4011#false} is VALID [2020-07-10 19:04:13,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:04:13,168 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:13,169 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1420581973] [2020-07-10 19:04:13,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:04:13,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 19:04:13,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411571247] [2020-07-10 19:04:13,170 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2020-07-10 19:04:13,171 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:04:13,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 19:04:13,206 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:13,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 19:04:13,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:04:13,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 19:04:13,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 19:04:13,207 INFO L87 Difference]: Start difference. First operand 159 states and 169 transitions. Second operand 6 states. [2020-07-10 19:04:14,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:14,795 INFO L93 Difference]: Finished difference Result 382 states and 407 transitions. [2020-07-10 19:04:14,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 19:04:14,795 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2020-07-10 19:04:14,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:04:14,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 19:04:14,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 407 transitions. [2020-07-10 19:04:14,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 19:04:14,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 407 transitions. [2020-07-10 19:04:14,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 407 transitions. [2020-07-10 19:04:15,210 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 407 edges. 407 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:15,216 INFO L225 Difference]: With dead ends: 382 [2020-07-10 19:04:15,216 INFO L226 Difference]: Without dead ends: 253 [2020-07-10 19:04:15,218 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-10 19:04:15,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2020-07-10 19:04:15,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 162. [2020-07-10 19:04:15,550 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:04:15,550 INFO L82 GeneralOperation]: Start isEquivalent. First operand 253 states. Second operand 162 states. [2020-07-10 19:04:15,550 INFO L74 IsIncluded]: Start isIncluded. First operand 253 states. Second operand 162 states. [2020-07-10 19:04:15,551 INFO L87 Difference]: Start difference. First operand 253 states. Second operand 162 states. [2020-07-10 19:04:15,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:15,562 INFO L93 Difference]: Finished difference Result 253 states and 269 transitions. [2020-07-10 19:04:15,562 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 269 transitions. [2020-07-10 19:04:15,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:15,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:15,563 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 253 states. [2020-07-10 19:04:15,563 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 253 states. [2020-07-10 19:04:15,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:15,573 INFO L93 Difference]: Finished difference Result 253 states and 269 transitions. [2020-07-10 19:04:15,573 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 269 transitions. [2020-07-10 19:04:15,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:15,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:15,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:04:15,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:04:15,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-07-10 19:04:15,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 172 transitions. [2020-07-10 19:04:15,579 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 172 transitions. Word has length 32 [2020-07-10 19:04:15,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:04:15,581 INFO L479 AbstractCegarLoop]: Abstraction has 162 states and 172 transitions. [2020-07-10 19:04:15,582 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 19:04:15,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 162 states and 172 transitions. [2020-07-10 19:04:15,828 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:15,828 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 172 transitions. [2020-07-10 19:04:15,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-10 19:04:15,829 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:15,829 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] [2020-07-10 19:04:15,830 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 19:04:15,830 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-10 19:04:15,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:15,831 INFO L82 PathProgramCache]: Analyzing trace with hash 972027235, now seen corresponding path program 1 times [2020-07-10 19:04:15,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:15,831 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2109037084] [2020-07-10 19:04:15,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:15,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:15,929 INFO L280 TraceCheckUtils]: 0: Hoare triple {5631#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {5621#true} is VALID [2020-07-10 19:04:15,930 INFO L280 TraceCheckUtils]: 1: Hoare triple {5621#true} #valid := #valid[0 := 0]; {5621#true} is VALID [2020-07-10 19:04:15,930 INFO L280 TraceCheckUtils]: 2: Hoare triple {5621#true} assume 0 < #StackHeapBarrier; {5621#true} is VALID [2020-07-10 19:04:15,930 INFO L280 TraceCheckUtils]: 3: Hoare triple {5621#true} assume true; {5621#true} is VALID [2020-07-10 19:04:15,931 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {5621#true} {5621#true} #419#return; {5621#true} is VALID [2020-07-10 19:04:15,932 INFO L263 TraceCheckUtils]: 0: Hoare triple {5621#true} call ULTIMATE.init(); {5631#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:04:15,932 INFO L280 TraceCheckUtils]: 1: Hoare triple {5631#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {5621#true} is VALID [2020-07-10 19:04:15,932 INFO L280 TraceCheckUtils]: 2: Hoare triple {5621#true} #valid := #valid[0 := 0]; {5621#true} is VALID [2020-07-10 19:04:15,932 INFO L280 TraceCheckUtils]: 3: Hoare triple {5621#true} assume 0 < #StackHeapBarrier; {5621#true} is VALID [2020-07-10 19:04:15,933 INFO L280 TraceCheckUtils]: 4: Hoare triple {5621#true} assume true; {5621#true} is VALID [2020-07-10 19:04:15,933 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {5621#true} {5621#true} #419#return; {5621#true} is VALID [2020-07-10 19:04:15,933 INFO L263 TraceCheckUtils]: 6: Hoare triple {5621#true} call #t~ret28 := main(); {5621#true} is VALID [2020-07-10 19:04:15,934 INFO L280 TraceCheckUtils]: 7: Hoare triple {5621#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {5628#(not (= 0 |main_#t~malloc0.base|))} is VALID [2020-07-10 19:04:15,935 INFO L280 TraceCheckUtils]: 8: Hoare triple {5628#(not (= 0 |main_#t~malloc0.base|))} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {5629#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:15,935 INFO L280 TraceCheckUtils]: 9: Hoare triple {5629#(not (= 0 main_~list~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {5629#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:15,936 INFO L280 TraceCheckUtils]: 10: Hoare triple {5629#(not (= 0 main_~list~0.base))} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {5629#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:15,936 INFO L280 TraceCheckUtils]: 11: Hoare triple {5629#(not (= 0 main_~list~0.base))} goto; {5629#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:15,937 INFO L280 TraceCheckUtils]: 12: Hoare triple {5629#(not (= 0 main_~list~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {5629#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:15,937 INFO L280 TraceCheckUtils]: 13: Hoare triple {5629#(not (= 0 main_~list~0.base))} assume 0 != #t~nondet1; {5629#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:15,938 INFO L280 TraceCheckUtils]: 14: Hoare triple {5629#(not (= 0 main_~list~0.base))} havoc #t~nondet1; {5629#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:15,938 INFO L280 TraceCheckUtils]: 15: Hoare triple {5629#(not (= 0 main_~list~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {5629#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:15,939 INFO L280 TraceCheckUtils]: 16: Hoare triple {5629#(not (= 0 main_~list~0.base))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {5629#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:15,940 INFO L280 TraceCheckUtils]: 17: Hoare triple {5629#(not (= 0 main_~list~0.base))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {5629#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:15,940 INFO L280 TraceCheckUtils]: 18: Hoare triple {5629#(not (= 0 main_~list~0.base))} assume !#t~short7; {5629#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:15,941 INFO L280 TraceCheckUtils]: 19: Hoare triple {5629#(not (= 0 main_~list~0.base))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-22 {5629#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:15,941 INFO L280 TraceCheckUtils]: 20: Hoare triple {5629#(not (= 0 main_~list~0.base))} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {5629#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:15,942 INFO L280 TraceCheckUtils]: 21: Hoare triple {5629#(not (= 0 main_~list~0.base))} assume !!#t~short7; {5629#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:15,942 INFO L280 TraceCheckUtils]: 22: Hoare triple {5629#(not (= 0 main_~list~0.base))} havoc #t~mem5.base, #t~mem5.offset; {5629#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:15,943 INFO L280 TraceCheckUtils]: 23: Hoare triple {5629#(not (= 0 main_~list~0.base))} havoc #t~mem6.base, #t~mem6.offset; {5629#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:15,943 INFO L280 TraceCheckUtils]: 24: Hoare triple {5629#(not (= 0 main_~list~0.base))} havoc #t~short7; {5629#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:15,944 INFO L280 TraceCheckUtils]: 25: Hoare triple {5629#(not (= 0 main_~list~0.base))} goto; {5629#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:15,945 INFO L280 TraceCheckUtils]: 26: Hoare triple {5629#(not (= 0 main_~list~0.base))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {5629#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:15,945 INFO L280 TraceCheckUtils]: 27: Hoare triple {5629#(not (= 0 main_~list~0.base))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {5629#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:15,946 INFO L280 TraceCheckUtils]: 28: Hoare triple {5629#(not (= 0 main_~list~0.base))} assume !(0 != #t~nondet8); {5629#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:15,947 INFO L280 TraceCheckUtils]: 29: Hoare triple {5629#(not (= 0 main_~list~0.base))} havoc #t~nondet8; {5629#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:15,947 INFO L280 TraceCheckUtils]: 30: Hoare triple {5629#(not (= 0 main_~list~0.base))} ~end~0.base, ~end~0.offset := 0, 0; {5629#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 19:04:15,948 INFO L280 TraceCheckUtils]: 31: Hoare triple {5629#(not (= 0 main_~list~0.base))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {5630#(not (= 0 main_~end~0.base))} is VALID [2020-07-10 19:04:15,948 INFO L280 TraceCheckUtils]: 32: Hoare triple {5630#(not (= 0 main_~end~0.base))} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {5622#false} is VALID [2020-07-10 19:04:15,949 INFO L280 TraceCheckUtils]: 33: Hoare triple {5622#false} assume !false; {5622#false} is VALID [2020-07-10 19:04:15,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:04:15,951 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:15,952 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2109037084] [2020-07-10 19:04:15,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:04:15,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 19:04:15,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117926367] [2020-07-10 19:04:15,952 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2020-07-10 19:04:15,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:04:15,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 19:04:15,991 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:15,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 19:04:15,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:04:15,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 19:04:15,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 19:04:15,992 INFO L87 Difference]: Start difference. First operand 162 states and 172 transitions. Second operand 6 states. [2020-07-10 19:04:17,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:17,349 INFO L93 Difference]: Finished difference Result 271 states and 288 transitions. [2020-07-10 19:04:17,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 19:04:17,349 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2020-07-10 19:04:17,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:04:17,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 19:04:17,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 285 transitions. [2020-07-10 19:04:17,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 19:04:17,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 285 transitions. [2020-07-10 19:04:17,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 285 transitions. [2020-07-10 19:04:17,643 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 285 edges. 285 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:17,649 INFO L225 Difference]: With dead ends: 271 [2020-07-10 19:04:17,649 INFO L226 Difference]: Without dead ends: 239 [2020-07-10 19:04:17,650 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-10 19:04:17,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2020-07-10 19:04:17,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 161. [2020-07-10 19:04:17,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:04:18,000 INFO L82 GeneralOperation]: Start isEquivalent. First operand 239 states. Second operand 161 states. [2020-07-10 19:04:18,000 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand 161 states. [2020-07-10 19:04:18,000 INFO L87 Difference]: Start difference. First operand 239 states. Second operand 161 states. [2020-07-10 19:04:18,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:18,008 INFO L93 Difference]: Finished difference Result 239 states and 254 transitions. [2020-07-10 19:04:18,009 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 254 transitions. [2020-07-10 19:04:18,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:18,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:18,010 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand 239 states. [2020-07-10 19:04:18,010 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 239 states. [2020-07-10 19:04:18,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:18,018 INFO L93 Difference]: Finished difference Result 239 states and 254 transitions. [2020-07-10 19:04:18,018 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 254 transitions. [2020-07-10 19:04:18,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:18,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:18,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:04:18,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:04:18,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2020-07-10 19:04:18,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 171 transitions. [2020-07-10 19:04:18,023 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 171 transitions. Word has length 34 [2020-07-10 19:04:18,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:04:18,024 INFO L479 AbstractCegarLoop]: Abstraction has 161 states and 171 transitions. [2020-07-10 19:04:18,024 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 19:04:18,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 161 states and 171 transitions. [2020-07-10 19:04:18,308 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-10 19:04:18,308 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 171 transitions. [2020-07-10 19:04:18,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-10 19:04:18,309 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:18,310 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] [2020-07-10 19:04:18,310 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 19:04:18,310 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-10 19:04:18,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:18,311 INFO L82 PathProgramCache]: Analyzing trace with hash -401575995, now seen corresponding path program 1 times [2020-07-10 19:04:18,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:18,311 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1456106260] [2020-07-10 19:04:18,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:18,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:18,447 INFO L280 TraceCheckUtils]: 0: Hoare triple {6991#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {6980#true} is VALID [2020-07-10 19:04:18,447 INFO L280 TraceCheckUtils]: 1: Hoare triple {6980#true} #valid := #valid[0 := 0]; {6980#true} is VALID [2020-07-10 19:04:18,447 INFO L280 TraceCheckUtils]: 2: Hoare triple {6980#true} assume 0 < #StackHeapBarrier; {6980#true} is VALID [2020-07-10 19:04:18,448 INFO L280 TraceCheckUtils]: 3: Hoare triple {6980#true} assume true; {6980#true} is VALID [2020-07-10 19:04:18,448 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {6980#true} {6980#true} #419#return; {6980#true} is VALID [2020-07-10 19:04:18,449 INFO L263 TraceCheckUtils]: 0: Hoare triple {6980#true} call ULTIMATE.init(); {6991#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:04:18,449 INFO L280 TraceCheckUtils]: 1: Hoare triple {6991#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {6980#true} is VALID [2020-07-10 19:04:18,449 INFO L280 TraceCheckUtils]: 2: Hoare triple {6980#true} #valid := #valid[0 := 0]; {6980#true} is VALID [2020-07-10 19:04:18,450 INFO L280 TraceCheckUtils]: 3: Hoare triple {6980#true} assume 0 < #StackHeapBarrier; {6980#true} is VALID [2020-07-10 19:04:18,450 INFO L280 TraceCheckUtils]: 4: Hoare triple {6980#true} assume true; {6980#true} is VALID [2020-07-10 19:04:18,450 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {6980#true} {6980#true} #419#return; {6980#true} is VALID [2020-07-10 19:04:18,450 INFO L263 TraceCheckUtils]: 6: Hoare triple {6980#true} call #t~ret28 := main(); {6980#true} is VALID [2020-07-10 19:04:18,451 INFO L280 TraceCheckUtils]: 7: Hoare triple {6980#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {6980#true} is VALID [2020-07-10 19:04:18,451 INFO L280 TraceCheckUtils]: 8: Hoare triple {6980#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {6980#true} is VALID [2020-07-10 19:04:18,451 INFO L280 TraceCheckUtils]: 9: Hoare triple {6980#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {6980#true} is VALID [2020-07-10 19:04:18,451 INFO L280 TraceCheckUtils]: 10: Hoare triple {6980#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {6980#true} is VALID [2020-07-10 19:04:18,452 INFO L280 TraceCheckUtils]: 11: Hoare triple {6980#true} goto; {6980#true} is VALID [2020-07-10 19:04:18,452 INFO L280 TraceCheckUtils]: 12: Hoare triple {6980#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {6980#true} is VALID [2020-07-10 19:04:18,452 INFO L280 TraceCheckUtils]: 13: Hoare triple {6980#true} assume 0 != #t~nondet1; {6980#true} is VALID [2020-07-10 19:04:18,452 INFO L280 TraceCheckUtils]: 14: Hoare triple {6980#true} havoc #t~nondet1; {6980#true} is VALID [2020-07-10 19:04:18,453 INFO L280 TraceCheckUtils]: 15: Hoare triple {6980#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {6980#true} is VALID [2020-07-10 19:04:18,453 INFO L280 TraceCheckUtils]: 16: Hoare triple {6980#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {6980#true} is VALID [2020-07-10 19:04:18,453 INFO L280 TraceCheckUtils]: 17: Hoare triple {6980#true} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {6980#true} is VALID [2020-07-10 19:04:18,453 INFO L280 TraceCheckUtils]: 18: Hoare triple {6980#true} assume !#t~short7; {6980#true} is VALID [2020-07-10 19:04:18,454 INFO L280 TraceCheckUtils]: 19: Hoare triple {6980#true} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-22 {6980#true} is VALID [2020-07-10 19:04:18,454 INFO L280 TraceCheckUtils]: 20: Hoare triple {6980#true} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {6980#true} is VALID [2020-07-10 19:04:18,454 INFO L280 TraceCheckUtils]: 21: Hoare triple {6980#true} assume !!#t~short7; {6980#true} is VALID [2020-07-10 19:04:18,454 INFO L280 TraceCheckUtils]: 22: Hoare triple {6980#true} havoc #t~mem5.base, #t~mem5.offset; {6980#true} is VALID [2020-07-10 19:04:18,454 INFO L280 TraceCheckUtils]: 23: Hoare triple {6980#true} havoc #t~mem6.base, #t~mem6.offset; {6980#true} is VALID [2020-07-10 19:04:18,455 INFO L280 TraceCheckUtils]: 24: Hoare triple {6980#true} havoc #t~short7; {6980#true} is VALID [2020-07-10 19:04:18,455 INFO L280 TraceCheckUtils]: 25: Hoare triple {6980#true} goto; {6980#true} is VALID [2020-07-10 19:04:18,455 INFO L280 TraceCheckUtils]: 26: Hoare triple {6980#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {6980#true} is VALID [2020-07-10 19:04:18,455 INFO L280 TraceCheckUtils]: 27: Hoare triple {6980#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {6980#true} is VALID [2020-07-10 19:04:18,456 INFO L280 TraceCheckUtils]: 28: Hoare triple {6980#true} assume !!(0 != #t~nondet8); {6980#true} is VALID [2020-07-10 19:04:18,456 INFO L280 TraceCheckUtils]: 29: Hoare triple {6980#true} havoc #t~nondet8; {6980#true} is VALID [2020-07-10 19:04:18,457 INFO L280 TraceCheckUtils]: 30: Hoare triple {6980#true} SUMMARY for call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(8); srcloc: L1001 {6987#(not (= 0 |main_#t~malloc9.base|))} is VALID [2020-07-10 19:04:18,458 INFO L280 TraceCheckUtils]: 31: Hoare triple {6987#(not (= 0 |main_#t~malloc9.base|))} SUMMARY for call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~end~0.base, ~end~0.offset, 4); srcloc: L1001-1 {6988#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-10 19:04:18,459 INFO L280 TraceCheckUtils]: 32: Hoare triple {6988#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} SUMMARY for call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1001-2 {6989#(not (= 0 |main_#t~mem10.base|))} is VALID [2020-07-10 19:04:18,459 INFO L280 TraceCheckUtils]: 33: Hoare triple {6989#(not (= 0 |main_#t~mem10.base|))} ~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset; {6990#(not (= 0 main_~end~0.base))} is VALID [2020-07-10 19:04:18,460 INFO L280 TraceCheckUtils]: 34: Hoare triple {6990#(not (= 0 main_~end~0.base))} havoc #t~mem10.base, #t~mem10.offset; {6990#(not (= 0 main_~end~0.base))} is VALID [2020-07-10 19:04:18,461 INFO L280 TraceCheckUtils]: 35: Hoare triple {6990#(not (= 0 main_~end~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); srcloc: L1003 {6990#(not (= 0 main_~end~0.base))} is VALID [2020-07-10 19:04:18,461 INFO L280 TraceCheckUtils]: 36: Hoare triple {6990#(not (= 0 main_~end~0.base))} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {6981#false} is VALID [2020-07-10 19:04:18,461 INFO L280 TraceCheckUtils]: 37: Hoare triple {6981#false} assume !false; {6981#false} is VALID [2020-07-10 19:04:18,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:04:18,464 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:18,464 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1456106260] [2020-07-10 19:04:18,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:04:18,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 19:04:18,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431890564] [2020-07-10 19:04:18,465 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2020-07-10 19:04:18,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:04:18,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 19:04:18,506 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:18,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 19:04:18,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:04:18,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 19:04:18,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-10 19:04:18,508 INFO L87 Difference]: Start difference. First operand 161 states and 171 transitions. Second operand 7 states. [2020-07-10 19:04:20,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:20,535 INFO L93 Difference]: Finished difference Result 245 states and 261 transitions. [2020-07-10 19:04:20,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 19:04:20,535 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2020-07-10 19:04:20,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:04:20,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 19:04:20,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 256 transitions. [2020-07-10 19:04:20,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 19:04:20,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 256 transitions. [2020-07-10 19:04:20,541 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 256 transitions. [2020-07-10 19:04:20,787 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:20,792 INFO L225 Difference]: With dead ends: 245 [2020-07-10 19:04:20,793 INFO L226 Difference]: Without dead ends: 241 [2020-07-10 19:04:20,793 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2020-07-10 19:04:20,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2020-07-10 19:04:21,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 157. [2020-07-10 19:04:21,187 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:04:21,187 INFO L82 GeneralOperation]: Start isEquivalent. First operand 241 states. Second operand 157 states. [2020-07-10 19:04:21,187 INFO L74 IsIncluded]: Start isIncluded. First operand 241 states. Second operand 157 states. [2020-07-10 19:04:21,187 INFO L87 Difference]: Start difference. First operand 241 states. Second operand 157 states. [2020-07-10 19:04:21,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:21,193 INFO L93 Difference]: Finished difference Result 241 states and 257 transitions. [2020-07-10 19:04:21,193 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 257 transitions. [2020-07-10 19:04:21,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:21,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:21,194 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand 241 states. [2020-07-10 19:04:21,194 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 241 states. [2020-07-10 19:04:21,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:21,199 INFO L93 Difference]: Finished difference Result 241 states and 257 transitions. [2020-07-10 19:04:21,199 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 257 transitions. [2020-07-10 19:04:21,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:21,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:21,201 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:04:21,201 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:04:21,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-07-10 19:04:21,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 167 transitions. [2020-07-10 19:04:21,204 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 167 transitions. Word has length 38 [2020-07-10 19:04:21,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:04:21,204 INFO L479 AbstractCegarLoop]: Abstraction has 157 states and 167 transitions. [2020-07-10 19:04:21,204 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 19:04:21,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 157 states and 167 transitions. [2020-07-10 19:04:21,478 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:21,478 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 167 transitions. [2020-07-10 19:04:21,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-10 19:04:21,479 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:21,479 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-10 19:04:21,480 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 19:04:21,480 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-10 19:04:21,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:21,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1938604912, now seen corresponding path program 1 times [2020-07-10 19:04:21,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:21,481 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1735150311] [2020-07-10 19:04:21,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:21,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:21,583 INFO L280 TraceCheckUtils]: 0: Hoare triple {8301#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {8293#true} is VALID [2020-07-10 19:04:21,584 INFO L280 TraceCheckUtils]: 1: Hoare triple {8293#true} #valid := #valid[0 := 0]; {8293#true} is VALID [2020-07-10 19:04:21,584 INFO L280 TraceCheckUtils]: 2: Hoare triple {8293#true} assume 0 < #StackHeapBarrier; {8293#true} is VALID [2020-07-10 19:04:21,584 INFO L280 TraceCheckUtils]: 3: Hoare triple {8293#true} assume true; {8293#true} is VALID [2020-07-10 19:04:21,585 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {8293#true} {8293#true} #419#return; {8293#true} is VALID [2020-07-10 19:04:21,586 INFO L263 TraceCheckUtils]: 0: Hoare triple {8293#true} call ULTIMATE.init(); {8301#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:04:21,586 INFO L280 TraceCheckUtils]: 1: Hoare triple {8301#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {8293#true} is VALID [2020-07-10 19:04:21,586 INFO L280 TraceCheckUtils]: 2: Hoare triple {8293#true} #valid := #valid[0 := 0]; {8293#true} is VALID [2020-07-10 19:04:21,586 INFO L280 TraceCheckUtils]: 3: Hoare triple {8293#true} assume 0 < #StackHeapBarrier; {8293#true} is VALID [2020-07-10 19:04:21,587 INFO L280 TraceCheckUtils]: 4: Hoare triple {8293#true} assume true; {8293#true} is VALID [2020-07-10 19:04:21,587 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {8293#true} {8293#true} #419#return; {8293#true} is VALID [2020-07-10 19:04:21,587 INFO L263 TraceCheckUtils]: 6: Hoare triple {8293#true} call #t~ret28 := main(); {8293#true} is VALID [2020-07-10 19:04:21,587 INFO L280 TraceCheckUtils]: 7: Hoare triple {8293#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {8293#true} is VALID [2020-07-10 19:04:21,588 INFO L280 TraceCheckUtils]: 8: Hoare triple {8293#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {8293#true} is VALID [2020-07-10 19:04:21,588 INFO L280 TraceCheckUtils]: 9: Hoare triple {8293#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {8293#true} is VALID [2020-07-10 19:04:21,588 INFO L280 TraceCheckUtils]: 10: Hoare triple {8293#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {8293#true} is VALID [2020-07-10 19:04:21,588 INFO L280 TraceCheckUtils]: 11: Hoare triple {8293#true} goto; {8293#true} is VALID [2020-07-10 19:04:21,589 INFO L280 TraceCheckUtils]: 12: Hoare triple {8293#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {8293#true} is VALID [2020-07-10 19:04:21,589 INFO L280 TraceCheckUtils]: 13: Hoare triple {8293#true} assume 0 != #t~nondet1; {8293#true} is VALID [2020-07-10 19:04:21,589 INFO L280 TraceCheckUtils]: 14: Hoare triple {8293#true} havoc #t~nondet1; {8293#true} is VALID [2020-07-10 19:04:21,589 INFO L280 TraceCheckUtils]: 15: Hoare triple {8293#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {8293#true} is VALID [2020-07-10 19:04:21,589 INFO L280 TraceCheckUtils]: 16: Hoare triple {8293#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {8293#true} is VALID [2020-07-10 19:04:21,590 INFO L280 TraceCheckUtils]: 17: Hoare triple {8293#true} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {8293#true} is VALID [2020-07-10 19:04:21,590 INFO L280 TraceCheckUtils]: 18: Hoare triple {8293#true} assume !#t~short7; {8293#true} is VALID [2020-07-10 19:04:21,590 INFO L280 TraceCheckUtils]: 19: Hoare triple {8293#true} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-22 {8293#true} is VALID [2020-07-10 19:04:21,590 INFO L280 TraceCheckUtils]: 20: Hoare triple {8293#true} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {8293#true} is VALID [2020-07-10 19:04:21,591 INFO L280 TraceCheckUtils]: 21: Hoare triple {8293#true} assume !!#t~short7; {8293#true} is VALID [2020-07-10 19:04:21,591 INFO L280 TraceCheckUtils]: 22: Hoare triple {8293#true} havoc #t~mem5.base, #t~mem5.offset; {8293#true} is VALID [2020-07-10 19:04:21,591 INFO L280 TraceCheckUtils]: 23: Hoare triple {8293#true} havoc #t~mem6.base, #t~mem6.offset; {8293#true} is VALID [2020-07-10 19:04:21,591 INFO L280 TraceCheckUtils]: 24: Hoare triple {8293#true} havoc #t~short7; {8293#true} is VALID [2020-07-10 19:04:21,592 INFO L280 TraceCheckUtils]: 25: Hoare triple {8293#true} goto; {8293#true} is VALID [2020-07-10 19:04:21,592 INFO L280 TraceCheckUtils]: 26: Hoare triple {8293#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {8293#true} is VALID [2020-07-10 19:04:21,592 INFO L280 TraceCheckUtils]: 27: Hoare triple {8293#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {8293#true} is VALID [2020-07-10 19:04:21,592 INFO L280 TraceCheckUtils]: 28: Hoare triple {8293#true} assume !(0 != #t~nondet8); {8293#true} is VALID [2020-07-10 19:04:21,593 INFO L280 TraceCheckUtils]: 29: Hoare triple {8293#true} havoc #t~nondet8; {8293#true} is VALID [2020-07-10 19:04:21,593 INFO L280 TraceCheckUtils]: 30: Hoare triple {8293#true} ~end~0.base, ~end~0.offset := 0, 0; {8293#true} is VALID [2020-07-10 19:04:21,593 INFO L280 TraceCheckUtils]: 31: Hoare triple {8293#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {8293#true} is VALID [2020-07-10 19:04:21,593 INFO L280 TraceCheckUtils]: 32: Hoare triple {8293#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {8293#true} is VALID [2020-07-10 19:04:21,594 INFO L280 TraceCheckUtils]: 33: Hoare triple {8293#true} goto; {8293#true} is VALID [2020-07-10 19:04:21,594 INFO L280 TraceCheckUtils]: 34: Hoare triple {8293#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {8293#true} is VALID [2020-07-10 19:04:21,595 INFO L280 TraceCheckUtils]: 35: Hoare triple {8293#true} ~len~0 := 0; {8300#(= 0 main_~len~0)} is VALID [2020-07-10 19:04:21,595 INFO L280 TraceCheckUtils]: 36: Hoare triple {8300#(= 0 main_~len~0)} SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 {8300#(= 0 main_~len~0)} is VALID [2020-07-10 19:04:21,596 INFO L280 TraceCheckUtils]: 37: Hoare triple {8300#(= 0 main_~len~0)} ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; {8300#(= 0 main_~len~0)} is VALID [2020-07-10 19:04:21,596 INFO L280 TraceCheckUtils]: 38: Hoare triple {8300#(= 0 main_~len~0)} havoc #t~mem18.base, #t~mem18.offset; {8300#(= 0 main_~len~0)} is VALID [2020-07-10 19:04:21,597 INFO L280 TraceCheckUtils]: 39: Hoare triple {8300#(= 0 main_~len~0)} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {8300#(= 0 main_~len~0)} is VALID [2020-07-10 19:04:21,597 INFO L280 TraceCheckUtils]: 40: Hoare triple {8300#(= 0 main_~len~0)} assume !(~len~0 <= 1); {8294#false} is VALID [2020-07-10 19:04:21,597 INFO L280 TraceCheckUtils]: 41: Hoare triple {8294#false} assume !false; {8294#false} is VALID [2020-07-10 19:04:21,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:04:21,599 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:21,599 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1735150311] [2020-07-10 19:04:21,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:04:21,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 19:04:21,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300666051] [2020-07-10 19:04:21,600 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2020-07-10 19:04:21,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:04:21,600 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 19:04:21,639 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-10 19:04:21,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 19:04:21,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:04:21,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 19:04:21,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 19:04:21,640 INFO L87 Difference]: Start difference. First operand 157 states and 167 transitions. Second operand 4 states. [2020-07-10 19:04:22,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:22,706 INFO L93 Difference]: Finished difference Result 267 states and 287 transitions. [2020-07-10 19:04:22,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 19:04:22,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2020-07-10 19:04:22,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:04:22,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 19:04:22,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 283 transitions. [2020-07-10 19:04:22,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 19:04:22,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 283 transitions. [2020-07-10 19:04:22,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 283 transitions. [2020-07-10 19:04:22,976 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 283 edges. 283 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:22,980 INFO L225 Difference]: With dead ends: 267 [2020-07-10 19:04:22,981 INFO L226 Difference]: Without dead ends: 196 [2020-07-10 19:04:22,982 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-10 19:04:22,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2020-07-10 19:04:23,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 160. [2020-07-10 19:04:23,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:04:23,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 196 states. Second operand 160 states. [2020-07-10 19:04:23,436 INFO L74 IsIncluded]: Start isIncluded. First operand 196 states. Second operand 160 states. [2020-07-10 19:04:23,436 INFO L87 Difference]: Start difference. First operand 196 states. Second operand 160 states. [2020-07-10 19:04:23,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:23,441 INFO L93 Difference]: Finished difference Result 196 states and 209 transitions. [2020-07-10 19:04:23,441 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 209 transitions. [2020-07-10 19:04:23,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:23,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:23,442 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 196 states. [2020-07-10 19:04:23,442 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 196 states. [2020-07-10 19:04:23,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:23,447 INFO L93 Difference]: Finished difference Result 196 states and 209 transitions. [2020-07-10 19:04:23,447 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 209 transitions. [2020-07-10 19:04:23,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:23,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:23,448 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:04:23,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:04:23,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2020-07-10 19:04:23,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 171 transitions. [2020-07-10 19:04:23,452 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 171 transitions. Word has length 42 [2020-07-10 19:04:23,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:04:23,452 INFO L479 AbstractCegarLoop]: Abstraction has 160 states and 171 transitions. [2020-07-10 19:04:23,452 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 19:04:23,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 160 states and 171 transitions. [2020-07-10 19:04:23,742 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-10 19:04:23,743 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 171 transitions. [2020-07-10 19:04:23,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-10 19:04:23,743 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:23,744 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] [2020-07-10 19:04:23,744 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-10 19:04:23,744 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-10 19:04:23,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:23,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1017153069, now seen corresponding path program 1 times [2020-07-10 19:04:23,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:23,745 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1802905440] [2020-07-10 19:04:23,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:23,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:23,821 INFO L280 TraceCheckUtils]: 0: Hoare triple {9558#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {9550#true} is VALID [2020-07-10 19:04:23,821 INFO L280 TraceCheckUtils]: 1: Hoare triple {9550#true} #valid := #valid[0 := 0]; {9550#true} is VALID [2020-07-10 19:04:23,822 INFO L280 TraceCheckUtils]: 2: Hoare triple {9550#true} assume 0 < #StackHeapBarrier; {9550#true} is VALID [2020-07-10 19:04:23,822 INFO L280 TraceCheckUtils]: 3: Hoare triple {9550#true} assume true; {9550#true} is VALID [2020-07-10 19:04:23,822 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {9550#true} {9550#true} #419#return; {9550#true} is VALID [2020-07-10 19:04:23,824 INFO L263 TraceCheckUtils]: 0: Hoare triple {9550#true} call ULTIMATE.init(); {9558#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:04:23,824 INFO L280 TraceCheckUtils]: 1: Hoare triple {9558#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {9550#true} is VALID [2020-07-10 19:04:23,824 INFO L280 TraceCheckUtils]: 2: Hoare triple {9550#true} #valid := #valid[0 := 0]; {9550#true} is VALID [2020-07-10 19:04:23,824 INFO L280 TraceCheckUtils]: 3: Hoare triple {9550#true} assume 0 < #StackHeapBarrier; {9550#true} is VALID [2020-07-10 19:04:23,825 INFO L280 TraceCheckUtils]: 4: Hoare triple {9550#true} assume true; {9550#true} is VALID [2020-07-10 19:04:23,825 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {9550#true} {9550#true} #419#return; {9550#true} is VALID [2020-07-10 19:04:23,826 INFO L263 TraceCheckUtils]: 6: Hoare triple {9550#true} call #t~ret28 := main(); {9550#true} is VALID [2020-07-10 19:04:23,826 INFO L280 TraceCheckUtils]: 7: Hoare triple {9550#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {9550#true} is VALID [2020-07-10 19:04:23,827 INFO L280 TraceCheckUtils]: 8: Hoare triple {9550#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {9550#true} is VALID [2020-07-10 19:04:23,827 INFO L280 TraceCheckUtils]: 9: Hoare triple {9550#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {9550#true} is VALID [2020-07-10 19:04:23,827 INFO L280 TraceCheckUtils]: 10: Hoare triple {9550#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {9550#true} is VALID [2020-07-10 19:04:23,827 INFO L280 TraceCheckUtils]: 11: Hoare triple {9550#true} goto; {9550#true} is VALID [2020-07-10 19:04:23,828 INFO L280 TraceCheckUtils]: 12: Hoare triple {9550#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {9550#true} is VALID [2020-07-10 19:04:23,828 INFO L280 TraceCheckUtils]: 13: Hoare triple {9550#true} assume 0 != #t~nondet1; {9550#true} is VALID [2020-07-10 19:04:23,828 INFO L280 TraceCheckUtils]: 14: Hoare triple {9550#true} havoc #t~nondet1; {9550#true} is VALID [2020-07-10 19:04:23,833 INFO L280 TraceCheckUtils]: 15: Hoare triple {9550#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {9550#true} is VALID [2020-07-10 19:04:23,833 INFO L280 TraceCheckUtils]: 16: Hoare triple {9550#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {9550#true} is VALID [2020-07-10 19:04:23,834 INFO L280 TraceCheckUtils]: 17: Hoare triple {9550#true} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {9550#true} is VALID [2020-07-10 19:04:23,834 INFO L280 TraceCheckUtils]: 18: Hoare triple {9550#true} assume !#t~short7; {9550#true} is VALID [2020-07-10 19:04:23,834 INFO L280 TraceCheckUtils]: 19: Hoare triple {9550#true} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-22 {9550#true} is VALID [2020-07-10 19:04:23,834 INFO L280 TraceCheckUtils]: 20: Hoare triple {9550#true} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {9550#true} is VALID [2020-07-10 19:04:23,835 INFO L280 TraceCheckUtils]: 21: Hoare triple {9550#true} assume !!#t~short7; {9550#true} is VALID [2020-07-10 19:04:23,835 INFO L280 TraceCheckUtils]: 22: Hoare triple {9550#true} havoc #t~mem5.base, #t~mem5.offset; {9550#true} is VALID [2020-07-10 19:04:23,835 INFO L280 TraceCheckUtils]: 23: Hoare triple {9550#true} havoc #t~mem6.base, #t~mem6.offset; {9550#true} is VALID [2020-07-10 19:04:23,835 INFO L280 TraceCheckUtils]: 24: Hoare triple {9550#true} havoc #t~short7; {9550#true} is VALID [2020-07-10 19:04:23,835 INFO L280 TraceCheckUtils]: 25: Hoare triple {9550#true} goto; {9550#true} is VALID [2020-07-10 19:04:23,836 INFO L280 TraceCheckUtils]: 26: Hoare triple {9550#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {9550#true} is VALID [2020-07-10 19:04:23,836 INFO L280 TraceCheckUtils]: 27: Hoare triple {9550#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {9550#true} is VALID [2020-07-10 19:04:23,836 INFO L280 TraceCheckUtils]: 28: Hoare triple {9550#true} assume !(0 != #t~nondet8); {9550#true} is VALID [2020-07-10 19:04:23,836 INFO L280 TraceCheckUtils]: 29: Hoare triple {9550#true} havoc #t~nondet8; {9550#true} is VALID [2020-07-10 19:04:23,837 INFO L280 TraceCheckUtils]: 30: Hoare triple {9550#true} ~end~0.base, ~end~0.offset := 0, 0; {9550#true} is VALID [2020-07-10 19:04:23,837 INFO L280 TraceCheckUtils]: 31: Hoare triple {9550#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {9550#true} is VALID [2020-07-10 19:04:23,837 INFO L280 TraceCheckUtils]: 32: Hoare triple {9550#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {9550#true} is VALID [2020-07-10 19:04:23,837 INFO L280 TraceCheckUtils]: 33: Hoare triple {9550#true} goto; {9550#true} is VALID [2020-07-10 19:04:23,837 INFO L280 TraceCheckUtils]: 34: Hoare triple {9550#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {9550#true} is VALID [2020-07-10 19:04:23,838 INFO L280 TraceCheckUtils]: 35: Hoare triple {9550#true} ~len~0 := 0; {9550#true} is VALID [2020-07-10 19:04:23,838 INFO L280 TraceCheckUtils]: 36: Hoare triple {9550#true} SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 {9550#true} is VALID [2020-07-10 19:04:23,840 INFO L280 TraceCheckUtils]: 37: Hoare triple {9550#true} ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; {9550#true} is VALID [2020-07-10 19:04:23,840 INFO L280 TraceCheckUtils]: 38: Hoare triple {9550#true} havoc #t~mem18.base, #t~mem18.offset; {9550#true} is VALID [2020-07-10 19:04:23,845 INFO L280 TraceCheckUtils]: 39: Hoare triple {9550#true} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {9557#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} is VALID [2020-07-10 19:04:23,845 INFO L280 TraceCheckUtils]: 40: Hoare triple {9557#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} assume 0 == ~len~0; {9557#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} is VALID [2020-07-10 19:04:23,846 INFO L280 TraceCheckUtils]: 41: Hoare triple {9557#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} ~len~0 := 1; {9557#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} is VALID [2020-07-10 19:04:23,846 INFO L280 TraceCheckUtils]: 42: Hoare triple {9557#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {9551#false} is VALID [2020-07-10 19:04:23,847 INFO L280 TraceCheckUtils]: 43: Hoare triple {9551#false} assume !false; {9551#false} is VALID [2020-07-10 19:04:23,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:04:23,848 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:23,849 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1802905440] [2020-07-10 19:04:23,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:04:23,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 19:04:23,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385349120] [2020-07-10 19:04:23,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2020-07-10 19:04:23,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:04:23,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 19:04:23,892 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:23,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 19:04:23,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:04:23,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 19:04:23,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 19:04:23,893 INFO L87 Difference]: Start difference. First operand 160 states and 171 transitions. Second operand 4 states. [2020-07-10 19:04:24,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:24,928 INFO L93 Difference]: Finished difference Result 160 states and 171 transitions. [2020-07-10 19:04:24,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 19:04:24,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2020-07-10 19:04:24,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:04:24,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 19:04:24,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2020-07-10 19:04:24,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 19:04:24,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2020-07-10 19:04:24,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 163 transitions. [2020-07-10 19:04:25,134 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:25,141 INFO L225 Difference]: With dead ends: 160 [2020-07-10 19:04:25,141 INFO L226 Difference]: Without dead ends: 158 [2020-07-10 19:04:25,142 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-10 19:04:25,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-07-10 19:04:25,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2020-07-10 19:04:25,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:04:25,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand 158 states. [2020-07-10 19:04:25,725 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 158 states. [2020-07-10 19:04:25,725 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 158 states. [2020-07-10 19:04:25,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:25,729 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2020-07-10 19:04:25,729 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 169 transitions. [2020-07-10 19:04:25,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:25,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:25,731 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 158 states. [2020-07-10 19:04:25,731 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 158 states. [2020-07-10 19:04:25,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:25,737 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2020-07-10 19:04:25,737 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 169 transitions. [2020-07-10 19:04:25,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:25,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:25,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:04:25,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:04:25,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2020-07-10 19:04:25,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 169 transitions. [2020-07-10 19:04:25,744 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 169 transitions. Word has length 44 [2020-07-10 19:04:25,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:04:25,745 INFO L479 AbstractCegarLoop]: Abstraction has 158 states and 169 transitions. [2020-07-10 19:04:25,745 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 19:04:25,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 158 states and 169 transitions. [2020-07-10 19:04:26,129 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:26,130 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 169 transitions. [2020-07-10 19:04:26,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-10 19:04:26,131 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:26,131 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] [2020-07-10 19:04:26,131 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-10 19:04:26,132 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-10 19:04:26,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:26,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1203451366, now seen corresponding path program 1 times [2020-07-10 19:04:26,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:26,132 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [515059311] [2020-07-10 19:04:26,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:26,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:26,453 INFO L280 TraceCheckUtils]: 0: Hoare triple {10528#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {10513#true} is VALID [2020-07-10 19:04:26,454 INFO L280 TraceCheckUtils]: 1: Hoare triple {10513#true} #valid := #valid[0 := 0]; {10513#true} is VALID [2020-07-10 19:04:26,454 INFO L280 TraceCheckUtils]: 2: Hoare triple {10513#true} assume 0 < #StackHeapBarrier; {10513#true} is VALID [2020-07-10 19:04:26,455 INFO L280 TraceCheckUtils]: 3: Hoare triple {10513#true} assume true; {10513#true} is VALID [2020-07-10 19:04:26,455 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {10513#true} {10513#true} #419#return; {10513#true} is VALID [2020-07-10 19:04:26,456 INFO L263 TraceCheckUtils]: 0: Hoare triple {10513#true} call ULTIMATE.init(); {10528#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:04:26,457 INFO L280 TraceCheckUtils]: 1: Hoare triple {10528#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {10513#true} is VALID [2020-07-10 19:04:26,457 INFO L280 TraceCheckUtils]: 2: Hoare triple {10513#true} #valid := #valid[0 := 0]; {10513#true} is VALID [2020-07-10 19:04:26,457 INFO L280 TraceCheckUtils]: 3: Hoare triple {10513#true} assume 0 < #StackHeapBarrier; {10513#true} is VALID [2020-07-10 19:04:26,458 INFO L280 TraceCheckUtils]: 4: Hoare triple {10513#true} assume true; {10513#true} is VALID [2020-07-10 19:04:26,458 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {10513#true} {10513#true} #419#return; {10513#true} is VALID [2020-07-10 19:04:26,458 INFO L263 TraceCheckUtils]: 6: Hoare triple {10513#true} call #t~ret28 := main(); {10513#true} is VALID [2020-07-10 19:04:26,459 INFO L280 TraceCheckUtils]: 7: Hoare triple {10513#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {10520#(= 0 |main_#t~malloc0.offset|)} is VALID [2020-07-10 19:04:26,460 INFO L280 TraceCheckUtils]: 8: Hoare triple {10520#(= 0 |main_#t~malloc0.offset|)} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {10521#(= 0 main_~list~0.offset)} is VALID [2020-07-10 19:04:26,460 INFO L280 TraceCheckUtils]: 9: Hoare triple {10521#(= 0 main_~list~0.offset)} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {10521#(= 0 main_~list~0.offset)} is VALID [2020-07-10 19:04:26,461 INFO L280 TraceCheckUtils]: 10: Hoare triple {10521#(= 0 main_~list~0.offset)} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {10521#(= 0 main_~list~0.offset)} is VALID [2020-07-10 19:04:26,462 INFO L280 TraceCheckUtils]: 11: Hoare triple {10521#(= 0 main_~list~0.offset)} goto; {10521#(= 0 main_~list~0.offset)} is VALID [2020-07-10 19:04:26,463 INFO L280 TraceCheckUtils]: 12: Hoare triple {10521#(= 0 main_~list~0.offset)} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {10521#(= 0 main_~list~0.offset)} is VALID [2020-07-10 19:04:26,464 INFO L280 TraceCheckUtils]: 13: Hoare triple {10521#(= 0 main_~list~0.offset)} assume 0 != #t~nondet1; {10521#(= 0 main_~list~0.offset)} is VALID [2020-07-10 19:04:26,464 INFO L280 TraceCheckUtils]: 14: Hoare triple {10521#(= 0 main_~list~0.offset)} havoc #t~nondet1; {10521#(= 0 main_~list~0.offset)} is VALID [2020-07-10 19:04:26,465 INFO L280 TraceCheckUtils]: 15: Hoare triple {10521#(= 0 main_~list~0.offset)} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {10521#(= 0 main_~list~0.offset)} is VALID [2020-07-10 19:04:26,466 INFO L280 TraceCheckUtils]: 16: Hoare triple {10521#(= 0 main_~list~0.offset)} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {10522#(and (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem5.base|))} is VALID [2020-07-10 19:04:26,468 INFO L280 TraceCheckUtils]: 17: Hoare triple {10522#(and (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem5.base|))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {10523#(and (or |main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))) (= 0 main_~list~0.offset))} is VALID [2020-07-10 19:04:26,470 INFO L280 TraceCheckUtils]: 18: Hoare triple {10523#(and (or |main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))) (= 0 main_~list~0.offset))} assume !#t~short7; {10524#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:26,471 INFO L280 TraceCheckUtils]: 19: Hoare triple {10524#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-22 {10524#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:26,472 INFO L280 TraceCheckUtils]: 20: Hoare triple {10524#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {10524#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:26,474 INFO L280 TraceCheckUtils]: 21: Hoare triple {10524#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !!#t~short7; {10524#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:26,475 INFO L280 TraceCheckUtils]: 22: Hoare triple {10524#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~mem5.base, #t~mem5.offset; {10524#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:26,476 INFO L280 TraceCheckUtils]: 23: Hoare triple {10524#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~mem6.base, #t~mem6.offset; {10524#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:26,477 INFO L280 TraceCheckUtils]: 24: Hoare triple {10524#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~short7; {10524#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:26,478 INFO L280 TraceCheckUtils]: 25: Hoare triple {10524#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} goto; {10524#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:26,480 INFO L280 TraceCheckUtils]: 26: Hoare triple {10524#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {10524#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:26,481 INFO L280 TraceCheckUtils]: 27: Hoare triple {10524#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {10524#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:26,482 INFO L280 TraceCheckUtils]: 28: Hoare triple {10524#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !(0 != #t~nondet8); {10524#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:26,483 INFO L280 TraceCheckUtils]: 29: Hoare triple {10524#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~nondet8; {10524#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:26,485 INFO L280 TraceCheckUtils]: 30: Hoare triple {10524#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := 0, 0; {10524#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:26,486 INFO L280 TraceCheckUtils]: 31: Hoare triple {10524#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {10525#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} is VALID [2020-07-10 19:04:26,488 INFO L280 TraceCheckUtils]: 32: Hoare triple {10525#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {10525#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} is VALID [2020-07-10 19:04:26,489 INFO L280 TraceCheckUtils]: 33: Hoare triple {10525#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} goto; {10525#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} is VALID [2020-07-10 19:04:26,490 INFO L280 TraceCheckUtils]: 34: Hoare triple {10525#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {10525#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} is VALID [2020-07-10 19:04:26,491 INFO L280 TraceCheckUtils]: 35: Hoare triple {10525#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} ~len~0 := 0; {10525#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} is VALID [2020-07-10 19:04:26,492 INFO L280 TraceCheckUtils]: 36: Hoare triple {10525#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 {10526#(and (= 0 |main_#t~mem18.offset|) (= 0 |main_#t~mem18.base|))} is VALID [2020-07-10 19:04:26,493 INFO L280 TraceCheckUtils]: 37: Hoare triple {10526#(and (= 0 |main_#t~mem18.offset|) (= 0 |main_#t~mem18.base|))} ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; {10527#(and (= 0 main_~inner~0.base) (= 0 main_~inner~0.offset))} is VALID [2020-07-10 19:04:26,494 INFO L280 TraceCheckUtils]: 38: Hoare triple {10527#(and (= 0 main_~inner~0.base) (= 0 main_~inner~0.offset))} havoc #t~mem18.base, #t~mem18.offset; {10527#(and (= 0 main_~inner~0.base) (= 0 main_~inner~0.offset))} is VALID [2020-07-10 19:04:26,495 INFO L280 TraceCheckUtils]: 39: Hoare triple {10527#(and (= 0 main_~inner~0.base) (= 0 main_~inner~0.offset))} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {10514#false} is VALID [2020-07-10 19:04:26,496 INFO L280 TraceCheckUtils]: 40: Hoare triple {10514#false} assume 0 == ~len~0; {10514#false} is VALID [2020-07-10 19:04:26,496 INFO L280 TraceCheckUtils]: 41: Hoare triple {10514#false} ~len~0 := 1; {10514#false} is VALID [2020-07-10 19:04:26,496 INFO L280 TraceCheckUtils]: 42: Hoare triple {10514#false} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {10514#false} is VALID [2020-07-10 19:04:26,497 INFO L280 TraceCheckUtils]: 43: Hoare triple {10514#false} goto; {10514#false} is VALID [2020-07-10 19:04:26,497 INFO L280 TraceCheckUtils]: 44: Hoare triple {10514#false} SUMMARY for call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); srcloc: L1025-6 {10514#false} is VALID [2020-07-10 19:04:26,498 INFO L280 TraceCheckUtils]: 45: Hoare triple {10514#false} assume !(0 == #t~mem19.base && 0 == #t~mem19.offset); {10514#false} is VALID [2020-07-10 19:04:26,498 INFO L280 TraceCheckUtils]: 46: Hoare triple {10514#false} havoc #t~mem19.base, #t~mem19.offset; {10514#false} is VALID [2020-07-10 19:04:26,498 INFO L280 TraceCheckUtils]: 47: Hoare triple {10514#false} assume !false; {10514#false} is VALID [2020-07-10 19:04:26,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:04:26,511 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:26,511 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [515059311] [2020-07-10 19:04:26,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:04:26,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-10 19:04:26,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158538518] [2020-07-10 19:04:26,513 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2020-07-10 19:04:26,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:04:26,513 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 19:04:26,594 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:26,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 19:04:26,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:04:26,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 19:04:26,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-07-10 19:04:26,595 INFO L87 Difference]: Start difference. First operand 158 states and 169 transitions. Second operand 11 states. [2020-07-10 19:04:30,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:30,548 INFO L93 Difference]: Finished difference Result 398 states and 427 transitions. [2020-07-10 19:04:30,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-10 19:04:30,548 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2020-07-10 19:04:30,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:04:30,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 19:04:30,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 415 transitions. [2020-07-10 19:04:30,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 19:04:30,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 415 transitions. [2020-07-10 19:04:30,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 415 transitions. [2020-07-10 19:04:31,099 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 415 edges. 415 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:31,106 INFO L225 Difference]: With dead ends: 398 [2020-07-10 19:04:31,106 INFO L226 Difference]: Without dead ends: 326 [2020-07-10 19:04:31,107 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2020-07-10 19:04:31,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2020-07-10 19:04:31,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 204. [2020-07-10 19:04:31,941 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:04:31,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 326 states. Second operand 204 states. [2020-07-10 19:04:31,941 INFO L74 IsIncluded]: Start isIncluded. First operand 326 states. Second operand 204 states. [2020-07-10 19:04:31,941 INFO L87 Difference]: Start difference. First operand 326 states. Second operand 204 states. [2020-07-10 19:04:31,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:31,950 INFO L93 Difference]: Finished difference Result 326 states and 348 transitions. [2020-07-10 19:04:31,950 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 348 transitions. [2020-07-10 19:04:31,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:31,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:31,951 INFO L74 IsIncluded]: Start isIncluded. First operand 204 states. Second operand 326 states. [2020-07-10 19:04:31,951 INFO L87 Difference]: Start difference. First operand 204 states. Second operand 326 states. [2020-07-10 19:04:31,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:31,959 INFO L93 Difference]: Finished difference Result 326 states and 348 transitions. [2020-07-10 19:04:31,959 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 348 transitions. [2020-07-10 19:04:31,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:31,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:31,961 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:04:31,961 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:04:31,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-07-10 19:04:31,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 220 transitions. [2020-07-10 19:04:31,965 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 220 transitions. Word has length 48 [2020-07-10 19:04:31,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:04:31,965 INFO L479 AbstractCegarLoop]: Abstraction has 204 states and 220 transitions. [2020-07-10 19:04:31,965 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 19:04:31,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 204 states and 220 transitions. [2020-07-10 19:04:32,421 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 220 edges. 220 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:32,421 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 220 transitions. [2020-07-10 19:04:32,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-10 19:04:32,422 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:32,422 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] [2020-07-10 19:04:32,423 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-10 19:04:32,423 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-10 19:04:32,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:32,423 INFO L82 PathProgramCache]: Analyzing trace with hash 2069783995, now seen corresponding path program 1 times [2020-07-10 19:04:32,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:32,424 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [740050255] [2020-07-10 19:04:32,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:32,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:32,492 INFO L280 TraceCheckUtils]: 0: Hoare triple {12421#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {12413#true} is VALID [2020-07-10 19:04:32,492 INFO L280 TraceCheckUtils]: 1: Hoare triple {12413#true} #valid := #valid[0 := 0]; {12413#true} is VALID [2020-07-10 19:04:32,493 INFO L280 TraceCheckUtils]: 2: Hoare triple {12413#true} assume 0 < #StackHeapBarrier; {12413#true} is VALID [2020-07-10 19:04:32,493 INFO L280 TraceCheckUtils]: 3: Hoare triple {12413#true} assume true; {12413#true} is VALID [2020-07-10 19:04:32,493 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {12413#true} {12413#true} #419#return; {12413#true} is VALID [2020-07-10 19:04:32,494 INFO L263 TraceCheckUtils]: 0: Hoare triple {12413#true} call ULTIMATE.init(); {12421#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:04:32,494 INFO L280 TraceCheckUtils]: 1: Hoare triple {12421#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {12413#true} is VALID [2020-07-10 19:04:32,495 INFO L280 TraceCheckUtils]: 2: Hoare triple {12413#true} #valid := #valid[0 := 0]; {12413#true} is VALID [2020-07-10 19:04:32,495 INFO L280 TraceCheckUtils]: 3: Hoare triple {12413#true} assume 0 < #StackHeapBarrier; {12413#true} is VALID [2020-07-10 19:04:32,495 INFO L280 TraceCheckUtils]: 4: Hoare triple {12413#true} assume true; {12413#true} is VALID [2020-07-10 19:04:32,495 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {12413#true} {12413#true} #419#return; {12413#true} is VALID [2020-07-10 19:04:32,495 INFO L263 TraceCheckUtils]: 6: Hoare triple {12413#true} call #t~ret28 := main(); {12413#true} is VALID [2020-07-10 19:04:32,496 INFO L280 TraceCheckUtils]: 7: Hoare triple {12413#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {12413#true} is VALID [2020-07-10 19:04:32,496 INFO L280 TraceCheckUtils]: 8: Hoare triple {12413#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {12413#true} is VALID [2020-07-10 19:04:32,496 INFO L280 TraceCheckUtils]: 9: Hoare triple {12413#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {12413#true} is VALID [2020-07-10 19:04:32,496 INFO L280 TraceCheckUtils]: 10: Hoare triple {12413#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {12413#true} is VALID [2020-07-10 19:04:32,497 INFO L280 TraceCheckUtils]: 11: Hoare triple {12413#true} goto; {12413#true} is VALID [2020-07-10 19:04:32,497 INFO L280 TraceCheckUtils]: 12: Hoare triple {12413#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {12413#true} is VALID [2020-07-10 19:04:32,497 INFO L280 TraceCheckUtils]: 13: Hoare triple {12413#true} assume 0 != #t~nondet1; {12413#true} is VALID [2020-07-10 19:04:32,497 INFO L280 TraceCheckUtils]: 14: Hoare triple {12413#true} havoc #t~nondet1; {12413#true} is VALID [2020-07-10 19:04:32,498 INFO L280 TraceCheckUtils]: 15: Hoare triple {12413#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {12413#true} is VALID [2020-07-10 19:04:32,498 INFO L280 TraceCheckUtils]: 16: Hoare triple {12413#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {12413#true} is VALID [2020-07-10 19:04:32,498 INFO L280 TraceCheckUtils]: 17: Hoare triple {12413#true} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {12413#true} is VALID [2020-07-10 19:04:32,498 INFO L280 TraceCheckUtils]: 18: Hoare triple {12413#true} assume !#t~short7; {12413#true} is VALID [2020-07-10 19:04:32,498 INFO L280 TraceCheckUtils]: 19: Hoare triple {12413#true} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-22 {12413#true} is VALID [2020-07-10 19:04:32,499 INFO L280 TraceCheckUtils]: 20: Hoare triple {12413#true} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {12413#true} is VALID [2020-07-10 19:04:32,499 INFO L280 TraceCheckUtils]: 21: Hoare triple {12413#true} assume !!#t~short7; {12413#true} is VALID [2020-07-10 19:04:32,499 INFO L280 TraceCheckUtils]: 22: Hoare triple {12413#true} havoc #t~mem5.base, #t~mem5.offset; {12413#true} is VALID [2020-07-10 19:04:32,499 INFO L280 TraceCheckUtils]: 23: Hoare triple {12413#true} havoc #t~mem6.base, #t~mem6.offset; {12413#true} is VALID [2020-07-10 19:04:32,500 INFO L280 TraceCheckUtils]: 24: Hoare triple {12413#true} havoc #t~short7; {12413#true} is VALID [2020-07-10 19:04:32,500 INFO L280 TraceCheckUtils]: 25: Hoare triple {12413#true} goto; {12413#true} is VALID [2020-07-10 19:04:32,500 INFO L280 TraceCheckUtils]: 26: Hoare triple {12413#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {12413#true} is VALID [2020-07-10 19:04:32,500 INFO L280 TraceCheckUtils]: 27: Hoare triple {12413#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {12413#true} is VALID [2020-07-10 19:04:32,500 INFO L280 TraceCheckUtils]: 28: Hoare triple {12413#true} assume !!(0 != #t~nondet8); {12413#true} is VALID [2020-07-10 19:04:32,501 INFO L280 TraceCheckUtils]: 29: Hoare triple {12413#true} havoc #t~nondet8; {12413#true} is VALID [2020-07-10 19:04:32,501 INFO L280 TraceCheckUtils]: 30: Hoare triple {12413#true} SUMMARY for call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(8); srcloc: L1001 {12413#true} is VALID [2020-07-10 19:04:32,501 INFO L280 TraceCheckUtils]: 31: Hoare triple {12413#true} SUMMARY for call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~end~0.base, ~end~0.offset, 4); srcloc: L1001-1 {12413#true} is VALID [2020-07-10 19:04:32,501 INFO L280 TraceCheckUtils]: 32: Hoare triple {12413#true} SUMMARY for call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1001-2 {12413#true} is VALID [2020-07-10 19:04:32,502 INFO L280 TraceCheckUtils]: 33: Hoare triple {12413#true} ~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset; {12413#true} is VALID [2020-07-10 19:04:32,502 INFO L280 TraceCheckUtils]: 34: Hoare triple {12413#true} havoc #t~mem10.base, #t~mem10.offset; {12413#true} is VALID [2020-07-10 19:04:32,502 INFO L280 TraceCheckUtils]: 35: Hoare triple {12413#true} SUMMARY for call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); srcloc: L1003 {12413#true} is VALID [2020-07-10 19:04:32,502 INFO L280 TraceCheckUtils]: 36: Hoare triple {12413#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {12413#true} is VALID [2020-07-10 19:04:32,502 INFO L280 TraceCheckUtils]: 37: Hoare triple {12413#true} goto; {12413#true} is VALID [2020-07-10 19:04:32,503 INFO L280 TraceCheckUtils]: 38: Hoare triple {12413#true} assume !!(~end~0.base != 0 || ~end~0.offset != 0); {12413#true} is VALID [2020-07-10 19:04:32,503 INFO L280 TraceCheckUtils]: 39: Hoare triple {12413#true} goto; {12413#true} is VALID [2020-07-10 19:04:32,503 INFO L280 TraceCheckUtils]: 40: Hoare triple {12413#true} assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; {12413#true} is VALID [2020-07-10 19:04:32,503 INFO L280 TraceCheckUtils]: 41: Hoare triple {12413#true} assume 0 != #t~nondet11; {12413#true} is VALID [2020-07-10 19:04:32,504 INFO L280 TraceCheckUtils]: 42: Hoare triple {12413#true} havoc #t~nondet11; {12413#true} is VALID [2020-07-10 19:04:32,504 INFO L280 TraceCheckUtils]: 43: Hoare triple {12413#true} SUMMARY for call write~$Pointer$(0, 0, ~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1005-7 {12413#true} is VALID [2020-07-10 19:04:32,504 INFO L280 TraceCheckUtils]: 44: Hoare triple {12413#true} SUMMARY for call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1005-34 {12413#true} is VALID [2020-07-10 19:04:32,504 INFO L280 TraceCheckUtils]: 45: Hoare triple {12413#true} #t~short17 := #t~mem15.base != 0 || #t~mem15.offset != 0; {12413#true} is VALID [2020-07-10 19:04:32,510 INFO L280 TraceCheckUtils]: 46: Hoare triple {12413#true} assume #t~short17; {12420#|main_#t~short17|} is VALID [2020-07-10 19:04:32,511 INFO L280 TraceCheckUtils]: 47: Hoare triple {12420#|main_#t~short17|} assume !#t~short17; {12414#false} is VALID [2020-07-10 19:04:32,511 INFO L280 TraceCheckUtils]: 48: Hoare triple {12414#false} havoc #t~short17; {12414#false} is VALID [2020-07-10 19:04:32,512 INFO L280 TraceCheckUtils]: 49: Hoare triple {12414#false} havoc #t~mem15.base, #t~mem15.offset; {12414#false} is VALID [2020-07-10 19:04:32,512 INFO L280 TraceCheckUtils]: 50: Hoare triple {12414#false} havoc #t~mem16.base, #t~mem16.offset; {12414#false} is VALID [2020-07-10 19:04:32,512 INFO L280 TraceCheckUtils]: 51: Hoare triple {12414#false} assume !false; {12414#false} is VALID [2020-07-10 19:04:32,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:04:32,517 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:32,518 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [740050255] [2020-07-10 19:04:32,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:04:32,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 19:04:32,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449595986] [2020-07-10 19:04:32,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2020-07-10 19:04:32,519 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:04:32,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 19:04:32,568 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:32,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 19:04:32,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:04:32,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 19:04:32,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 19:04:32,569 INFO L87 Difference]: Start difference. First operand 204 states and 220 transitions. Second operand 4 states. [2020-07-10 19:04:33,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:33,797 INFO L93 Difference]: Finished difference Result 211 states and 228 transitions. [2020-07-10 19:04:33,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 19:04:33,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2020-07-10 19:04:33,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:04:33,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 19:04:33,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2020-07-10 19:04:33,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 19:04:33,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2020-07-10 19:04:33,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 167 transitions. [2020-07-10 19:04:33,967 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:33,970 INFO L225 Difference]: With dead ends: 211 [2020-07-10 19:04:33,970 INFO L226 Difference]: Without dead ends: 206 [2020-07-10 19:04:33,971 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-10 19:04:33,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-07-10 19:04:34,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2020-07-10 19:04:34,761 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:04:34,761 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand 206 states. [2020-07-10 19:04:34,761 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand 206 states. [2020-07-10 19:04:34,761 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 206 states. [2020-07-10 19:04:34,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:34,766 INFO L93 Difference]: Finished difference Result 206 states and 222 transitions. [2020-07-10 19:04:34,766 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 222 transitions. [2020-07-10 19:04:34,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:34,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:34,767 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand 206 states. [2020-07-10 19:04:34,767 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 206 states. [2020-07-10 19:04:34,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:34,771 INFO L93 Difference]: Finished difference Result 206 states and 222 transitions. [2020-07-10 19:04:34,771 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 222 transitions. [2020-07-10 19:04:34,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:34,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:34,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:04:34,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:04:34,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-07-10 19:04:34,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 222 transitions. [2020-07-10 19:04:34,776 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 222 transitions. Word has length 52 [2020-07-10 19:04:34,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:04:34,776 INFO L479 AbstractCegarLoop]: Abstraction has 206 states and 222 transitions. [2020-07-10 19:04:34,777 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 19:04:34,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 206 states and 222 transitions. [2020-07-10 19:04:35,236 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:35,237 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 222 transitions. [2020-07-10 19:04:35,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-07-10 19:04:35,238 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:35,238 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] [2020-07-10 19:04:35,238 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-10 19:04:35,239 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-10 19:04:35,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:35,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1565892499, now seen corresponding path program 1 times [2020-07-10 19:04:35,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:35,240 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [485339984] [2020-07-10 19:04:35,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:35,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:35,671 INFO L280 TraceCheckUtils]: 0: Hoare triple {13688#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {13670#true} is VALID [2020-07-10 19:04:35,671 INFO L280 TraceCheckUtils]: 1: Hoare triple {13670#true} #valid := #valid[0 := 0]; {13670#true} is VALID [2020-07-10 19:04:35,671 INFO L280 TraceCheckUtils]: 2: Hoare triple {13670#true} assume 0 < #StackHeapBarrier; {13670#true} is VALID [2020-07-10 19:04:35,671 INFO L280 TraceCheckUtils]: 3: Hoare triple {13670#true} assume true; {13670#true} is VALID [2020-07-10 19:04:35,672 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {13670#true} {13670#true} #419#return; {13670#true} is VALID [2020-07-10 19:04:35,673 INFO L263 TraceCheckUtils]: 0: Hoare triple {13670#true} call ULTIMATE.init(); {13688#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:04:35,673 INFO L280 TraceCheckUtils]: 1: Hoare triple {13688#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {13670#true} is VALID [2020-07-10 19:04:35,673 INFO L280 TraceCheckUtils]: 2: Hoare triple {13670#true} #valid := #valid[0 := 0]; {13670#true} is VALID [2020-07-10 19:04:35,673 INFO L280 TraceCheckUtils]: 3: Hoare triple {13670#true} assume 0 < #StackHeapBarrier; {13670#true} is VALID [2020-07-10 19:04:35,673 INFO L280 TraceCheckUtils]: 4: Hoare triple {13670#true} assume true; {13670#true} is VALID [2020-07-10 19:04:35,674 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {13670#true} {13670#true} #419#return; {13670#true} is VALID [2020-07-10 19:04:35,674 INFO L263 TraceCheckUtils]: 6: Hoare triple {13670#true} call #t~ret28 := main(); {13670#true} is VALID [2020-07-10 19:04:35,675 INFO L280 TraceCheckUtils]: 7: Hoare triple {13670#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {13677#(and (= 1 (select |#valid| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|))} is VALID [2020-07-10 19:04:35,675 INFO L280 TraceCheckUtils]: 8: Hoare triple {13677#(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; {13678#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-10 19:04:35,676 INFO L280 TraceCheckUtils]: 9: Hoare triple {13678#(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: L992 {13678#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-10 19:04:35,677 INFO L280 TraceCheckUtils]: 10: Hoare triple {13678#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {13678#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-10 19:04:35,677 INFO L280 TraceCheckUtils]: 11: Hoare triple {13678#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} goto; {13678#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-10 19:04:35,678 INFO L280 TraceCheckUtils]: 12: Hoare triple {13678#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {13678#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-10 19:04:35,679 INFO L280 TraceCheckUtils]: 13: Hoare triple {13678#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} assume !(0 != #t~nondet1); {13678#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-10 19:04:35,679 INFO L280 TraceCheckUtils]: 14: Hoare triple {13678#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} havoc #t~nondet1; {13678#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-10 19:04:35,680 INFO L280 TraceCheckUtils]: 15: Hoare triple {13678#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); srcloc: L993-10 {13679#(and (= 0 |main_#t~malloc2.offset|) (= 0 main_~list~0.offset) (not (= |main_#t~malloc2.base| main_~list~0.base)))} is VALID [2020-07-10 19:04:35,681 INFO L280 TraceCheckUtils]: 16: Hoare triple {13679#(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, 4 + ~list~0.offset, 4); srcloc: L993-11 {13680#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} is VALID [2020-07-10 19:04:35,682 INFO L280 TraceCheckUtils]: 17: Hoare triple {13680#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-12 {13681#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem3.base|) (not (= |main_#t~mem3.base| main_~list~0.base)))} is VALID [2020-07-10 19:04:35,683 INFO L280 TraceCheckUtils]: 18: Hoare triple {13681#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem3.base|) (not (= |main_#t~mem3.base| main_~list~0.base)))} SUMMARY for call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4); srcloc: L993-13 {13680#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} is VALID [2020-07-10 19:04:35,684 INFO L280 TraceCheckUtils]: 19: Hoare triple {13680#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} havoc #t~mem3.base, #t~mem3.offset; {13680#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} is VALID [2020-07-10 19:04:35,686 INFO L280 TraceCheckUtils]: 20: Hoare triple {13680#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-15 {13682#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (not (= |main_#t~mem4.base| main_~list~0.base)) (= 0 |main_#t~mem4.offset|) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem4.base|))} is VALID [2020-07-10 19:04:35,687 INFO L280 TraceCheckUtils]: 21: Hoare triple {13682#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (not (= |main_#t~mem4.base| main_~list~0.base)) (= 0 |main_#t~mem4.offset|) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem4.base|))} SUMMARY for call write~$Pointer$(0, 0, #t~mem4.base, 4 + #t~mem4.offset, 4); srcloc: L993-16 {13683#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:35,688 INFO L280 TraceCheckUtils]: 22: Hoare triple {13683#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} havoc #t~mem4.base, #t~mem4.offset; {13683#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:35,689 INFO L280 TraceCheckUtils]: 23: Hoare triple {13683#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {13683#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:35,690 INFO L280 TraceCheckUtils]: 24: Hoare triple {13683#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {13683#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:35,691 INFO L280 TraceCheckUtils]: 25: Hoare triple {13683#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} assume #t~short7; {13683#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:35,692 INFO L280 TraceCheckUtils]: 26: Hoare triple {13683#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} assume !!#t~short7; {13683#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:35,693 INFO L280 TraceCheckUtils]: 27: Hoare triple {13683#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} havoc #t~mem5.base, #t~mem5.offset; {13683#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:35,693 INFO L280 TraceCheckUtils]: 28: Hoare triple {13683#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} havoc #t~mem6.base, #t~mem6.offset; {13683#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:35,694 INFO L280 TraceCheckUtils]: 29: Hoare triple {13683#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} havoc #t~short7; {13683#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:35,695 INFO L280 TraceCheckUtils]: 30: Hoare triple {13683#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} goto; {13683#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:35,696 INFO L280 TraceCheckUtils]: 31: Hoare triple {13683#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {13683#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:35,697 INFO L280 TraceCheckUtils]: 32: Hoare triple {13683#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {13683#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:35,698 INFO L280 TraceCheckUtils]: 33: Hoare triple {13683#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} assume !(0 != #t~nondet8); {13683#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:35,699 INFO L280 TraceCheckUtils]: 34: Hoare triple {13683#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} havoc #t~nondet8; {13683#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:35,699 INFO L280 TraceCheckUtils]: 35: Hoare triple {13683#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := 0, 0; {13683#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:35,700 INFO L280 TraceCheckUtils]: 36: Hoare triple {13683#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {13684#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4) 0))} is VALID [2020-07-10 19:04:35,701 INFO L280 TraceCheckUtils]: 37: Hoare triple {13684#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4) 0))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {13684#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4) 0))} is VALID [2020-07-10 19:04:35,702 INFO L280 TraceCheckUtils]: 38: Hoare triple {13684#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4) 0))} goto; {13684#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4) 0))} is VALID [2020-07-10 19:04:35,703 INFO L280 TraceCheckUtils]: 39: Hoare triple {13684#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4) 0))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {13684#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4) 0))} is VALID [2020-07-10 19:04:35,704 INFO L280 TraceCheckUtils]: 40: Hoare triple {13684#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4) 0))} ~len~0 := 0; {13684#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4) 0))} is VALID [2020-07-10 19:04:35,704 INFO L280 TraceCheckUtils]: 41: Hoare triple {13684#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4) 0))} SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 {13685#(and (= 0 |main_#t~mem18.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) 4)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) 4)))} is VALID [2020-07-10 19:04:35,705 INFO L280 TraceCheckUtils]: 42: Hoare triple {13685#(and (= 0 |main_#t~mem18.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) 4)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) 4)))} ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; {13686#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} is VALID [2020-07-10 19:04:35,706 INFO L280 TraceCheckUtils]: 43: Hoare triple {13686#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} havoc #t~mem18.base, #t~mem18.offset; {13686#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} is VALID [2020-07-10 19:04:35,707 INFO L280 TraceCheckUtils]: 44: Hoare triple {13686#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {13686#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} is VALID [2020-07-10 19:04:35,707 INFO L280 TraceCheckUtils]: 45: Hoare triple {13686#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} assume 0 == ~len~0; {13686#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} is VALID [2020-07-10 19:04:35,708 INFO L280 TraceCheckUtils]: 46: Hoare triple {13686#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} ~len~0 := 1; {13686#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} is VALID [2020-07-10 19:04:35,709 INFO L280 TraceCheckUtils]: 47: Hoare triple {13686#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {13686#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} is VALID [2020-07-10 19:04:35,709 INFO L280 TraceCheckUtils]: 48: Hoare triple {13686#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} goto; {13686#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} is VALID [2020-07-10 19:04:35,710 INFO L280 TraceCheckUtils]: 49: Hoare triple {13686#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} SUMMARY for call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); srcloc: L1025-6 {13687#(and (= 0 |main_#t~mem19.offset|) (= 0 |main_#t~mem19.base|))} is VALID [2020-07-10 19:04:35,711 INFO L280 TraceCheckUtils]: 50: Hoare triple {13687#(and (= 0 |main_#t~mem19.offset|) (= 0 |main_#t~mem19.base|))} assume !(0 == #t~mem19.base && 0 == #t~mem19.offset); {13671#false} is VALID [2020-07-10 19:04:35,711 INFO L280 TraceCheckUtils]: 51: Hoare triple {13671#false} havoc #t~mem19.base, #t~mem19.offset; {13671#false} is VALID [2020-07-10 19:04:35,711 INFO L280 TraceCheckUtils]: 52: Hoare triple {13671#false} assume !false; {13671#false} is VALID [2020-07-10 19:04:35,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:04:35,725 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:35,725 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [485339984] [2020-07-10 19:04:35,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:04:35,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-10 19:04:35,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903376371] [2020-07-10 19:04:35,726 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 53 [2020-07-10 19:04:35,727 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:04:35,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-10 19:04:35,799 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:35,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-10 19:04:35,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:04:35,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-10 19:04:35,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2020-07-10 19:04:35,800 INFO L87 Difference]: Start difference. First operand 206 states and 222 transitions. Second operand 14 states. [2020-07-10 19:04:45,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:45,763 INFO L93 Difference]: Finished difference Result 636 states and 681 transitions. [2020-07-10 19:04:45,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-07-10 19:04:45,763 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 53 [2020-07-10 19:04:45,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:04:45,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 19:04:45,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 556 transitions. [2020-07-10 19:04:45,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 19:04:45,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 556 transitions. [2020-07-10 19:04:45,770 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 556 transitions. [2020-07-10 19:04:46,691 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 556 edges. 556 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:46,712 INFO L225 Difference]: With dead ends: 636 [2020-07-10 19:04:46,712 INFO L226 Difference]: Without dead ends: 633 [2020-07-10 19:04:46,713 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=252, Invalid=804, Unknown=0, NotChecked=0, Total=1056 [2020-07-10 19:04:46,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2020-07-10 19:04:48,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 225. [2020-07-10 19:04:48,116 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:04:48,116 INFO L82 GeneralOperation]: Start isEquivalent. First operand 633 states. Second operand 225 states. [2020-07-10 19:04:48,117 INFO L74 IsIncluded]: Start isIncluded. First operand 633 states. Second operand 225 states. [2020-07-10 19:04:48,117 INFO L87 Difference]: Start difference. First operand 633 states. Second operand 225 states. [2020-07-10 19:04:48,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:48,138 INFO L93 Difference]: Finished difference Result 633 states and 678 transitions. [2020-07-10 19:04:48,138 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 678 transitions. [2020-07-10 19:04:48,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:48,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:48,140 INFO L74 IsIncluded]: Start isIncluded. First operand 225 states. Second operand 633 states. [2020-07-10 19:04:48,140 INFO L87 Difference]: Start difference. First operand 225 states. Second operand 633 states. [2020-07-10 19:04:48,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:48,159 INFO L93 Difference]: Finished difference Result 633 states and 678 transitions. [2020-07-10 19:04:48,159 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 678 transitions. [2020-07-10 19:04:48,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:48,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:48,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:04:48,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:04:48,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2020-07-10 19:04:48,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 243 transitions. [2020-07-10 19:04:48,163 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 243 transitions. Word has length 53 [2020-07-10 19:04:48,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:04:48,164 INFO L479 AbstractCegarLoop]: Abstraction has 225 states and 243 transitions. [2020-07-10 19:04:48,164 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-10 19:04:48,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 225 states and 243 transitions. [2020-07-10 19:04:48,863 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:48,863 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 243 transitions. [2020-07-10 19:04:48,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-07-10 19:04:48,864 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:48,864 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] [2020-07-10 19:04:48,865 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-10 19:04:48,865 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-10 19:04:48,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:48,865 INFO L82 PathProgramCache]: Analyzing trace with hash 991929043, now seen corresponding path program 1 times [2020-07-10 19:04:48,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:48,866 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1953615674] [2020-07-10 19:04:48,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:48,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:49,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:49,082 INFO L280 TraceCheckUtils]: 0: Hoare triple {16729#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {16717#true} is VALID [2020-07-10 19:04:49,082 INFO L280 TraceCheckUtils]: 1: Hoare triple {16717#true} #valid := #valid[0 := 0]; {16717#true} is VALID [2020-07-10 19:04:49,082 INFO L280 TraceCheckUtils]: 2: Hoare triple {16717#true} assume 0 < #StackHeapBarrier; {16717#true} is VALID [2020-07-10 19:04:49,083 INFO L280 TraceCheckUtils]: 3: Hoare triple {16717#true} assume true; {16717#true} is VALID [2020-07-10 19:04:49,083 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {16717#true} {16717#true} #419#return; {16717#true} is VALID [2020-07-10 19:04:49,084 INFO L263 TraceCheckUtils]: 0: Hoare triple {16717#true} call ULTIMATE.init(); {16729#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:04:49,084 INFO L280 TraceCheckUtils]: 1: Hoare triple {16729#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {16717#true} is VALID [2020-07-10 19:04:49,084 INFO L280 TraceCheckUtils]: 2: Hoare triple {16717#true} #valid := #valid[0 := 0]; {16717#true} is VALID [2020-07-10 19:04:49,084 INFO L280 TraceCheckUtils]: 3: Hoare triple {16717#true} assume 0 < #StackHeapBarrier; {16717#true} is VALID [2020-07-10 19:04:49,084 INFO L280 TraceCheckUtils]: 4: Hoare triple {16717#true} assume true; {16717#true} is VALID [2020-07-10 19:04:49,085 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {16717#true} {16717#true} #419#return; {16717#true} is VALID [2020-07-10 19:04:49,085 INFO L263 TraceCheckUtils]: 6: Hoare triple {16717#true} call #t~ret28 := main(); {16717#true} is VALID [2020-07-10 19:04:49,085 INFO L280 TraceCheckUtils]: 7: Hoare triple {16717#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {16717#true} is VALID [2020-07-10 19:04:49,085 INFO L280 TraceCheckUtils]: 8: Hoare triple {16717#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {16717#true} is VALID [2020-07-10 19:04:49,086 INFO L280 TraceCheckUtils]: 9: Hoare triple {16717#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {16717#true} is VALID [2020-07-10 19:04:49,086 INFO L280 TraceCheckUtils]: 10: Hoare triple {16717#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {16717#true} is VALID [2020-07-10 19:04:49,086 INFO L280 TraceCheckUtils]: 11: Hoare triple {16717#true} goto; {16717#true} is VALID [2020-07-10 19:04:49,086 INFO L280 TraceCheckUtils]: 12: Hoare triple {16717#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {16717#true} is VALID [2020-07-10 19:04:49,086 INFO L280 TraceCheckUtils]: 13: Hoare triple {16717#true} assume 0 != #t~nondet1; {16717#true} is VALID [2020-07-10 19:04:49,087 INFO L280 TraceCheckUtils]: 14: Hoare triple {16717#true} havoc #t~nondet1; {16717#true} is VALID [2020-07-10 19:04:49,087 INFO L280 TraceCheckUtils]: 15: Hoare triple {16717#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {16717#true} is VALID [2020-07-10 19:04:49,088 INFO L280 TraceCheckUtils]: 16: Hoare triple {16717#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {16724#(and (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem5.base|))} is VALID [2020-07-10 19:04:49,089 INFO L280 TraceCheckUtils]: 17: Hoare triple {16724#(and (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem5.base|))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {16725#(or |main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))))} is VALID [2020-07-10 19:04:49,089 INFO L280 TraceCheckUtils]: 18: Hoare triple {16725#(or |main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))))} assume !#t~short7; {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:49,090 INFO L280 TraceCheckUtils]: 19: Hoare triple {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-22 {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:49,091 INFO L280 TraceCheckUtils]: 20: Hoare triple {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:49,096 INFO L280 TraceCheckUtils]: 21: Hoare triple {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !!#t~short7; {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:49,097 INFO L280 TraceCheckUtils]: 22: Hoare triple {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~mem5.base, #t~mem5.offset; {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:49,098 INFO L280 TraceCheckUtils]: 23: Hoare triple {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~mem6.base, #t~mem6.offset; {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:49,098 INFO L280 TraceCheckUtils]: 24: Hoare triple {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~short7; {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:49,099 INFO L280 TraceCheckUtils]: 25: Hoare triple {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} goto; {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:49,100 INFO L280 TraceCheckUtils]: 26: Hoare triple {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:49,100 INFO L280 TraceCheckUtils]: 27: Hoare triple {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:49,101 INFO L280 TraceCheckUtils]: 28: Hoare triple {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !(0 != #t~nondet8); {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:49,102 INFO L280 TraceCheckUtils]: 29: Hoare triple {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~nondet8; {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:49,103 INFO L280 TraceCheckUtils]: 30: Hoare triple {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := 0, 0; {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:49,103 INFO L280 TraceCheckUtils]: 31: Hoare triple {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:49,104 INFO L280 TraceCheckUtils]: 32: Hoare triple {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:49,105 INFO L280 TraceCheckUtils]: 33: Hoare triple {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} goto; {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:49,105 INFO L280 TraceCheckUtils]: 34: Hoare triple {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:49,106 INFO L280 TraceCheckUtils]: 35: Hoare triple {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~len~0 := 0; {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:49,107 INFO L280 TraceCheckUtils]: 36: Hoare triple {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:49,108 INFO L280 TraceCheckUtils]: 37: Hoare triple {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:49,109 INFO L280 TraceCheckUtils]: 38: Hoare triple {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~mem18.base, #t~mem18.offset; {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:49,109 INFO L280 TraceCheckUtils]: 39: Hoare triple {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:49,110 INFO L280 TraceCheckUtils]: 40: Hoare triple {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !!(~len~0 <= 1); {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:49,111 INFO L280 TraceCheckUtils]: 41: Hoare triple {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} goto; {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:49,112 INFO L280 TraceCheckUtils]: 42: Hoare triple {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1031-4 {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:49,113 INFO L280 TraceCheckUtils]: 43: Hoare triple {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := #t~mem23.base, #t~mem23.offset; {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:49,114 INFO L280 TraceCheckUtils]: 44: Hoare triple {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~mem23.base, #t~mem23.offset; {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:49,114 INFO L280 TraceCheckUtils]: 45: Hoare triple {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:49,115 INFO L280 TraceCheckUtils]: 46: Hoare triple {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !!(0 != ~list~0.base || 0 != ~list~0.offset); {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:04:49,131 INFO L280 TraceCheckUtils]: 47: Hoare triple {16726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L1039 {16727#(and (= 0 |main_#t~mem24.offset|) (= 0 |main_#t~mem24.base|))} is VALID [2020-07-10 19:04:49,133 INFO L280 TraceCheckUtils]: 48: Hoare triple {16727#(and (= 0 |main_#t~mem24.offset|) (= 0 |main_#t~mem24.base|))} ~end~0.base, ~end~0.offset := #t~mem24.base, #t~mem24.offset; {16728#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} is VALID [2020-07-10 19:04:49,133 INFO L280 TraceCheckUtils]: 49: Hoare triple {16728#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} havoc #t~mem24.base, #t~mem24.offset; {16728#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} is VALID [2020-07-10 19:04:49,134 INFO L280 TraceCheckUtils]: 50: Hoare triple {16728#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} assume 0 != ~end~0.base || 0 != ~end~0.offset; {16718#false} is VALID [2020-07-10 19:04:49,134 INFO L280 TraceCheckUtils]: 51: Hoare triple {16718#false} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {16718#false} is VALID [2020-07-10 19:04:49,134 INFO L280 TraceCheckUtils]: 52: Hoare triple {16718#false} assume !false; {16718#false} is VALID [2020-07-10 19:04:49,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:04:49,144 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:49,145 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1953615674] [2020-07-10 19:04:49,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:04:49,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-10 19:04:49,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74399468] [2020-07-10 19:04:49,145 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2020-07-10 19:04:49,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:04:49,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 19:04:49,205 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:49,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 19:04:49,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:04:49,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 19:04:49,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-10 19:04:49,206 INFO L87 Difference]: Start difference. First operand 225 states and 243 transitions. Second operand 8 states. [2020-07-10 19:04:52,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:52,548 INFO L93 Difference]: Finished difference Result 321 states and 346 transitions. [2020-07-10 19:04:52,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-10 19:04:52,548 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2020-07-10 19:04:52,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:04:52,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 19:04:52,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 269 transitions. [2020-07-10 19:04:52,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 19:04:52,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 269 transitions. [2020-07-10 19:04:52,557 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 269 transitions. [2020-07-10 19:04:52,819 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-10 19:04:52,825 INFO L225 Difference]: With dead ends: 321 [2020-07-10 19:04:52,825 INFO L226 Difference]: Without dead ends: 291 [2020-07-10 19:04:52,826 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-10 19:04:52,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-07-10 19:04:54,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 275. [2020-07-10 19:04:54,617 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:04:54,617 INFO L82 GeneralOperation]: Start isEquivalent. First operand 291 states. Second operand 275 states. [2020-07-10 19:04:54,617 INFO L74 IsIncluded]: Start isIncluded. First operand 291 states. Second operand 275 states. [2020-07-10 19:04:54,618 INFO L87 Difference]: Start difference. First operand 291 states. Second operand 275 states. [2020-07-10 19:04:54,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:54,624 INFO L93 Difference]: Finished difference Result 291 states and 314 transitions. [2020-07-10 19:04:54,624 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 314 transitions. [2020-07-10 19:04:54,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:54,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:54,625 INFO L74 IsIncluded]: Start isIncluded. First operand 275 states. Second operand 291 states. [2020-07-10 19:04:54,625 INFO L87 Difference]: Start difference. First operand 275 states. Second operand 291 states. [2020-07-10 19:04:54,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:54,632 INFO L93 Difference]: Finished difference Result 291 states and 314 transitions. [2020-07-10 19:04:54,632 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 314 transitions. [2020-07-10 19:04:54,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:04:54,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:04:54,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:04:54,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:04:54,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2020-07-10 19:04:54,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 301 transitions. [2020-07-10 19:04:54,639 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 301 transitions. Word has length 53 [2020-07-10 19:04:54,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:04:54,639 INFO L479 AbstractCegarLoop]: Abstraction has 275 states and 301 transitions. [2020-07-10 19:04:54,639 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 19:04:54,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 275 states and 301 transitions. [2020-07-10 19:04:55,595 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 301 edges. 301 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:55,595 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 301 transitions. [2020-07-10 19:04:55,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-10 19:04:55,596 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:04:55,596 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-10 19:04:55,596 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-10 19:04:55,597 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-10 19:04:55,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:04:55,597 INFO L82 PathProgramCache]: Analyzing trace with hash -604385608, now seen corresponding path program 1 times [2020-07-10 19:04:55,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:04:55,597 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1494030186] [2020-07-10 19:04:55,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:04:55,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:55,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:04:55,734 INFO L280 TraceCheckUtils]: 0: Hoare triple {18526#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {18514#true} is VALID [2020-07-10 19:04:55,734 INFO L280 TraceCheckUtils]: 1: Hoare triple {18514#true} #valid := #valid[0 := 0]; {18514#true} is VALID [2020-07-10 19:04:55,735 INFO L280 TraceCheckUtils]: 2: Hoare triple {18514#true} assume 0 < #StackHeapBarrier; {18514#true} is VALID [2020-07-10 19:04:55,735 INFO L280 TraceCheckUtils]: 3: Hoare triple {18514#true} assume true; {18514#true} is VALID [2020-07-10 19:04:55,735 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {18514#true} {18514#true} #419#return; {18514#true} is VALID [2020-07-10 19:04:55,736 INFO L263 TraceCheckUtils]: 0: Hoare triple {18514#true} call ULTIMATE.init(); {18526#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:04:55,736 INFO L280 TraceCheckUtils]: 1: Hoare triple {18526#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {18514#true} is VALID [2020-07-10 19:04:55,736 INFO L280 TraceCheckUtils]: 2: Hoare triple {18514#true} #valid := #valid[0 := 0]; {18514#true} is VALID [2020-07-10 19:04:55,737 INFO L280 TraceCheckUtils]: 3: Hoare triple {18514#true} assume 0 < #StackHeapBarrier; {18514#true} is VALID [2020-07-10 19:04:55,737 INFO L280 TraceCheckUtils]: 4: Hoare triple {18514#true} assume true; {18514#true} is VALID [2020-07-10 19:04:55,737 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {18514#true} {18514#true} #419#return; {18514#true} is VALID [2020-07-10 19:04:55,737 INFO L263 TraceCheckUtils]: 6: Hoare triple {18514#true} call #t~ret28 := main(); {18514#true} is VALID [2020-07-10 19:04:55,737 INFO L280 TraceCheckUtils]: 7: Hoare triple {18514#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {18514#true} is VALID [2020-07-10 19:04:55,737 INFO L280 TraceCheckUtils]: 8: Hoare triple {18514#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {18514#true} is VALID [2020-07-10 19:04:55,737 INFO L280 TraceCheckUtils]: 9: Hoare triple {18514#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {18514#true} is VALID [2020-07-10 19:04:55,738 INFO L280 TraceCheckUtils]: 10: Hoare triple {18514#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {18514#true} is VALID [2020-07-10 19:04:55,738 INFO L280 TraceCheckUtils]: 11: Hoare triple {18514#true} goto; {18514#true} is VALID [2020-07-10 19:04:55,738 INFO L280 TraceCheckUtils]: 12: Hoare triple {18514#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {18514#true} is VALID [2020-07-10 19:04:55,738 INFO L280 TraceCheckUtils]: 13: Hoare triple {18514#true} assume 0 != #t~nondet1; {18514#true} is VALID [2020-07-10 19:04:55,738 INFO L280 TraceCheckUtils]: 14: Hoare triple {18514#true} havoc #t~nondet1; {18514#true} is VALID [2020-07-10 19:04:55,738 INFO L280 TraceCheckUtils]: 15: Hoare triple {18514#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {18514#true} is VALID [2020-07-10 19:04:55,738 INFO L280 TraceCheckUtils]: 16: Hoare triple {18514#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {18514#true} is VALID [2020-07-10 19:04:55,738 INFO L280 TraceCheckUtils]: 17: Hoare triple {18514#true} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {18514#true} is VALID [2020-07-10 19:04:55,739 INFO L280 TraceCheckUtils]: 18: Hoare triple {18514#true} assume !#t~short7; {18514#true} is VALID [2020-07-10 19:04:55,739 INFO L280 TraceCheckUtils]: 19: Hoare triple {18514#true} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-22 {18514#true} is VALID [2020-07-10 19:04:55,739 INFO L280 TraceCheckUtils]: 20: Hoare triple {18514#true} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {18514#true} is VALID [2020-07-10 19:04:55,739 INFO L280 TraceCheckUtils]: 21: Hoare triple {18514#true} assume !!#t~short7; {18514#true} is VALID [2020-07-10 19:04:55,739 INFO L280 TraceCheckUtils]: 22: Hoare triple {18514#true} havoc #t~mem5.base, #t~mem5.offset; {18514#true} is VALID [2020-07-10 19:04:55,739 INFO L280 TraceCheckUtils]: 23: Hoare triple {18514#true} havoc #t~mem6.base, #t~mem6.offset; {18514#true} is VALID [2020-07-10 19:04:55,739 INFO L280 TraceCheckUtils]: 24: Hoare triple {18514#true} havoc #t~short7; {18514#true} is VALID [2020-07-10 19:04:55,739 INFO L280 TraceCheckUtils]: 25: Hoare triple {18514#true} goto; {18514#true} is VALID [2020-07-10 19:04:55,740 INFO L280 TraceCheckUtils]: 26: Hoare triple {18514#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {18514#true} is VALID [2020-07-10 19:04:55,740 INFO L280 TraceCheckUtils]: 27: Hoare triple {18514#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {18514#true} is VALID [2020-07-10 19:04:55,740 INFO L280 TraceCheckUtils]: 28: Hoare triple {18514#true} assume !!(0 != #t~nondet8); {18514#true} is VALID [2020-07-10 19:04:55,740 INFO L280 TraceCheckUtils]: 29: Hoare triple {18514#true} havoc #t~nondet8; {18514#true} is VALID [2020-07-10 19:04:55,740 INFO L280 TraceCheckUtils]: 30: Hoare triple {18514#true} SUMMARY for call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(8); srcloc: L1001 {18514#true} is VALID [2020-07-10 19:04:55,740 INFO L280 TraceCheckUtils]: 31: Hoare triple {18514#true} SUMMARY for call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~end~0.base, ~end~0.offset, 4); srcloc: L1001-1 {18514#true} is VALID [2020-07-10 19:04:55,740 INFO L280 TraceCheckUtils]: 32: Hoare triple {18514#true} SUMMARY for call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1001-2 {18514#true} is VALID [2020-07-10 19:04:55,741 INFO L280 TraceCheckUtils]: 33: Hoare triple {18514#true} ~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset; {18514#true} is VALID [2020-07-10 19:04:55,741 INFO L280 TraceCheckUtils]: 34: Hoare triple {18514#true} havoc #t~mem10.base, #t~mem10.offset; {18514#true} is VALID [2020-07-10 19:04:55,741 INFO L280 TraceCheckUtils]: 35: Hoare triple {18514#true} SUMMARY for call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); srcloc: L1003 {18514#true} is VALID [2020-07-10 19:04:55,741 INFO L280 TraceCheckUtils]: 36: Hoare triple {18514#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {18514#true} is VALID [2020-07-10 19:04:55,741 INFO L280 TraceCheckUtils]: 37: Hoare triple {18514#true} goto; {18514#true} is VALID [2020-07-10 19:04:55,741 INFO L280 TraceCheckUtils]: 38: Hoare triple {18514#true} assume !!(~end~0.base != 0 || ~end~0.offset != 0); {18514#true} is VALID [2020-07-10 19:04:55,741 INFO L280 TraceCheckUtils]: 39: Hoare triple {18514#true} goto; {18514#true} is VALID [2020-07-10 19:04:55,741 INFO L280 TraceCheckUtils]: 40: Hoare triple {18514#true} assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; {18514#true} is VALID [2020-07-10 19:04:55,742 INFO L280 TraceCheckUtils]: 41: Hoare triple {18514#true} assume 0 != #t~nondet11; {18514#true} is VALID [2020-07-10 19:04:55,742 INFO L280 TraceCheckUtils]: 42: Hoare triple {18514#true} havoc #t~nondet11; {18514#true} is VALID [2020-07-10 19:04:55,742 INFO L280 TraceCheckUtils]: 43: Hoare triple {18514#true} SUMMARY for call write~$Pointer$(0, 0, ~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1005-7 {18514#true} is VALID [2020-07-10 19:04:55,742 INFO L280 TraceCheckUtils]: 44: Hoare triple {18514#true} SUMMARY for call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1005-34 {18521#(and (= |main_#t~mem15.offset| (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)) |main_#t~mem15.base|))} is VALID [2020-07-10 19:04:55,743 INFO L280 TraceCheckUtils]: 45: Hoare triple {18521#(and (= |main_#t~mem15.offset| (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)) |main_#t~mem15.base|))} #t~short17 := #t~mem15.base != 0 || #t~mem15.offset != 0; {18522#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)))) |main_#t~short17|)} is VALID [2020-07-10 19:04:55,744 INFO L280 TraceCheckUtils]: 46: Hoare triple {18522#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)))) |main_#t~short17|)} assume !#t~short17; {18523#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} is VALID [2020-07-10 19:04:55,744 INFO L280 TraceCheckUtils]: 47: Hoare triple {18523#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} SUMMARY for call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1005-22 {18524#(and (= 0 |main_#t~mem16.offset|) (= 0 |main_#t~mem16.base|))} is VALID [2020-07-10 19:04:55,745 INFO L280 TraceCheckUtils]: 48: Hoare triple {18524#(and (= 0 |main_#t~mem16.offset|) (= 0 |main_#t~mem16.base|))} #t~short17 := #t~mem16.base == 0 && #t~mem16.offset == 0; {18525#|main_#t~short17|} is VALID [2020-07-10 19:04:55,750 INFO L280 TraceCheckUtils]: 49: Hoare triple {18525#|main_#t~short17|} assume !#t~short17; {18515#false} is VALID [2020-07-10 19:04:55,750 INFO L280 TraceCheckUtils]: 50: Hoare triple {18515#false} havoc #t~short17; {18515#false} is VALID [2020-07-10 19:04:55,751 INFO L280 TraceCheckUtils]: 51: Hoare triple {18515#false} havoc #t~mem15.base, #t~mem15.offset; {18515#false} is VALID [2020-07-10 19:04:55,751 INFO L280 TraceCheckUtils]: 52: Hoare triple {18515#false} havoc #t~mem16.base, #t~mem16.offset; {18515#false} is VALID [2020-07-10 19:04:55,751 INFO L280 TraceCheckUtils]: 53: Hoare triple {18515#false} assume !false; {18515#false} is VALID [2020-07-10 19:04:55,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:04:55,753 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:04:55,754 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1494030186] [2020-07-10 19:04:55,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:04:55,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-10 19:04:55,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034165043] [2020-07-10 19:04:55,754 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2020-07-10 19:04:55,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:04:55,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 19:04:55,812 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-10 19:04:55,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 19:04:55,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:04:55,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 19:04:55,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-10 19:04:55,813 INFO L87 Difference]: Start difference. First operand 275 states and 301 transitions. Second operand 8 states. [2020-07-10 19:04:58,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:04:58,898 INFO L93 Difference]: Finished difference Result 298 states and 326 transitions. [2020-07-10 19:04:58,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-10 19:04:58,899 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2020-07-10 19:04:58,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:04:58,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 19:04:58,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 184 transitions. [2020-07-10 19:04:58,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 19:04:58,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 184 transitions. [2020-07-10 19:04:58,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 184 transitions. [2020-07-10 19:04:59,105 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:04:59,110 INFO L225 Difference]: With dead ends: 298 [2020-07-10 19:04:59,110 INFO L226 Difference]: Without dead ends: 293 [2020-07-10 19:04:59,111 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-10 19:04:59,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2020-07-10 19:05:00,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 268. [2020-07-10 19:05:00,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:05:00,910 INFO L82 GeneralOperation]: Start isEquivalent. First operand 293 states. Second operand 268 states. [2020-07-10 19:05:00,910 INFO L74 IsIncluded]: Start isIncluded. First operand 293 states. Second operand 268 states. [2020-07-10 19:05:00,911 INFO L87 Difference]: Start difference. First operand 293 states. Second operand 268 states. [2020-07-10 19:05:00,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:05:00,916 INFO L93 Difference]: Finished difference Result 293 states and 320 transitions. [2020-07-10 19:05:00,916 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 320 transitions. [2020-07-10 19:05:00,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:05:00,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:05:00,917 INFO L74 IsIncluded]: Start isIncluded. First operand 268 states. Second operand 293 states. [2020-07-10 19:05:00,917 INFO L87 Difference]: Start difference. First operand 268 states. Second operand 293 states. [2020-07-10 19:05:00,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:05:00,923 INFO L93 Difference]: Finished difference Result 293 states and 320 transitions. [2020-07-10 19:05:00,924 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 320 transitions. [2020-07-10 19:05:00,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:05:00,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:05:00,924 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:05:00,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:05:00,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2020-07-10 19:05:00,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 293 transitions. [2020-07-10 19:05:00,930 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 293 transitions. Word has length 54 [2020-07-10 19:05:00,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:05:00,930 INFO L479 AbstractCegarLoop]: Abstraction has 268 states and 293 transitions. [2020-07-10 19:05:00,930 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 19:05:00,931 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 268 states and 293 transitions. [2020-07-10 19:05:01,891 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 293 edges. 293 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:05:01,891 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 293 transitions. [2020-07-10 19:05:01,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-07-10 19:05:01,893 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:05:01,893 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] [2020-07-10 19:05:01,893 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-10 19:05:01,893 INFO L427 AbstractCegarLoop]: === Iteration 14 === [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-10 19:05:01,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:05:01,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1636675303, now seen corresponding path program 1 times [2020-07-10 19:05:01,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:05:01,895 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1778925708] [2020-07-10 19:05:01,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:05:01,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:05:02,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:05:02,318 INFO L280 TraceCheckUtils]: 0: Hoare triple {20280#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {20261#true} is VALID [2020-07-10 19:05:02,318 INFO L280 TraceCheckUtils]: 1: Hoare triple {20261#true} #valid := #valid[0 := 0]; {20261#true} is VALID [2020-07-10 19:05:02,318 INFO L280 TraceCheckUtils]: 2: Hoare triple {20261#true} assume 0 < #StackHeapBarrier; {20261#true} is VALID [2020-07-10 19:05:02,318 INFO L280 TraceCheckUtils]: 3: Hoare triple {20261#true} assume true; {20261#true} is VALID [2020-07-10 19:05:02,319 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {20261#true} {20261#true} #419#return; {20261#true} is VALID [2020-07-10 19:05:02,319 INFO L263 TraceCheckUtils]: 0: Hoare triple {20261#true} call ULTIMATE.init(); {20280#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:05:02,319 INFO L280 TraceCheckUtils]: 1: Hoare triple {20280#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {20261#true} is VALID [2020-07-10 19:05:02,319 INFO L280 TraceCheckUtils]: 2: Hoare triple {20261#true} #valid := #valid[0 := 0]; {20261#true} is VALID [2020-07-10 19:05:02,320 INFO L280 TraceCheckUtils]: 3: Hoare triple {20261#true} assume 0 < #StackHeapBarrier; {20261#true} is VALID [2020-07-10 19:05:02,320 INFO L280 TraceCheckUtils]: 4: Hoare triple {20261#true} assume true; {20261#true} is VALID [2020-07-10 19:05:02,320 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {20261#true} {20261#true} #419#return; {20261#true} is VALID [2020-07-10 19:05:02,320 INFO L263 TraceCheckUtils]: 6: Hoare triple {20261#true} call #t~ret28 := main(); {20261#true} is VALID [2020-07-10 19:05:02,322 INFO L280 TraceCheckUtils]: 7: Hoare triple {20261#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {20268#(= 1 (select |#valid| |main_#t~malloc0.base|))} is VALID [2020-07-10 19:05:02,323 INFO L280 TraceCheckUtils]: 8: Hoare triple {20268#(= 1 (select |#valid| |main_#t~malloc0.base|))} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {20269#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-10 19:05:02,323 INFO L280 TraceCheckUtils]: 9: Hoare triple {20269#(= 1 (select |#valid| main_~list~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {20269#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-10 19:05:02,323 INFO L280 TraceCheckUtils]: 10: Hoare triple {20269#(= 1 (select |#valid| main_~list~0.base))} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {20269#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-10 19:05:02,324 INFO L280 TraceCheckUtils]: 11: Hoare triple {20269#(= 1 (select |#valid| main_~list~0.base))} goto; {20269#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-10 19:05:02,324 INFO L280 TraceCheckUtils]: 12: Hoare triple {20269#(= 1 (select |#valid| main_~list~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {20269#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-10 19:05:02,324 INFO L280 TraceCheckUtils]: 13: Hoare triple {20269#(= 1 (select |#valid| main_~list~0.base))} assume !(0 != #t~nondet1); {20269#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-10 19:05:02,325 INFO L280 TraceCheckUtils]: 14: Hoare triple {20269#(= 1 (select |#valid| main_~list~0.base))} havoc #t~nondet1; {20269#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-10 19:05:02,325 INFO L280 TraceCheckUtils]: 15: Hoare triple {20269#(= 1 (select |#valid| main_~list~0.base))} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); srcloc: L993-10 {20270#(and (= 0 |main_#t~malloc2.offset|) (not (= |main_#t~malloc2.base| main_~list~0.base)))} is VALID [2020-07-10 19:05:02,326 INFO L280 TraceCheckUtils]: 16: Hoare triple {20270#(and (= 0 |main_#t~malloc2.offset|) (not (= |main_#t~malloc2.base| main_~list~0.base)))} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-11 {20271#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:05:02,327 INFO L280 TraceCheckUtils]: 17: Hoare triple {20271#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-12 {20272#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem3.base|) (= 0 |main_#t~mem3.offset|) (not (= |main_#t~mem3.base| main_~list~0.base)))} is VALID [2020-07-10 19:05:02,328 INFO L280 TraceCheckUtils]: 18: Hoare triple {20272#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem3.base|) (= 0 |main_#t~mem3.offset|) (not (= |main_#t~mem3.base| main_~list~0.base)))} SUMMARY for call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4); srcloc: L993-13 {20273#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-10 19:05:02,328 INFO L280 TraceCheckUtils]: 19: Hoare triple {20273#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} havoc #t~mem3.base, #t~mem3.offset; {20273#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-10 19:05:02,330 INFO L280 TraceCheckUtils]: 20: Hoare triple {20273#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-15 {20274#(and (= 0 (select (store (select |#memory_$Pointer$.base| |main_#t~mem4.base|) (+ |main_#t~mem4.offset| 4) 0) 0)) (= 0 (select (store (select |#memory_$Pointer$.offset| |main_#t~mem4.base|) (+ |main_#t~mem4.offset| 4) 0) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= |main_#t~mem4.base| main_~list~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem4.base|))} is VALID [2020-07-10 19:05:02,331 INFO L280 TraceCheckUtils]: 21: Hoare triple {20274#(and (= 0 (select (store (select |#memory_$Pointer$.base| |main_#t~mem4.base|) (+ |main_#t~mem4.offset| 4) 0) 0)) (= 0 (select (store (select |#memory_$Pointer$.offset| |main_#t~mem4.base|) (+ |main_#t~mem4.offset| 4) 0) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= |main_#t~mem4.base| main_~list~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem4.base|))} SUMMARY for call write~$Pointer$(0, 0, #t~mem4.base, 4 + #t~mem4.offset, 4); srcloc: L993-16 {20275#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-10 19:05:02,332 INFO L280 TraceCheckUtils]: 22: Hoare triple {20275#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} havoc #t~mem4.base, #t~mem4.offset; {20275#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-10 19:05:02,333 INFO L280 TraceCheckUtils]: 23: Hoare triple {20275#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {20275#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-10 19:05:02,333 INFO L280 TraceCheckUtils]: 24: Hoare triple {20275#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {20275#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-10 19:05:02,334 INFO L280 TraceCheckUtils]: 25: Hoare triple {20275#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} assume #t~short7; {20275#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-10 19:05:02,334 INFO L280 TraceCheckUtils]: 26: Hoare triple {20275#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} assume !!#t~short7; {20275#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-10 19:05:02,335 INFO L280 TraceCheckUtils]: 27: Hoare triple {20275#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} havoc #t~mem5.base, #t~mem5.offset; {20275#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-10 19:05:02,335 INFO L280 TraceCheckUtils]: 28: Hoare triple {20275#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} havoc #t~mem6.base, #t~mem6.offset; {20275#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-10 19:05:02,336 INFO L280 TraceCheckUtils]: 29: Hoare triple {20275#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} havoc #t~short7; {20275#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-10 19:05:02,336 INFO L280 TraceCheckUtils]: 30: Hoare triple {20275#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} goto; {20275#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-10 19:05:02,337 INFO L280 TraceCheckUtils]: 31: Hoare triple {20275#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {20275#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-10 19:05:02,338 INFO L280 TraceCheckUtils]: 32: Hoare triple {20275#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {20275#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-10 19:05:02,338 INFO L280 TraceCheckUtils]: 33: Hoare triple {20275#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} assume !(0 != #t~nondet8); {20275#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-10 19:05:02,339 INFO L280 TraceCheckUtils]: 34: Hoare triple {20275#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} havoc #t~nondet8; {20275#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-10 19:05:02,339 INFO L280 TraceCheckUtils]: 35: Hoare triple {20275#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} ~end~0.base, ~end~0.offset := 0, 0; {20275#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-10 19:05:02,340 INFO L280 TraceCheckUtils]: 36: Hoare triple {20275#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {20276#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0)))} is VALID [2020-07-10 19:05:02,341 INFO L280 TraceCheckUtils]: 37: Hoare triple {20276#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0)))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {20276#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0)))} is VALID [2020-07-10 19:05:02,341 INFO L280 TraceCheckUtils]: 38: Hoare triple {20276#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0)))} goto; {20276#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0)))} is VALID [2020-07-10 19:05:02,342 INFO L280 TraceCheckUtils]: 39: Hoare triple {20276#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0)))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {20276#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0)))} is VALID [2020-07-10 19:05:02,342 INFO L280 TraceCheckUtils]: 40: Hoare triple {20276#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0)))} ~len~0 := 0; {20276#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0)))} is VALID [2020-07-10 19:05:02,343 INFO L280 TraceCheckUtils]: 41: Hoare triple {20276#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0)))} SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 {20277#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) 0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) 0)) (= 0 |main_#t~mem18.offset|))} is VALID [2020-07-10 19:05:02,344 INFO L280 TraceCheckUtils]: 42: Hoare triple {20277#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) 0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) 0)) (= 0 |main_#t~mem18.offset|))} ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; {20278#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} is VALID [2020-07-10 19:05:02,344 INFO L280 TraceCheckUtils]: 43: Hoare triple {20278#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} havoc #t~mem18.base, #t~mem18.offset; {20278#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} is VALID [2020-07-10 19:05:02,345 INFO L280 TraceCheckUtils]: 44: Hoare triple {20278#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {20278#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} is VALID [2020-07-10 19:05:02,345 INFO L280 TraceCheckUtils]: 45: Hoare triple {20278#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} assume 0 == ~len~0; {20278#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} is VALID [2020-07-10 19:05:02,346 INFO L280 TraceCheckUtils]: 46: Hoare triple {20278#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} ~len~0 := 1; {20278#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} is VALID [2020-07-10 19:05:02,346 INFO L280 TraceCheckUtils]: 47: Hoare triple {20278#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {20278#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} is VALID [2020-07-10 19:05:02,347 INFO L280 TraceCheckUtils]: 48: Hoare triple {20278#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} goto; {20278#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} is VALID [2020-07-10 19:05:02,347 INFO L280 TraceCheckUtils]: 49: Hoare triple {20278#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} SUMMARY for call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); srcloc: L1025-6 {20278#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} is VALID [2020-07-10 19:05:02,348 INFO L280 TraceCheckUtils]: 50: Hoare triple {20278#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} assume !!(0 == #t~mem19.base && 0 == #t~mem19.offset); {20278#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} is VALID [2020-07-10 19:05:02,348 INFO L280 TraceCheckUtils]: 51: Hoare triple {20278#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} havoc #t~mem19.base, #t~mem19.offset; {20278#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} is VALID [2020-07-10 19:05:02,349 INFO L280 TraceCheckUtils]: 52: Hoare triple {20278#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} goto; {20278#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} is VALID [2020-07-10 19:05:02,350 INFO L280 TraceCheckUtils]: 53: Hoare triple {20278#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} SUMMARY for call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~inner~0.base, ~inner~0.offset, 4); srcloc: L1026-6 {20279#(and (= 0 |main_#t~mem20.base|) (= 0 |main_#t~mem20.offset|))} is VALID [2020-07-10 19:05:02,350 INFO L280 TraceCheckUtils]: 54: Hoare triple {20279#(and (= 0 |main_#t~mem20.base|) (= 0 |main_#t~mem20.offset|))} assume !(0 == #t~mem20.base && 0 == #t~mem20.offset); {20262#false} is VALID [2020-07-10 19:05:02,350 INFO L280 TraceCheckUtils]: 55: Hoare triple {20262#false} havoc #t~mem20.base, #t~mem20.offset; {20262#false} is VALID [2020-07-10 19:05:02,350 INFO L280 TraceCheckUtils]: 56: Hoare triple {20262#false} assume !false; {20262#false} is VALID [2020-07-10 19:05:02,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:05:02,362 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:05:02,362 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1778925708] [2020-07-10 19:05:02,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:05:02,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-10 19:05:02,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381020842] [2020-07-10 19:05:02,363 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2020-07-10 19:05:02,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:05:02,363 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-10 19:05:02,437 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:05:02,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-10 19:05:02,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:05:02,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-10 19:05:02,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-07-10 19:05:02,438 INFO L87 Difference]: Start difference. First operand 268 states and 293 transitions. Second operand 15 states. [2020-07-10 19:05:13,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:05:13,489 INFO L93 Difference]: Finished difference Result 722 states and 782 transitions. [2020-07-10 19:05:13,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-07-10 19:05:13,490 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2020-07-10 19:05:13,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:05:13,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 19:05:13,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 543 transitions. [2020-07-10 19:05:13,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 19:05:13,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 543 transitions. [2020-07-10 19:05:13,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 543 transitions. [2020-07-10 19:05:14,326 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 543 edges. 543 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:05:14,347 INFO L225 Difference]: With dead ends: 722 [2020-07-10 19:05:14,348 INFO L226 Difference]: Without dead ends: 719 [2020-07-10 19:05:14,348 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=272, Invalid=850, Unknown=0, NotChecked=0, Total=1122 [2020-07-10 19:05:14,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2020-07-10 19:05:16,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 272. [2020-07-10 19:05:16,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:05:16,392 INFO L82 GeneralOperation]: Start isEquivalent. First operand 719 states. Second operand 272 states. [2020-07-10 19:05:16,392 INFO L74 IsIncluded]: Start isIncluded. First operand 719 states. Second operand 272 states. [2020-07-10 19:05:16,392 INFO L87 Difference]: Start difference. First operand 719 states. Second operand 272 states. [2020-07-10 19:05:16,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:05:16,414 INFO L93 Difference]: Finished difference Result 719 states and 779 transitions. [2020-07-10 19:05:16,414 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 779 transitions. [2020-07-10 19:05:16,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:05:16,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:05:16,415 INFO L74 IsIncluded]: Start isIncluded. First operand 272 states. Second operand 719 states. [2020-07-10 19:05:16,416 INFO L87 Difference]: Start difference. First operand 272 states. Second operand 719 states. [2020-07-10 19:05:16,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:05:16,442 INFO L93 Difference]: Finished difference Result 719 states and 779 transitions. [2020-07-10 19:05:16,442 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 779 transitions. [2020-07-10 19:05:16,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:05:16,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:05:16,444 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:05:16,444 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:05:16,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2020-07-10 19:05:16,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 297 transitions. [2020-07-10 19:05:16,449 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 297 transitions. Word has length 57 [2020-07-10 19:05:16,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:05:16,450 INFO L479 AbstractCegarLoop]: Abstraction has 272 states and 297 transitions. [2020-07-10 19:05:16,450 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-10 19:05:16,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 272 states and 297 transitions. [2020-07-10 19:05:17,500 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 297 edges. 297 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:05:17,500 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 297 transitions. [2020-07-10 19:05:17,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-10 19:05:17,501 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:05:17,501 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-10 19:05:17,502 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-10 19:05:17,502 INFO L427 AbstractCegarLoop]: === Iteration 15 === [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-10 19:05:17,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:05:17,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1939208096, now seen corresponding path program 1 times [2020-07-10 19:05:17,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:05:17,502 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1939596701] [2020-07-10 19:05:17,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:05:17,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:05:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:05:17,580 INFO L280 TraceCheckUtils]: 0: Hoare triple {23755#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {23747#true} is VALID [2020-07-10 19:05:17,580 INFO L280 TraceCheckUtils]: 1: Hoare triple {23747#true} #valid := #valid[0 := 0]; {23747#true} is VALID [2020-07-10 19:05:17,580 INFO L280 TraceCheckUtils]: 2: Hoare triple {23747#true} assume 0 < #StackHeapBarrier; {23747#true} is VALID [2020-07-10 19:05:17,580 INFO L280 TraceCheckUtils]: 3: Hoare triple {23747#true} assume true; {23747#true} is VALID [2020-07-10 19:05:17,581 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {23747#true} {23747#true} #419#return; {23747#true} is VALID [2020-07-10 19:05:17,581 INFO L263 TraceCheckUtils]: 0: Hoare triple {23747#true} call ULTIMATE.init(); {23755#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:05:17,582 INFO L280 TraceCheckUtils]: 1: Hoare triple {23755#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {23747#true} is VALID [2020-07-10 19:05:17,582 INFO L280 TraceCheckUtils]: 2: Hoare triple {23747#true} #valid := #valid[0 := 0]; {23747#true} is VALID [2020-07-10 19:05:17,582 INFO L280 TraceCheckUtils]: 3: Hoare triple {23747#true} assume 0 < #StackHeapBarrier; {23747#true} is VALID [2020-07-10 19:05:17,582 INFO L280 TraceCheckUtils]: 4: Hoare triple {23747#true} assume true; {23747#true} is VALID [2020-07-10 19:05:17,582 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {23747#true} {23747#true} #419#return; {23747#true} is VALID [2020-07-10 19:05:17,582 INFO L263 TraceCheckUtils]: 6: Hoare triple {23747#true} call #t~ret28 := main(); {23747#true} is VALID [2020-07-10 19:05:17,583 INFO L280 TraceCheckUtils]: 7: Hoare triple {23747#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {23747#true} is VALID [2020-07-10 19:05:17,583 INFO L280 TraceCheckUtils]: 8: Hoare triple {23747#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {23747#true} is VALID [2020-07-10 19:05:17,583 INFO L280 TraceCheckUtils]: 9: Hoare triple {23747#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {23747#true} is VALID [2020-07-10 19:05:17,583 INFO L280 TraceCheckUtils]: 10: Hoare triple {23747#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {23747#true} is VALID [2020-07-10 19:05:17,583 INFO L280 TraceCheckUtils]: 11: Hoare triple {23747#true} goto; {23747#true} is VALID [2020-07-10 19:05:17,584 INFO L280 TraceCheckUtils]: 12: Hoare triple {23747#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {23747#true} is VALID [2020-07-10 19:05:17,584 INFO L280 TraceCheckUtils]: 13: Hoare triple {23747#true} assume !(0 != #t~nondet1); {23747#true} is VALID [2020-07-10 19:05:17,584 INFO L280 TraceCheckUtils]: 14: Hoare triple {23747#true} havoc #t~nondet1; {23747#true} is VALID [2020-07-10 19:05:17,584 INFO L280 TraceCheckUtils]: 15: Hoare triple {23747#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); srcloc: L993-10 {23747#true} is VALID [2020-07-10 19:05:17,584 INFO L280 TraceCheckUtils]: 16: Hoare triple {23747#true} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-11 {23747#true} is VALID [2020-07-10 19:05:17,585 INFO L280 TraceCheckUtils]: 17: Hoare triple {23747#true} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-12 {23747#true} is VALID [2020-07-10 19:05:17,585 INFO L280 TraceCheckUtils]: 18: Hoare triple {23747#true} SUMMARY for call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4); srcloc: L993-13 {23747#true} is VALID [2020-07-10 19:05:17,585 INFO L280 TraceCheckUtils]: 19: Hoare triple {23747#true} havoc #t~mem3.base, #t~mem3.offset; {23747#true} is VALID [2020-07-10 19:05:17,585 INFO L280 TraceCheckUtils]: 20: Hoare triple {23747#true} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-15 {23747#true} is VALID [2020-07-10 19:05:17,585 INFO L280 TraceCheckUtils]: 21: Hoare triple {23747#true} SUMMARY for call write~$Pointer$(0, 0, #t~mem4.base, 4 + #t~mem4.offset, 4); srcloc: L993-16 {23747#true} is VALID [2020-07-10 19:05:17,585 INFO L280 TraceCheckUtils]: 22: Hoare triple {23747#true} havoc #t~mem4.base, #t~mem4.offset; {23747#true} is VALID [2020-07-10 19:05:17,586 INFO L280 TraceCheckUtils]: 23: Hoare triple {23747#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {23747#true} is VALID [2020-07-10 19:05:17,586 INFO L280 TraceCheckUtils]: 24: Hoare triple {23747#true} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {23747#true} is VALID [2020-07-10 19:05:17,586 INFO L280 TraceCheckUtils]: 25: Hoare triple {23747#true} assume #t~short7; {23747#true} is VALID [2020-07-10 19:05:17,586 INFO L280 TraceCheckUtils]: 26: Hoare triple {23747#true} assume !!#t~short7; {23747#true} is VALID [2020-07-10 19:05:17,586 INFO L280 TraceCheckUtils]: 27: Hoare triple {23747#true} havoc #t~mem5.base, #t~mem5.offset; {23747#true} is VALID [2020-07-10 19:05:17,587 INFO L280 TraceCheckUtils]: 28: Hoare triple {23747#true} havoc #t~mem6.base, #t~mem6.offset; {23747#true} is VALID [2020-07-10 19:05:17,587 INFO L280 TraceCheckUtils]: 29: Hoare triple {23747#true} havoc #t~short7; {23747#true} is VALID [2020-07-10 19:05:17,587 INFO L280 TraceCheckUtils]: 30: Hoare triple {23747#true} goto; {23747#true} is VALID [2020-07-10 19:05:17,587 INFO L280 TraceCheckUtils]: 31: Hoare triple {23747#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {23747#true} is VALID [2020-07-10 19:05:17,587 INFO L280 TraceCheckUtils]: 32: Hoare triple {23747#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {23747#true} is VALID [2020-07-10 19:05:17,587 INFO L280 TraceCheckUtils]: 33: Hoare triple {23747#true} assume !(0 != #t~nondet8); {23747#true} is VALID [2020-07-10 19:05:17,588 INFO L280 TraceCheckUtils]: 34: Hoare triple {23747#true} havoc #t~nondet8; {23747#true} is VALID [2020-07-10 19:05:17,588 INFO L280 TraceCheckUtils]: 35: Hoare triple {23747#true} ~end~0.base, ~end~0.offset := 0, 0; {23747#true} is VALID [2020-07-10 19:05:17,588 INFO L280 TraceCheckUtils]: 36: Hoare triple {23747#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {23747#true} is VALID [2020-07-10 19:05:17,588 INFO L280 TraceCheckUtils]: 37: Hoare triple {23747#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {23747#true} is VALID [2020-07-10 19:05:17,588 INFO L280 TraceCheckUtils]: 38: Hoare triple {23747#true} goto; {23747#true} is VALID [2020-07-10 19:05:17,589 INFO L280 TraceCheckUtils]: 39: Hoare triple {23747#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {23747#true} is VALID [2020-07-10 19:05:17,589 INFO L280 TraceCheckUtils]: 40: Hoare triple {23747#true} ~len~0 := 0; {23747#true} is VALID [2020-07-10 19:05:17,589 INFO L280 TraceCheckUtils]: 41: Hoare triple {23747#true} SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 {23747#true} is VALID [2020-07-10 19:05:17,589 INFO L280 TraceCheckUtils]: 42: Hoare triple {23747#true} ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; {23747#true} is VALID [2020-07-10 19:05:17,589 INFO L280 TraceCheckUtils]: 43: Hoare triple {23747#true} havoc #t~mem18.base, #t~mem18.offset; {23747#true} is VALID [2020-07-10 19:05:17,589 INFO L280 TraceCheckUtils]: 44: Hoare triple {23747#true} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {23747#true} is VALID [2020-07-10 19:05:17,590 INFO L280 TraceCheckUtils]: 45: Hoare triple {23747#true} assume !!(~len~0 <= 1); {23747#true} is VALID [2020-07-10 19:05:17,590 INFO L280 TraceCheckUtils]: 46: Hoare triple {23747#true} goto; {23747#true} is VALID [2020-07-10 19:05:17,590 INFO L280 TraceCheckUtils]: 47: Hoare triple {23747#true} SUMMARY for call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1031-4 {23747#true} is VALID [2020-07-10 19:05:17,590 INFO L280 TraceCheckUtils]: 48: Hoare triple {23747#true} ~end~0.base, ~end~0.offset := #t~mem23.base, #t~mem23.offset; {23747#true} is VALID [2020-07-10 19:05:17,590 INFO L280 TraceCheckUtils]: 49: Hoare triple {23747#true} havoc #t~mem23.base, #t~mem23.offset; {23747#true} is VALID [2020-07-10 19:05:17,591 INFO L280 TraceCheckUtils]: 50: Hoare triple {23747#true} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {23747#true} is VALID [2020-07-10 19:05:17,591 INFO L280 TraceCheckUtils]: 51: Hoare triple {23747#true} assume !!(0 != ~list~0.base || 0 != ~list~0.offset); {23747#true} is VALID [2020-07-10 19:05:17,591 INFO L280 TraceCheckUtils]: 52: Hoare triple {23747#true} SUMMARY for call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L1039 {23747#true} is VALID [2020-07-10 19:05:17,591 INFO L280 TraceCheckUtils]: 53: Hoare triple {23747#true} ~end~0.base, ~end~0.offset := #t~mem24.base, #t~mem24.offset; {23747#true} is VALID [2020-07-10 19:05:17,591 INFO L280 TraceCheckUtils]: 54: Hoare triple {23747#true} havoc #t~mem24.base, #t~mem24.offset; {23747#true} is VALID [2020-07-10 19:05:17,593 INFO L280 TraceCheckUtils]: 55: Hoare triple {23747#true} assume 0 != ~end~0.base || 0 != ~end~0.offset; {23754#(or (not (= 0 main_~end~0.base)) (not (= 0 main_~end~0.offset)))} is VALID [2020-07-10 19:05:17,593 INFO L280 TraceCheckUtils]: 56: Hoare triple {23754#(or (not (= 0 main_~end~0.base)) (not (= 0 main_~end~0.offset)))} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {23748#false} is VALID [2020-07-10 19:05:17,593 INFO L280 TraceCheckUtils]: 57: Hoare triple {23748#false} assume !false; {23748#false} is VALID [2020-07-10 19:05:17,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:05:17,596 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:05:17,596 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1939596701] [2020-07-10 19:05:17,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:05:17,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 19:05:17,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445054986] [2020-07-10 19:05:17,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2020-07-10 19:05:17,597 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:05:17,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 19:05:17,652 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:05:17,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 19:05:17,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:05:17,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 19:05:17,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 19:05:17,653 INFO L87 Difference]: Start difference. First operand 272 states and 297 transitions. Second operand 4 states. [2020-07-10 19:05:20,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:05:20,186 INFO L93 Difference]: Finished difference Result 277 states and 302 transitions. [2020-07-10 19:05:20,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 19:05:20,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2020-07-10 19:05:20,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:05:20,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 19:05:20,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2020-07-10 19:05:20,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 19:05:20,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2020-07-10 19:05:20,188 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 167 transitions. [2020-07-10 19:05:20,379 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:05:20,384 INFO L225 Difference]: With dead ends: 277 [2020-07-10 19:05:20,384 INFO L226 Difference]: Without dead ends: 275 [2020-07-10 19:05:20,385 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-10 19:05:20,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-07-10 19:05:22,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 270. [2020-07-10 19:05:22,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:05:22,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 275 states. Second operand 270 states. [2020-07-10 19:05:22,388 INFO L74 IsIncluded]: Start isIncluded. First operand 275 states. Second operand 270 states. [2020-07-10 19:05:22,388 INFO L87 Difference]: Start difference. First operand 275 states. Second operand 270 states. [2020-07-10 19:05:22,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:05:22,393 INFO L93 Difference]: Finished difference Result 275 states and 300 transitions. [2020-07-10 19:05:22,393 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 300 transitions. [2020-07-10 19:05:22,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:05:22,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:05:22,393 INFO L74 IsIncluded]: Start isIncluded. First operand 270 states. Second operand 275 states. [2020-07-10 19:05:22,393 INFO L87 Difference]: Start difference. First operand 270 states. Second operand 275 states. [2020-07-10 19:05:22,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:05:22,399 INFO L93 Difference]: Finished difference Result 275 states and 300 transitions. [2020-07-10 19:05:22,399 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 300 transitions. [2020-07-10 19:05:22,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:05:22,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:05:22,400 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:05:22,400 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:05:22,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2020-07-10 19:05:22,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 295 transitions. [2020-07-10 19:05:22,406 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 295 transitions. Word has length 58 [2020-07-10 19:05:22,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:05:22,406 INFO L479 AbstractCegarLoop]: Abstraction has 270 states and 295 transitions. [2020-07-10 19:05:22,406 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 19:05:22,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 270 states and 295 transitions. [2020-07-10 19:05:23,515 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 295 edges. 295 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:05:23,515 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 295 transitions. [2020-07-10 19:05:23,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-07-10 19:05:23,517 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:05:23,517 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 19:05:23,517 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-10 19:05:23,518 INFO L427 AbstractCegarLoop]: === Iteration 16 === [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-10 19:05:23,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:05:23,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1792411396, now seen corresponding path program 1 times [2020-07-10 19:05:23,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:05:23,519 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [164269651] [2020-07-10 19:05:23,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:05:23,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:05:23,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:05:23,659 INFO L280 TraceCheckUtils]: 0: Hoare triple {25413#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {25402#true} is VALID [2020-07-10 19:05:23,659 INFO L280 TraceCheckUtils]: 1: Hoare triple {25402#true} #valid := #valid[0 := 0]; {25402#true} is VALID [2020-07-10 19:05:23,659 INFO L280 TraceCheckUtils]: 2: Hoare triple {25402#true} assume 0 < #StackHeapBarrier; {25402#true} is VALID [2020-07-10 19:05:23,660 INFO L280 TraceCheckUtils]: 3: Hoare triple {25402#true} assume true; {25402#true} is VALID [2020-07-10 19:05:23,660 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {25402#true} {25402#true} #419#return; {25402#true} is VALID [2020-07-10 19:05:23,661 INFO L263 TraceCheckUtils]: 0: Hoare triple {25402#true} call ULTIMATE.init(); {25413#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:05:23,661 INFO L280 TraceCheckUtils]: 1: Hoare triple {25413#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {25402#true} is VALID [2020-07-10 19:05:23,661 INFO L280 TraceCheckUtils]: 2: Hoare triple {25402#true} #valid := #valid[0 := 0]; {25402#true} is VALID [2020-07-10 19:05:23,661 INFO L280 TraceCheckUtils]: 3: Hoare triple {25402#true} assume 0 < #StackHeapBarrier; {25402#true} is VALID [2020-07-10 19:05:23,662 INFO L280 TraceCheckUtils]: 4: Hoare triple {25402#true} assume true; {25402#true} is VALID [2020-07-10 19:05:23,662 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {25402#true} {25402#true} #419#return; {25402#true} is VALID [2020-07-10 19:05:23,662 INFO L263 TraceCheckUtils]: 6: Hoare triple {25402#true} call #t~ret28 := main(); {25402#true} is VALID [2020-07-10 19:05:23,662 INFO L280 TraceCheckUtils]: 7: Hoare triple {25402#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {25402#true} is VALID [2020-07-10 19:05:23,662 INFO L280 TraceCheckUtils]: 8: Hoare triple {25402#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {25402#true} is VALID [2020-07-10 19:05:23,663 INFO L280 TraceCheckUtils]: 9: Hoare triple {25402#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {25409#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-10 19:05:23,664 INFO L280 TraceCheckUtils]: 10: Hoare triple {25409#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {25409#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-10 19:05:23,665 INFO L280 TraceCheckUtils]: 11: Hoare triple {25409#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} goto; {25409#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-10 19:05:23,666 INFO L280 TraceCheckUtils]: 12: Hoare triple {25409#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {25409#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-10 19:05:23,666 INFO L280 TraceCheckUtils]: 13: Hoare triple {25409#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} assume 0 != #t~nondet1; {25409#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-10 19:05:23,667 INFO L280 TraceCheckUtils]: 14: Hoare triple {25409#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} havoc #t~nondet1; {25409#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-10 19:05:23,668 INFO L280 TraceCheckUtils]: 15: Hoare triple {25409#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {25409#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-10 19:05:23,669 INFO L280 TraceCheckUtils]: 16: Hoare triple {25409#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {25409#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-10 19:05:23,670 INFO L280 TraceCheckUtils]: 17: Hoare triple {25409#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {25409#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-10 19:05:23,671 INFO L280 TraceCheckUtils]: 18: Hoare triple {25409#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} assume !#t~short7; {25409#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-10 19:05:23,672 INFO L280 TraceCheckUtils]: 19: Hoare triple {25409#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-22 {25409#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-10 19:05:23,672 INFO L280 TraceCheckUtils]: 20: Hoare triple {25409#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {25409#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-10 19:05:23,673 INFO L280 TraceCheckUtils]: 21: Hoare triple {25409#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} assume !!#t~short7; {25409#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-10 19:05:23,674 INFO L280 TraceCheckUtils]: 22: Hoare triple {25409#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} havoc #t~mem5.base, #t~mem5.offset; {25409#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-10 19:05:23,675 INFO L280 TraceCheckUtils]: 23: Hoare triple {25409#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} havoc #t~mem6.base, #t~mem6.offset; {25409#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-10 19:05:23,675 INFO L280 TraceCheckUtils]: 24: Hoare triple {25409#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} havoc #t~short7; {25409#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-10 19:05:23,676 INFO L280 TraceCheckUtils]: 25: Hoare triple {25409#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} goto; {25409#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-10 19:05:23,677 INFO L280 TraceCheckUtils]: 26: Hoare triple {25409#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {25409#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-10 19:05:23,678 INFO L280 TraceCheckUtils]: 27: Hoare triple {25409#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {25409#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-10 19:05:23,678 INFO L280 TraceCheckUtils]: 28: Hoare triple {25409#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} assume !(0 != #t~nondet8); {25409#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-10 19:05:23,679 INFO L280 TraceCheckUtils]: 29: Hoare triple {25409#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} havoc #t~nondet8; {25409#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-10 19:05:23,680 INFO L280 TraceCheckUtils]: 30: Hoare triple {25409#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} ~end~0.base, ~end~0.offset := 0, 0; {25409#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-10 19:05:23,681 INFO L280 TraceCheckUtils]: 31: Hoare triple {25409#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {25410#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-10 19:05:23,682 INFO L280 TraceCheckUtils]: 32: Hoare triple {25410#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {25410#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-10 19:05:23,682 INFO L280 TraceCheckUtils]: 33: Hoare triple {25410#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} goto; {25410#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-10 19:05:23,683 INFO L280 TraceCheckUtils]: 34: Hoare triple {25410#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {25410#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-10 19:05:23,684 INFO L280 TraceCheckUtils]: 35: Hoare triple {25410#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} ~len~0 := 0; {25410#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-10 19:05:23,684 INFO L280 TraceCheckUtils]: 36: Hoare triple {25410#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 {25410#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-10 19:05:23,685 INFO L280 TraceCheckUtils]: 37: Hoare triple {25410#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; {25410#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-10 19:05:23,686 INFO L280 TraceCheckUtils]: 38: Hoare triple {25410#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} havoc #t~mem18.base, #t~mem18.offset; {25410#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-10 19:05:23,687 INFO L280 TraceCheckUtils]: 39: Hoare triple {25410#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {25410#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-10 19:05:23,687 INFO L280 TraceCheckUtils]: 40: Hoare triple {25410#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} assume !!(~len~0 <= 1); {25410#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-10 19:05:23,688 INFO L280 TraceCheckUtils]: 41: Hoare triple {25410#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} goto; {25410#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-10 19:05:23,689 INFO L280 TraceCheckUtils]: 42: Hoare triple {25410#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} SUMMARY for call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1031-4 {25411#(and (= 0 |main_#t~mem23.base|) (= |main_#t~mem23.offset| 0))} is VALID [2020-07-10 19:05:23,689 INFO L280 TraceCheckUtils]: 43: Hoare triple {25411#(and (= 0 |main_#t~mem23.base|) (= |main_#t~mem23.offset| 0))} ~end~0.base, ~end~0.offset := #t~mem23.base, #t~mem23.offset; {25412#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} is VALID [2020-07-10 19:05:23,690 INFO L280 TraceCheckUtils]: 44: Hoare triple {25412#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} havoc #t~mem23.base, #t~mem23.offset; {25412#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} is VALID [2020-07-10 19:05:23,690 INFO L280 TraceCheckUtils]: 45: Hoare triple {25412#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {25403#false} is VALID [2020-07-10 19:05:23,691 INFO L280 TraceCheckUtils]: 46: Hoare triple {25403#false} ~len~0 := 0; {25403#false} is VALID [2020-07-10 19:05:23,691 INFO L280 TraceCheckUtils]: 47: Hoare triple {25403#false} SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 {25403#false} is VALID [2020-07-10 19:05:23,691 INFO L280 TraceCheckUtils]: 48: Hoare triple {25403#false} ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; {25403#false} is VALID [2020-07-10 19:05:23,691 INFO L280 TraceCheckUtils]: 49: Hoare triple {25403#false} havoc #t~mem18.base, #t~mem18.offset; {25403#false} is VALID [2020-07-10 19:05:23,691 INFO L280 TraceCheckUtils]: 50: Hoare triple {25403#false} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {25403#false} is VALID [2020-07-10 19:05:23,692 INFO L280 TraceCheckUtils]: 51: Hoare triple {25403#false} assume 0 == ~len~0; {25403#false} is VALID [2020-07-10 19:05:23,692 INFO L280 TraceCheckUtils]: 52: Hoare triple {25403#false} ~len~0 := 1; {25403#false} is VALID [2020-07-10 19:05:23,692 INFO L280 TraceCheckUtils]: 53: Hoare triple {25403#false} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {25403#false} is VALID [2020-07-10 19:05:23,692 INFO L280 TraceCheckUtils]: 54: Hoare triple {25403#false} goto; {25403#false} is VALID [2020-07-10 19:05:23,692 INFO L280 TraceCheckUtils]: 55: Hoare triple {25403#false} SUMMARY for call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); srcloc: L1025-6 {25403#false} is VALID [2020-07-10 19:05:23,693 INFO L280 TraceCheckUtils]: 56: Hoare triple {25403#false} assume !(0 == #t~mem19.base && 0 == #t~mem19.offset); {25403#false} is VALID [2020-07-10 19:05:23,693 INFO L280 TraceCheckUtils]: 57: Hoare triple {25403#false} havoc #t~mem19.base, #t~mem19.offset; {25403#false} is VALID [2020-07-10 19:05:23,693 INFO L280 TraceCheckUtils]: 58: Hoare triple {25403#false} assume !false; {25403#false} is VALID [2020-07-10 19:05:23,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:05:23,704 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:05:23,705 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [164269651] [2020-07-10 19:05:23,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:05:23,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 19:05:23,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574081822] [2020-07-10 19:05:23,706 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2020-07-10 19:05:23,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:05:23,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 19:05:23,774 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:05:23,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 19:05:23,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:05:23,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 19:05:23,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-10 19:05:23,775 INFO L87 Difference]: Start difference. First operand 270 states and 295 transitions. Second operand 7 states. [2020-07-10 19:05:27,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:05:27,731 INFO L93 Difference]: Finished difference Result 421 states and 458 transitions. [2020-07-10 19:05:27,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 19:05:27,732 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2020-07-10 19:05:27,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:05:27,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 19:05:27,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 313 transitions. [2020-07-10 19:05:27,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 19:05:27,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 313 transitions. [2020-07-10 19:05:27,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 313 transitions. [2020-07-10 19:05:28,105 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 313 edges. 313 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:05:28,112 INFO L225 Difference]: With dead ends: 421 [2020-07-10 19:05:28,113 INFO L226 Difference]: Without dead ends: 312 [2020-07-10 19:05:28,113 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-07-10 19:05:28,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2020-07-10 19:05:30,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 270. [2020-07-10 19:05:30,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:05:30,294 INFO L82 GeneralOperation]: Start isEquivalent. First operand 312 states. Second operand 270 states. [2020-07-10 19:05:30,295 INFO L74 IsIncluded]: Start isIncluded. First operand 312 states. Second operand 270 states. [2020-07-10 19:05:30,295 INFO L87 Difference]: Start difference. First operand 312 states. Second operand 270 states. [2020-07-10 19:05:30,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:05:30,302 INFO L93 Difference]: Finished difference Result 312 states and 333 transitions. [2020-07-10 19:05:30,302 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 333 transitions. [2020-07-10 19:05:30,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:05:30,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:05:30,303 INFO L74 IsIncluded]: Start isIncluded. First operand 270 states. Second operand 312 states. [2020-07-10 19:05:30,303 INFO L87 Difference]: Start difference. First operand 270 states. Second operand 312 states. [2020-07-10 19:05:30,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:05:30,310 INFO L93 Difference]: Finished difference Result 312 states and 333 transitions. [2020-07-10 19:05:30,310 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 333 transitions. [2020-07-10 19:05:30,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:05:30,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:05:30,311 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:05:30,311 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:05:30,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2020-07-10 19:05:30,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 293 transitions. [2020-07-10 19:05:30,316 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 293 transitions. Word has length 59 [2020-07-10 19:05:30,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:05:30,316 INFO L479 AbstractCegarLoop]: Abstraction has 270 states and 293 transitions. [2020-07-10 19:05:30,316 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 19:05:30,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 270 states and 293 transitions. [2020-07-10 19:05:31,462 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 293 edges. 293 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:05:31,462 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 293 transitions. [2020-07-10 19:05:31,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-07-10 19:05:31,463 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:05:31,463 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, 1, 1, 1, 1] [2020-07-10 19:05:31,463 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-10 19:05:31,464 INFO L427 AbstractCegarLoop]: === Iteration 17 === [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-10 19:05:31,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:05:31,464 INFO L82 PathProgramCache]: Analyzing trace with hash -984681049, now seen corresponding path program 1 times [2020-07-10 19:05:31,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:05:31,465 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [812704888] [2020-07-10 19:05:31,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:05:31,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:05:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:05:31,755 INFO L280 TraceCheckUtils]: 0: Hoare triple {27450#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {27430#true} is VALID [2020-07-10 19:05:31,756 INFO L280 TraceCheckUtils]: 1: Hoare triple {27430#true} #valid := #valid[0 := 0]; {27430#true} is VALID [2020-07-10 19:05:31,756 INFO L280 TraceCheckUtils]: 2: Hoare triple {27430#true} assume 0 < #StackHeapBarrier; {27430#true} is VALID [2020-07-10 19:05:31,756 INFO L280 TraceCheckUtils]: 3: Hoare triple {27430#true} assume true; {27430#true} is VALID [2020-07-10 19:05:31,756 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {27430#true} {27430#true} #419#return; {27430#true} is VALID [2020-07-10 19:05:31,757 INFO L263 TraceCheckUtils]: 0: Hoare triple {27430#true} call ULTIMATE.init(); {27450#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:05:31,757 INFO L280 TraceCheckUtils]: 1: Hoare triple {27450#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {27430#true} is VALID [2020-07-10 19:05:31,758 INFO L280 TraceCheckUtils]: 2: Hoare triple {27430#true} #valid := #valid[0 := 0]; {27430#true} is VALID [2020-07-10 19:05:31,758 INFO L280 TraceCheckUtils]: 3: Hoare triple {27430#true} assume 0 < #StackHeapBarrier; {27430#true} is VALID [2020-07-10 19:05:31,758 INFO L280 TraceCheckUtils]: 4: Hoare triple {27430#true} assume true; {27430#true} is VALID [2020-07-10 19:05:31,758 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {27430#true} {27430#true} #419#return; {27430#true} is VALID [2020-07-10 19:05:31,758 INFO L263 TraceCheckUtils]: 6: Hoare triple {27430#true} call #t~ret28 := main(); {27430#true} is VALID [2020-07-10 19:05:31,759 INFO L280 TraceCheckUtils]: 7: Hoare triple {27430#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {27437#(= 1 (select |#valid| |main_#t~malloc0.base|))} is VALID [2020-07-10 19:05:31,760 INFO L280 TraceCheckUtils]: 8: Hoare triple {27437#(= 1 (select |#valid| |main_#t~malloc0.base|))} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {27438#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-10 19:05:31,761 INFO L280 TraceCheckUtils]: 9: Hoare triple {27438#(= 1 (select |#valid| main_~list~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {27438#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-10 19:05:31,761 INFO L280 TraceCheckUtils]: 10: Hoare triple {27438#(= 1 (select |#valid| main_~list~0.base))} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {27438#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-10 19:05:31,762 INFO L280 TraceCheckUtils]: 11: Hoare triple {27438#(= 1 (select |#valid| main_~list~0.base))} goto; {27438#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-10 19:05:31,762 INFO L280 TraceCheckUtils]: 12: Hoare triple {27438#(= 1 (select |#valid| main_~list~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {27438#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-10 19:05:31,763 INFO L280 TraceCheckUtils]: 13: Hoare triple {27438#(= 1 (select |#valid| main_~list~0.base))} assume !(0 != #t~nondet1); {27438#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-10 19:05:31,764 INFO L280 TraceCheckUtils]: 14: Hoare triple {27438#(= 1 (select |#valid| main_~list~0.base))} havoc #t~nondet1; {27438#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-10 19:05:31,764 INFO L280 TraceCheckUtils]: 15: Hoare triple {27438#(= 1 (select |#valid| main_~list~0.base))} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); srcloc: L993-10 {27439#(and (= 0 |main_#t~malloc2.offset|) (not (= |main_#t~malloc2.base| main_~list~0.base)))} is VALID [2020-07-10 19:05:31,765 INFO L280 TraceCheckUtils]: 16: Hoare triple {27439#(and (= 0 |main_#t~malloc2.offset|) (not (= |main_#t~malloc2.base| main_~list~0.base)))} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-11 {27440#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:05:31,766 INFO L280 TraceCheckUtils]: 17: Hoare triple {27440#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-12 {27441#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem3.base|) (not (= |main_#t~mem3.base| main_~list~0.base)))} is VALID [2020-07-10 19:05:31,767 INFO L280 TraceCheckUtils]: 18: Hoare triple {27441#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem3.base|) (not (= |main_#t~mem3.base| main_~list~0.base)))} SUMMARY for call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4); srcloc: L993-13 {27440#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:05:31,768 INFO L280 TraceCheckUtils]: 19: Hoare triple {27440#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~mem3.base, #t~mem3.offset; {27440#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:05:31,769 INFO L280 TraceCheckUtils]: 20: Hoare triple {27440#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-15 {27442#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= |main_#t~mem4.base| main_~list~0.base)))} is VALID [2020-07-10 19:05:31,770 INFO L280 TraceCheckUtils]: 21: Hoare triple {27442#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= |main_#t~mem4.base| main_~list~0.base)))} SUMMARY for call write~$Pointer$(0, 0, #t~mem4.base, 4 + #t~mem4.offset, 4); srcloc: L993-16 {27443#(= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))} is VALID [2020-07-10 19:05:31,770 INFO L280 TraceCheckUtils]: 22: Hoare triple {27443#(= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))} havoc #t~mem4.base, #t~mem4.offset; {27443#(= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))} is VALID [2020-07-10 19:05:31,771 INFO L280 TraceCheckUtils]: 23: Hoare triple {27443#(= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {27444#(and (= 0 |main_#t~mem5.offset|) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem5.base|))} is VALID [2020-07-10 19:05:31,772 INFO L280 TraceCheckUtils]: 24: Hoare triple {27444#(and (= 0 |main_#t~mem5.offset|) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem5.base|))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {27445#(or (not |main_#t~short7|) (not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))))} is VALID [2020-07-10 19:05:31,772 INFO L280 TraceCheckUtils]: 25: Hoare triple {27445#(or (not |main_#t~short7|) (not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))))} assume #t~short7; {27446#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:05:31,773 INFO L280 TraceCheckUtils]: 26: Hoare triple {27446#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !!#t~short7; {27446#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:05:31,774 INFO L280 TraceCheckUtils]: 27: Hoare triple {27446#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~mem5.base, #t~mem5.offset; {27446#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:05:31,775 INFO L280 TraceCheckUtils]: 28: Hoare triple {27446#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~mem6.base, #t~mem6.offset; {27446#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:05:31,776 INFO L280 TraceCheckUtils]: 29: Hoare triple {27446#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~short7; {27446#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:05:31,776 INFO L280 TraceCheckUtils]: 30: Hoare triple {27446#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} goto; {27446#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:05:31,777 INFO L280 TraceCheckUtils]: 31: Hoare triple {27446#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {27446#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:05:31,780 INFO L280 TraceCheckUtils]: 32: Hoare triple {27446#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {27446#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:05:31,780 INFO L280 TraceCheckUtils]: 33: Hoare triple {27446#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !(0 != #t~nondet8); {27446#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:05:31,781 INFO L280 TraceCheckUtils]: 34: Hoare triple {27446#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~nondet8; {27446#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:05:31,781 INFO L280 TraceCheckUtils]: 35: Hoare triple {27446#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := 0, 0; {27446#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-10 19:05:31,782 INFO L280 TraceCheckUtils]: 36: Hoare triple {27446#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {27447#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} is VALID [2020-07-10 19:05:31,783 INFO L280 TraceCheckUtils]: 37: Hoare triple {27447#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {27447#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} is VALID [2020-07-10 19:05:31,783 INFO L280 TraceCheckUtils]: 38: Hoare triple {27447#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} goto; {27447#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} is VALID [2020-07-10 19:05:31,784 INFO L280 TraceCheckUtils]: 39: Hoare triple {27447#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {27447#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} is VALID [2020-07-10 19:05:31,784 INFO L280 TraceCheckUtils]: 40: Hoare triple {27447#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} ~len~0 := 0; {27447#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} is VALID [2020-07-10 19:05:31,785 INFO L280 TraceCheckUtils]: 41: Hoare triple {27447#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 {27448#(not (= 0 |main_#t~mem18.base|))} is VALID [2020-07-10 19:05:31,785 INFO L280 TraceCheckUtils]: 42: Hoare triple {27448#(not (= 0 |main_#t~mem18.base|))} ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; {27449#(not (= 0 main_~inner~0.base))} is VALID [2020-07-10 19:05:31,786 INFO L280 TraceCheckUtils]: 43: Hoare triple {27449#(not (= 0 main_~inner~0.base))} havoc #t~mem18.base, #t~mem18.offset; {27449#(not (= 0 main_~inner~0.base))} is VALID [2020-07-10 19:05:31,786 INFO L280 TraceCheckUtils]: 44: Hoare triple {27449#(not (= 0 main_~inner~0.base))} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {27431#false} is VALID [2020-07-10 19:05:31,787 INFO L280 TraceCheckUtils]: 45: Hoare triple {27431#false} assume !!(~len~0 <= 1); {27431#false} is VALID [2020-07-10 19:05:31,787 INFO L280 TraceCheckUtils]: 46: Hoare triple {27431#false} goto; {27431#false} is VALID [2020-07-10 19:05:31,787 INFO L280 TraceCheckUtils]: 47: Hoare triple {27431#false} SUMMARY for call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1031-4 {27431#false} is VALID [2020-07-10 19:05:31,787 INFO L280 TraceCheckUtils]: 48: Hoare triple {27431#false} ~end~0.base, ~end~0.offset := #t~mem23.base, #t~mem23.offset; {27431#false} is VALID [2020-07-10 19:05:31,787 INFO L280 TraceCheckUtils]: 49: Hoare triple {27431#false} havoc #t~mem23.base, #t~mem23.offset; {27431#false} is VALID [2020-07-10 19:05:31,788 INFO L280 TraceCheckUtils]: 50: Hoare triple {27431#false} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {27431#false} is VALID [2020-07-10 19:05:31,788 INFO L280 TraceCheckUtils]: 51: Hoare triple {27431#false} assume !!(0 != ~list~0.base || 0 != ~list~0.offset); {27431#false} is VALID [2020-07-10 19:05:31,788 INFO L280 TraceCheckUtils]: 52: Hoare triple {27431#false} SUMMARY for call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L1039 {27431#false} is VALID [2020-07-10 19:05:31,788 INFO L280 TraceCheckUtils]: 53: Hoare triple {27431#false} ~end~0.base, ~end~0.offset := #t~mem24.base, #t~mem24.offset; {27431#false} is VALID [2020-07-10 19:05:31,788 INFO L280 TraceCheckUtils]: 54: Hoare triple {27431#false} havoc #t~mem24.base, #t~mem24.offset; {27431#false} is VALID [2020-07-10 19:05:31,789 INFO L280 TraceCheckUtils]: 55: Hoare triple {27431#false} assume 0 != ~end~0.base || 0 != ~end~0.offset; {27431#false} is VALID [2020-07-10 19:05:31,789 INFO L280 TraceCheckUtils]: 56: Hoare triple {27431#false} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {27431#false} is VALID [2020-07-10 19:05:31,789 INFO L280 TraceCheckUtils]: 57: Hoare triple {27431#false} goto; {27431#false} is VALID [2020-07-10 19:05:31,789 INFO L280 TraceCheckUtils]: 58: Hoare triple {27431#false} SUMMARY for call #t~mem25.base, #t~mem25.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1044-6 {27431#false} is VALID [2020-07-10 19:05:31,790 INFO L280 TraceCheckUtils]: 59: Hoare triple {27431#false} assume !(0 == #t~mem25.base && 0 == #t~mem25.offset); {27431#false} is VALID [2020-07-10 19:05:31,790 INFO L280 TraceCheckUtils]: 60: Hoare triple {27431#false} havoc #t~mem25.base, #t~mem25.offset; {27431#false} is VALID [2020-07-10 19:05:31,790 INFO L280 TraceCheckUtils]: 61: Hoare triple {27431#false} assume !false; {27431#false} is VALID [2020-07-10 19:05:31,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:05:31,798 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:05:31,799 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [812704888] [2020-07-10 19:05:31,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:05:31,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-07-10 19:05:31,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122666752] [2020-07-10 19:05:31,800 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 62 [2020-07-10 19:05:31,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:05:31,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-10 19:05:31,865 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:05:31,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-10 19:05:31,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:05:31,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-10 19:05:31,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2020-07-10 19:05:31,867 INFO L87 Difference]: Start difference. First operand 270 states and 293 transitions. Second operand 16 states. [2020-07-10 19:05:41,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:05:41,429 INFO L93 Difference]: Finished difference Result 574 states and 610 transitions. [2020-07-10 19:05:41,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-07-10 19:05:41,429 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 62 [2020-07-10 19:05:41,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:05:41,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-10 19:05:41,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 524 transitions. [2020-07-10 19:05:41,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-10 19:05:41,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 524 transitions. [2020-07-10 19:05:41,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 524 transitions. [2020-07-10 19:05:42,161 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 524 edges. 524 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:05:42,178 INFO L225 Difference]: With dead ends: 574 [2020-07-10 19:05:42,178 INFO L226 Difference]: Without dead ends: 540 [2020-07-10 19:05:42,179 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=274, Invalid=916, Unknown=0, NotChecked=0, Total=1190 [2020-07-10 19:05:42,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-07-10 19:05:44,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 269. [2020-07-10 19:05:44,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:05:44,376 INFO L82 GeneralOperation]: Start isEquivalent. First operand 540 states. Second operand 269 states. [2020-07-10 19:05:44,376 INFO L74 IsIncluded]: Start isIncluded. First operand 540 states. Second operand 269 states. [2020-07-10 19:05:44,376 INFO L87 Difference]: Start difference. First operand 540 states. Second operand 269 states. [2020-07-10 19:05:44,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:05:44,391 INFO L93 Difference]: Finished difference Result 540 states and 574 transitions. [2020-07-10 19:05:44,391 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 574 transitions. [2020-07-10 19:05:44,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:05:44,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:05:44,392 INFO L74 IsIncluded]: Start isIncluded. First operand 269 states. Second operand 540 states. [2020-07-10 19:05:44,392 INFO L87 Difference]: Start difference. First operand 269 states. Second operand 540 states. [2020-07-10 19:05:44,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:05:44,408 INFO L93 Difference]: Finished difference Result 540 states and 574 transitions. [2020-07-10 19:05:44,408 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 574 transitions. [2020-07-10 19:05:44,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:05:44,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:05:44,409 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:05:44,409 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:05:44,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2020-07-10 19:05:44,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 291 transitions. [2020-07-10 19:05:44,414 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 291 transitions. Word has length 62 [2020-07-10 19:05:44,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:05:44,414 INFO L479 AbstractCegarLoop]: Abstraction has 269 states and 291 transitions. [2020-07-10 19:05:44,414 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-10 19:05:44,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 269 states and 291 transitions. [2020-07-10 19:05:45,601 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 291 edges. 291 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:05:45,601 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 291 transitions. [2020-07-10 19:05:45,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-07-10 19:05:45,602 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:05:45,602 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, 1, 1, 1, 1, 1, 1] [2020-07-10 19:05:45,603 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-10 19:05:45,603 INFO L427 AbstractCegarLoop]: === Iteration 18 === [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-10 19:05:45,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:05:45,604 INFO L82 PathProgramCache]: Analyzing trace with hash -649286859, now seen corresponding path program 1 times [2020-07-10 19:05:45,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:05:45,604 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [847799703] [2020-07-10 19:05:45,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:05:45,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:05:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:05:45,673 INFO L280 TraceCheckUtils]: 0: Hoare triple {30265#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {30257#true} is VALID [2020-07-10 19:05:45,673 INFO L280 TraceCheckUtils]: 1: Hoare triple {30257#true} #valid := #valid[0 := 0]; {30257#true} is VALID [2020-07-10 19:05:45,674 INFO L280 TraceCheckUtils]: 2: Hoare triple {30257#true} assume 0 < #StackHeapBarrier; {30257#true} is VALID [2020-07-10 19:05:45,674 INFO L280 TraceCheckUtils]: 3: Hoare triple {30257#true} assume true; {30257#true} is VALID [2020-07-10 19:05:45,674 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {30257#true} {30257#true} #419#return; {30257#true} is VALID [2020-07-10 19:05:45,675 INFO L263 TraceCheckUtils]: 0: Hoare triple {30257#true} call ULTIMATE.init(); {30265#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:05:45,676 INFO L280 TraceCheckUtils]: 1: Hoare triple {30265#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {30257#true} is VALID [2020-07-10 19:05:45,676 INFO L280 TraceCheckUtils]: 2: Hoare triple {30257#true} #valid := #valid[0 := 0]; {30257#true} is VALID [2020-07-10 19:05:45,676 INFO L280 TraceCheckUtils]: 3: Hoare triple {30257#true} assume 0 < #StackHeapBarrier; {30257#true} is VALID [2020-07-10 19:05:45,677 INFO L280 TraceCheckUtils]: 4: Hoare triple {30257#true} assume true; {30257#true} is VALID [2020-07-10 19:05:45,677 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {30257#true} {30257#true} #419#return; {30257#true} is VALID [2020-07-10 19:05:45,677 INFO L263 TraceCheckUtils]: 6: Hoare triple {30257#true} call #t~ret28 := main(); {30257#true} is VALID [2020-07-10 19:05:45,677 INFO L280 TraceCheckUtils]: 7: Hoare triple {30257#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {30257#true} is VALID [2020-07-10 19:05:45,677 INFO L280 TraceCheckUtils]: 8: Hoare triple {30257#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {30257#true} is VALID [2020-07-10 19:05:45,678 INFO L280 TraceCheckUtils]: 9: Hoare triple {30257#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {30257#true} is VALID [2020-07-10 19:05:45,678 INFO L280 TraceCheckUtils]: 10: Hoare triple {30257#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {30257#true} is VALID [2020-07-10 19:05:45,678 INFO L280 TraceCheckUtils]: 11: Hoare triple {30257#true} goto; {30257#true} is VALID [2020-07-10 19:05:45,678 INFO L280 TraceCheckUtils]: 12: Hoare triple {30257#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {30257#true} is VALID [2020-07-10 19:05:45,678 INFO L280 TraceCheckUtils]: 13: Hoare triple {30257#true} assume !(0 != #t~nondet1); {30257#true} is VALID [2020-07-10 19:05:45,679 INFO L280 TraceCheckUtils]: 14: Hoare triple {30257#true} havoc #t~nondet1; {30257#true} is VALID [2020-07-10 19:05:45,679 INFO L280 TraceCheckUtils]: 15: Hoare triple {30257#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); srcloc: L993-10 {30257#true} is VALID [2020-07-10 19:05:45,679 INFO L280 TraceCheckUtils]: 16: Hoare triple {30257#true} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-11 {30257#true} is VALID [2020-07-10 19:05:45,679 INFO L280 TraceCheckUtils]: 17: Hoare triple {30257#true} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-12 {30257#true} is VALID [2020-07-10 19:05:45,679 INFO L280 TraceCheckUtils]: 18: Hoare triple {30257#true} SUMMARY for call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4); srcloc: L993-13 {30257#true} is VALID [2020-07-10 19:05:45,680 INFO L280 TraceCheckUtils]: 19: Hoare triple {30257#true} havoc #t~mem3.base, #t~mem3.offset; {30257#true} is VALID [2020-07-10 19:05:45,680 INFO L280 TraceCheckUtils]: 20: Hoare triple {30257#true} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-15 {30257#true} is VALID [2020-07-10 19:05:45,680 INFO L280 TraceCheckUtils]: 21: Hoare triple {30257#true} SUMMARY for call write~$Pointer$(0, 0, #t~mem4.base, 4 + #t~mem4.offset, 4); srcloc: L993-16 {30257#true} is VALID [2020-07-10 19:05:45,680 INFO L280 TraceCheckUtils]: 22: Hoare triple {30257#true} havoc #t~mem4.base, #t~mem4.offset; {30257#true} is VALID [2020-07-10 19:05:45,681 INFO L280 TraceCheckUtils]: 23: Hoare triple {30257#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {30257#true} is VALID [2020-07-10 19:05:45,681 INFO L280 TraceCheckUtils]: 24: Hoare triple {30257#true} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {30257#true} is VALID [2020-07-10 19:05:45,681 INFO L280 TraceCheckUtils]: 25: Hoare triple {30257#true} assume #t~short7; {30257#true} is VALID [2020-07-10 19:05:45,681 INFO L280 TraceCheckUtils]: 26: Hoare triple {30257#true} assume !!#t~short7; {30257#true} is VALID [2020-07-10 19:05:45,682 INFO L280 TraceCheckUtils]: 27: Hoare triple {30257#true} havoc #t~mem5.base, #t~mem5.offset; {30257#true} is VALID [2020-07-10 19:05:45,682 INFO L280 TraceCheckUtils]: 28: Hoare triple {30257#true} havoc #t~mem6.base, #t~mem6.offset; {30257#true} is VALID [2020-07-10 19:05:45,682 INFO L280 TraceCheckUtils]: 29: Hoare triple {30257#true} havoc #t~short7; {30257#true} is VALID [2020-07-10 19:05:45,683 INFO L280 TraceCheckUtils]: 30: Hoare triple {30257#true} goto; {30257#true} is VALID [2020-07-10 19:05:45,683 INFO L280 TraceCheckUtils]: 31: Hoare triple {30257#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {30257#true} is VALID [2020-07-10 19:05:45,683 INFO L280 TraceCheckUtils]: 32: Hoare triple {30257#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {30257#true} is VALID [2020-07-10 19:05:45,683 INFO L280 TraceCheckUtils]: 33: Hoare triple {30257#true} assume !(0 != #t~nondet8); {30257#true} is VALID [2020-07-10 19:05:45,683 INFO L280 TraceCheckUtils]: 34: Hoare triple {30257#true} havoc #t~nondet8; {30257#true} is VALID [2020-07-10 19:05:45,684 INFO L280 TraceCheckUtils]: 35: Hoare triple {30257#true} ~end~0.base, ~end~0.offset := 0, 0; {30257#true} is VALID [2020-07-10 19:05:45,684 INFO L280 TraceCheckUtils]: 36: Hoare triple {30257#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {30257#true} is VALID [2020-07-10 19:05:45,684 INFO L280 TraceCheckUtils]: 37: Hoare triple {30257#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {30257#true} is VALID [2020-07-10 19:05:45,684 INFO L280 TraceCheckUtils]: 38: Hoare triple {30257#true} goto; {30257#true} is VALID [2020-07-10 19:05:45,684 INFO L280 TraceCheckUtils]: 39: Hoare triple {30257#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {30257#true} is VALID [2020-07-10 19:05:45,684 INFO L280 TraceCheckUtils]: 40: Hoare triple {30257#true} ~len~0 := 0; {30257#true} is VALID [2020-07-10 19:05:45,685 INFO L280 TraceCheckUtils]: 41: Hoare triple {30257#true} SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 {30257#true} is VALID [2020-07-10 19:05:45,685 INFO L280 TraceCheckUtils]: 42: Hoare triple {30257#true} ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; {30257#true} is VALID [2020-07-10 19:05:45,685 INFO L280 TraceCheckUtils]: 43: Hoare triple {30257#true} havoc #t~mem18.base, #t~mem18.offset; {30257#true} is VALID [2020-07-10 19:05:45,686 INFO L280 TraceCheckUtils]: 44: Hoare triple {30257#true} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {30257#true} is VALID [2020-07-10 19:05:45,686 INFO L280 TraceCheckUtils]: 45: Hoare triple {30257#true} assume 0 == ~len~0; {30257#true} is VALID [2020-07-10 19:05:45,687 INFO L280 TraceCheckUtils]: 46: Hoare triple {30257#true} ~len~0 := 1; {30264#(= 1 main_~len~0)} is VALID [2020-07-10 19:05:45,688 INFO L280 TraceCheckUtils]: 47: Hoare triple {30264#(= 1 main_~len~0)} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {30264#(= 1 main_~len~0)} is VALID [2020-07-10 19:05:45,688 INFO L280 TraceCheckUtils]: 48: Hoare triple {30264#(= 1 main_~len~0)} goto; {30264#(= 1 main_~len~0)} is VALID [2020-07-10 19:05:45,689 INFO L280 TraceCheckUtils]: 49: Hoare triple {30264#(= 1 main_~len~0)} SUMMARY for call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); srcloc: L1025-6 {30264#(= 1 main_~len~0)} is VALID [2020-07-10 19:05:45,689 INFO L280 TraceCheckUtils]: 50: Hoare triple {30264#(= 1 main_~len~0)} assume !!(0 == #t~mem19.base && 0 == #t~mem19.offset); {30264#(= 1 main_~len~0)} is VALID [2020-07-10 19:05:45,690 INFO L280 TraceCheckUtils]: 51: Hoare triple {30264#(= 1 main_~len~0)} havoc #t~mem19.base, #t~mem19.offset; {30264#(= 1 main_~len~0)} is VALID [2020-07-10 19:05:45,690 INFO L280 TraceCheckUtils]: 52: Hoare triple {30264#(= 1 main_~len~0)} goto; {30264#(= 1 main_~len~0)} is VALID [2020-07-10 19:05:45,691 INFO L280 TraceCheckUtils]: 53: Hoare triple {30264#(= 1 main_~len~0)} SUMMARY for call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~inner~0.base, ~inner~0.offset, 4); srcloc: L1026-6 {30264#(= 1 main_~len~0)} is VALID [2020-07-10 19:05:45,691 INFO L280 TraceCheckUtils]: 54: Hoare triple {30264#(= 1 main_~len~0)} assume !!(0 == #t~mem20.base && 0 == #t~mem20.offset); {30264#(= 1 main_~len~0)} is VALID [2020-07-10 19:05:45,692 INFO L280 TraceCheckUtils]: 55: Hoare triple {30264#(= 1 main_~len~0)} havoc #t~mem20.base, #t~mem20.offset; {30264#(= 1 main_~len~0)} is VALID [2020-07-10 19:05:45,693 INFO L280 TraceCheckUtils]: 56: Hoare triple {30264#(= 1 main_~len~0)} goto; {30264#(= 1 main_~len~0)} is VALID [2020-07-10 19:05:45,694 INFO L280 TraceCheckUtils]: 57: Hoare triple {30264#(= 1 main_~len~0)} SUMMARY for call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); srcloc: L1026-7 {30264#(= 1 main_~len~0)} is VALID [2020-07-10 19:05:45,695 INFO L280 TraceCheckUtils]: 58: Hoare triple {30264#(= 1 main_~len~0)} ~inner~0.base, ~inner~0.offset := #t~mem21.base, #t~mem21.offset; {30264#(= 1 main_~len~0)} is VALID [2020-07-10 19:05:45,696 INFO L280 TraceCheckUtils]: 59: Hoare triple {30264#(= 1 main_~len~0)} havoc #t~mem21.base, #t~mem21.offset; {30264#(= 1 main_~len~0)} is VALID [2020-07-10 19:05:45,696 INFO L280 TraceCheckUtils]: 60: Hoare triple {30264#(= 1 main_~len~0)} assume !(1 == ~len~0); {30258#false} is VALID [2020-07-10 19:05:45,696 INFO L280 TraceCheckUtils]: 61: Hoare triple {30258#false} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {30258#false} is VALID [2020-07-10 19:05:45,697 INFO L280 TraceCheckUtils]: 62: Hoare triple {30258#false} assume !(~len~0 <= 1); {30258#false} is VALID [2020-07-10 19:05:45,697 INFO L280 TraceCheckUtils]: 63: Hoare triple {30258#false} assume !false; {30258#false} is VALID [2020-07-10 19:05:45,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:05:45,701 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:05:45,701 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [847799703] [2020-07-10 19:05:45,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:05:45,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 19:05:45,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403482738] [2020-07-10 19:05:45,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2020-07-10 19:05:45,702 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:05:45,702 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 19:05:45,769 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:05:45,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 19:05:45,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:05:45,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 19:05:45,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 19:05:45,770 INFO L87 Difference]: Start difference. First operand 269 states and 291 transitions. Second operand 4 states. [2020-07-10 19:05:49,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:05:49,513 INFO L93 Difference]: Finished difference Result 447 states and 493 transitions. [2020-07-10 19:05:49,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 19:05:49,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2020-07-10 19:05:49,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:05:49,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 19:05:49,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 290 transitions. [2020-07-10 19:05:49,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 19:05:49,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 290 transitions. [2020-07-10 19:05:49,516 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 290 transitions. [2020-07-10 19:05:49,803 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 290 edges. 290 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:05:49,811 INFO L225 Difference]: With dead ends: 447 [2020-07-10 19:05:49,812 INFO L226 Difference]: Without dead ends: 350 [2020-07-10 19:05:49,812 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-10 19:05:49,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2020-07-10 19:05:52,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 302. [2020-07-10 19:05:52,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:05:52,345 INFO L82 GeneralOperation]: Start isEquivalent. First operand 350 states. Second operand 302 states. [2020-07-10 19:05:52,345 INFO L74 IsIncluded]: Start isIncluded. First operand 350 states. Second operand 302 states. [2020-07-10 19:05:52,345 INFO L87 Difference]: Start difference. First operand 350 states. Second operand 302 states. [2020-07-10 19:05:52,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:05:52,353 INFO L93 Difference]: Finished difference Result 350 states and 378 transitions. [2020-07-10 19:05:52,353 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 378 transitions. [2020-07-10 19:05:52,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:05:52,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:05:52,354 INFO L74 IsIncluded]: Start isIncluded. First operand 302 states. Second operand 350 states. [2020-07-10 19:05:52,355 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 350 states. [2020-07-10 19:05:52,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:05:52,362 INFO L93 Difference]: Finished difference Result 350 states and 378 transitions. [2020-07-10 19:05:52,362 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 378 transitions. [2020-07-10 19:05:52,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:05:52,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:05:52,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:05:52,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:05:52,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2020-07-10 19:05:52,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 330 transitions. [2020-07-10 19:05:52,369 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 330 transitions. Word has length 64 [2020-07-10 19:05:52,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:05:52,369 INFO L479 AbstractCegarLoop]: Abstraction has 302 states and 330 transitions. [2020-07-10 19:05:52,370 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 19:05:52,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 302 states and 330 transitions. [2020-07-10 19:05:53,727 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 330 edges. 330 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:05:53,728 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 330 transitions. [2020-07-10 19:05:53,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-10 19:05:53,729 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:05:53,729 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 19:05:53,729 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-10 19:05:53,729 INFO L427 AbstractCegarLoop]: === Iteration 19 === [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-10 19:05:53,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:05:53,730 INFO L82 PathProgramCache]: Analyzing trace with hash -201437452, now seen corresponding path program 1 times [2020-07-10 19:05:53,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:05:53,730 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [819653303] [2020-07-10 19:05:53,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:05:53,742 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-07-10 19:05:53,743 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:277) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-10 19:05:53,749 INFO L168 Benchmark]: Toolchain (without parser) took 109984.68 ms. Allocated memory was 137.4 MB in the beginning and 738.2 MB in the end (delta: 600.8 MB). Free memory was 99.4 MB in the beginning and 281.7 MB in the end (delta: -182.2 MB). Peak memory consumption was 418.6 MB. Max. memory is 7.1 GB. [2020-07-10 19:05:53,749 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.4 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 19:05:53,750 INFO L168 Benchmark]: CACSL2BoogieTranslator took 646.69 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 99.2 MB in the beginning and 167.0 MB in the end (delta: -67.8 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. [2020-07-10 19:05:53,750 INFO L168 Benchmark]: Boogie Preprocessor took 88.61 ms. Allocated memory is still 201.9 MB. Free memory was 167.0 MB in the beginning and 163.0 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. [2020-07-10 19:05:53,751 INFO L168 Benchmark]: RCFGBuilder took 1015.07 ms. Allocated memory was 201.9 MB in the beginning and 233.3 MB in the end (delta: 31.5 MB). Free memory was 163.0 MB in the beginning and 192.0 MB in the end (delta: -29.0 MB). Peak memory consumption was 81.8 MB. Max. memory is 7.1 GB. [2020-07-10 19:05:53,751 INFO L168 Benchmark]: TraceAbstraction took 108228.75 ms. Allocated memory was 233.3 MB in the beginning and 738.2 MB in the end (delta: 504.9 MB). Free memory was 190.6 MB in the beginning and 281.7 MB in the end (delta: -91.1 MB). Peak memory consumption was 413.8 MB. Max. memory is 7.1 GB. [2020-07-10 19:05:53,753 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 137.4 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 646.69 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 99.2 MB in the beginning and 167.0 MB in the end (delta: -67.8 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 88.61 ms. Allocated memory is still 201.9 MB. Free memory was 167.0 MB in the beginning and 163.0 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1015.07 ms. Allocated memory was 201.9 MB in the beginning and 233.3 MB in the end (delta: 31.5 MB). Free memory was 163.0 MB in the beginning and 192.0 MB in the end (delta: -29.0 MB). Peak memory consumption was 81.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 108228.75 ms. Allocated memory was 233.3 MB in the beginning and 738.2 MB in the end (delta: 504.9 MB). Free memory was 190.6 MB in the beginning and 281.7 MB in the end (delta: -91.1 MB). Peak memory consumption was 413.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...