/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-01-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:08:13,518 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:08:13,520 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:08:13,533 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:08:13,533 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:08:13,534 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:08:13,536 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:08:13,537 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:08:13,539 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:08:13,540 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:08:13,541 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:08:13,542 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:08:13,542 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:08:13,543 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:08:13,544 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:08:13,545 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:08:13,546 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:08:13,547 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:08:13,549 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:08:13,551 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:08:13,552 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:08:13,553 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:08:13,554 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:08:13,555 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:08:13,558 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:08:13,558 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:08:13,558 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:08:13,559 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:08:13,560 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:08:13,560 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:08:13,561 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:08:13,561 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:08:13,562 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:08:13,563 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:08:13,564 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:08:13,564 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:08:13,565 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:08:13,565 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:08:13,565 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:08:13,566 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:08:13,567 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:08:13,568 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:08:13,583 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:08:13,583 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:08:13,585 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:08:13,585 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:08:13,585 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:08:13,585 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:08:13,585 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:08:13,586 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:08:13,586 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:08:13,586 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:08:13,586 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:08:13,586 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:08:13,587 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:08:13,587 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:08:13,587 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:08:13,587 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:08:13,587 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:08:13,588 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:08:13,588 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:08:13,588 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:08:13,588 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:08:13,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:08:13,589 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:08:13,589 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:08:13,589 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:08:13,589 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:08:13,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:08:13,590 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:08:13,590 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:08:13,590 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:08:13,886 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:08:13,899 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:08:13,903 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:08:13,904 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:08:13,905 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:08:13,905 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-01-1.i [2020-07-10 15:08:13,970 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34b63f662/50a71db2a29d4b17aecf914e9e9ada59/FLAG948085086 [2020-07-10 15:08:14,496 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:08:14,497 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i [2020-07-10 15:08:14,515 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34b63f662/50a71db2a29d4b17aecf914e9e9ada59/FLAG948085086 [2020-07-10 15:08:14,861 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34b63f662/50a71db2a29d4b17aecf914e9e9ada59 [2020-07-10 15:08:14,873 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:08:14,875 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:08:14,877 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:08:14,877 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:08:14,881 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:08:14,883 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:08:14" (1/1) ... [2020-07-10 15:08:14,886 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e4c526f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:08:14, skipping insertion in model container [2020-07-10 15:08:14,886 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:08:14" (1/1) ... [2020-07-10 15:08:14,895 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:08:14,937 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:08:15,490 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:08:15,499 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:08:15,556 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:08:15,622 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:08:15,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:08:15 WrapperNode [2020-07-10 15:08:15,623 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:08:15,624 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:08:15,624 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:08:15,624 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:08:15,640 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:08:15" (1/1) ... [2020-07-10 15:08:15,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:08:15" (1/1) ... [2020-07-10 15:08:15,658 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:08:15" (1/1) ... [2020-07-10 15:08:15,659 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:08:15" (1/1) ... [2020-07-10 15:08:15,711 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:08:15" (1/1) ... [2020-07-10 15:08:15,738 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:08:15" (1/1) ... [2020-07-10 15:08:15,750 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:08:15" (1/1) ... [2020-07-10 15:08:15,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:08:15,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:08:15,761 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:08:15,761 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:08:15,762 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:08:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:08:15,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:08:15,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:08:15,832 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:08:15,832 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-10 15:08:15,832 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-10 15:08:15,832 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-10 15:08:15,832 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-10 15:08:15,833 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-10 15:08:15,833 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-10 15:08:15,833 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-10 15:08:15,833 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-10 15:08:15,833 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-10 15:08:15,833 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-10 15:08:15,834 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-10 15:08:15,834 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-10 15:08:15,834 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-10 15:08:15,834 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-10 15:08:15,834 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-10 15:08:15,834 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-10 15:08:15,835 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-10 15:08:15,835 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-10 15:08:15,835 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-10 15:08:15,835 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-10 15:08:15,835 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-10 15:08:15,836 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-10 15:08:15,836 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-10 15:08:15,836 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-10 15:08:15,836 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-10 15:08:15,836 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-10 15:08:15,836 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-10 15:08:15,836 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-10 15:08:15,837 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-10 15:08:15,837 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-10 15:08:15,837 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-10 15:08:15,837 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-10 15:08:15,837 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-10 15:08:15,837 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-10 15:08:15,838 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-10 15:08:15,838 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-10 15:08:15,838 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-10 15:08:15,838 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-10 15:08:15,838 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-10 15:08:15,838 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-10 15:08:15,839 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-10 15:08:15,839 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-10 15:08:15,839 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-10 15:08:15,840 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-10 15:08:15,840 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-10 15:08:15,840 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-10 15:08:15,840 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-10 15:08:15,840 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-10 15:08:15,841 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-10 15:08:15,841 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-10 15:08:15,841 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 15:08:15,841 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-10 15:08:15,841 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-10 15:08:15,841 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-10 15:08:15,842 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-10 15:08:15,842 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-10 15:08:15,842 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-10 15:08:15,842 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-10 15:08:15,842 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-10 15:08:15,842 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:08:15,843 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-10 15:08:15,843 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-10 15:08:15,843 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-10 15:08:15,843 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-10 15:08:15,844 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-10 15:08:15,844 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-10 15:08:15,844 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-10 15:08:15,844 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-10 15:08:15,844 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-10 15:08:15,844 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-10 15:08:15,845 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-10 15:08:15,845 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-10 15:08:15,845 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-10 15:08:15,845 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-10 15:08:15,845 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-10 15:08:15,846 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-10 15:08:15,846 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-10 15:08:15,846 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-10 15:08:15,846 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-10 15:08:15,846 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-10 15:08:15,847 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-10 15:08:15,847 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-10 15:08:15,847 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-10 15:08:15,847 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-10 15:08:15,847 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-10 15:08:15,848 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-10 15:08:15,848 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-10 15:08:15,848 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-10 15:08:15,848 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-10 15:08:15,848 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-10 15:08:15,848 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-10 15:08:15,849 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-10 15:08:15,849 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-10 15:08:15,849 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-10 15:08:15,849 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-10 15:08:15,849 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-10 15:08:15,849 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-10 15:08:15,849 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-10 15:08:15,850 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-10 15:08:15,850 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-10 15:08:15,850 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-10 15:08:15,850 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-10 15:08:15,850 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-10 15:08:15,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:08:15,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:08:15,851 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:08:15,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:08:15,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-10 15:08:15,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-10 15:08:15,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:08:15,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:08:15,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:08:16,729 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:08:16,729 INFO L295 CfgBuilder]: Removed 30 assume(true) statements. [2020-07-10 15:08:16,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:08:16 BoogieIcfgContainer [2020-07-10 15:08:16,736 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:08:16,739 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:08:16,740 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:08:16,746 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:08:16,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:08:14" (1/3) ... [2020-07-10 15:08:16,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52cf30f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:08:16, skipping insertion in model container [2020-07-10 15:08:16,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:08:15" (2/3) ... [2020-07-10 15:08:16,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52cf30f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:08:16, skipping insertion in model container [2020-07-10 15:08:16,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:08:16" (3/3) ... [2020-07-10 15:08:16,769 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-01-1.i [2020-07-10 15:08:16,780 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:08:16,787 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2020-07-10 15:08:16,800 INFO L251 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2020-07-10 15:08:16,824 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:08:16,824 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:08:16,824 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:08:16,825 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:08:16,825 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:08:16,825 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:08:16,825 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:08:16,825 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:08:16,848 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2020-07-10 15:08:16,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-10 15:08:16,854 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:08:16,855 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:08:16,856 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 15:08:16,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:08:16,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1861454184, now seen corresponding path program 1 times [2020-07-10 15:08:16,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:08:16,871 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116050398] [2020-07-10 15:08:16,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:08:16,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:17,102 INFO L280 TraceCheckUtils]: 0: Hoare triple {97#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {91#true} is VALID [2020-07-10 15:08:17,102 INFO L280 TraceCheckUtils]: 1: Hoare triple {91#true} assume true; {91#true} is VALID [2020-07-10 15:08:17,103 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {91#true} {91#true} #331#return; {91#true} is VALID [2020-07-10 15:08:17,106 INFO L263 TraceCheckUtils]: 0: Hoare triple {91#true} call ULTIMATE.init(); {97#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:08:17,107 INFO L280 TraceCheckUtils]: 1: Hoare triple {97#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {91#true} is VALID [2020-07-10 15:08:17,107 INFO L280 TraceCheckUtils]: 2: Hoare triple {91#true} assume true; {91#true} is VALID [2020-07-10 15:08:17,107 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {91#true} {91#true} #331#return; {91#true} is VALID [2020-07-10 15:08:17,108 INFO L263 TraceCheckUtils]: 4: Hoare triple {91#true} call #t~ret28 := main(); {91#true} is VALID [2020-07-10 15:08:17,109 INFO L280 TraceCheckUtils]: 5: Hoare triple {91#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4);call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); {96#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 15:08:17,110 INFO L280 TraceCheckUtils]: 6: Hoare triple {96#(not (= 0 main_~list~0.base))} assume !(~list~0.base != 0 || ~list~0.offset != 0); {92#false} is VALID [2020-07-10 15:08:17,111 INFO L280 TraceCheckUtils]: 7: Hoare triple {92#false} assume !false; {92#false} is VALID [2020-07-10 15:08:17,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:08:17,113 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116050398] [2020-07-10 15:08:17,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:08:17,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 15:08:17,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676792246] [2020-07-10 15:08:17,121 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-10 15:08:17,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:08:17,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:08:17,151 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:17,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:08:17,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:08:17,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:08:17,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:08:17,164 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 4 states. [2020-07-10 15:08:17,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:17,691 INFO L93 Difference]: Finished difference Result 186 states and 302 transitions. [2020-07-10 15:08:17,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 15:08:17,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-10 15:08:17,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:08:17,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:08:17,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 302 transitions. [2020-07-10 15:08:17,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:08:17,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 302 transitions. [2020-07-10 15:08:17,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 302 transitions. [2020-07-10 15:08:18,125 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 302 edges. 302 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:18,142 INFO L225 Difference]: With dead ends: 186 [2020-07-10 15:08:18,142 INFO L226 Difference]: Without dead ends: 99 [2020-07-10 15:08:18,146 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 15:08:18,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-07-10 15:08:18,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 81. [2020-07-10 15:08:18,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:08:18,198 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand 81 states. [2020-07-10 15:08:18,199 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 81 states. [2020-07-10 15:08:18,199 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 81 states. [2020-07-10 15:08:18,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:18,207 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2020-07-10 15:08:18,207 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2020-07-10 15:08:18,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:18,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:18,209 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 99 states. [2020-07-10 15:08:18,209 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 99 states. [2020-07-10 15:08:18,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:18,217 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2020-07-10 15:08:18,217 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2020-07-10 15:08:18,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:18,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:18,219 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:08:18,219 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:08:18,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-07-10 15:08:18,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2020-07-10 15:08:18,225 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 8 [2020-07-10 15:08:18,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:08:18,226 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2020-07-10 15:08:18,226 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:08:18,226 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2020-07-10 15:08:18,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-10 15:08:18,227 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:08:18,227 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:08:18,227 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:08:18,228 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 15:08:18,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:08:18,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1461031906, now seen corresponding path program 1 times [2020-07-10 15:08:18,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:08:18,229 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690764842] [2020-07-10 15:08:18,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:08:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:18,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:18,326 INFO L280 TraceCheckUtils]: 0: Hoare triple {598#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {592#true} is VALID [2020-07-10 15:08:18,326 INFO L280 TraceCheckUtils]: 1: Hoare triple {592#true} assume true; {592#true} is VALID [2020-07-10 15:08:18,327 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {592#true} {592#true} #331#return; {592#true} is VALID [2020-07-10 15:08:18,328 INFO L263 TraceCheckUtils]: 0: Hoare triple {592#true} call ULTIMATE.init(); {598#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:08:18,328 INFO L280 TraceCheckUtils]: 1: Hoare triple {598#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {592#true} is VALID [2020-07-10 15:08:18,329 INFO L280 TraceCheckUtils]: 2: Hoare triple {592#true} assume true; {592#true} is VALID [2020-07-10 15:08:18,329 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {592#true} {592#true} #331#return; {592#true} is VALID [2020-07-10 15:08:18,329 INFO L263 TraceCheckUtils]: 4: Hoare triple {592#true} call #t~ret28 := main(); {592#true} is VALID [2020-07-10 15:08:18,330 INFO L280 TraceCheckUtils]: 5: Hoare triple {592#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4);call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); {592#true} is VALID [2020-07-10 15:08:18,330 INFO L280 TraceCheckUtils]: 6: Hoare triple {592#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {592#true} is VALID [2020-07-10 15:08:18,330 INFO L280 TraceCheckUtils]: 7: Hoare triple {592#true} goto; {592#true} is VALID [2020-07-10 15:08:18,331 INFO L280 TraceCheckUtils]: 8: Hoare triple {592#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {592#true} is VALID [2020-07-10 15:08:18,331 INFO L280 TraceCheckUtils]: 9: Hoare triple {592#true} assume 0 != #t~nondet1;havoc #t~nondet1;call write~$Pointer$(0, 0, ~list~0.base, 8 + ~list~0.offset, 4); {592#true} is VALID [2020-07-10 15:08:18,331 INFO L280 TraceCheckUtils]: 10: Hoare triple {592#true} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {592#true} is VALID [2020-07-10 15:08:18,332 INFO L280 TraceCheckUtils]: 11: Hoare triple {592#true} assume #t~short7; {597#|main_#t~short7|} is VALID [2020-07-10 15:08:18,333 INFO L280 TraceCheckUtils]: 12: Hoare triple {597#|main_#t~short7|} assume !#t~short7;havoc #t~short7;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {593#false} is VALID [2020-07-10 15:08:18,333 INFO L280 TraceCheckUtils]: 13: Hoare triple {593#false} assume !false; {593#false} is VALID [2020-07-10 15:08:18,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:08:18,335 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690764842] [2020-07-10 15:08:18,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:08:18,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 15:08:18,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675563933] [2020-07-10 15:08:18,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-07-10 15:08:18,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:08:18,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:08:18,358 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:18,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:08:18,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:08:18,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:08:18,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:08:18,359 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 4 states. [2020-07-10 15:08:18,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:18,695 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2020-07-10 15:08:18,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 15:08:18,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-07-10 15:08:18,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:08:18,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:08:18,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2020-07-10 15:08:18,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:08:18,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2020-07-10 15:08:18,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 93 transitions. [2020-07-10 15:08:18,787 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:18,790 INFO L225 Difference]: With dead ends: 84 [2020-07-10 15:08:18,790 INFO L226 Difference]: Without dead ends: 82 [2020-07-10 15:08:18,791 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 15:08:18,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-07-10 15:08:18,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2020-07-10 15:08:18,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:08:18,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 82 states. [2020-07-10 15:08:18,813 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 82 states. [2020-07-10 15:08:18,814 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 82 states. [2020-07-10 15:08:18,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:18,818 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2020-07-10 15:08:18,818 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2020-07-10 15:08:18,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:18,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:18,819 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 82 states. [2020-07-10 15:08:18,819 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 82 states. [2020-07-10 15:08:18,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:18,823 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2020-07-10 15:08:18,824 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2020-07-10 15:08:18,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:18,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:18,825 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:08:18,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:08:18,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-07-10 15:08:18,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2020-07-10 15:08:18,831 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 14 [2020-07-10 15:08:18,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:08:18,832 INFO L479 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2020-07-10 15:08:18,832 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:08:18,832 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2020-07-10 15:08:18,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-10 15:08:18,834 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:08:18,834 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:08:18,834 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:08:18,835 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 15:08:18,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:08:18,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1461033828, now seen corresponding path program 1 times [2020-07-10 15:08:18,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:08:18,837 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684573216] [2020-07-10 15:08:18,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:08:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:18,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:18,945 INFO L280 TraceCheckUtils]: 0: Hoare triple {958#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {951#true} is VALID [2020-07-10 15:08:18,946 INFO L280 TraceCheckUtils]: 1: Hoare triple {951#true} assume true; {951#true} is VALID [2020-07-10 15:08:18,946 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {951#true} {951#true} #331#return; {951#true} is VALID [2020-07-10 15:08:18,947 INFO L263 TraceCheckUtils]: 0: Hoare triple {951#true} call ULTIMATE.init(); {958#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:08:18,948 INFO L280 TraceCheckUtils]: 1: Hoare triple {958#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {951#true} is VALID [2020-07-10 15:08:18,948 INFO L280 TraceCheckUtils]: 2: Hoare triple {951#true} assume true; {951#true} is VALID [2020-07-10 15:08:18,948 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {951#true} {951#true} #331#return; {951#true} is VALID [2020-07-10 15:08:18,949 INFO L263 TraceCheckUtils]: 4: Hoare triple {951#true} call #t~ret28 := main(); {951#true} is VALID [2020-07-10 15:08:18,949 INFO L280 TraceCheckUtils]: 5: Hoare triple {951#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4);call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); {951#true} is VALID [2020-07-10 15:08:18,949 INFO L280 TraceCheckUtils]: 6: Hoare triple {951#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {951#true} is VALID [2020-07-10 15:08:18,949 INFO L280 TraceCheckUtils]: 7: Hoare triple {951#true} goto; {951#true} is VALID [2020-07-10 15:08:18,950 INFO L280 TraceCheckUtils]: 8: Hoare triple {951#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {951#true} is VALID [2020-07-10 15:08:18,951 INFO L280 TraceCheckUtils]: 9: Hoare triple {951#true} assume 0 != #t~nondet1;havoc #t~nondet1;call write~$Pointer$(0, 0, ~list~0.base, 8 + ~list~0.offset, 4); {956#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 15:08:18,952 INFO L280 TraceCheckUtils]: 10: Hoare triple {956#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {956#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 15:08:18,953 INFO L280 TraceCheckUtils]: 11: Hoare triple {956#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !#t~short7;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);#t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {957#|main_#t~short7|} is VALID [2020-07-10 15:08:18,954 INFO L280 TraceCheckUtils]: 12: Hoare triple {957#|main_#t~short7|} assume !#t~short7;havoc #t~short7;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {952#false} is VALID [2020-07-10 15:08:18,954 INFO L280 TraceCheckUtils]: 13: Hoare triple {952#false} assume !false; {952#false} is VALID [2020-07-10 15:08:18,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:08:18,956 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684573216] [2020-07-10 15:08:18,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:08:18,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:08:18,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748650341] [2020-07-10 15:08:18,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-10 15:08:18,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:08:18,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:08:18,972 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:18,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:08:18,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:08:18,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:08:18,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:08:18,973 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 5 states. [2020-07-10 15:08:19,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:19,633 INFO L93 Difference]: Finished difference Result 138 states and 153 transitions. [2020-07-10 15:08:19,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:08:19,633 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-10 15:08:19,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:08:19,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:08:19,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 152 transitions. [2020-07-10 15:08:19,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:08:19,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 152 transitions. [2020-07-10 15:08:19,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 152 transitions. [2020-07-10 15:08:19,825 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:19,830 INFO L225 Difference]: With dead ends: 138 [2020-07-10 15:08:19,830 INFO L226 Difference]: Without dead ends: 136 [2020-07-10 15:08:19,831 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:08:19,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-07-10 15:08:19,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 84. [2020-07-10 15:08:19,852 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:08:19,852 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand 84 states. [2020-07-10 15:08:19,853 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 84 states. [2020-07-10 15:08:19,853 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 84 states. [2020-07-10 15:08:19,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:19,859 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2020-07-10 15:08:19,859 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 151 transitions. [2020-07-10 15:08:19,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:19,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:19,861 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 136 states. [2020-07-10 15:08:19,861 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 136 states. [2020-07-10 15:08:19,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:19,867 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2020-07-10 15:08:19,868 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 151 transitions. [2020-07-10 15:08:19,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:19,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:19,869 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:08:19,869 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:08:19,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-07-10 15:08:19,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2020-07-10 15:08:19,873 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 14 [2020-07-10 15:08:19,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:08:19,873 INFO L479 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2020-07-10 15:08:19,873 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:08:19,873 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2020-07-10 15:08:19,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-10 15:08:19,874 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:08:19,874 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:08:19,874 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:08:19,875 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 15:08:19,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:08:19,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1462880870, now seen corresponding path program 1 times [2020-07-10 15:08:19,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:08:19,876 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075090183] [2020-07-10 15:08:19,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:08:19,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:19,973 INFO L280 TraceCheckUtils]: 0: Hoare triple {1488#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1481#true} is VALID [2020-07-10 15:08:19,974 INFO L280 TraceCheckUtils]: 1: Hoare triple {1481#true} assume true; {1481#true} is VALID [2020-07-10 15:08:19,974 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1481#true} {1481#true} #331#return; {1481#true} is VALID [2020-07-10 15:08:19,976 INFO L263 TraceCheckUtils]: 0: Hoare triple {1481#true} call ULTIMATE.init(); {1488#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:08:19,976 INFO L280 TraceCheckUtils]: 1: Hoare triple {1488#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1481#true} is VALID [2020-07-10 15:08:19,976 INFO L280 TraceCheckUtils]: 2: Hoare triple {1481#true} assume true; {1481#true} is VALID [2020-07-10 15:08:19,977 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1481#true} {1481#true} #331#return; {1481#true} is VALID [2020-07-10 15:08:19,977 INFO L263 TraceCheckUtils]: 4: Hoare triple {1481#true} call #t~ret28 := main(); {1481#true} is VALID [2020-07-10 15:08:19,977 INFO L280 TraceCheckUtils]: 5: Hoare triple {1481#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4);call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); {1481#true} is VALID [2020-07-10 15:08:19,978 INFO L280 TraceCheckUtils]: 6: Hoare triple {1481#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {1481#true} is VALID [2020-07-10 15:08:19,978 INFO L280 TraceCheckUtils]: 7: Hoare triple {1481#true} goto; {1481#true} is VALID [2020-07-10 15:08:19,978 INFO L280 TraceCheckUtils]: 8: Hoare triple {1481#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1481#true} is VALID [2020-07-10 15:08:19,978 INFO L280 TraceCheckUtils]: 9: Hoare triple {1481#true} assume !(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~list~0.base, 8 + ~list~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4);havoc #t~mem3.base, #t~mem3.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);call write~$Pointer$(0, 0, #t~mem4.base, 8 + #t~mem4.offset, 4);havoc #t~mem4.base, #t~mem4.offset; {1481#true} is VALID [2020-07-10 15:08:19,981 INFO L280 TraceCheckUtils]: 10: Hoare triple {1481#true} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {1486#(or |main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))))} is VALID [2020-07-10 15:08:19,982 INFO L280 TraceCheckUtils]: 11: Hoare triple {1486#(or |main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8)))))} assume !#t~short7;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);#t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {1487#|main_#t~short7|} is VALID [2020-07-10 15:08:19,982 INFO L280 TraceCheckUtils]: 12: Hoare triple {1487#|main_#t~short7|} assume !#t~short7;havoc #t~short7;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {1482#false} is VALID [2020-07-10 15:08:19,982 INFO L280 TraceCheckUtils]: 13: Hoare triple {1482#false} assume !false; {1482#false} is VALID [2020-07-10 15:08:19,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:08:19,983 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075090183] [2020-07-10 15:08:19,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:08:19,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:08:19,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709423421] [2020-07-10 15:08:19,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-10 15:08:19,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:08:19,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:08:20,003 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:20,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:08:20,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:08:20,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:08:20,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:08:20,005 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand 5 states. [2020-07-10 15:08:20,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:20,418 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2020-07-10 15:08:20,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:08:20,418 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-10 15:08:20,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:08:20,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:08:20,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2020-07-10 15:08:20,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:08:20,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2020-07-10 15:08:20,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 91 transitions. [2020-07-10 15:08:20,521 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:20,523 INFO L225 Difference]: With dead ends: 84 [2020-07-10 15:08:20,523 INFO L226 Difference]: Without dead ends: 82 [2020-07-10 15:08:20,524 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:08:20,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-07-10 15:08:20,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2020-07-10 15:08:20,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:08:20,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 79 states. [2020-07-10 15:08:20,545 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 79 states. [2020-07-10 15:08:20,545 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 79 states. [2020-07-10 15:08:20,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:20,549 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2020-07-10 15:08:20,549 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2020-07-10 15:08:20,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:20,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:20,549 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 82 states. [2020-07-10 15:08:20,550 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 82 states. [2020-07-10 15:08:20,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:20,553 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2020-07-10 15:08:20,553 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2020-07-10 15:08:20,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:20,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:20,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:08:20,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:08:20,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-07-10 15:08:20,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2020-07-10 15:08:20,557 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 14 [2020-07-10 15:08:20,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:08:20,557 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2020-07-10 15:08:20,557 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:08:20,558 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2020-07-10 15:08:20,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-10 15:08:20,558 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:08:20,558 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:08:20,558 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 15:08:20,559 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 15:08:20,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:08:20,559 INFO L82 PathProgramCache]: Analyzing trace with hash 177734485, now seen corresponding path program 1 times [2020-07-10 15:08:20,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:08:20,560 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856168718] [2020-07-10 15:08:20,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:08:20,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:20,647 INFO L280 TraceCheckUtils]: 0: Hoare triple {1845#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1838#true} is VALID [2020-07-10 15:08:20,648 INFO L280 TraceCheckUtils]: 1: Hoare triple {1838#true} assume true; {1838#true} is VALID [2020-07-10 15:08:20,648 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1838#true} {1838#true} #331#return; {1838#true} is VALID [2020-07-10 15:08:20,649 INFO L263 TraceCheckUtils]: 0: Hoare triple {1838#true} call ULTIMATE.init(); {1845#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:08:20,649 INFO L280 TraceCheckUtils]: 1: Hoare triple {1845#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1838#true} is VALID [2020-07-10 15:08:20,650 INFO L280 TraceCheckUtils]: 2: Hoare triple {1838#true} assume true; {1838#true} is VALID [2020-07-10 15:08:20,650 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1838#true} {1838#true} #331#return; {1838#true} is VALID [2020-07-10 15:08:20,650 INFO L263 TraceCheckUtils]: 4: Hoare triple {1838#true} call #t~ret28 := main(); {1838#true} is VALID [2020-07-10 15:08:20,651 INFO L280 TraceCheckUtils]: 5: Hoare triple {1838#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4);call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); {1838#true} is VALID [2020-07-10 15:08:20,651 INFO L280 TraceCheckUtils]: 6: Hoare triple {1838#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {1838#true} is VALID [2020-07-10 15:08:20,651 INFO L280 TraceCheckUtils]: 7: Hoare triple {1838#true} goto; {1838#true} is VALID [2020-07-10 15:08:20,651 INFO L280 TraceCheckUtils]: 8: Hoare triple {1838#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1838#true} is VALID [2020-07-10 15:08:20,653 INFO L280 TraceCheckUtils]: 9: Hoare triple {1838#true} assume 0 != #t~nondet1;havoc #t~nondet1;call write~$Pointer$(0, 0, ~list~0.base, 8 + ~list~0.offset, 4); {1843#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 15:08:20,654 INFO L280 TraceCheckUtils]: 10: Hoare triple {1843#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {1844#(not |main_#t~short7|)} is VALID [2020-07-10 15:08:20,655 INFO L280 TraceCheckUtils]: 11: Hoare triple {1844#(not |main_#t~short7|)} assume #t~short7; {1839#false} is VALID [2020-07-10 15:08:20,656 INFO L280 TraceCheckUtils]: 12: Hoare triple {1839#false} assume !!#t~short7;havoc #t~short7;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {1839#false} is VALID [2020-07-10 15:08:20,656 INFO L280 TraceCheckUtils]: 13: Hoare triple {1839#false} goto; {1839#false} is VALID [2020-07-10 15:08:20,656 INFO L280 TraceCheckUtils]: 14: Hoare triple {1839#false} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1839#false} is VALID [2020-07-10 15:08:20,656 INFO L280 TraceCheckUtils]: 15: Hoare triple {1839#false} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {1839#false} is VALID [2020-07-10 15:08:20,657 INFO L280 TraceCheckUtils]: 16: Hoare triple {1839#false} assume !!(0 != #t~nondet8);havoc #t~nondet8;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~end~0.base, ~end~0.offset, 4);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem10.base, 4 + #t~mem10.offset, 4);havoc #t~mem10.base, #t~mem10.offset;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); {1839#false} is VALID [2020-07-10 15:08:20,657 INFO L280 TraceCheckUtils]: 17: Hoare triple {1839#false} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {1839#false} is VALID [2020-07-10 15:08:20,657 INFO L280 TraceCheckUtils]: 18: Hoare triple {1839#false} assume !false; {1839#false} is VALID [2020-07-10 15:08:20,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:08:20,658 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856168718] [2020-07-10 15:08:20,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:08:20,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:08:20,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398768376] [2020-07-10 15:08:20,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-10 15:08:20,660 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:08:20,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:08:20,680 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:20,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:08:20,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:08:20,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:08:20,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:08:20,682 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand 5 states. [2020-07-10 15:08:21,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:21,317 INFO L93 Difference]: Finished difference Result 199 states and 221 transitions. [2020-07-10 15:08:21,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:08:21,317 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-10 15:08:21,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:08:21,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:08:21,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 221 transitions. [2020-07-10 15:08:21,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:08:21,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 221 transitions. [2020-07-10 15:08:21,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 221 transitions. [2020-07-10 15:08:21,609 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:21,612 INFO L225 Difference]: With dead ends: 199 [2020-07-10 15:08:21,612 INFO L226 Difference]: Without dead ends: 132 [2020-07-10 15:08:21,613 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:08:21,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-07-10 15:08:21,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 81. [2020-07-10 15:08:21,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:08:21,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand 81 states. [2020-07-10 15:08:21,632 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 81 states. [2020-07-10 15:08:21,632 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 81 states. [2020-07-10 15:08:21,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:21,637 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2020-07-10 15:08:21,637 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 146 transitions. [2020-07-10 15:08:21,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:21,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:21,638 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 132 states. [2020-07-10 15:08:21,638 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 132 states. [2020-07-10 15:08:21,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:21,643 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2020-07-10 15:08:21,643 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 146 transitions. [2020-07-10 15:08:21,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:21,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:21,644 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:08:21,644 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:08:21,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-07-10 15:08:21,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2020-07-10 15:08:21,647 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 19 [2020-07-10 15:08:21,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:08:21,647 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2020-07-10 15:08:21,647 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:08:21,647 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2020-07-10 15:08:21,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-10 15:08:21,648 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:08:21,648 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:08:21,648 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 15:08:21,648 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 15:08:21,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:08:21,649 INFO L82 PathProgramCache]: Analyzing trace with hash -631612141, now seen corresponding path program 1 times [2020-07-10 15:08:21,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:08:21,649 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940864657] [2020-07-10 15:08:21,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:08:21,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:21,764 INFO L280 TraceCheckUtils]: 0: Hoare triple {2431#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2423#true} is VALID [2020-07-10 15:08:21,764 INFO L280 TraceCheckUtils]: 1: Hoare triple {2423#true} assume true; {2423#true} is VALID [2020-07-10 15:08:21,764 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2423#true} {2423#true} #331#return; {2423#true} is VALID [2020-07-10 15:08:21,766 INFO L263 TraceCheckUtils]: 0: Hoare triple {2423#true} call ULTIMATE.init(); {2431#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:08:21,767 INFO L280 TraceCheckUtils]: 1: Hoare triple {2431#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2423#true} is VALID [2020-07-10 15:08:21,767 INFO L280 TraceCheckUtils]: 2: Hoare triple {2423#true} assume true; {2423#true} is VALID [2020-07-10 15:08:21,767 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2423#true} {2423#true} #331#return; {2423#true} is VALID [2020-07-10 15:08:21,767 INFO L263 TraceCheckUtils]: 4: Hoare triple {2423#true} call #t~ret28 := main(); {2423#true} is VALID [2020-07-10 15:08:21,769 INFO L280 TraceCheckUtils]: 5: Hoare triple {2423#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4);call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); {2428#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-10 15:08:21,770 INFO L280 TraceCheckUtils]: 6: Hoare triple {2428#(= 1 (select |#valid| main_~list~0.base))} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {2428#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-10 15:08:21,771 INFO L280 TraceCheckUtils]: 7: Hoare triple {2428#(= 1 (select |#valid| main_~list~0.base))} goto; {2428#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-10 15:08:21,772 INFO L280 TraceCheckUtils]: 8: Hoare triple {2428#(= 1 (select |#valid| main_~list~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2428#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-10 15:08:21,772 INFO L280 TraceCheckUtils]: 9: Hoare triple {2428#(= 1 (select |#valid| main_~list~0.base))} assume 0 != #t~nondet1;havoc #t~nondet1;call write~$Pointer$(0, 0, ~list~0.base, 8 + ~list~0.offset, 4); {2428#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-10 15:08:21,773 INFO L280 TraceCheckUtils]: 10: Hoare triple {2428#(= 1 (select |#valid| main_~list~0.base))} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {2428#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-10 15:08:21,774 INFO L280 TraceCheckUtils]: 11: Hoare triple {2428#(= 1 (select |#valid| main_~list~0.base))} assume !#t~short7;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);#t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {2428#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-10 15:08:21,774 INFO L280 TraceCheckUtils]: 12: Hoare triple {2428#(= 1 (select |#valid| main_~list~0.base))} assume !!#t~short7;havoc #t~short7;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {2428#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-10 15:08:21,775 INFO L280 TraceCheckUtils]: 13: Hoare triple {2428#(= 1 (select |#valid| main_~list~0.base))} goto; {2428#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-10 15:08:21,776 INFO L280 TraceCheckUtils]: 14: Hoare triple {2428#(= 1 (select |#valid| main_~list~0.base))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {2429#(= 1 (select |#valid| main_~end~0.base))} is VALID [2020-07-10 15:08:21,777 INFO L280 TraceCheckUtils]: 15: Hoare triple {2429#(= 1 (select |#valid| main_~end~0.base))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {2429#(= 1 (select |#valid| main_~end~0.base))} is VALID [2020-07-10 15:08:21,779 INFO L280 TraceCheckUtils]: 16: Hoare triple {2429#(= 1 (select |#valid| main_~end~0.base))} assume !!(0 != #t~nondet8);havoc #t~nondet8;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~end~0.base, ~end~0.offset, 4);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem10.base, 4 + #t~mem10.offset, 4);havoc #t~mem10.base, #t~mem10.offset;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); {2430#(not (= 0 main_~end~0.base))} is VALID [2020-07-10 15:08:21,781 INFO L280 TraceCheckUtils]: 17: Hoare triple {2430#(not (= 0 main_~end~0.base))} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {2424#false} is VALID [2020-07-10 15:08:21,781 INFO L280 TraceCheckUtils]: 18: Hoare triple {2424#false} assume !false; {2424#false} is VALID [2020-07-10 15:08:21,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:08:21,782 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940864657] [2020-07-10 15:08:21,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:08:21,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:08:21,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838993609] [2020-07-10 15:08:21,783 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-07-10 15:08:21,784 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:08:21,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:08:21,808 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:21,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:08:21,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:08:21,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:08:21,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:08:21,809 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 6 states. [2020-07-10 15:08:22,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:22,422 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2020-07-10 15:08:22,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:08:22,423 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-07-10 15:08:22,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:08:22,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:08:22,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2020-07-10 15:08:22,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:08:22,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2020-07-10 15:08:22,427 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 138 transitions. [2020-07-10 15:08:22,595 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:22,598 INFO L225 Difference]: With dead ends: 126 [2020-07-10 15:08:22,598 INFO L226 Difference]: Without dead ends: 122 [2020-07-10 15:08:22,599 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 15:08:22,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-07-10 15:08:22,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 77. [2020-07-10 15:08:22,623 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:08:22,623 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand 77 states. [2020-07-10 15:08:22,624 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 77 states. [2020-07-10 15:08:22,624 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 77 states. [2020-07-10 15:08:22,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:22,628 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2020-07-10 15:08:22,628 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2020-07-10 15:08:22,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:22,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:22,629 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 122 states. [2020-07-10 15:08:22,629 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 122 states. [2020-07-10 15:08:22,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:22,632 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2020-07-10 15:08:22,632 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2020-07-10 15:08:22,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:22,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:22,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:08:22,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:08:22,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-07-10 15:08:22,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2020-07-10 15:08:22,635 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 19 [2020-07-10 15:08:22,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:08:22,636 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2020-07-10 15:08:22,636 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:08:22,636 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2020-07-10 15:08:22,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-10 15:08:22,636 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:08:22,637 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:08:22,637 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 15:08:22,637 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 15:08:22,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:08:22,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1894864309, now seen corresponding path program 1 times [2020-07-10 15:08:22,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:08:22,638 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432102824] [2020-07-10 15:08:22,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:08:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:22,711 INFO L280 TraceCheckUtils]: 0: Hoare triple {2915#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2908#true} is VALID [2020-07-10 15:08:22,711 INFO L280 TraceCheckUtils]: 1: Hoare triple {2908#true} assume true; {2908#true} is VALID [2020-07-10 15:08:22,711 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2908#true} {2908#true} #331#return; {2908#true} is VALID [2020-07-10 15:08:22,712 INFO L263 TraceCheckUtils]: 0: Hoare triple {2908#true} call ULTIMATE.init(); {2915#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:08:22,713 INFO L280 TraceCheckUtils]: 1: Hoare triple {2915#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2908#true} is VALID [2020-07-10 15:08:22,713 INFO L280 TraceCheckUtils]: 2: Hoare triple {2908#true} assume true; {2908#true} is VALID [2020-07-10 15:08:22,713 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2908#true} {2908#true} #331#return; {2908#true} is VALID [2020-07-10 15:08:22,713 INFO L263 TraceCheckUtils]: 4: Hoare triple {2908#true} call #t~ret28 := main(); {2908#true} is VALID [2020-07-10 15:08:22,715 INFO L280 TraceCheckUtils]: 5: Hoare triple {2908#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4);call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); {2913#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 15:08:22,715 INFO L280 TraceCheckUtils]: 6: Hoare triple {2913#(not (= 0 main_~list~0.base))} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {2913#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 15:08:22,716 INFO L280 TraceCheckUtils]: 7: Hoare triple {2913#(not (= 0 main_~list~0.base))} goto; {2913#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 15:08:22,716 INFO L280 TraceCheckUtils]: 8: Hoare triple {2913#(not (= 0 main_~list~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2913#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 15:08:22,717 INFO L280 TraceCheckUtils]: 9: Hoare triple {2913#(not (= 0 main_~list~0.base))} assume 0 != #t~nondet1;havoc #t~nondet1;call write~$Pointer$(0, 0, ~list~0.base, 8 + ~list~0.offset, 4); {2913#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 15:08:22,717 INFO L280 TraceCheckUtils]: 10: Hoare triple {2913#(not (= 0 main_~list~0.base))} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {2913#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 15:08:22,718 INFO L280 TraceCheckUtils]: 11: Hoare triple {2913#(not (= 0 main_~list~0.base))} assume !#t~short7;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);#t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {2913#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 15:08:22,719 INFO L280 TraceCheckUtils]: 12: Hoare triple {2913#(not (= 0 main_~list~0.base))} assume !!#t~short7;havoc #t~short7;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {2913#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 15:08:22,719 INFO L280 TraceCheckUtils]: 13: Hoare triple {2913#(not (= 0 main_~list~0.base))} goto; {2913#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 15:08:22,720 INFO L280 TraceCheckUtils]: 14: Hoare triple {2913#(not (= 0 main_~list~0.base))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {2913#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 15:08:22,720 INFO L280 TraceCheckUtils]: 15: Hoare triple {2913#(not (= 0 main_~list~0.base))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {2913#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 15:08:22,721 INFO L280 TraceCheckUtils]: 16: Hoare triple {2913#(not (= 0 main_~list~0.base))} assume !(0 != #t~nondet8);havoc #t~nondet8; {2913#(not (= 0 main_~list~0.base))} is VALID [2020-07-10 15:08:22,722 INFO L280 TraceCheckUtils]: 17: Hoare triple {2913#(not (= 0 main_~list~0.base))} ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {2914#(not (= 0 main_~end~0.base))} is VALID [2020-07-10 15:08:22,722 INFO L280 TraceCheckUtils]: 18: Hoare triple {2914#(not (= 0 main_~end~0.base))} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {2909#false} is VALID [2020-07-10 15:08:22,723 INFO L280 TraceCheckUtils]: 19: Hoare triple {2909#false} assume !false; {2909#false} is VALID [2020-07-10 15:08:22,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:08:22,724 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432102824] [2020-07-10 15:08:22,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:08:22,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:08:22,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46709152] [2020-07-10 15:08:22,725 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-10 15:08:22,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:08:22,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:08:22,764 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:22,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:08:22,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:08:22,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:08:22,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:08:22,765 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 5 states. [2020-07-10 15:08:23,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:23,206 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2020-07-10 15:08:23,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:08:23,206 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-10 15:08:23,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:08:23,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:08:23,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 148 transitions. [2020-07-10 15:08:23,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:08:23,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 148 transitions. [2020-07-10 15:08:23,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 148 transitions. [2020-07-10 15:08:23,393 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:23,396 INFO L225 Difference]: With dead ends: 136 [2020-07-10 15:08:23,397 INFO L226 Difference]: Without dead ends: 116 [2020-07-10 15:08:23,397 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:08:23,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-07-10 15:08:23,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 76. [2020-07-10 15:08:23,433 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:08:23,433 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand 76 states. [2020-07-10 15:08:23,433 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 76 states. [2020-07-10 15:08:23,433 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 76 states. [2020-07-10 15:08:23,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:23,437 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2020-07-10 15:08:23,438 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 128 transitions. [2020-07-10 15:08:23,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:23,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:23,438 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 116 states. [2020-07-10 15:08:23,438 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 116 states. [2020-07-10 15:08:23,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:23,443 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2020-07-10 15:08:23,443 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 128 transitions. [2020-07-10 15:08:23,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:23,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:23,444 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:08:23,444 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:08:23,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-10 15:08:23,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2020-07-10 15:08:23,450 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 20 [2020-07-10 15:08:23,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:08:23,450 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2020-07-10 15:08:23,450 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:08:23,450 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2020-07-10 15:08:23,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 15:08:23,451 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:08:23,451 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 15:08:23,451 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-10 15:08:23,451 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 15:08:23,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:08:23,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1337316768, now seen corresponding path program 1 times [2020-07-10 15:08:23,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:08:23,453 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987133546] [2020-07-10 15:08:23,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:08:23,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:23,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:23,593 INFO L280 TraceCheckUtils]: 0: Hoare triple {3393#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3387#true} is VALID [2020-07-10 15:08:23,594 INFO L280 TraceCheckUtils]: 1: Hoare triple {3387#true} assume true; {3387#true} is VALID [2020-07-10 15:08:23,594 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3387#true} {3387#true} #331#return; {3387#true} is VALID [2020-07-10 15:08:23,595 INFO L263 TraceCheckUtils]: 0: Hoare triple {3387#true} call ULTIMATE.init(); {3393#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:08:23,595 INFO L280 TraceCheckUtils]: 1: Hoare triple {3393#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3387#true} is VALID [2020-07-10 15:08:23,596 INFO L280 TraceCheckUtils]: 2: Hoare triple {3387#true} assume true; {3387#true} is VALID [2020-07-10 15:08:23,596 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3387#true} {3387#true} #331#return; {3387#true} is VALID [2020-07-10 15:08:23,597 INFO L263 TraceCheckUtils]: 4: Hoare triple {3387#true} call #t~ret28 := main(); {3387#true} is VALID [2020-07-10 15:08:23,597 INFO L280 TraceCheckUtils]: 5: Hoare triple {3387#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4);call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); {3387#true} is VALID [2020-07-10 15:08:23,597 INFO L280 TraceCheckUtils]: 6: Hoare triple {3387#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {3387#true} is VALID [2020-07-10 15:08:23,598 INFO L280 TraceCheckUtils]: 7: Hoare triple {3387#true} goto; {3387#true} is VALID [2020-07-10 15:08:23,598 INFO L280 TraceCheckUtils]: 8: Hoare triple {3387#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3387#true} is VALID [2020-07-10 15:08:23,598 INFO L280 TraceCheckUtils]: 9: Hoare triple {3387#true} assume 0 != #t~nondet1;havoc #t~nondet1;call write~$Pointer$(0, 0, ~list~0.base, 8 + ~list~0.offset, 4); {3387#true} is VALID [2020-07-10 15:08:23,598 INFO L280 TraceCheckUtils]: 10: Hoare triple {3387#true} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {3387#true} is VALID [2020-07-10 15:08:23,598 INFO L280 TraceCheckUtils]: 11: Hoare triple {3387#true} assume !#t~short7;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);#t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {3387#true} is VALID [2020-07-10 15:08:23,599 INFO L280 TraceCheckUtils]: 12: Hoare triple {3387#true} assume !!#t~short7;havoc #t~short7;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {3387#true} is VALID [2020-07-10 15:08:23,599 INFO L280 TraceCheckUtils]: 13: Hoare triple {3387#true} goto; {3387#true} is VALID [2020-07-10 15:08:23,599 INFO L280 TraceCheckUtils]: 14: Hoare triple {3387#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {3387#true} is VALID [2020-07-10 15:08:23,599 INFO L280 TraceCheckUtils]: 15: Hoare triple {3387#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {3387#true} is VALID [2020-07-10 15:08:23,600 INFO L280 TraceCheckUtils]: 16: Hoare triple {3387#true} assume !(0 != #t~nondet8);havoc #t~nondet8; {3387#true} is VALID [2020-07-10 15:08:23,600 INFO L280 TraceCheckUtils]: 17: Hoare triple {3387#true} ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {3387#true} is VALID [2020-07-10 15:08:23,600 INFO L280 TraceCheckUtils]: 18: Hoare triple {3387#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {3387#true} is VALID [2020-07-10 15:08:23,600 INFO L280 TraceCheckUtils]: 19: Hoare triple {3387#true} goto; {3387#true} is VALID [2020-07-10 15:08:23,602 INFO L280 TraceCheckUtils]: 20: Hoare triple {3387#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset);~len~0 := 0;call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~end~0.base, 8 + ~end~0.offset, 4);~inner~0.base, ~inner~0.offset := #t~mem19.base, #t~mem19.offset;havoc #t~mem19.base, #t~mem19.offset; {3392#(= 0 main_~len~0)} is VALID [2020-07-10 15:08:23,603 INFO L280 TraceCheckUtils]: 21: Hoare triple {3392#(= 0 main_~len~0)} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {3392#(= 0 main_~len~0)} is VALID [2020-07-10 15:08:23,603 INFO L280 TraceCheckUtils]: 22: Hoare triple {3392#(= 0 main_~len~0)} assume !(~len~0 <= 1); {3388#false} is VALID [2020-07-10 15:08:23,603 INFO L280 TraceCheckUtils]: 23: Hoare triple {3388#false} assume !false; {3388#false} is VALID [2020-07-10 15:08:23,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:08:23,605 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987133546] [2020-07-10 15:08:23,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:08:23,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 15:08:23,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368956214] [2020-07-10 15:08:23,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-07-10 15:08:23,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:08:23,606 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:08:23,628 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 15:08:23,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:08:23,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:08:23,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:08:23,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:08:23,630 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand 4 states. [2020-07-10 15:08:23,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:23,956 INFO L93 Difference]: Finished difference Result 141 states and 159 transitions. [2020-07-10 15:08:23,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 15:08:23,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-07-10 15:08:23,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:08:23,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:08:23,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2020-07-10 15:08:23,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:08:23,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2020-07-10 15:08:23,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 156 transitions. [2020-07-10 15:08:24,138 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:24,141 INFO L225 Difference]: With dead ends: 141 [2020-07-10 15:08:24,141 INFO L226 Difference]: Without dead ends: 100 [2020-07-10 15:08:24,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 15:08:24,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-07-10 15:08:24,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 79. [2020-07-10 15:08:24,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:08:24,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand 79 states. [2020-07-10 15:08:24,182 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 79 states. [2020-07-10 15:08:24,182 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 79 states. [2020-07-10 15:08:24,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:24,188 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2020-07-10 15:08:24,189 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 112 transitions. [2020-07-10 15:08:24,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:24,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:24,189 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 100 states. [2020-07-10 15:08:24,189 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 100 states. [2020-07-10 15:08:24,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:24,193 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2020-07-10 15:08:24,193 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 112 transitions. [2020-07-10 15:08:24,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:24,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:24,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:08:24,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:08:24,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-07-10 15:08:24,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2020-07-10 15:08:24,197 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 24 [2020-07-10 15:08:24,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:08:24,198 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2020-07-10 15:08:24,198 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:08:24,198 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2020-07-10 15:08:24,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-10 15:08:24,199 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:08:24,199 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:08:24,199 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-10 15:08:24,199 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 15:08:24,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:08:24,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1492857654, now seen corresponding path program 1 times [2020-07-10 15:08:24,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:08:24,206 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095878295] [2020-07-10 15:08:24,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:08:24,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:24,311 INFO L280 TraceCheckUtils]: 0: Hoare triple {3847#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3841#true} is VALID [2020-07-10 15:08:24,311 INFO L280 TraceCheckUtils]: 1: Hoare triple {3841#true} assume true; {3841#true} is VALID [2020-07-10 15:08:24,311 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3841#true} {3841#true} #331#return; {3841#true} is VALID [2020-07-10 15:08:24,312 INFO L263 TraceCheckUtils]: 0: Hoare triple {3841#true} call ULTIMATE.init(); {3847#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:08:24,313 INFO L280 TraceCheckUtils]: 1: Hoare triple {3847#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3841#true} is VALID [2020-07-10 15:08:24,313 INFO L280 TraceCheckUtils]: 2: Hoare triple {3841#true} assume true; {3841#true} is VALID [2020-07-10 15:08:24,313 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3841#true} {3841#true} #331#return; {3841#true} is VALID [2020-07-10 15:08:24,313 INFO L263 TraceCheckUtils]: 4: Hoare triple {3841#true} call #t~ret28 := main(); {3841#true} is VALID [2020-07-10 15:08:24,313 INFO L280 TraceCheckUtils]: 5: Hoare triple {3841#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4);call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); {3841#true} is VALID [2020-07-10 15:08:24,314 INFO L280 TraceCheckUtils]: 6: Hoare triple {3841#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {3841#true} is VALID [2020-07-10 15:08:24,314 INFO L280 TraceCheckUtils]: 7: Hoare triple {3841#true} goto; {3841#true} is VALID [2020-07-10 15:08:24,314 INFO L280 TraceCheckUtils]: 8: Hoare triple {3841#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3841#true} is VALID [2020-07-10 15:08:24,314 INFO L280 TraceCheckUtils]: 9: Hoare triple {3841#true} assume 0 != #t~nondet1;havoc #t~nondet1;call write~$Pointer$(0, 0, ~list~0.base, 8 + ~list~0.offset, 4); {3841#true} is VALID [2020-07-10 15:08:24,315 INFO L280 TraceCheckUtils]: 10: Hoare triple {3841#true} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {3841#true} is VALID [2020-07-10 15:08:24,315 INFO L280 TraceCheckUtils]: 11: Hoare triple {3841#true} assume !#t~short7;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);#t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {3841#true} is VALID [2020-07-10 15:08:24,315 INFO L280 TraceCheckUtils]: 12: Hoare triple {3841#true} assume !!#t~short7;havoc #t~short7;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {3841#true} is VALID [2020-07-10 15:08:24,315 INFO L280 TraceCheckUtils]: 13: Hoare triple {3841#true} goto; {3841#true} is VALID [2020-07-10 15:08:24,316 INFO L280 TraceCheckUtils]: 14: Hoare triple {3841#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {3841#true} is VALID [2020-07-10 15:08:24,316 INFO L280 TraceCheckUtils]: 15: Hoare triple {3841#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {3841#true} is VALID [2020-07-10 15:08:24,316 INFO L280 TraceCheckUtils]: 16: Hoare triple {3841#true} assume !(0 != #t~nondet8);havoc #t~nondet8; {3841#true} is VALID [2020-07-10 15:08:24,316 INFO L280 TraceCheckUtils]: 17: Hoare triple {3841#true} ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {3841#true} is VALID [2020-07-10 15:08:24,316 INFO L280 TraceCheckUtils]: 18: Hoare triple {3841#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {3841#true} is VALID [2020-07-10 15:08:24,317 INFO L280 TraceCheckUtils]: 19: Hoare triple {3841#true} goto; {3841#true} is VALID [2020-07-10 15:08:24,317 INFO L280 TraceCheckUtils]: 20: Hoare triple {3841#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset);~len~0 := 0;call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~end~0.base, 8 + ~end~0.offset, 4);~inner~0.base, ~inner~0.offset := #t~mem19.base, #t~mem19.offset;havoc #t~mem19.base, #t~mem19.offset; {3841#true} is VALID [2020-07-10 15:08:24,318 INFO L280 TraceCheckUtils]: 21: Hoare triple {3841#true} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {3846#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} is VALID [2020-07-10 15:08:24,318 INFO L280 TraceCheckUtils]: 22: Hoare triple {3846#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} assume 0 == ~len~0;~len~0 := 1; {3846#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} is VALID [2020-07-10 15:08:24,319 INFO L280 TraceCheckUtils]: 23: Hoare triple {3846#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {3842#false} is VALID [2020-07-10 15:08:24,319 INFO L280 TraceCheckUtils]: 24: Hoare triple {3842#false} assume !false; {3842#false} is VALID [2020-07-10 15:08:24,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:08:24,321 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095878295] [2020-07-10 15:08:24,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:08:24,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 15:08:24,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262638591] [2020-07-10 15:08:24,327 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-07-10 15:08:24,327 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:08:24,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:08:24,354 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:24,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:08:24,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:08:24,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:08:24,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:08:24,356 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 4 states. [2020-07-10 15:08:24,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:24,663 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2020-07-10 15:08:24,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 15:08:24,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-07-10 15:08:24,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:08:24,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:08:24,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2020-07-10 15:08:24,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:08:24,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2020-07-10 15:08:24,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 82 transitions. [2020-07-10 15:08:24,756 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:24,758 INFO L225 Difference]: With dead ends: 79 [2020-07-10 15:08:24,758 INFO L226 Difference]: Without dead ends: 77 [2020-07-10 15:08:24,759 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 15:08:24,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-07-10 15:08:24,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2020-07-10 15:08:24,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:08:24,785 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 77 states. [2020-07-10 15:08:24,786 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 77 states. [2020-07-10 15:08:24,786 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 77 states. [2020-07-10 15:08:24,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:24,790 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2020-07-10 15:08:24,790 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2020-07-10 15:08:24,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:24,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:24,791 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 77 states. [2020-07-10 15:08:24,791 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 77 states. [2020-07-10 15:08:24,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:24,793 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2020-07-10 15:08:24,794 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2020-07-10 15:08:24,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:24,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:24,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:08:24,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:08:24,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-07-10 15:08:24,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2020-07-10 15:08:24,797 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 25 [2020-07-10 15:08:24,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:08:24,797 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2020-07-10 15:08:24,797 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:08:24,797 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2020-07-10 15:08:24,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 15:08:24,798 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:08:24,798 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:08:24,798 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-10 15:08:24,798 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 15:08:24,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:08:24,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1632693981, now seen corresponding path program 1 times [2020-07-10 15:08:24,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:08:24,799 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486775374] [2020-07-10 15:08:24,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:08:24,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:24,888 INFO L280 TraceCheckUtils]: 0: Hoare triple {4189#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4182#true} is VALID [2020-07-10 15:08:24,888 INFO L280 TraceCheckUtils]: 1: Hoare triple {4182#true} assume true; {4182#true} is VALID [2020-07-10 15:08:24,889 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4182#true} {4182#true} #331#return; {4182#true} is VALID [2020-07-10 15:08:24,890 INFO L263 TraceCheckUtils]: 0: Hoare triple {4182#true} call ULTIMATE.init(); {4189#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:08:24,890 INFO L280 TraceCheckUtils]: 1: Hoare triple {4189#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4182#true} is VALID [2020-07-10 15:08:24,890 INFO L280 TraceCheckUtils]: 2: Hoare triple {4182#true} assume true; {4182#true} is VALID [2020-07-10 15:08:24,890 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4182#true} {4182#true} #331#return; {4182#true} is VALID [2020-07-10 15:08:24,890 INFO L263 TraceCheckUtils]: 4: Hoare triple {4182#true} call #t~ret28 := main(); {4182#true} is VALID [2020-07-10 15:08:24,891 INFO L280 TraceCheckUtils]: 5: Hoare triple {4182#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4);call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); {4182#true} is VALID [2020-07-10 15:08:24,891 INFO L280 TraceCheckUtils]: 6: Hoare triple {4182#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {4182#true} is VALID [2020-07-10 15:08:24,891 INFO L280 TraceCheckUtils]: 7: Hoare triple {4182#true} goto; {4182#true} is VALID [2020-07-10 15:08:24,892 INFO L280 TraceCheckUtils]: 8: Hoare triple {4182#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4182#true} is VALID [2020-07-10 15:08:24,892 INFO L280 TraceCheckUtils]: 9: Hoare triple {4182#true} assume 0 != #t~nondet1;havoc #t~nondet1;call write~$Pointer$(0, 0, ~list~0.base, 8 + ~list~0.offset, 4); {4182#true} is VALID [2020-07-10 15:08:24,896 INFO L280 TraceCheckUtils]: 10: Hoare triple {4182#true} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {4182#true} is VALID [2020-07-10 15:08:24,896 INFO L280 TraceCheckUtils]: 11: Hoare triple {4182#true} assume !#t~short7;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);#t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {4182#true} is VALID [2020-07-10 15:08:24,896 INFO L280 TraceCheckUtils]: 12: Hoare triple {4182#true} assume !!#t~short7;havoc #t~short7;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {4182#true} is VALID [2020-07-10 15:08:24,897 INFO L280 TraceCheckUtils]: 13: Hoare triple {4182#true} goto; {4182#true} is VALID [2020-07-10 15:08:24,897 INFO L280 TraceCheckUtils]: 14: Hoare triple {4182#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {4182#true} is VALID [2020-07-10 15:08:24,897 INFO L280 TraceCheckUtils]: 15: Hoare triple {4182#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {4182#true} is VALID [2020-07-10 15:08:24,897 INFO L280 TraceCheckUtils]: 16: Hoare triple {4182#true} assume !!(0 != #t~nondet8);havoc #t~nondet8;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~end~0.base, ~end~0.offset, 4);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem10.base, 4 + #t~mem10.offset, 4);havoc #t~mem10.base, #t~mem10.offset;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); {4182#true} is VALID [2020-07-10 15:08:24,898 INFO L280 TraceCheckUtils]: 17: Hoare triple {4182#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {4182#true} is VALID [2020-07-10 15:08:24,898 INFO L280 TraceCheckUtils]: 18: Hoare triple {4182#true} goto; {4182#true} is VALID [2020-07-10 15:08:24,898 INFO L280 TraceCheckUtils]: 19: Hoare triple {4182#true} assume !!(~end~0.base != 0 || ~end~0.offset != 0); {4182#true} is VALID [2020-07-10 15:08:24,898 INFO L280 TraceCheckUtils]: 20: Hoare triple {4182#true} goto; {4182#true} is VALID [2020-07-10 15:08:24,898 INFO L280 TraceCheckUtils]: 21: Hoare triple {4182#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647; {4182#true} is VALID [2020-07-10 15:08:24,899 INFO L280 TraceCheckUtils]: 22: Hoare triple {4182#true} assume 0 != #t~nondet12;havoc #t~nondet12;call write~$Pointer$(0, 0, ~end~0.base, 8 + ~end~0.offset, 4); {4182#true} is VALID [2020-07-10 15:08:24,908 INFO L280 TraceCheckUtils]: 23: Hoare triple {4182#true} call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~end~0.base, 8 + ~end~0.offset, 4);#t~short18 := #t~mem16.base != 0 || #t~mem16.offset != 0; {4187#(or |main_#t~short18| (and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8)))))} is VALID [2020-07-10 15:08:24,909 INFO L280 TraceCheckUtils]: 24: Hoare triple {4187#(or |main_#t~short18| (and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8)))))} assume !#t~short18;call #t~mem17.base, #t~mem17.offset := read~$Pointer$(~end~0.base, 8 + ~end~0.offset, 4);#t~short18 := #t~mem17.base == 0 && #t~mem17.offset == 0; {4188#|main_#t~short18|} is VALID [2020-07-10 15:08:24,910 INFO L280 TraceCheckUtils]: 25: Hoare triple {4188#|main_#t~short18|} assume !#t~short18;havoc #t~mem16.base, #t~mem16.offset;havoc #t~mem17.base, #t~mem17.offset;havoc #t~short18; {4183#false} is VALID [2020-07-10 15:08:24,911 INFO L280 TraceCheckUtils]: 26: Hoare triple {4183#false} assume !false; {4183#false} is VALID [2020-07-10 15:08:24,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:08:24,913 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486775374] [2020-07-10 15:08:24,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:08:24,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:08:24,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973223571] [2020-07-10 15:08:24,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-07-10 15:08:24,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:08:24,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:08:24,940 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:24,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:08:24,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:08:24,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:08:24,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:08:24,941 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 5 states. [2020-07-10 15:08:25,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:25,286 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2020-07-10 15:08:25,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:08:25,286 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-07-10 15:08:25,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:08:25,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:08:25,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2020-07-10 15:08:25,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:08:25,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2020-07-10 15:08:25,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 81 transitions. [2020-07-10 15:08:25,383 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:25,384 INFO L225 Difference]: With dead ends: 78 [2020-07-10 15:08:25,385 INFO L226 Difference]: Without dead ends: 76 [2020-07-10 15:08:25,385 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:08:25,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-07-10 15:08:25,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2020-07-10 15:08:25,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:08:25,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 75 states. [2020-07-10 15:08:25,420 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 75 states. [2020-07-10 15:08:25,420 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 75 states. [2020-07-10 15:08:25,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:25,422 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2020-07-10 15:08:25,422 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2020-07-10 15:08:25,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:25,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:25,423 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 76 states. [2020-07-10 15:08:25,423 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 76 states. [2020-07-10 15:08:25,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:25,425 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2020-07-10 15:08:25,425 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2020-07-10 15:08:25,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:25,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:25,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:08:25,426 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:08:25,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-07-10 15:08:25,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2020-07-10 15:08:25,427 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 27 [2020-07-10 15:08:25,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:08:25,428 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2020-07-10 15:08:25,428 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:08:25,428 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2020-07-10 15:08:25,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-10 15:08:25,428 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:08:25,429 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] [2020-07-10 15:08:25,429 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-10 15:08:25,429 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 15:08:25,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:08:25,429 INFO L82 PathProgramCache]: Analyzing trace with hash 668074133, now seen corresponding path program 1 times [2020-07-10 15:08:25,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:08:25,430 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52013881] [2020-07-10 15:08:25,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:08:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:25,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:25,522 INFO L280 TraceCheckUtils]: 0: Hoare triple {4527#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4519#true} is VALID [2020-07-10 15:08:25,522 INFO L280 TraceCheckUtils]: 1: Hoare triple {4519#true} assume true; {4519#true} is VALID [2020-07-10 15:08:25,523 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4519#true} {4519#true} #331#return; {4519#true} is VALID [2020-07-10 15:08:25,524 INFO L263 TraceCheckUtils]: 0: Hoare triple {4519#true} call ULTIMATE.init(); {4527#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:08:25,524 INFO L280 TraceCheckUtils]: 1: Hoare triple {4527#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4519#true} is VALID [2020-07-10 15:08:25,524 INFO L280 TraceCheckUtils]: 2: Hoare triple {4519#true} assume true; {4519#true} is VALID [2020-07-10 15:08:25,525 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4519#true} {4519#true} #331#return; {4519#true} is VALID [2020-07-10 15:08:25,525 INFO L263 TraceCheckUtils]: 4: Hoare triple {4519#true} call #t~ret28 := main(); {4519#true} is VALID [2020-07-10 15:08:25,525 INFO L280 TraceCheckUtils]: 5: Hoare triple {4519#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4);call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); {4519#true} is VALID [2020-07-10 15:08:25,525 INFO L280 TraceCheckUtils]: 6: Hoare triple {4519#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {4519#true} is VALID [2020-07-10 15:08:25,525 INFO L280 TraceCheckUtils]: 7: Hoare triple {4519#true} goto; {4519#true} is VALID [2020-07-10 15:08:25,526 INFO L280 TraceCheckUtils]: 8: Hoare triple {4519#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4519#true} is VALID [2020-07-10 15:08:25,527 INFO L280 TraceCheckUtils]: 9: Hoare triple {4519#true} assume 0 != #t~nondet1;havoc #t~nondet1;call write~$Pointer$(0, 0, ~list~0.base, 8 + ~list~0.offset, 4); {4524#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 15:08:25,528 INFO L280 TraceCheckUtils]: 10: Hoare triple {4524#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {4524#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 15:08:25,530 INFO L280 TraceCheckUtils]: 11: Hoare triple {4524#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !#t~short7;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);#t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {4524#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 15:08:25,531 INFO L280 TraceCheckUtils]: 12: Hoare triple {4524#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !!#t~short7;havoc #t~short7;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {4524#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 15:08:25,531 INFO L280 TraceCheckUtils]: 13: Hoare triple {4524#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} goto; {4524#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 15:08:25,532 INFO L280 TraceCheckUtils]: 14: Hoare triple {4524#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {4524#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 15:08:25,533 INFO L280 TraceCheckUtils]: 15: Hoare triple {4524#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {4524#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 15:08:25,534 INFO L280 TraceCheckUtils]: 16: Hoare triple {4524#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !(0 != #t~nondet8);havoc #t~nondet8; {4524#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 15:08:25,535 INFO L280 TraceCheckUtils]: 17: Hoare triple {4524#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {4525#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))))} is VALID [2020-07-10 15:08:25,536 INFO L280 TraceCheckUtils]: 18: Hoare triple {4525#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {4525#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))))} is VALID [2020-07-10 15:08:25,537 INFO L280 TraceCheckUtils]: 19: Hoare triple {4525#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))))} goto; {4525#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))))} is VALID [2020-07-10 15:08:25,538 INFO L280 TraceCheckUtils]: 20: Hoare triple {4525#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset);~len~0 := 0;call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~end~0.base, 8 + ~end~0.offset, 4);~inner~0.base, ~inner~0.offset := #t~mem19.base, #t~mem19.offset;havoc #t~mem19.base, #t~mem19.offset; {4526#(and (= 0 main_~inner~0.base) (= 0 main_~inner~0.offset))} is VALID [2020-07-10 15:08:25,538 INFO L280 TraceCheckUtils]: 21: Hoare triple {4526#(and (= 0 main_~inner~0.base) (= 0 main_~inner~0.offset))} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {4520#false} is VALID [2020-07-10 15:08:25,539 INFO L280 TraceCheckUtils]: 22: Hoare triple {4520#false} assume 0 == ~len~0;~len~0 := 1; {4520#false} is VALID [2020-07-10 15:08:25,539 INFO L280 TraceCheckUtils]: 23: Hoare triple {4520#false} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {4520#false} is VALID [2020-07-10 15:08:25,539 INFO L280 TraceCheckUtils]: 24: Hoare triple {4520#false} goto; {4520#false} is VALID [2020-07-10 15:08:25,539 INFO L280 TraceCheckUtils]: 25: Hoare triple {4520#false} call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~inner~0.base, 8 + ~inner~0.offset, 4); {4520#false} is VALID [2020-07-10 15:08:25,539 INFO L280 TraceCheckUtils]: 26: Hoare triple {4520#false} assume !(0 == #t~mem20.base && 0 == #t~mem20.offset);havoc #t~mem20.base, #t~mem20.offset; {4520#false} is VALID [2020-07-10 15:08:25,540 INFO L280 TraceCheckUtils]: 27: Hoare triple {4520#false} assume !false; {4520#false} is VALID [2020-07-10 15:08:25,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:08:25,543 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52013881] [2020-07-10 15:08:25,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:08:25,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:08:25,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196084410] [2020-07-10 15:08:25,544 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-07-10 15:08:25,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:08:25,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:08:25,575 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:25,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:08:25,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:08:25,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:08:25,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:08:25,576 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 6 states. [2020-07-10 15:08:26,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:26,552 INFO L93 Difference]: Finished difference Result 179 states and 203 transitions. [2020-07-10 15:08:26,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 15:08:26,552 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-07-10 15:08:26,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:08:26,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:08:26,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 191 transitions. [2020-07-10 15:08:26,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:08:26,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 191 transitions. [2020-07-10 15:08:26,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 191 transitions. [2020-07-10 15:08:26,762 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:26,765 INFO L225 Difference]: With dead ends: 179 [2020-07-10 15:08:26,765 INFO L226 Difference]: Without dead ends: 137 [2020-07-10 15:08:26,766 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:08:26,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-07-10 15:08:26,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 85. [2020-07-10 15:08:26,810 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:08:26,810 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand 85 states. [2020-07-10 15:08:26,810 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 85 states. [2020-07-10 15:08:26,811 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 85 states. [2020-07-10 15:08:26,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:26,815 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2020-07-10 15:08:26,815 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 155 transitions. [2020-07-10 15:08:26,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:26,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:26,816 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 137 states. [2020-07-10 15:08:26,816 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 137 states. [2020-07-10 15:08:26,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:26,820 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2020-07-10 15:08:26,820 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 155 transitions. [2020-07-10 15:08:26,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:26,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:26,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:08:26,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:08:26,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-07-10 15:08:26,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2020-07-10 15:08:26,823 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 28 [2020-07-10 15:08:26,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:08:26,824 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2020-07-10 15:08:26,824 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:08:26,824 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2020-07-10 15:08:26,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-10 15:08:26,824 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:08:26,825 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] [2020-07-10 15:08:26,825 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-10 15:08:26,825 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 15:08:26,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:08:26,826 INFO L82 PathProgramCache]: Analyzing trace with hash 567478293, now seen corresponding path program 1 times [2020-07-10 15:08:26,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:08:26,826 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104805722] [2020-07-10 15:08:26,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:08:26,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:27,058 INFO L280 TraceCheckUtils]: 0: Hoare triple {5119#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5109#true} is VALID [2020-07-10 15:08:27,059 INFO L280 TraceCheckUtils]: 1: Hoare triple {5109#true} assume true; {5109#true} is VALID [2020-07-10 15:08:27,059 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5109#true} {5109#true} #331#return; {5109#true} is VALID [2020-07-10 15:08:27,060 INFO L263 TraceCheckUtils]: 0: Hoare triple {5109#true} call ULTIMATE.init(); {5119#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:08:27,064 INFO L280 TraceCheckUtils]: 1: Hoare triple {5119#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5109#true} is VALID [2020-07-10 15:08:27,064 INFO L280 TraceCheckUtils]: 2: Hoare triple {5109#true} assume true; {5109#true} is VALID [2020-07-10 15:08:27,064 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5109#true} {5109#true} #331#return; {5109#true} is VALID [2020-07-10 15:08:27,064 INFO L263 TraceCheckUtils]: 4: Hoare triple {5109#true} call #t~ret28 := main(); {5109#true} is VALID [2020-07-10 15:08:27,069 INFO L280 TraceCheckUtils]: 5: Hoare triple {5109#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4);call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); {5114#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-10 15:08:27,072 INFO L280 TraceCheckUtils]: 6: Hoare triple {5114#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {5114#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-10 15:08:27,076 INFO L280 TraceCheckUtils]: 7: Hoare triple {5114#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} goto; {5114#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-10 15:08:27,079 INFO L280 TraceCheckUtils]: 8: Hoare triple {5114#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {5114#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-10 15:08:27,082 INFO L280 TraceCheckUtils]: 9: Hoare triple {5114#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} assume !(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~list~0.base, 8 + ~list~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4);havoc #t~mem3.base, #t~mem3.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);call write~$Pointer$(0, 0, #t~mem4.base, 8 + #t~mem4.offset, 4);havoc #t~mem4.base, #t~mem4.offset; {5115#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 15:08:27,083 INFO L280 TraceCheckUtils]: 10: Hoare triple {5115#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {5115#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 15:08:27,084 INFO L280 TraceCheckUtils]: 11: Hoare triple {5115#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume #t~short7; {5115#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 15:08:27,085 INFO L280 TraceCheckUtils]: 12: Hoare triple {5115#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !!#t~short7;havoc #t~short7;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {5115#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 15:08:27,086 INFO L280 TraceCheckUtils]: 13: Hoare triple {5115#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} goto; {5115#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 15:08:27,087 INFO L280 TraceCheckUtils]: 14: Hoare triple {5115#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {5115#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 15:08:27,088 INFO L280 TraceCheckUtils]: 15: Hoare triple {5115#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {5115#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 15:08:27,089 INFO L280 TraceCheckUtils]: 16: Hoare triple {5115#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !(0 != #t~nondet8);havoc #t~nondet8; {5115#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 15:08:27,090 INFO L280 TraceCheckUtils]: 17: Hoare triple {5115#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (+ main_~list~0.offset 8)) 0) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {5116#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))))} is VALID [2020-07-10 15:08:27,091 INFO L280 TraceCheckUtils]: 18: Hoare triple {5116#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {5116#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))))} is VALID [2020-07-10 15:08:27,092 INFO L280 TraceCheckUtils]: 19: Hoare triple {5116#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))))} goto; {5116#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))))} is VALID [2020-07-10 15:08:27,093 INFO L280 TraceCheckUtils]: 20: Hoare triple {5116#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))) 8)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset);~len~0 := 0;call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~end~0.base, 8 + ~end~0.offset, 4);~inner~0.base, ~inner~0.offset := #t~mem19.base, #t~mem19.offset;havoc #t~mem19.base, #t~mem19.offset; {5117#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} is VALID [2020-07-10 15:08:27,094 INFO L280 TraceCheckUtils]: 21: Hoare triple {5117#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {5117#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} is VALID [2020-07-10 15:08:27,095 INFO L280 TraceCheckUtils]: 22: Hoare triple {5117#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} assume 0 == ~len~0;~len~0 := 1; {5117#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} is VALID [2020-07-10 15:08:27,096 INFO L280 TraceCheckUtils]: 23: Hoare triple {5117#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {5117#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} is VALID [2020-07-10 15:08:27,097 INFO L280 TraceCheckUtils]: 24: Hoare triple {5117#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} goto; {5117#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} is VALID [2020-07-10 15:08:27,097 INFO L280 TraceCheckUtils]: 25: Hoare triple {5117#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 8))))} call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~inner~0.base, 8 + ~inner~0.offset, 4); {5118#(and (= 0 |main_#t~mem20.base|) (= 0 |main_#t~mem20.offset|))} is VALID [2020-07-10 15:08:27,098 INFO L280 TraceCheckUtils]: 26: Hoare triple {5118#(and (= 0 |main_#t~mem20.base|) (= 0 |main_#t~mem20.offset|))} assume !(0 == #t~mem20.base && 0 == #t~mem20.offset);havoc #t~mem20.base, #t~mem20.offset; {5110#false} is VALID [2020-07-10 15:08:27,098 INFO L280 TraceCheckUtils]: 27: Hoare triple {5110#false} assume !false; {5110#false} is VALID [2020-07-10 15:08:27,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:08:27,103 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104805722] [2020-07-10 15:08:27,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:08:27,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-10 15:08:27,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349901227] [2020-07-10 15:08:27,104 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-07-10 15:08:27,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:08:27,104 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 15:08:27,143 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:27,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 15:08:27,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:08:27,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 15:08:27,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:08:27,144 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand 8 states. [2020-07-10 15:08:29,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:29,283 INFO L93 Difference]: Finished difference Result 228 states and 252 transitions. [2020-07-10 15:08:29,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-10 15:08:29,284 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-07-10 15:08:29,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:08:29,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:08:29,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 235 transitions. [2020-07-10 15:08:29,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:08:29,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 235 transitions. [2020-07-10 15:08:29,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 235 transitions. [2020-07-10 15:08:29,752 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:29,758 INFO L225 Difference]: With dead ends: 228 [2020-07-10 15:08:29,758 INFO L226 Difference]: Without dead ends: 226 [2020-07-10 15:08:29,758 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2020-07-10 15:08:29,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2020-07-10 15:08:29,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 97. [2020-07-10 15:08:29,818 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:08:29,818 INFO L82 GeneralOperation]: Start isEquivalent. First operand 226 states. Second operand 97 states. [2020-07-10 15:08:29,818 INFO L74 IsIncluded]: Start isIncluded. First operand 226 states. Second operand 97 states. [2020-07-10 15:08:29,819 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 97 states. [2020-07-10 15:08:29,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:29,827 INFO L93 Difference]: Finished difference Result 226 states and 250 transitions. [2020-07-10 15:08:29,827 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 250 transitions. [2020-07-10 15:08:29,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:29,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:29,828 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 226 states. [2020-07-10 15:08:29,828 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 226 states. [2020-07-10 15:08:29,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:29,834 INFO L93 Difference]: Finished difference Result 226 states and 250 transitions. [2020-07-10 15:08:29,834 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 250 transitions. [2020-07-10 15:08:29,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:29,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:29,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:08:29,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:08:29,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-07-10 15:08:29,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2020-07-10 15:08:29,838 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 28 [2020-07-10 15:08:29,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:08:29,838 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2020-07-10 15:08:29,838 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 15:08:29,838 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2020-07-10 15:08:29,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 15:08:29,840 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:08:29,840 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] [2020-07-10 15:08:29,841 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-10 15:08:29,841 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 15:08:29,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:08:29,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1429819819, now seen corresponding path program 1 times [2020-07-10 15:08:29,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:08:29,842 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900616523] [2020-07-10 15:08:29,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:08:29,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:29,934 INFO L280 TraceCheckUtils]: 0: Hoare triple {5959#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5952#true} is VALID [2020-07-10 15:08:29,935 INFO L280 TraceCheckUtils]: 1: Hoare triple {5952#true} assume true; {5952#true} is VALID [2020-07-10 15:08:29,935 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5952#true} {5952#true} #331#return; {5952#true} is VALID [2020-07-10 15:08:29,936 INFO L263 TraceCheckUtils]: 0: Hoare triple {5952#true} call ULTIMATE.init(); {5959#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:08:29,936 INFO L280 TraceCheckUtils]: 1: Hoare triple {5959#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5952#true} is VALID [2020-07-10 15:08:29,937 INFO L280 TraceCheckUtils]: 2: Hoare triple {5952#true} assume true; {5952#true} is VALID [2020-07-10 15:08:29,937 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5952#true} {5952#true} #331#return; {5952#true} is VALID [2020-07-10 15:08:29,937 INFO L263 TraceCheckUtils]: 4: Hoare triple {5952#true} call #t~ret28 := main(); {5952#true} is VALID [2020-07-10 15:08:29,937 INFO L280 TraceCheckUtils]: 5: Hoare triple {5952#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4);call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); {5952#true} is VALID [2020-07-10 15:08:29,937 INFO L280 TraceCheckUtils]: 6: Hoare triple {5952#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {5952#true} is VALID [2020-07-10 15:08:29,938 INFO L280 TraceCheckUtils]: 7: Hoare triple {5952#true} goto; {5952#true} is VALID [2020-07-10 15:08:29,938 INFO L280 TraceCheckUtils]: 8: Hoare triple {5952#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {5952#true} is VALID [2020-07-10 15:08:29,939 INFO L280 TraceCheckUtils]: 9: Hoare triple {5952#true} assume 0 != #t~nondet1;havoc #t~nondet1;call write~$Pointer$(0, 0, ~list~0.base, 8 + ~list~0.offset, 4); {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 15:08:29,940 INFO L280 TraceCheckUtils]: 10: Hoare triple {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 15:08:29,942 INFO L280 TraceCheckUtils]: 11: Hoare triple {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !#t~short7;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);#t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 15:08:29,943 INFO L280 TraceCheckUtils]: 12: Hoare triple {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !!#t~short7;havoc #t~short7;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 15:08:29,943 INFO L280 TraceCheckUtils]: 13: Hoare triple {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} goto; {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 15:08:29,944 INFO L280 TraceCheckUtils]: 14: Hoare triple {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 15:08:29,945 INFO L280 TraceCheckUtils]: 15: Hoare triple {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 15:08:29,946 INFO L280 TraceCheckUtils]: 16: Hoare triple {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !(0 != #t~nondet8);havoc #t~nondet8; {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 15:08:29,947 INFO L280 TraceCheckUtils]: 17: Hoare triple {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 15:08:29,948 INFO L280 TraceCheckUtils]: 18: Hoare triple {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 15:08:29,948 INFO L280 TraceCheckUtils]: 19: Hoare triple {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} goto; {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 15:08:29,949 INFO L280 TraceCheckUtils]: 20: Hoare triple {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset);~len~0 := 0;call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~end~0.base, 8 + ~end~0.offset, 4);~inner~0.base, ~inner~0.offset := #t~mem19.base, #t~mem19.offset;havoc #t~mem19.base, #t~mem19.offset; {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 15:08:29,950 INFO L280 TraceCheckUtils]: 21: Hoare triple {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 15:08:29,951 INFO L280 TraceCheckUtils]: 22: Hoare triple {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !!(~len~0 <= 1); {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 15:08:29,952 INFO L280 TraceCheckUtils]: 23: Hoare triple {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} goto; {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 15:08:29,953 INFO L280 TraceCheckUtils]: 24: Hoare triple {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem23.base, #t~mem23.offset;havoc #t~mem23.base, #t~mem23.offset; {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 15:08:29,954 INFO L280 TraceCheckUtils]: 25: Hoare triple {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2020-07-10 15:08:29,955 INFO L280 TraceCheckUtils]: 26: Hoare triple {5957#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !!(0 != ~list~0.base || 0 != ~list~0.offset);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem24.base, #t~mem24.offset;havoc #t~mem24.base, #t~mem24.offset; {5958#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} is VALID [2020-07-10 15:08:29,956 INFO L280 TraceCheckUtils]: 27: Hoare triple {5958#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} assume 0 != ~end~0.base || 0 != ~end~0.offset; {5953#false} is VALID [2020-07-10 15:08:29,956 INFO L280 TraceCheckUtils]: 28: Hoare triple {5953#false} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {5953#false} is VALID [2020-07-10 15:08:29,956 INFO L280 TraceCheckUtils]: 29: Hoare triple {5953#false} assume !false; {5953#false} is VALID [2020-07-10 15:08:29,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-10 15:08:29,960 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900616523] [2020-07-10 15:08:29,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:08:29,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:08:29,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123463896] [2020-07-10 15:08:29,962 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-10 15:08:29,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:08:29,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:08:30,002 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:30,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:08:30,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:08:30,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:08:30,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:08:30,003 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand 5 states. [2020-07-10 15:08:30,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:30,659 INFO L93 Difference]: Finished difference Result 143 states and 162 transitions. [2020-07-10 15:08:30,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:08:30,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-10 15:08:30,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:08:30,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:08:30,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2020-07-10 15:08:30,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:08:30,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2020-07-10 15:08:30,665 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 137 transitions. [2020-07-10 15:08:30,843 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:30,845 INFO L225 Difference]: With dead ends: 143 [2020-07-10 15:08:30,846 INFO L226 Difference]: Without dead ends: 125 [2020-07-10 15:08:30,846 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:08:30,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-07-10 15:08:30,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 117. [2020-07-10 15:08:30,942 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:08:30,942 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand 117 states. [2020-07-10 15:08:30,943 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 117 states. [2020-07-10 15:08:30,943 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 117 states. [2020-07-10 15:08:30,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:30,947 INFO L93 Difference]: Finished difference Result 125 states and 142 transitions. [2020-07-10 15:08:30,947 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 142 transitions. [2020-07-10 15:08:30,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:30,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:30,948 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 125 states. [2020-07-10 15:08:30,948 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 125 states. [2020-07-10 15:08:30,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:30,951 INFO L93 Difference]: Finished difference Result 125 states and 142 transitions. [2020-07-10 15:08:30,951 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 142 transitions. [2020-07-10 15:08:30,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:30,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:30,952 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:08:30,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:08:30,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-07-10 15:08:30,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 137 transitions. [2020-07-10 15:08:30,955 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 137 transitions. Word has length 30 [2020-07-10 15:08:30,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:08:30,955 INFO L479 AbstractCegarLoop]: Abstraction has 117 states and 137 transitions. [2020-07-10 15:08:30,955 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:08:30,955 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 137 transitions. [2020-07-10 15:08:30,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 15:08:30,956 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:08:30,956 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] [2020-07-10 15:08:30,956 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-10 15:08:30,957 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 15:08:30,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:08:30,957 INFO L82 PathProgramCache]: Analyzing trace with hash -753501909, now seen corresponding path program 1 times [2020-07-10 15:08:30,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:08:30,966 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072147442] [2020-07-10 15:08:30,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:08:30,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:31,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:08:31,029 INFO L280 TraceCheckUtils]: 0: Hoare triple {6519#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {6513#true} is VALID [2020-07-10 15:08:31,030 INFO L280 TraceCheckUtils]: 1: Hoare triple {6513#true} assume true; {6513#true} is VALID [2020-07-10 15:08:31,030 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6513#true} {6513#true} #331#return; {6513#true} is VALID [2020-07-10 15:08:31,031 INFO L263 TraceCheckUtils]: 0: Hoare triple {6513#true} call ULTIMATE.init(); {6519#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:08:31,031 INFO L280 TraceCheckUtils]: 1: Hoare triple {6519#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {6513#true} is VALID [2020-07-10 15:08:31,032 INFO L280 TraceCheckUtils]: 2: Hoare triple {6513#true} assume true; {6513#true} is VALID [2020-07-10 15:08:31,032 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6513#true} {6513#true} #331#return; {6513#true} is VALID [2020-07-10 15:08:31,032 INFO L263 TraceCheckUtils]: 4: Hoare triple {6513#true} call #t~ret28 := main(); {6513#true} is VALID [2020-07-10 15:08:31,032 INFO L280 TraceCheckUtils]: 5: Hoare triple {6513#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4);call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); {6513#true} is VALID [2020-07-10 15:08:31,033 INFO L280 TraceCheckUtils]: 6: Hoare triple {6513#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {6513#true} is VALID [2020-07-10 15:08:31,033 INFO L280 TraceCheckUtils]: 7: Hoare triple {6513#true} goto; {6513#true} is VALID [2020-07-10 15:08:31,033 INFO L280 TraceCheckUtils]: 8: Hoare triple {6513#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {6513#true} is VALID [2020-07-10 15:08:31,033 INFO L280 TraceCheckUtils]: 9: Hoare triple {6513#true} assume !(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~list~0.base, 8 + ~list~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4);havoc #t~mem3.base, #t~mem3.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);call write~$Pointer$(0, 0, #t~mem4.base, 8 + #t~mem4.offset, 4);havoc #t~mem4.base, #t~mem4.offset; {6513#true} is VALID [2020-07-10 15:08:31,033 INFO L280 TraceCheckUtils]: 10: Hoare triple {6513#true} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {6513#true} is VALID [2020-07-10 15:08:31,034 INFO L280 TraceCheckUtils]: 11: Hoare triple {6513#true} assume #t~short7; {6513#true} is VALID [2020-07-10 15:08:31,034 INFO L280 TraceCheckUtils]: 12: Hoare triple {6513#true} assume !!#t~short7;havoc #t~short7;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {6513#true} is VALID [2020-07-10 15:08:31,034 INFO L280 TraceCheckUtils]: 13: Hoare triple {6513#true} goto; {6513#true} is VALID [2020-07-10 15:08:31,034 INFO L280 TraceCheckUtils]: 14: Hoare triple {6513#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {6513#true} is VALID [2020-07-10 15:08:31,035 INFO L280 TraceCheckUtils]: 15: Hoare triple {6513#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {6513#true} is VALID [2020-07-10 15:08:31,035 INFO L280 TraceCheckUtils]: 16: Hoare triple {6513#true} assume !(0 != #t~nondet8);havoc #t~nondet8; {6513#true} is VALID [2020-07-10 15:08:31,035 INFO L280 TraceCheckUtils]: 17: Hoare triple {6513#true} ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {6513#true} is VALID [2020-07-10 15:08:31,035 INFO L280 TraceCheckUtils]: 18: Hoare triple {6513#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {6513#true} is VALID [2020-07-10 15:08:31,036 INFO L280 TraceCheckUtils]: 19: Hoare triple {6513#true} goto; {6513#true} is VALID [2020-07-10 15:08:31,036 INFO L280 TraceCheckUtils]: 20: Hoare triple {6513#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset);~len~0 := 0;call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~end~0.base, 8 + ~end~0.offset, 4);~inner~0.base, ~inner~0.offset := #t~mem19.base, #t~mem19.offset;havoc #t~mem19.base, #t~mem19.offset; {6513#true} is VALID [2020-07-10 15:08:31,036 INFO L280 TraceCheckUtils]: 21: Hoare triple {6513#true} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {6513#true} is VALID [2020-07-10 15:08:31,036 INFO L280 TraceCheckUtils]: 22: Hoare triple {6513#true} assume !!(~len~0 <= 1); {6513#true} is VALID [2020-07-10 15:08:31,037 INFO L280 TraceCheckUtils]: 23: Hoare triple {6513#true} goto; {6513#true} is VALID [2020-07-10 15:08:31,037 INFO L280 TraceCheckUtils]: 24: Hoare triple {6513#true} call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem23.base, #t~mem23.offset;havoc #t~mem23.base, #t~mem23.offset; {6513#true} is VALID [2020-07-10 15:08:31,037 INFO L280 TraceCheckUtils]: 25: Hoare triple {6513#true} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {6513#true} is VALID [2020-07-10 15:08:31,038 INFO L280 TraceCheckUtils]: 26: Hoare triple {6513#true} assume !!(0 != ~list~0.base || 0 != ~list~0.offset);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~list~0.base, 8 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem24.base, #t~mem24.offset;havoc #t~mem24.base, #t~mem24.offset; {6513#true} is VALID [2020-07-10 15:08:31,039 INFO L280 TraceCheckUtils]: 27: Hoare triple {6513#true} assume 0 != ~end~0.base || 0 != ~end~0.offset; {6518#(or (not (= 0 main_~end~0.base)) (not (= 0 main_~end~0.offset)))} is VALID [2020-07-10 15:08:31,041 INFO L280 TraceCheckUtils]: 28: Hoare triple {6518#(or (not (= 0 main_~end~0.base)) (not (= 0 main_~end~0.offset)))} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {6514#false} is VALID [2020-07-10 15:08:31,041 INFO L280 TraceCheckUtils]: 29: Hoare triple {6514#false} assume !false; {6514#false} is VALID [2020-07-10 15:08:31,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-10 15:08:31,043 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072147442] [2020-07-10 15:08:31,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:08:31,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 15:08:31,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164188021] [2020-07-10 15:08:31,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2020-07-10 15:08:31,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:08:31,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:08:31,085 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:31,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:08:31,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:08:31,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:08:31,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:08:31,087 INFO L87 Difference]: Start difference. First operand 117 states and 137 transitions. Second operand 4 states. [2020-07-10 15:08:31,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:31,560 INFO L93 Difference]: Finished difference Result 117 states and 137 transitions. [2020-07-10 15:08:31,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 15:08:31,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2020-07-10 15:08:31,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:08:31,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:08:31,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2020-07-10 15:08:31,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:08:31,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2020-07-10 15:08:31,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 83 transitions. [2020-07-10 15:08:31,658 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:08:31,660 INFO L225 Difference]: With dead ends: 117 [2020-07-10 15:08:31,660 INFO L226 Difference]: Without dead ends: 115 [2020-07-10 15:08:31,660 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 15:08:31,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-07-10 15:08:31,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2020-07-10 15:08:31,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:08:31,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand 115 states. [2020-07-10 15:08:31,732 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 115 states. [2020-07-10 15:08:31,732 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 115 states. [2020-07-10 15:08:31,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:31,735 INFO L93 Difference]: Finished difference Result 115 states and 135 transitions. [2020-07-10 15:08:31,735 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 135 transitions. [2020-07-10 15:08:31,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:31,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:31,736 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 115 states. [2020-07-10 15:08:31,736 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 115 states. [2020-07-10 15:08:31,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:31,738 INFO L93 Difference]: Finished difference Result 115 states and 135 transitions. [2020-07-10 15:08:31,738 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 135 transitions. [2020-07-10 15:08:31,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:08:31,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:08:31,739 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:08:31,739 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:08:31,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-07-10 15:08:31,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 135 transitions. [2020-07-10 15:08:31,742 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 135 transitions. Word has length 30 [2020-07-10 15:08:31,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:08:31,742 INFO L479 AbstractCegarLoop]: Abstraction has 115 states and 135 transitions. [2020-07-10 15:08:31,742 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:08:31,743 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 135 transitions. [2020-07-10 15:08:31,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-10 15:08:31,743 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:08:31,743 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:08:31,743 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-10 15:08:31,744 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 15:08:31,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:08:31,744 INFO L82 PathProgramCache]: Analyzing trace with hash 758661948, now seen corresponding path program 1 times [2020-07-10 15:08:31,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:08:31,745 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080185435] [2020-07-10 15:08:31,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:08:31,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:08:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:08:31,848 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:08:31,849 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:08:31,849 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-10 15:08:31,912 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:08:31,912 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:08:31,913 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:08:31,913 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:08:31,913 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:08:31,913 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:08:31,913 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:08:31,913 WARN L170 areAnnotationChecker]: L995-4 has no Hoare annotation [2020-07-10 15:08:31,913 WARN L170 areAnnotationChecker]: L995-4 has no Hoare annotation [2020-07-10 15:08:31,913 WARN L170 areAnnotationChecker]: L995-4 has no Hoare annotation [2020-07-10 15:08:31,913 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:08:31,914 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:08:31,914 WARN L170 areAnnotationChecker]: L995-5 has no Hoare annotation [2020-07-10 15:08:31,914 WARN L170 areAnnotationChecker]: L995-1 has no Hoare annotation [2020-07-10 15:08:31,914 WARN L170 areAnnotationChecker]: L995-1 has no Hoare annotation [2020-07-10 15:08:31,914 WARN L170 areAnnotationChecker]: L995-3 has no Hoare annotation [2020-07-10 15:08:31,914 WARN L170 areAnnotationChecker]: L995-3 has no Hoare annotation [2020-07-10 15:08:31,914 WARN L170 areAnnotationChecker]: L995-6 has no Hoare annotation [2020-07-10 15:08:31,914 WARN L170 areAnnotationChecker]: L995-6 has no Hoare annotation [2020-07-10 15:08:31,914 WARN L170 areAnnotationChecker]: L995-15 has no Hoare annotation [2020-07-10 15:08:31,914 WARN L170 areAnnotationChecker]: L995-15 has no Hoare annotation [2020-07-10 15:08:31,915 WARN L170 areAnnotationChecker]: L995-9 has no Hoare annotation [2020-07-10 15:08:31,915 WARN L170 areAnnotationChecker]: L995-9 has no Hoare annotation [2020-07-10 15:08:31,915 WARN L170 areAnnotationChecker]: L995-16 has no Hoare annotation [2020-07-10 15:08:31,915 WARN L170 areAnnotationChecker]: L995-11 has no Hoare annotation [2020-07-10 15:08:31,915 WARN L170 areAnnotationChecker]: L995-11 has no Hoare annotation [2020-07-10 15:08:31,915 WARN L170 areAnnotationChecker]: L1008-15 has no Hoare annotation [2020-07-10 15:08:31,915 WARN L170 areAnnotationChecker]: L1008-15 has no Hoare annotation [2020-07-10 15:08:31,915 WARN L170 areAnnotationChecker]: L995-12 has no Hoare annotation [2020-07-10 15:08:31,915 WARN L170 areAnnotationChecker]: L995-12 has no Hoare annotation [2020-07-10 15:08:31,915 WARN L170 areAnnotationChecker]: L995-14 has no Hoare annotation [2020-07-10 15:08:31,916 WARN L170 areAnnotationChecker]: L995-14 has no Hoare annotation [2020-07-10 15:08:31,916 WARN L170 areAnnotationChecker]: L1000-3 has no Hoare annotation [2020-07-10 15:08:31,916 WARN L170 areAnnotationChecker]: L1000-1 has no Hoare annotation [2020-07-10 15:08:31,916 WARN L170 areAnnotationChecker]: L1000-1 has no Hoare annotation [2020-07-10 15:08:31,916 WARN L170 areAnnotationChecker]: L1015-4 has no Hoare annotation [2020-07-10 15:08:31,916 WARN L170 areAnnotationChecker]: L1015-4 has no Hoare annotation [2020-07-10 15:08:31,916 WARN L170 areAnnotationChecker]: L1015-4 has no Hoare annotation [2020-07-10 15:08:31,916 WARN L170 areAnnotationChecker]: L1007-4 has no Hoare annotation [2020-07-10 15:08:31,916 WARN L170 areAnnotationChecker]: L1007-4 has no Hoare annotation [2020-07-10 15:08:31,916 WARN L170 areAnnotationChecker]: L1007-4 has no Hoare annotation [2020-07-10 15:08:31,917 WARN L170 areAnnotationChecker]: L1017-1 has no Hoare annotation [2020-07-10 15:08:31,917 WARN L170 areAnnotationChecker]: L1017-1 has no Hoare annotation [2020-07-10 15:08:31,917 WARN L170 areAnnotationChecker]: L1017-1 has no Hoare annotation [2020-07-10 15:08:31,917 WARN L170 areAnnotationChecker]: L1015-1 has no Hoare annotation [2020-07-10 15:08:31,917 WARN L170 areAnnotationChecker]: L1015-1 has no Hoare annotation [2020-07-10 15:08:31,917 WARN L170 areAnnotationChecker]: L1015-3 has no Hoare annotation [2020-07-10 15:08:31,917 WARN L170 areAnnotationChecker]: L1015-3 has no Hoare annotation [2020-07-10 15:08:31,917 WARN L170 areAnnotationChecker]: L1008-3 has no Hoare annotation [2020-07-10 15:08:31,917 WARN L170 areAnnotationChecker]: L1008-3 has no Hoare annotation [2020-07-10 15:08:31,918 WARN L170 areAnnotationChecker]: L1008-3 has no Hoare annotation [2020-07-10 15:08:31,918 WARN L170 areAnnotationChecker]: L1007-1 has no Hoare annotation [2020-07-10 15:08:31,918 WARN L170 areAnnotationChecker]: L1007-1 has no Hoare annotation [2020-07-10 15:08:31,918 WARN L170 areAnnotationChecker]: L1007-3 has no Hoare annotation [2020-07-10 15:08:31,918 WARN L170 areAnnotationChecker]: L1007-3 has no Hoare annotation [2020-07-10 15:08:31,918 WARN L170 areAnnotationChecker]: L1038-1 has no Hoare annotation [2020-07-10 15:08:31,918 WARN L170 areAnnotationChecker]: L1038-1 has no Hoare annotation [2020-07-10 15:08:31,918 WARN L170 areAnnotationChecker]: L1038-1 has no Hoare annotation [2020-07-10 15:08:31,918 WARN L170 areAnnotationChecker]: L1021-2 has no Hoare annotation [2020-07-10 15:08:31,918 WARN L170 areAnnotationChecker]: L1021-2 has no Hoare annotation [2020-07-10 15:08:31,919 WARN L170 areAnnotationChecker]: L1021-2 has no Hoare annotation [2020-07-10 15:08:31,919 WARN L170 areAnnotationChecker]: L1008-4 has no Hoare annotation [2020-07-10 15:08:31,919 WARN L170 areAnnotationChecker]: L1008 has no Hoare annotation [2020-07-10 15:08:31,919 WARN L170 areAnnotationChecker]: L1008 has no Hoare annotation [2020-07-10 15:08:31,919 WARN L170 areAnnotationChecker]: L1008-2 has no Hoare annotation [2020-07-10 15:08:31,920 WARN L170 areAnnotationChecker]: L1008-2 has no Hoare annotation [2020-07-10 15:08:31,920 WARN L170 areAnnotationChecker]: L1038-2 has no Hoare annotation [2020-07-10 15:08:31,920 WARN L170 areAnnotationChecker]: L1042 has no Hoare annotation [2020-07-10 15:08:31,920 WARN L170 areAnnotationChecker]: L1042 has no Hoare annotation [2020-07-10 15:08:31,920 WARN L170 areAnnotationChecker]: L1032-3 has no Hoare annotation [2020-07-10 15:08:31,920 WARN L170 areAnnotationChecker]: L1032-3 has no Hoare annotation [2020-07-10 15:08:31,921 WARN L170 areAnnotationChecker]: L1032-3 has no Hoare annotation [2020-07-10 15:08:31,921 WARN L170 areAnnotationChecker]: L1023 has no Hoare annotation [2020-07-10 15:08:31,921 WARN L170 areAnnotationChecker]: L1023 has no Hoare annotation [2020-07-10 15:08:31,921 WARN L170 areAnnotationChecker]: L1008-5 has no Hoare annotation [2020-07-10 15:08:31,921 WARN L170 areAnnotationChecker]: L1008-5 has no Hoare annotation [2020-07-10 15:08:31,921 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:08:31,921 WARN L170 areAnnotationChecker]: L1044-4 has no Hoare annotation [2020-07-10 15:08:31,921 WARN L170 areAnnotationChecker]: L1044-4 has no Hoare annotation [2020-07-10 15:08:31,921 WARN L170 areAnnotationChecker]: L1044-4 has no Hoare annotation [2020-07-10 15:08:31,922 WARN L170 areAnnotationChecker]: L1042-2 has no Hoare annotation [2020-07-10 15:08:31,922 WARN L170 areAnnotationChecker]: L1032-4 has no Hoare annotation [2020-07-10 15:08:31,922 WARN L170 areAnnotationChecker]: L1032 has no Hoare annotation [2020-07-10 15:08:31,922 WARN L170 areAnnotationChecker]: L1032 has no Hoare annotation [2020-07-10 15:08:31,922 WARN L170 areAnnotationChecker]: L1032-2 has no Hoare annotation [2020-07-10 15:08:31,922 WARN L170 areAnnotationChecker]: L1032-2 has no Hoare annotation [2020-07-10 15:08:31,922 WARN L170 areAnnotationChecker]: L1027-3 has no Hoare annotation [2020-07-10 15:08:31,922 WARN L170 areAnnotationChecker]: L1027-3 has no Hoare annotation [2020-07-10 15:08:31,922 WARN L170 areAnnotationChecker]: L1027-3 has no Hoare annotation [2020-07-10 15:08:31,922 WARN L170 areAnnotationChecker]: L1008-14 has no Hoare annotation [2020-07-10 15:08:31,923 WARN L170 areAnnotationChecker]: L1008-14 has no Hoare annotation [2020-07-10 15:08:31,923 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:08:31,923 WARN L170 areAnnotationChecker]: L1045-4 has no Hoare annotation [2020-07-10 15:08:31,923 WARN L170 areAnnotationChecker]: L1045-4 has no Hoare annotation [2020-07-10 15:08:31,923 WARN L170 areAnnotationChecker]: L1044-1 has no Hoare annotation [2020-07-10 15:08:31,923 WARN L170 areAnnotationChecker]: L1044-1 has no Hoare annotation [2020-07-10 15:08:31,923 WARN L170 areAnnotationChecker]: L1044-3 has no Hoare annotation [2020-07-10 15:08:31,923 WARN L170 areAnnotationChecker]: L1044-3 has no Hoare annotation [2020-07-10 15:08:31,923 WARN L170 areAnnotationChecker]: L1028-4 has no Hoare annotation [2020-07-10 15:08:31,923 WARN L170 areAnnotationChecker]: L1028-4 has no Hoare annotation [2020-07-10 15:08:31,924 WARN L170 areAnnotationChecker]: L1027 has no Hoare annotation [2020-07-10 15:08:31,924 WARN L170 areAnnotationChecker]: L1027 has no Hoare annotation [2020-07-10 15:08:31,924 WARN L170 areAnnotationChecker]: L1027-2 has no Hoare annotation [2020-07-10 15:08:31,924 WARN L170 areAnnotationChecker]: L1027-2 has no Hoare annotation [2020-07-10 15:08:31,924 WARN L170 areAnnotationChecker]: L1008-8 has no Hoare annotation [2020-07-10 15:08:31,924 WARN L170 areAnnotationChecker]: L1008-8 has no Hoare annotation [2020-07-10 15:08:31,924 WARN L170 areAnnotationChecker]: L1045 has no Hoare annotation [2020-07-10 15:08:31,924 WARN L170 areAnnotationChecker]: L1045 has no Hoare annotation [2020-07-10 15:08:31,924 WARN L170 areAnnotationChecker]: L1046-4 has no Hoare annotation [2020-07-10 15:08:31,924 WARN L170 areAnnotationChecker]: L1046-4 has no Hoare annotation [2020-07-10 15:08:31,925 WARN L170 areAnnotationChecker]: L1028 has no Hoare annotation [2020-07-10 15:08:31,925 WARN L170 areAnnotationChecker]: L1028 has no Hoare annotation [2020-07-10 15:08:31,925 WARN L170 areAnnotationChecker]: L1029-4 has no Hoare annotation [2020-07-10 15:08:31,925 WARN L170 areAnnotationChecker]: L1029-4 has no Hoare annotation [2020-07-10 15:08:31,925 WARN L170 areAnnotationChecker]: L1008-10 has no Hoare annotation [2020-07-10 15:08:31,925 WARN L170 areAnnotationChecker]: L1008-10 has no Hoare annotation [2020-07-10 15:08:31,925 WARN L170 areAnnotationChecker]: L1045-1 has no Hoare annotation [2020-07-10 15:08:31,925 WARN L170 areAnnotationChecker]: L1045-1 has no Hoare annotation [2020-07-10 15:08:31,925 WARN L170 areAnnotationChecker]: L1045-3 has no Hoare annotation [2020-07-10 15:08:31,926 WARN L170 areAnnotationChecker]: L1045-3 has no Hoare annotation [2020-07-10 15:08:31,926 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2020-07-10 15:08:31,926 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2020-07-10 15:08:31,926 WARN L170 areAnnotationChecker]: L1046-5 has no Hoare annotation [2020-07-10 15:08:31,926 WARN L170 areAnnotationChecker]: L1028-1 has no Hoare annotation [2020-07-10 15:08:31,926 WARN L170 areAnnotationChecker]: L1028-1 has no Hoare annotation [2020-07-10 15:08:31,926 WARN L170 areAnnotationChecker]: L1028-3 has no Hoare annotation [2020-07-10 15:08:31,926 WARN L170 areAnnotationChecker]: L1028-3 has no Hoare annotation [2020-07-10 15:08:31,926 WARN L170 areAnnotationChecker]: L1029 has no Hoare annotation [2020-07-10 15:08:31,927 WARN L170 areAnnotationChecker]: L1029 has no Hoare annotation [2020-07-10 15:08:31,927 WARN L170 areAnnotationChecker]: L1029-5 has no Hoare annotation [2020-07-10 15:08:31,927 WARN L170 areAnnotationChecker]: L1008-11 has no Hoare annotation [2020-07-10 15:08:31,927 WARN L170 areAnnotationChecker]: L1008-11 has no Hoare annotation [2020-07-10 15:08:31,927 WARN L170 areAnnotationChecker]: L1008-13 has no Hoare annotation [2020-07-10 15:08:31,927 WARN L170 areAnnotationChecker]: L1008-13 has no Hoare annotation [2020-07-10 15:08:31,927 WARN L170 areAnnotationChecker]: L1046-1 has no Hoare annotation [2020-07-10 15:08:31,927 WARN L170 areAnnotationChecker]: L1046-1 has no Hoare annotation [2020-07-10 15:08:31,927 WARN L170 areAnnotationChecker]: L1046-3 has no Hoare annotation [2020-07-10 15:08:31,928 WARN L170 areAnnotationChecker]: L1046-3 has no Hoare annotation [2020-07-10 15:08:31,928 WARN L170 areAnnotationChecker]: L1029-1 has no Hoare annotation [2020-07-10 15:08:31,928 WARN L170 areAnnotationChecker]: L1029-1 has no Hoare annotation [2020-07-10 15:08:31,928 WARN L170 areAnnotationChecker]: L1029-3 has no Hoare annotation [2020-07-10 15:08:31,928 WARN L170 areAnnotationChecker]: L1029-3 has no Hoare annotation [2020-07-10 15:08:31,928 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:08:31,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:08:31 BoogieIcfgContainer [2020-07-10 15:08:31,935 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:08:31,938 INFO L168 Benchmark]: Toolchain (without parser) took 17063.45 ms. Allocated memory was 135.8 MB in the beginning and 407.9 MB in the end (delta: 272.1 MB). Free memory was 98.7 MB in the beginning and 281.6 MB in the end (delta: -182.9 MB). Peak memory consumption was 89.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:08:31,939 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 135.8 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-10 15:08:31,940 INFO L168 Benchmark]: CACSL2BoogieTranslator took 747.05 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 98.5 MB in the beginning and 165.1 MB in the end (delta: -66.6 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:08:31,945 INFO L168 Benchmark]: Boogie Preprocessor took 135.06 ms. Allocated memory is still 199.8 MB. Free memory was 165.1 MB in the beginning and 160.7 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 7.1 GB. [2020-07-10 15:08:31,945 INFO L168 Benchmark]: RCFGBuilder took 975.66 ms. Allocated memory is still 199.8 MB. Free memory was 160.7 MB in the beginning and 83.4 MB in the end (delta: 77.4 MB). Peak memory consumption was 77.4 MB. Max. memory is 7.1 GB. [2020-07-10 15:08:31,949 INFO L168 Benchmark]: TraceAbstraction took 15196.48 ms. Allocated memory was 199.8 MB in the beginning and 407.9 MB in the end (delta: 208.1 MB). Free memory was 82.6 MB in the beginning and 281.6 MB in the end (delta: -198.9 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:08:31,954 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.24 ms. Allocated memory is still 135.8 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 747.05 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 98.5 MB in the beginning and 165.1 MB in the end (delta: -66.6 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 135.06 ms. Allocated memory is still 199.8 MB. Free memory was 165.1 MB in the beginning and 160.7 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 975.66 ms. Allocated memory is still 199.8 MB. Free memory was 160.7 MB in the beginning and 83.4 MB in the end (delta: 77.4 MB). Peak memory consumption was 77.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15196.48 ms. Allocated memory was 199.8 MB in the beginning and 407.9 MB in the end (delta: 208.1 MB). Free memory was 82.6 MB in the beginning and 281.6 MB in the end (delta: -198.9 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1029]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L992] SLL* list = malloc(sizeof(SLL)); [L993] list->next = ((void*)0) [L994] list->prev = ((void*)0) VAL [list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L995] COND FALSE !(!(list != ((void*)0))) VAL [list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L995] COND FALSE !(__VERIFIER_nondet_int()) [L995] list->inner = malloc(sizeof(SLL)) [L995] EXPR list->inner [L995] list->inner->next = ((void*)0) [L995] EXPR list->inner [L995] list->inner->inner = ((void*)0) [L995] EXPR list->inner [L995] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={-1:0}, list->inner={-2:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L995] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L997] SLL* end = list; VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1011] end = ((void*)0) [L1012] end = list VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1015] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1017] COND TRUE ((void*)0) != end [L1019] int len = 0; [L1020] EXPR end->inner [L1020] SLL* inner = end->inner; [L1021] COND TRUE ((void*)0) != inner VAL [end={-1:0}, inner={-2:0}, len=0, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1023] COND TRUE len == 0 [L1024] len = 1 VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1027] COND FALSE !(!(((void*)0) != inner)) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1028] EXPR inner->inner VAL [end={-1:0}, inner={-2:0}, inner->inner={0:0}, len=1, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1028] COND FALSE !(!(((void*)0) == inner->inner)) [L1029] EXPR inner->next VAL [end={-1:0}, inner={-2:0}, inner->next={0:0}, len=1, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1029] COND TRUE !(((void*)0) != inner->next) [L1029] __VERIFIER_error() VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 88 locations, 13 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 15.0s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 11.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1050 SDtfs, 927 SDslu, 1484 SDs, 0 SdLazy, 1936 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 420 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 331 NumberOfCodeBlocks, 331 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 286 ConstructedInterpolants, 0 QuantifiedInterpolants, 42885 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...