./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/sll-optional-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-optional-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9782fe34c3bae6ab09bbe7588de1b0d436c1fccc .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:19:05,838 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:19:05,840 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:19:05,853 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:19:05,854 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:19:05,855 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:19:05,857 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:19:05,859 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:19:05,861 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:19:05,863 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:19:05,864 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:19:05,866 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:19:05,866 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:19:05,868 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:19:05,869 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:19:05,871 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:19:05,872 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:19:05,874 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:19:05,876 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:19:05,878 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:19:05,880 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:19:05,882 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:19:05,883 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:19:05,885 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:19:05,888 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:19:05,888 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:19:05,889 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:19:05,890 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:19:05,890 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:19:05,892 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:19:05,892 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:19:05,893 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:19:05,894 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:19:05,896 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:19:05,897 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:19:05,897 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:19:05,899 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:19:05,899 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:19:05,899 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:19:05,900 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:19:05,901 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:19:05,902 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2020-07-29 01:19:05,919 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:19:05,919 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:19:05,921 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:19:05,921 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:19:05,921 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:19:05,922 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:19:05,922 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 01:19:05,923 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:19:05,923 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:19:05,923 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 01:19:05,923 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:19:05,924 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-07-29 01:19:05,924 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-07-29 01:19:05,924 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 01:19:05,925 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-07-29 01:19:05,925 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 01:19:05,925 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:19:05,926 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:19:05,926 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:19:05,926 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 01:19:05,927 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 01:19:05,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:19:05,927 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:19:05,928 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 01:19:05,928 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:19:05,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-29 01:19:05,929 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:19:05,929 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9782fe34c3bae6ab09bbe7588de1b0d436c1fccc [2020-07-29 01:19:06,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:19:06,328 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:19:06,332 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:19:06,333 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:19:06,334 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:19:06,335 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-optional-2.i [2020-07-29 01:19:06,397 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efaea7c8c/17c3db243ed1474f961a5dbfa276d9ef/FLAGa3f52de04 [2020-07-29 01:19:06,918 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:19:06,919 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-optional-2.i [2020-07-29 01:19:06,942 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efaea7c8c/17c3db243ed1474f961a5dbfa276d9ef/FLAGa3f52de04 [2020-07-29 01:19:07,151 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efaea7c8c/17c3db243ed1474f961a5dbfa276d9ef [2020-07-29 01:19:07,154 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:19:07,157 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-07-29 01:19:07,158 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:19:07,158 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:19:07,162 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:19:07,164 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:19:07" (1/1) ... [2020-07-29 01:19:07,167 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3aa0d3d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:19:07, skipping insertion in model container [2020-07-29 01:19:07,167 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:19:07" (1/1) ... [2020-07-29 01:19:07,176 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:19:07,236 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:19:07,721 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:19:07,735 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:19:07,784 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:19:07,869 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:19:07,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:19:07 WrapperNode [2020-07-29 01:19:07,870 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:19:07,870 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:19:07,871 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:19:07,871 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:19:07,887 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:19:07" (1/1) ... [2020-07-29 01:19:07,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:19:07" (1/1) ... [2020-07-29 01:19:07,917 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:19:07" (1/1) ... [2020-07-29 01:19:07,918 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:19:07" (1/1) ... [2020-07-29 01:19:07,964 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:19:07" (1/1) ... [2020-07-29 01:19:07,971 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:19:07" (1/1) ... [2020-07-29 01:19:07,975 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:19:07" (1/1) ... [2020-07-29 01:19:07,982 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:19:07,982 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:19:07,983 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:19:07,983 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:19:07,984 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:19:07" (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-29 01:19:08,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-29 01:19:08,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:19:08,069 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-29 01:19:08,069 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-29 01:19:08,069 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-29 01:19:08,070 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-29 01:19:08,070 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-29 01:19:08,070 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-29 01:19:08,070 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-29 01:19:08,071 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-29 01:19:08,071 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-29 01:19:08,071 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-29 01:19:08,071 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-29 01:19:08,072 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-29 01:19:08,072 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-29 01:19:08,072 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-29 01:19:08,072 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-29 01:19:08,072 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-29 01:19:08,073 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-29 01:19:08,073 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-29 01:19:08,073 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-29 01:19:08,073 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-29 01:19:08,073 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-29 01:19:08,074 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-29 01:19:08,074 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-29 01:19:08,074 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-29 01:19:08,074 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-29 01:19:08,075 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-29 01:19:08,075 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-29 01:19:08,075 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-29 01:19:08,075 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-29 01:19:08,076 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-29 01:19:08,076 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-29 01:19:08,076 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-29 01:19:08,077 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-29 01:19:08,077 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-29 01:19:08,077 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-29 01:19:08,077 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-29 01:19:08,077 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-29 01:19:08,078 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-29 01:19:08,078 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-29 01:19:08,078 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-29 01:19:08,078 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-29 01:19:08,078 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-29 01:19:08,078 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-29 01:19:08,079 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-29 01:19:08,079 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-29 01:19:08,079 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-29 01:19:08,079 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-29 01:19:08,080 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-29 01:19:08,080 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-29 01:19:08,080 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-29 01:19:08,080 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-29 01:19:08,080 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-29 01:19:08,081 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-29 01:19:08,081 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-29 01:19:08,081 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-29 01:19:08,081 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-29 01:19:08,082 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-29 01:19:08,082 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-29 01:19:08,082 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-29 01:19:08,082 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-29 01:19:08,082 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-29 01:19:08,082 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-29 01:19:08,083 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-29 01:19:08,083 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-29 01:19:08,083 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-29 01:19:08,083 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-29 01:19:08,083 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-29 01:19:08,084 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-29 01:19:08,084 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-29 01:19:08,084 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-29 01:19:08,084 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-29 01:19:08,085 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-29 01:19:08,085 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-29 01:19:08,085 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-29 01:19:08,086 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-29 01:19:08,086 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-29 01:19:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-29 01:19:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-29 01:19:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-29 01:19:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-29 01:19:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-29 01:19:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-29 01:19:08,088 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-29 01:19:08,088 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-29 01:19:08,088 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-29 01:19:08,088 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-29 01:19:08,088 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-29 01:19:08,089 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-29 01:19:08,089 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-29 01:19:08,089 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-29 01:19:08,089 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-29 01:19:08,089 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-29 01:19:08,089 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-29 01:19:08,089 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-29 01:19:08,090 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-29 01:19:08,090 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-29 01:19:08,090 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-29 01:19:08,090 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-29 01:19:08,090 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-29 01:19:08,090 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-29 01:19:08,090 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-29 01:19:08,090 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-29 01:19:08,090 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-29 01:19:08,091 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-29 01:19:08,091 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-29 01:19:08,091 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-29 01:19:08,091 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-29 01:19:08,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-29 01:19:08,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-29 01:19:08,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:19:08,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-29 01:19:08,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:19:08,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:19:08,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-29 01:19:08,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:19:09,072 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:19:09,072 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-29 01:19:09,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:19:09 BoogieIcfgContainer [2020-07-29 01:19:09,078 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:19:09,080 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-29 01:19:09,080 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-29 01:19:09,084 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-29 01:19:09,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.07 01:19:07" (1/3) ... [2020-07-29 01:19:09,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f4d71fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:19:09, skipping insertion in model container [2020-07-29 01:19:09,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:19:07" (2/3) ... [2020-07-29 01:19:09,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f4d71fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:19:09, skipping insertion in model container [2020-07-29 01:19:09,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:19:09" (3/3) ... [2020-07-29 01:19:09,088 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-optional-2.i [2020-07-29 01:19:09,100 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-29 01:19:09,110 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 60 error locations. [2020-07-29 01:19:09,126 INFO L251 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2020-07-29 01:19:09,149 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-29 01:19:09,150 INFO L376 AbstractCegarLoop]: Hoare is false [2020-07-29 01:19:09,150 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-29 01:19:09,150 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:19:09,151 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:19:09,151 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-29 01:19:09,151 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:19:09,152 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-29 01:19:09,173 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states. [2020-07-29 01:19:09,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-29 01:19:09,184 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:09,185 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:09,186 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr59ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:09,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:09,193 INFO L82 PathProgramCache]: Analyzing trace with hash 637094669, now seen corresponding path program 1 times [2020-07-29 01:19:09,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:09,206 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934151117] [2020-07-29 01:19:09,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:09,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:09,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:09,448 INFO L280 TraceCheckUtils]: 0: Hoare triple {139#(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; {133#true} is VALID [2020-07-29 01:19:09,449 INFO L280 TraceCheckUtils]: 1: Hoare triple {133#true} assume true; {133#true} is VALID [2020-07-29 01:19:09,450 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {133#true} {133#true} #203#return; {133#true} is VALID [2020-07-29 01:19:09,454 INFO L263 TraceCheckUtils]: 0: Hoare triple {133#true} call ULTIMATE.init(); {139#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:09,454 INFO L280 TraceCheckUtils]: 1: Hoare triple {139#(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; {133#true} is VALID [2020-07-29 01:19:09,455 INFO L280 TraceCheckUtils]: 2: Hoare triple {133#true} assume true; {133#true} is VALID [2020-07-29 01:19:09,455 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {133#true} {133#true} #203#return; {133#true} is VALID [2020-07-29 01:19:09,456 INFO L263 TraceCheckUtils]: 4: Hoare triple {133#true} call #t~ret19 := main(); {133#true} is VALID [2020-07-29 01:19:09,458 INFO L280 TraceCheckUtils]: 5: Hoare triple {133#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {138#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-29 01:19:09,459 INFO L280 TraceCheckUtils]: 6: Hoare triple {138#(= 1 (select |#valid| main_~head~0.base))} assume !(1 == #valid[~head~0.base]); {134#false} is VALID [2020-07-29 01:19:09,460 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-29 01:19:09,461 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934151117] [2020-07-29 01:19:09,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:09,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:19:09,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011567532] [2020-07-29 01:19:09,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-29 01:19:09,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:09,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:19:09,495 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:09,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:19:09,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:09,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:19:09,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:19:09,509 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 4 states. [2020-07-29 01:19:10,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:10,492 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2020-07-29 01:19:10,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:19:10,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-29 01:19:10,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:10,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:19:10,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 157 transitions. [2020-07-29 01:19:10,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:19:10,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 157 transitions. [2020-07-29 01:19:10,539 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 157 transitions. [2020-07-29 01:19:10,781 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:10,807 INFO L225 Difference]: With dead ends: 131 [2020-07-29 01:19:10,809 INFO L226 Difference]: Without dead ends: 127 [2020-07-29 01:19:10,812 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:19:10,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-07-29 01:19:10,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 121. [2020-07-29 01:19:10,871 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:10,872 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand 121 states. [2020-07-29 01:19:10,873 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 121 states. [2020-07-29 01:19:10,873 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 121 states. [2020-07-29 01:19:10,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:10,900 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2020-07-29 01:19:10,900 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 135 transitions. [2020-07-29 01:19:10,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:10,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:10,903 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 127 states. [2020-07-29 01:19:10,903 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 127 states. [2020-07-29 01:19:10,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:10,932 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2020-07-29 01:19:10,932 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 135 transitions. [2020-07-29 01:19:10,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:10,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:10,936 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:10,936 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:10,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-07-29 01:19:10,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2020-07-29 01:19:10,948 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 7 [2020-07-29 01:19:10,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:10,949 INFO L479 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2020-07-29 01:19:10,949 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:19:10,950 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2020-07-29 01:19:10,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-29 01:19:10,951 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:10,951 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:10,952 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-29 01:19:10,952 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr59ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:10,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:10,953 INFO L82 PathProgramCache]: Analyzing trace with hash 637094670, now seen corresponding path program 1 times [2020-07-29 01:19:10,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:10,954 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928084007] [2020-07-29 01:19:10,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:10,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:11,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:11,049 INFO L280 TraceCheckUtils]: 0: Hoare triple {656#(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; {650#true} is VALID [2020-07-29 01:19:11,050 INFO L280 TraceCheckUtils]: 1: Hoare triple {650#true} assume true; {650#true} is VALID [2020-07-29 01:19:11,050 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {650#true} {650#true} #203#return; {650#true} is VALID [2020-07-29 01:19:11,052 INFO L263 TraceCheckUtils]: 0: Hoare triple {650#true} call ULTIMATE.init(); {656#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:11,052 INFO L280 TraceCheckUtils]: 1: Hoare triple {656#(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; {650#true} is VALID [2020-07-29 01:19:11,052 INFO L280 TraceCheckUtils]: 2: Hoare triple {650#true} assume true; {650#true} is VALID [2020-07-29 01:19:11,053 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {650#true} {650#true} #203#return; {650#true} is VALID [2020-07-29 01:19:11,053 INFO L263 TraceCheckUtils]: 4: Hoare triple {650#true} call #t~ret19 := main(); {650#true} is VALID [2020-07-29 01:19:11,055 INFO L280 TraceCheckUtils]: 5: Hoare triple {650#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {655#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)))} is VALID [2020-07-29 01:19:11,056 INFO L280 TraceCheckUtils]: 6: Hoare triple {655#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)))} assume !(4 + ~head~0.offset <= #length[~head~0.base] && 0 <= ~head~0.offset); {651#false} is VALID [2020-07-29 01:19:11,057 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-29 01:19:11,057 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928084007] [2020-07-29 01:19:11,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:11,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:19:11,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865597021] [2020-07-29 01:19:11,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-29 01:19:11,060 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:11,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:19:11,071 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:11,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:19:11,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:11,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:19:11,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:19:11,072 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand 4 states. [2020-07-29 01:19:11,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:11,732 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2020-07-29 01:19:11,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:19:11,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-29 01:19:11,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:11,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:19:11,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2020-07-29 01:19:11,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:19:11,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2020-07-29 01:19:11,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 130 transitions. [2020-07-29 01:19:11,936 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:11,944 INFO L225 Difference]: With dead ends: 117 [2020-07-29 01:19:11,944 INFO L226 Difference]: Without dead ends: 117 [2020-07-29 01:19:11,945 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-29 01:19:11,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-07-29 01:19:11,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2020-07-29 01:19:11,959 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:11,963 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand 113 states. [2020-07-29 01:19:11,966 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 113 states. [2020-07-29 01:19:11,967 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 113 states. [2020-07-29 01:19:11,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:11,974 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2020-07-29 01:19:11,974 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2020-07-29 01:19:11,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:11,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:11,976 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 117 states. [2020-07-29 01:19:11,976 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 117 states. [2020-07-29 01:19:11,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:11,983 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2020-07-29 01:19:11,983 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2020-07-29 01:19:11,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:11,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:11,985 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:11,985 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:11,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-07-29 01:19:11,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 123 transitions. [2020-07-29 01:19:11,991 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 123 transitions. Word has length 7 [2020-07-29 01:19:11,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:11,992 INFO L479 AbstractCegarLoop]: Abstraction has 113 states and 123 transitions. [2020-07-29 01:19:11,992 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:19:11,992 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 123 transitions. [2020-07-29 01:19:11,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-29 01:19:11,993 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:11,993 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:11,994 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-29 01:19:11,994 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr59ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:11,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:11,995 INFO L82 PathProgramCache]: Analyzing trace with hash 65960736, now seen corresponding path program 1 times [2020-07-29 01:19:11,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:11,995 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625734180] [2020-07-29 01:19:11,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:12,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:12,114 INFO L280 TraceCheckUtils]: 0: Hoare triple {1131#(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; {1123#true} is VALID [2020-07-29 01:19:12,114 INFO L280 TraceCheckUtils]: 1: Hoare triple {1123#true} assume true; {1123#true} is VALID [2020-07-29 01:19:12,115 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1123#true} {1123#true} #203#return; {1123#true} is VALID [2020-07-29 01:19:12,116 INFO L263 TraceCheckUtils]: 0: Hoare triple {1123#true} call ULTIMATE.init(); {1131#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:12,116 INFO L280 TraceCheckUtils]: 1: Hoare triple {1131#(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; {1123#true} is VALID [2020-07-29 01:19:12,116 INFO L280 TraceCheckUtils]: 2: Hoare triple {1123#true} assume true; {1123#true} is VALID [2020-07-29 01:19:12,116 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1123#true} {1123#true} #203#return; {1123#true} is VALID [2020-07-29 01:19:12,117 INFO L263 TraceCheckUtils]: 4: Hoare triple {1123#true} call #t~ret19 := main(); {1123#true} is VALID [2020-07-29 01:19:12,117 INFO L280 TraceCheckUtils]: 5: Hoare triple {1123#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {1123#true} is VALID [2020-07-29 01:19:12,117 INFO L280 TraceCheckUtils]: 6: Hoare triple {1123#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L986 {1123#true} is VALID [2020-07-29 01:19:12,118 INFO L280 TraceCheckUtils]: 7: Hoare triple {1123#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1123#true} is VALID [2020-07-29 01:19:12,118 INFO L280 TraceCheckUtils]: 8: Hoare triple {1123#true} assume 0 != #t~nondet1;havoc #t~nondet1; {1123#true} is VALID [2020-07-29 01:19:12,118 INFO L280 TraceCheckUtils]: 9: Hoare triple {1123#true} SUMMARY for call write~int(2, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L987-1 {1123#true} is VALID [2020-07-29 01:19:12,121 INFO L280 TraceCheckUtils]: 10: Hoare triple {1123#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12); {1128#(= (select |#valid| |main_#t~malloc2.base|) 1)} is VALID [2020-07-29 01:19:12,123 INFO L280 TraceCheckUtils]: 11: Hoare triple {1128#(= (select |#valid| |main_#t~malloc2.base|) 1)} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L987-3 {1129#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))))} is VALID [2020-07-29 01:19:12,125 INFO L280 TraceCheckUtils]: 12: Hoare triple {1129#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~head~0.base, 4 + ~head~0.offset, 4); srcloc: L987-4 {1130#(= 1 (select |#valid| |main_#t~mem3.base|))} is VALID [2020-07-29 01:19:12,126 INFO L280 TraceCheckUtils]: 13: Hoare triple {1130#(= 1 (select |#valid| |main_#t~mem3.base|))} assume !(1 == #valid[#t~mem3.base]); {1124#false} is VALID [2020-07-29 01:19:12,128 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-29 01:19:12,129 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625734180] [2020-07-29 01:19:12,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:12,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:19:12,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141844935] [2020-07-29 01:19:12,130 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-29 01:19:12,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:12,130 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:19:12,152 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-29 01:19:12,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:19:12,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:12,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:19:12,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:19:12,153 INFO L87 Difference]: Start difference. First operand 113 states and 123 transitions. Second operand 6 states. [2020-07-29 01:19:13,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:13,737 INFO L93 Difference]: Finished difference Result 228 states and 247 transitions. [2020-07-29 01:19:13,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:19:13,738 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-29 01:19:13,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:13,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:19:13,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 243 transitions. [2020-07-29 01:19:13,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:19:13,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 243 transitions. [2020-07-29 01:19:13,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 243 transitions. [2020-07-29 01:19:14,084 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:14,094 INFO L225 Difference]: With dead ends: 228 [2020-07-29 01:19:14,094 INFO L226 Difference]: Without dead ends: 228 [2020-07-29 01:19:14,095 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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-29 01:19:14,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-07-29 01:19:14,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 112. [2020-07-29 01:19:14,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:14,114 INFO L82 GeneralOperation]: Start isEquivalent. First operand 228 states. Second operand 112 states. [2020-07-29 01:19:14,114 INFO L74 IsIncluded]: Start isIncluded. First operand 228 states. Second operand 112 states. [2020-07-29 01:19:14,114 INFO L87 Difference]: Start difference. First operand 228 states. Second operand 112 states. [2020-07-29 01:19:14,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:14,125 INFO L93 Difference]: Finished difference Result 228 states and 247 transitions. [2020-07-29 01:19:14,125 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 247 transitions. [2020-07-29 01:19:14,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:14,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:14,127 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 228 states. [2020-07-29 01:19:14,127 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 228 states. [2020-07-29 01:19:14,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:14,138 INFO L93 Difference]: Finished difference Result 228 states and 247 transitions. [2020-07-29 01:19:14,138 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 247 transitions. [2020-07-29 01:19:14,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:14,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:14,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:14,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:14,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-07-29 01:19:14,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2020-07-29 01:19:14,145 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 14 [2020-07-29 01:19:14,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:14,145 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2020-07-29 01:19:14,146 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:19:14,146 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2020-07-29 01:19:14,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-29 01:19:14,146 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:14,147 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:14,147 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-29 01:19:14,148 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr59ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:14,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:14,148 INFO L82 PathProgramCache]: Analyzing trace with hash 65960737, now seen corresponding path program 1 times [2020-07-29 01:19:14,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:14,149 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193414179] [2020-07-29 01:19:14,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:14,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:14,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:14,307 INFO L280 TraceCheckUtils]: 0: Hoare triple {1944#(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; {1936#true} is VALID [2020-07-29 01:19:14,308 INFO L280 TraceCheckUtils]: 1: Hoare triple {1936#true} assume true; {1936#true} is VALID [2020-07-29 01:19:14,308 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1936#true} {1936#true} #203#return; {1936#true} is VALID [2020-07-29 01:19:14,310 INFO L263 TraceCheckUtils]: 0: Hoare triple {1936#true} call ULTIMATE.init(); {1944#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:14,310 INFO L280 TraceCheckUtils]: 1: Hoare triple {1944#(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; {1936#true} is VALID [2020-07-29 01:19:14,311 INFO L280 TraceCheckUtils]: 2: Hoare triple {1936#true} assume true; {1936#true} is VALID [2020-07-29 01:19:14,311 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1936#true} {1936#true} #203#return; {1936#true} is VALID [2020-07-29 01:19:14,312 INFO L263 TraceCheckUtils]: 4: Hoare triple {1936#true} call #t~ret19 := main(); {1936#true} is VALID [2020-07-29 01:19:14,312 INFO L280 TraceCheckUtils]: 5: Hoare triple {1936#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {1936#true} is VALID [2020-07-29 01:19:14,312 INFO L280 TraceCheckUtils]: 6: Hoare triple {1936#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L986 {1936#true} is VALID [2020-07-29 01:19:14,312 INFO L280 TraceCheckUtils]: 7: Hoare triple {1936#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1936#true} is VALID [2020-07-29 01:19:14,313 INFO L280 TraceCheckUtils]: 8: Hoare triple {1936#true} assume 0 != #t~nondet1;havoc #t~nondet1; {1936#true} is VALID [2020-07-29 01:19:14,313 INFO L280 TraceCheckUtils]: 9: Hoare triple {1936#true} SUMMARY for call write~int(2, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L987-1 {1936#true} is VALID [2020-07-29 01:19:14,315 INFO L280 TraceCheckUtils]: 10: Hoare triple {1936#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12); {1941#(and (= 12 (select |#length| |main_#t~malloc2.base|)) (= 0 |main_#t~malloc2.offset|))} is VALID [2020-07-29 01:19:14,317 INFO L280 TraceCheckUtils]: 11: Hoare triple {1941#(and (= 12 (select |#length| |main_#t~malloc2.base|)) (= 0 |main_#t~malloc2.offset|))} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L987-3 {1942#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4)) 0) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))))} is VALID [2020-07-29 01:19:14,318 INFO L280 TraceCheckUtils]: 12: Hoare triple {1942#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4)) 0) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4)))))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~head~0.base, 4 + ~head~0.offset, 4); srcloc: L987-4 {1943#(and (= 12 (select |#length| |main_#t~mem3.base|)) (= 0 |main_#t~mem3.offset|))} is VALID [2020-07-29 01:19:14,318 INFO L280 TraceCheckUtils]: 13: Hoare triple {1943#(and (= 12 (select |#length| |main_#t~mem3.base|)) (= 0 |main_#t~mem3.offset|))} assume !(4 + #t~mem3.offset <= #length[#t~mem3.base] && 0 <= #t~mem3.offset); {1937#false} is VALID [2020-07-29 01:19:14,319 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-29 01:19:14,320 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193414179] [2020-07-29 01:19:14,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:14,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:19:14,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478836824] [2020-07-29 01:19:14,321 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-29 01:19:14,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:14,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:19:14,342 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-29 01:19:14,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:19:14,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:14,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:19:14,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:19:14,343 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand 6 states. [2020-07-29 01:19:16,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:16,002 INFO L93 Difference]: Finished difference Result 202 states and 220 transitions. [2020-07-29 01:19:16,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:19:16,002 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-29 01:19:16,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:16,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:19:16,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 211 transitions. [2020-07-29 01:19:16,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:19:16,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 211 transitions. [2020-07-29 01:19:16,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 211 transitions. [2020-07-29 01:19:16,290 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:16,295 INFO L225 Difference]: With dead ends: 202 [2020-07-29 01:19:16,295 INFO L226 Difference]: Without dead ends: 202 [2020-07-29 01:19:16,296 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:19:16,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2020-07-29 01:19:16,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 111. [2020-07-29 01:19:16,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:16,303 INFO L82 GeneralOperation]: Start isEquivalent. First operand 202 states. Second operand 111 states. [2020-07-29 01:19:16,304 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand 111 states. [2020-07-29 01:19:16,304 INFO L87 Difference]: Start difference. First operand 202 states. Second operand 111 states. [2020-07-29 01:19:16,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:16,312 INFO L93 Difference]: Finished difference Result 202 states and 220 transitions. [2020-07-29 01:19:16,312 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 220 transitions. [2020-07-29 01:19:16,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:16,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:16,313 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 202 states. [2020-07-29 01:19:16,314 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 202 states. [2020-07-29 01:19:16,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:16,321 INFO L93 Difference]: Finished difference Result 202 states and 220 transitions. [2020-07-29 01:19:16,322 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 220 transitions. [2020-07-29 01:19:16,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:16,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:16,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:16,323 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:16,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-07-29 01:19:16,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2020-07-29 01:19:16,328 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 14 [2020-07-29 01:19:16,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:16,328 INFO L479 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2020-07-29 01:19:16,328 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:19:16,329 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2020-07-29 01:19:16,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-29 01:19:16,329 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:16,329 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:16,330 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-29 01:19:16,330 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr59ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:16,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:16,331 INFO L82 PathProgramCache]: Analyzing trace with hash -903844465, now seen corresponding path program 1 times [2020-07-29 01:19:16,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:16,331 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158787812] [2020-07-29 01:19:16,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:16,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:16,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:16,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:16,455 INFO L280 TraceCheckUtils]: 0: Hoare triple {2677#(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; {2670#true} is VALID [2020-07-29 01:19:16,456 INFO L280 TraceCheckUtils]: 1: Hoare triple {2670#true} assume true; {2670#true} is VALID [2020-07-29 01:19:16,456 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2670#true} {2670#true} #203#return; {2670#true} is VALID [2020-07-29 01:19:16,458 INFO L263 TraceCheckUtils]: 0: Hoare triple {2670#true} call ULTIMATE.init(); {2677#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:16,458 INFO L280 TraceCheckUtils]: 1: Hoare triple {2677#(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; {2670#true} is VALID [2020-07-29 01:19:16,458 INFO L280 TraceCheckUtils]: 2: Hoare triple {2670#true} assume true; {2670#true} is VALID [2020-07-29 01:19:16,459 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2670#true} {2670#true} #203#return; {2670#true} is VALID [2020-07-29 01:19:16,459 INFO L263 TraceCheckUtils]: 4: Hoare triple {2670#true} call #t~ret19 := main(); {2670#true} is VALID [2020-07-29 01:19:16,459 INFO L280 TraceCheckUtils]: 5: Hoare triple {2670#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {2670#true} is VALID [2020-07-29 01:19:16,463 INFO L280 TraceCheckUtils]: 6: Hoare triple {2670#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L986 {2675#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-29 01:19:16,464 INFO L280 TraceCheckUtils]: 7: Hoare triple {2675#(= 1 (select |#valid| main_~head~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2675#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-29 01:19:16,465 INFO L280 TraceCheckUtils]: 8: Hoare triple {2675#(= 1 (select |#valid| main_~head~0.base))} assume !(0 != #t~nondet1);havoc #t~nondet1;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {2675#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-29 01:19:16,465 INFO L280 TraceCheckUtils]: 9: Hoare triple {2675#(= 1 (select |#valid| main_~head~0.base))} assume !(0 != #t~nondet4);havoc #t~nondet4; {2675#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-29 01:19:16,466 INFO L280 TraceCheckUtils]: 10: Hoare triple {2675#(= 1 (select |#valid| main_~head~0.base))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L987-12 {2675#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-29 01:19:16,467 INFO L280 TraceCheckUtils]: 11: Hoare triple {2675#(= 1 (select |#valid| main_~head~0.base))} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L987-13 {2675#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-29 01:19:16,468 INFO L280 TraceCheckUtils]: 12: Hoare triple {2675#(= 1 (select |#valid| main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {2676#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-29 01:19:16,469 INFO L280 TraceCheckUtils]: 13: Hoare triple {2676#(= 1 (select |#valid| main_~x~0.base))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2676#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-29 01:19:16,470 INFO L280 TraceCheckUtils]: 14: Hoare triple {2676#(= 1 (select |#valid| main_~x~0.base))} assume !!(0 != #t~nondet5);havoc #t~nondet5;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(12); {2676#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-29 01:19:16,471 INFO L280 TraceCheckUtils]: 15: Hoare triple {2676#(= 1 (select |#valid| main_~x~0.base))} assume !(1 == #valid[~x~0.base]); {2671#false} is VALID [2020-07-29 01:19:16,471 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-29 01:19:16,472 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158787812] [2020-07-29 01:19:16,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:16,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:19:16,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764115273] [2020-07-29 01:19:16,473 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-29 01:19:16,473 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:16,473 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:19:16,494 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:16,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:19:16,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:16,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:19:16,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:19:16,495 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand 5 states. [2020-07-29 01:19:17,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:17,156 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2020-07-29 01:19:17,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:19:17,156 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-29 01:19:17,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:17,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:19:17,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2020-07-29 01:19:17,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:19:17,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2020-07-29 01:19:17,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 138 transitions. [2020-07-29 01:19:17,365 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-29 01:19:17,369 INFO L225 Difference]: With dead ends: 115 [2020-07-29 01:19:17,369 INFO L226 Difference]: Without dead ends: 115 [2020-07-29 01:19:17,369 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-29 01:19:17,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-07-29 01:19:17,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 106. [2020-07-29 01:19:17,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:17,376 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand 106 states. [2020-07-29 01:19:17,376 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 106 states. [2020-07-29 01:19:17,377 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 106 states. [2020-07-29 01:19:17,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:17,382 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2020-07-29 01:19:17,382 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2020-07-29 01:19:17,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:17,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:17,383 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 115 states. [2020-07-29 01:19:17,383 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 115 states. [2020-07-29 01:19:17,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:17,388 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2020-07-29 01:19:17,389 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2020-07-29 01:19:17,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:17,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:17,390 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:17,390 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:17,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-07-29 01:19:17,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 121 transitions. [2020-07-29 01:19:17,395 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 121 transitions. Word has length 16 [2020-07-29 01:19:17,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:17,395 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 121 transitions. [2020-07-29 01:19:17,395 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:19:17,396 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 121 transitions. [2020-07-29 01:19:17,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-29 01:19:17,396 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:17,396 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:17,397 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-29 01:19:17,397 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr59ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:17,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:17,398 INFO L82 PathProgramCache]: Analyzing trace with hash -903844464, now seen corresponding path program 1 times [2020-07-29 01:19:17,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:17,399 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341269839] [2020-07-29 01:19:17,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:17,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:17,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:17,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:17,546 INFO L280 TraceCheckUtils]: 0: Hoare triple {3140#(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; {3133#true} is VALID [2020-07-29 01:19:17,547 INFO L280 TraceCheckUtils]: 1: Hoare triple {3133#true} assume true; {3133#true} is VALID [2020-07-29 01:19:17,547 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3133#true} {3133#true} #203#return; {3133#true} is VALID [2020-07-29 01:19:17,554 INFO L263 TraceCheckUtils]: 0: Hoare triple {3133#true} call ULTIMATE.init(); {3140#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:17,554 INFO L280 TraceCheckUtils]: 1: Hoare triple {3140#(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; {3133#true} is VALID [2020-07-29 01:19:17,554 INFO L280 TraceCheckUtils]: 2: Hoare triple {3133#true} assume true; {3133#true} is VALID [2020-07-29 01:19:17,555 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3133#true} {3133#true} #203#return; {3133#true} is VALID [2020-07-29 01:19:17,555 INFO L263 TraceCheckUtils]: 4: Hoare triple {3133#true} call #t~ret19 := main(); {3133#true} is VALID [2020-07-29 01:19:17,557 INFO L280 TraceCheckUtils]: 5: Hoare triple {3133#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {3138#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)))} is VALID [2020-07-29 01:19:17,559 INFO L280 TraceCheckUtils]: 6: Hoare triple {3138#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)))} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L986 {3138#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)))} is VALID [2020-07-29 01:19:17,560 INFO L280 TraceCheckUtils]: 7: Hoare triple {3138#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3138#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)))} is VALID [2020-07-29 01:19:17,561 INFO L280 TraceCheckUtils]: 8: Hoare triple {3138#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)))} assume !(0 != #t~nondet1);havoc #t~nondet1;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {3138#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)))} is VALID [2020-07-29 01:19:17,562 INFO L280 TraceCheckUtils]: 9: Hoare triple {3138#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)))} assume !(0 != #t~nondet4);havoc #t~nondet4; {3138#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)))} is VALID [2020-07-29 01:19:17,565 INFO L280 TraceCheckUtils]: 10: Hoare triple {3138#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L987-12 {3138#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)))} is VALID [2020-07-29 01:19:17,567 INFO L280 TraceCheckUtils]: 11: Hoare triple {3138#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)))} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L987-13 {3138#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)))} is VALID [2020-07-29 01:19:17,568 INFO L280 TraceCheckUtils]: 12: Hoare triple {3138#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {3139#(and (= main_~x~0.offset 0) (<= 12 (select |#length| main_~x~0.base)))} is VALID [2020-07-29 01:19:17,569 INFO L280 TraceCheckUtils]: 13: Hoare triple {3139#(and (= main_~x~0.offset 0) (<= 12 (select |#length| main_~x~0.base)))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {3139#(and (= main_~x~0.offset 0) (<= 12 (select |#length| main_~x~0.base)))} is VALID [2020-07-29 01:19:17,570 INFO L280 TraceCheckUtils]: 14: Hoare triple {3139#(and (= main_~x~0.offset 0) (<= 12 (select |#length| main_~x~0.base)))} assume !!(0 != #t~nondet5);havoc #t~nondet5;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(12); {3139#(and (= main_~x~0.offset 0) (<= 12 (select |#length| main_~x~0.base)))} is VALID [2020-07-29 01:19:17,572 INFO L280 TraceCheckUtils]: 15: Hoare triple {3139#(and (= main_~x~0.offset 0) (<= 12 (select |#length| main_~x~0.base)))} assume !(4 + ~x~0.offset <= #length[~x~0.base] && 0 <= ~x~0.offset); {3134#false} is VALID [2020-07-29 01:19:17,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:19:17,574 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341269839] [2020-07-29 01:19:17,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:17,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:19:17,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844457168] [2020-07-29 01:19:17,576 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-29 01:19:17,576 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:17,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:19:17,602 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:17,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:19:17,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:17,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:19:17,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:19:17,603 INFO L87 Difference]: Start difference. First operand 106 states and 121 transitions. Second operand 5 states. [2020-07-29 01:19:18,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:18,385 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2020-07-29 01:19:18,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:19:18,386 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-29 01:19:18,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:18,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:19:18,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2020-07-29 01:19:18,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:19:18,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2020-07-29 01:19:18,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 139 transitions. [2020-07-29 01:19:18,582 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:18,585 INFO L225 Difference]: With dead ends: 126 [2020-07-29 01:19:18,586 INFO L226 Difference]: Without dead ends: 126 [2020-07-29 01:19:18,586 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:19:18,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-07-29 01:19:18,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 117. [2020-07-29 01:19:18,591 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:18,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand 117 states. [2020-07-29 01:19:18,592 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 117 states. [2020-07-29 01:19:18,592 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 117 states. [2020-07-29 01:19:18,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:18,602 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2020-07-29 01:19:18,602 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 140 transitions. [2020-07-29 01:19:18,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:18,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:18,602 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 126 states. [2020-07-29 01:19:18,603 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 126 states. [2020-07-29 01:19:18,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:18,608 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2020-07-29 01:19:18,608 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 140 transitions. [2020-07-29 01:19:18,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:18,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:18,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:18,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:18,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-07-29 01:19:18,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 133 transitions. [2020-07-29 01:19:18,614 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 133 transitions. Word has length 16 [2020-07-29 01:19:18,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:18,615 INFO L479 AbstractCegarLoop]: Abstraction has 117 states and 133 transitions. [2020-07-29 01:19:18,615 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:19:18,615 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 133 transitions. [2020-07-29 01:19:18,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-29 01:19:18,616 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:18,616 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-29 01:19:18,618 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-29 01:19:18,622 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr59ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:18,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:18,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1280450289, now seen corresponding path program 1 times [2020-07-29 01:19:18,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:18,625 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537207778] [2020-07-29 01:19:18,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:18,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:18,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:18,789 INFO L280 TraceCheckUtils]: 0: Hoare triple {3649#(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; {3640#true} is VALID [2020-07-29 01:19:18,789 INFO L280 TraceCheckUtils]: 1: Hoare triple {3640#true} assume true; {3640#true} is VALID [2020-07-29 01:19:18,789 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3640#true} {3640#true} #203#return; {3640#true} is VALID [2020-07-29 01:19:18,791 INFO L263 TraceCheckUtils]: 0: Hoare triple {3640#true} call ULTIMATE.init(); {3649#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:18,791 INFO L280 TraceCheckUtils]: 1: Hoare triple {3649#(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; {3640#true} is VALID [2020-07-29 01:19:18,791 INFO L280 TraceCheckUtils]: 2: Hoare triple {3640#true} assume true; {3640#true} is VALID [2020-07-29 01:19:18,792 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3640#true} {3640#true} #203#return; {3640#true} is VALID [2020-07-29 01:19:18,792 INFO L263 TraceCheckUtils]: 4: Hoare triple {3640#true} call #t~ret19 := main(); {3640#true} is VALID [2020-07-29 01:19:18,792 INFO L280 TraceCheckUtils]: 5: Hoare triple {3640#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {3640#true} is VALID [2020-07-29 01:19:18,792 INFO L280 TraceCheckUtils]: 6: Hoare triple {3640#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L986 {3640#true} is VALID [2020-07-29 01:19:18,793 INFO L280 TraceCheckUtils]: 7: Hoare triple {3640#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3640#true} is VALID [2020-07-29 01:19:18,793 INFO L280 TraceCheckUtils]: 8: Hoare triple {3640#true} assume !(0 != #t~nondet1);havoc #t~nondet1;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {3640#true} is VALID [2020-07-29 01:19:18,793 INFO L280 TraceCheckUtils]: 9: Hoare triple {3640#true} assume !(0 != #t~nondet4);havoc #t~nondet4; {3640#true} is VALID [2020-07-29 01:19:18,794 INFO L280 TraceCheckUtils]: 10: Hoare triple {3640#true} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L987-12 {3640#true} is VALID [2020-07-29 01:19:18,794 INFO L280 TraceCheckUtils]: 11: Hoare triple {3640#true} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L987-13 {3640#true} is VALID [2020-07-29 01:19:18,794 INFO L280 TraceCheckUtils]: 12: Hoare triple {3640#true} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {3640#true} is VALID [2020-07-29 01:19:18,794 INFO L280 TraceCheckUtils]: 13: Hoare triple {3640#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {3640#true} is VALID [2020-07-29 01:19:18,799 INFO L280 TraceCheckUtils]: 14: Hoare triple {3640#true} assume !!(0 != #t~nondet5);havoc #t~nondet5;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(12); {3645#(and (= 12 (select |#length| |main_#t~malloc6.base|)) (= 0 |main_#t~malloc6.offset|))} is VALID [2020-07-29 01:19:18,801 INFO L280 TraceCheckUtils]: 15: Hoare triple {3645#(and (= 12 (select |#length| |main_#t~malloc6.base|)) (= 0 |main_#t~malloc6.offset|))} SUMMARY for call write~$Pointer$(#t~malloc6.base, #t~malloc6.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L990-3 {3646#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-29 01:19:18,802 INFO L280 TraceCheckUtils]: 16: Hoare triple {3646#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} SUMMARY for call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L990-4 {3647#(and (= 12 (select |#length| |main_#t~mem7.base|)) (= 0 |main_#t~mem7.offset|))} is VALID [2020-07-29 01:19:18,803 INFO L280 TraceCheckUtils]: 17: Hoare triple {3647#(and (= 12 (select |#length| |main_#t~mem7.base|)) (= 0 |main_#t~mem7.offset|))} ~x~0.base, ~x~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {3648#(and (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0))} is VALID [2020-07-29 01:19:18,804 INFO L280 TraceCheckUtils]: 18: Hoare triple {3648#(and (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0))} assume !(4 + ~x~0.offset <= #length[~x~0.base] && 0 <= ~x~0.offset); {3641#false} is VALID [2020-07-29 01:19:18,805 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-29 01:19:18,805 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537207778] [2020-07-29 01:19:18,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:18,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-29 01:19:18,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079525885] [2020-07-29 01:19:18,806 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-07-29 01:19:18,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:18,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:19:18,828 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-29 01:19:18,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-29 01:19:18,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:18,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:19:18,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:19:18,829 INFO L87 Difference]: Start difference. First operand 117 states and 133 transitions. Second operand 7 states. [2020-07-29 01:19:20,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:20,275 INFO L93 Difference]: Finished difference Result 168 states and 194 transitions. [2020-07-29 01:19:20,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 01:19:20,275 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-07-29 01:19:20,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:20,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:19:20,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions. [2020-07-29 01:19:20,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:19:20,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions. [2020-07-29 01:19:20,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 158 transitions. [2020-07-29 01:19:20,483 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:20,486 INFO L225 Difference]: With dead ends: 168 [2020-07-29 01:19:20,487 INFO L226 Difference]: Without dead ends: 168 [2020-07-29 01:19:20,487 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-07-29 01:19:20,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2020-07-29 01:19:20,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 103. [2020-07-29 01:19:20,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:20,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 168 states. Second operand 103 states. [2020-07-29 01:19:20,492 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand 103 states. [2020-07-29 01:19:20,493 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 103 states. [2020-07-29 01:19:20,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:20,498 INFO L93 Difference]: Finished difference Result 168 states and 194 transitions. [2020-07-29 01:19:20,499 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 194 transitions. [2020-07-29 01:19:20,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:20,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:20,500 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 168 states. [2020-07-29 01:19:20,500 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 168 states. [2020-07-29 01:19:20,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:20,506 INFO L93 Difference]: Finished difference Result 168 states and 194 transitions. [2020-07-29 01:19:20,506 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 194 transitions. [2020-07-29 01:19:20,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:20,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:20,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:20,508 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:20,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-07-29 01:19:20,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 118 transitions. [2020-07-29 01:19:20,511 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 118 transitions. Word has length 19 [2020-07-29 01:19:20,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:20,512 INFO L479 AbstractCegarLoop]: Abstraction has 103 states and 118 transitions. [2020-07-29 01:19:20,512 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-29 01:19:20,512 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2020-07-29 01:19:20,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-29 01:19:20,513 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:20,513 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-29 01:19:20,514 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-29 01:19:20,514 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr59ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:20,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:20,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1280450290, now seen corresponding path program 1 times [2020-07-29 01:19:20,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:20,515 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134500444] [2020-07-29 01:19:20,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:20,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:20,616 INFO L280 TraceCheckUtils]: 0: Hoare triple {4279#(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; {4270#true} is VALID [2020-07-29 01:19:20,616 INFO L280 TraceCheckUtils]: 1: Hoare triple {4270#true} assume true; {4270#true} is VALID [2020-07-29 01:19:20,617 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4270#true} {4270#true} #203#return; {4270#true} is VALID [2020-07-29 01:19:20,618 INFO L263 TraceCheckUtils]: 0: Hoare triple {4270#true} call ULTIMATE.init(); {4279#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:20,618 INFO L280 TraceCheckUtils]: 1: Hoare triple {4279#(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; {4270#true} is VALID [2020-07-29 01:19:20,618 INFO L280 TraceCheckUtils]: 2: Hoare triple {4270#true} assume true; {4270#true} is VALID [2020-07-29 01:19:20,618 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4270#true} {4270#true} #203#return; {4270#true} is VALID [2020-07-29 01:19:20,619 INFO L263 TraceCheckUtils]: 4: Hoare triple {4270#true} call #t~ret19 := main(); {4270#true} is VALID [2020-07-29 01:19:20,619 INFO L280 TraceCheckUtils]: 5: Hoare triple {4270#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {4270#true} is VALID [2020-07-29 01:19:20,619 INFO L280 TraceCheckUtils]: 6: Hoare triple {4270#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L986 {4270#true} is VALID [2020-07-29 01:19:20,619 INFO L280 TraceCheckUtils]: 7: Hoare triple {4270#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4270#true} is VALID [2020-07-29 01:19:20,620 INFO L280 TraceCheckUtils]: 8: Hoare triple {4270#true} assume !(0 != #t~nondet1);havoc #t~nondet1;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {4270#true} is VALID [2020-07-29 01:19:20,620 INFO L280 TraceCheckUtils]: 9: Hoare triple {4270#true} assume !(0 != #t~nondet4);havoc #t~nondet4; {4270#true} is VALID [2020-07-29 01:19:20,625 INFO L280 TraceCheckUtils]: 10: Hoare triple {4270#true} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L987-12 {4270#true} is VALID [2020-07-29 01:19:20,626 INFO L280 TraceCheckUtils]: 11: Hoare triple {4270#true} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L987-13 {4270#true} is VALID [2020-07-29 01:19:20,626 INFO L280 TraceCheckUtils]: 12: Hoare triple {4270#true} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {4270#true} is VALID [2020-07-29 01:19:20,626 INFO L280 TraceCheckUtils]: 13: Hoare triple {4270#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {4270#true} is VALID [2020-07-29 01:19:20,641 INFO L280 TraceCheckUtils]: 14: Hoare triple {4270#true} assume !!(0 != #t~nondet5);havoc #t~nondet5;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(12); {4275#(= (select |#valid| |main_#t~malloc6.base|) 1)} is VALID [2020-07-29 01:19:20,643 INFO L280 TraceCheckUtils]: 15: Hoare triple {4275#(= (select |#valid| |main_#t~malloc6.base|) 1)} SUMMARY for call write~$Pointer$(#t~malloc6.base, #t~malloc6.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L990-3 {4276#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-29 01:19:20,644 INFO L280 TraceCheckUtils]: 16: Hoare triple {4276#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} SUMMARY for call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L990-4 {4277#(= 1 (select |#valid| |main_#t~mem7.base|))} is VALID [2020-07-29 01:19:20,645 INFO L280 TraceCheckUtils]: 17: Hoare triple {4277#(= 1 (select |#valid| |main_#t~mem7.base|))} ~x~0.base, ~x~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {4278#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-29 01:19:20,645 INFO L280 TraceCheckUtils]: 18: Hoare triple {4278#(= 1 (select |#valid| main_~x~0.base))} assume !(1 == #valid[~x~0.base]); {4271#false} is VALID [2020-07-29 01:19:20,646 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-29 01:19:20,647 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134500444] [2020-07-29 01:19:20,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:20,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-29 01:19:20,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955236577] [2020-07-29 01:19:20,648 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-07-29 01:19:20,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:20,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:19:20,672 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-29 01:19:20,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-29 01:19:20,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:20,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:19:20,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:19:20,674 INFO L87 Difference]: Start difference. First operand 103 states and 118 transitions. Second operand 7 states. [2020-07-29 01:19:21,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:21,856 INFO L93 Difference]: Finished difference Result 154 states and 176 transitions. [2020-07-29 01:19:21,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:19:21,857 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-07-29 01:19:21,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:21,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:19:21,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2020-07-29 01:19:21,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:19:21,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2020-07-29 01:19:21,863 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 142 transitions. [2020-07-29 01:19:22,017 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:22,020 INFO L225 Difference]: With dead ends: 154 [2020-07-29 01:19:22,021 INFO L226 Difference]: Without dead ends: 154 [2020-07-29 01:19:22,021 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:19:22,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-07-29 01:19:22,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 102. [2020-07-29 01:19:22,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:22,028 INFO L82 GeneralOperation]: Start isEquivalent. First operand 154 states. Second operand 102 states. [2020-07-29 01:19:22,028 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states. Second operand 102 states. [2020-07-29 01:19:22,029 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 102 states. [2020-07-29 01:19:22,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:22,047 INFO L93 Difference]: Finished difference Result 154 states and 176 transitions. [2020-07-29 01:19:22,050 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 176 transitions. [2020-07-29 01:19:22,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:22,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:22,052 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 154 states. [2020-07-29 01:19:22,052 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 154 states. [2020-07-29 01:19:22,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:22,062 INFO L93 Difference]: Finished difference Result 154 states and 176 transitions. [2020-07-29 01:19:22,062 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 176 transitions. [2020-07-29 01:19:22,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:22,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:22,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:22,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:22,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-07-29 01:19:22,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2020-07-29 01:19:22,070 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 19 [2020-07-29 01:19:22,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:22,070 INFO L479 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2020-07-29 01:19:22,071 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-29 01:19:22,071 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2020-07-29 01:19:22,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-29 01:19:22,072 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:22,072 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] [2020-07-29 01:19:22,073 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-29 01:19:22,073 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr59ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:22,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:22,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1881660023, now seen corresponding path program 1 times [2020-07-29 01:19:22,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:22,075 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663645289] [2020-07-29 01:19:22,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:22,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:22,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:22,200 INFO L280 TraceCheckUtils]: 0: Hoare triple {4860#(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; {4853#true} is VALID [2020-07-29 01:19:22,200 INFO L280 TraceCheckUtils]: 1: Hoare triple {4853#true} assume true; {4853#true} is VALID [2020-07-29 01:19:22,201 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4853#true} {4853#true} #203#return; {4853#true} is VALID [2020-07-29 01:19:22,202 INFO L263 TraceCheckUtils]: 0: Hoare triple {4853#true} call ULTIMATE.init(); {4860#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:22,203 INFO L280 TraceCheckUtils]: 1: Hoare triple {4860#(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; {4853#true} is VALID [2020-07-29 01:19:22,203 INFO L280 TraceCheckUtils]: 2: Hoare triple {4853#true} assume true; {4853#true} is VALID [2020-07-29 01:19:22,203 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4853#true} {4853#true} #203#return; {4853#true} is VALID [2020-07-29 01:19:22,204 INFO L263 TraceCheckUtils]: 4: Hoare triple {4853#true} call #t~ret19 := main(); {4853#true} is VALID [2020-07-29 01:19:22,205 INFO L280 TraceCheckUtils]: 5: Hoare triple {4853#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {4858#(not (= 0 main_~head~0.base))} is VALID [2020-07-29 01:19:22,206 INFO L280 TraceCheckUtils]: 6: Hoare triple {4858#(not (= 0 main_~head~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L986 {4858#(not (= 0 main_~head~0.base))} is VALID [2020-07-29 01:19:22,207 INFO L280 TraceCheckUtils]: 7: Hoare triple {4858#(not (= 0 main_~head~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4858#(not (= 0 main_~head~0.base))} is VALID [2020-07-29 01:19:22,208 INFO L280 TraceCheckUtils]: 8: Hoare triple {4858#(not (= 0 main_~head~0.base))} assume !(0 != #t~nondet1);havoc #t~nondet1;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {4858#(not (= 0 main_~head~0.base))} is VALID [2020-07-29 01:19:22,209 INFO L280 TraceCheckUtils]: 9: Hoare triple {4858#(not (= 0 main_~head~0.base))} assume !(0 != #t~nondet4);havoc #t~nondet4; {4858#(not (= 0 main_~head~0.base))} is VALID [2020-07-29 01:19:22,209 INFO L280 TraceCheckUtils]: 10: Hoare triple {4858#(not (= 0 main_~head~0.base))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L987-12 {4858#(not (= 0 main_~head~0.base))} is VALID [2020-07-29 01:19:22,210 INFO L280 TraceCheckUtils]: 11: Hoare triple {4858#(not (= 0 main_~head~0.base))} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L987-13 {4858#(not (= 0 main_~head~0.base))} is VALID [2020-07-29 01:19:22,211 INFO L280 TraceCheckUtils]: 12: Hoare triple {4858#(not (= 0 main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {4858#(not (= 0 main_~head~0.base))} is VALID [2020-07-29 01:19:22,212 INFO L280 TraceCheckUtils]: 13: Hoare triple {4858#(not (= 0 main_~head~0.base))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {4858#(not (= 0 main_~head~0.base))} is VALID [2020-07-29 01:19:22,213 INFO L280 TraceCheckUtils]: 14: Hoare triple {4858#(not (= 0 main_~head~0.base))} assume !(0 != #t~nondet5);havoc #t~nondet5; {4858#(not (= 0 main_~head~0.base))} is VALID [2020-07-29 01:19:22,215 INFO L280 TraceCheckUtils]: 15: Hoare triple {4858#(not (= 0 main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {4859#(not (= 0 main_~x~0.base))} is VALID [2020-07-29 01:19:22,216 INFO L280 TraceCheckUtils]: 16: Hoare triple {4859#(not (= 0 main_~x~0.base))} assume !(~x~0.base != 0 || ~x~0.offset != 0); {4854#false} is VALID [2020-07-29 01:19:22,216 INFO L280 TraceCheckUtils]: 17: Hoare triple {4854#false} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {4854#false} is VALID [2020-07-29 01:19:22,216 INFO L280 TraceCheckUtils]: 18: Hoare triple {4854#false} assume !(~x~0.base != 0 || ~x~0.offset != 0); {4854#false} is VALID [2020-07-29 01:19:22,217 INFO L280 TraceCheckUtils]: 19: Hoare triple {4854#false} #res := 0; {4854#false} is VALID [2020-07-29 01:19:22,217 INFO L280 TraceCheckUtils]: 20: Hoare triple {4854#false} assume !(#valid == old(#valid)); {4854#false} is VALID [2020-07-29 01:19:22,218 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-29 01:19:22,219 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663645289] [2020-07-29 01:19:22,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:22,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:19:22,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343153184] [2020-07-29 01:19:22,220 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-07-29 01:19:22,220 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:22,220 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:19:22,246 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:22,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:19:22,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:22,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:19:22,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:19:22,247 INFO L87 Difference]: Start difference. First operand 102 states and 117 transitions. Second operand 5 states. [2020-07-29 01:19:22,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:22,795 INFO L93 Difference]: Finished difference Result 133 states and 149 transitions. [2020-07-29 01:19:22,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:19:22,796 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-07-29 01:19:22,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:22,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:19:22,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 141 transitions. [2020-07-29 01:19:22,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:19:22,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 141 transitions. [2020-07-29 01:19:22,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 141 transitions. [2020-07-29 01:19:22,982 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:22,985 INFO L225 Difference]: With dead ends: 133 [2020-07-29 01:19:22,986 INFO L226 Difference]: Without dead ends: 133 [2020-07-29 01:19:22,986 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-29 01:19:22,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-07-29 01:19:22,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 102. [2020-07-29 01:19:22,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:22,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 102 states. [2020-07-29 01:19:22,989 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 102 states. [2020-07-29 01:19:22,990 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 102 states. [2020-07-29 01:19:22,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:22,993 INFO L93 Difference]: Finished difference Result 133 states and 149 transitions. [2020-07-29 01:19:22,993 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 149 transitions. [2020-07-29 01:19:22,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:22,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:22,994 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 133 states. [2020-07-29 01:19:22,994 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 133 states. [2020-07-29 01:19:22,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:22,997 INFO L93 Difference]: Finished difference Result 133 states and 149 transitions. [2020-07-29 01:19:22,997 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 149 transitions. [2020-07-29 01:19:22,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:22,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:22,998 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:22,998 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:22,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-07-29 01:19:23,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2020-07-29 01:19:23,000 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 21 [2020-07-29 01:19:23,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:23,001 INFO L479 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2020-07-29 01:19:23,001 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:19:23,001 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2020-07-29 01:19:23,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-29 01:19:23,001 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:23,002 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] [2020-07-29 01:19:23,002 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-29 01:19:23,002 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr59ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:23,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:23,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1775325807, now seen corresponding path program 1 times [2020-07-29 01:19:23,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:23,003 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244033857] [2020-07-29 01:19:23,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:23,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:19:23,020 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:19:23,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:19:23,042 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:19:23,095 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:19:23,095 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-29 01:19:23,095 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-29 01:19:23,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.07 01:19:23 BoogieIcfgContainer [2020-07-29 01:19:23,124 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-29 01:19:23,124 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:19:23,125 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:19:23,125 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:19:23,125 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:19:09" (3/4) ... [2020-07-29 01:19:23,130 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-07-29 01:19:23,178 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-29 01:19:23,178 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:19:23,181 INFO L168 Benchmark]: Toolchain (without parser) took 16024.55 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 361.2 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -103.3 MB). Peak memory consumption was 258.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:19:23,182 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:19:23,182 INFO L168 Benchmark]: CACSL2BoogieTranslator took 711.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -156.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:19:23,183 INFO L168 Benchmark]: Boogie Preprocessor took 111.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:19:23,184 INFO L168 Benchmark]: RCFGBuilder took 1096.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 97.2 MB). Peak memory consumption was 97.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:19:23,184 INFO L168 Benchmark]: TraceAbstraction took 14044.48 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 224.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -50.3 MB). Peak memory consumption was 174.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:19:23,185 INFO L168 Benchmark]: Witness Printer took 53.45 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:19:23,188 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 711.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -156.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 111.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1096.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 97.2 MB). Peak memory consumption was 97.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14044.48 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 224.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -50.3 MB). Peak memory consumption was 174.6 MB. Max. memory is 11.5 GB. * Witness Printer took 53.45 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 996]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L985] SLL* head = malloc(sizeof(SLL)); VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L986] head->next = ((void*)0) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L987] COND FALSE !(__VERIFIER_nondet_int()) [L987] COND FALSE !(__VERIFIER_nondet_int()) [L987] head->data = 0 VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L987] head->opt = head VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L988] SLL* x = head; VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, x={-1:0}] [L990] COND FALSE !(__VERIFIER_nondet_int()) [L993] x = head VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, x={-1:0}] [L994] COND TRUE x != ((void*)0) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, x={-1:0}] [L996] EXPR x->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, x={-1:0}, x->data=0] [L996] EXPR x->data == 2 && x->opt == x VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, x={-1:0}, x->data=0, x->data == 2 && x->opt == x=0] [L996] COND TRUE !(x->data == 2 && x->opt == x) [L996] __VERIFIER_error() VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, x={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 130 locations, 60 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.9s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 11.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 838 SDtfs, 952 SDslu, 1243 SDs, 0 SdLazy, 2756 SolverSat, 117 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 383 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 155 NumberOfCodeBlocks, 155 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 124 ConstructedInterpolants, 0 QuantifiedInterpolants, 7278 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...