./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/sll-token-1.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-token-1.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 60dcf5da7f0124de96473d8010137f60c5cb2803 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:25,825 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:19:25,828 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:19:25,847 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:19:25,847 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:19:25,850 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:19:25,852 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:19:25,864 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:19:25,868 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:19:25,869 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:19:25,870 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:19:25,871 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:19:25,871 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:19:25,873 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:19:25,874 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:19:25,876 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:19:25,877 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:19:25,878 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:19:25,879 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:19:25,881 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:19:25,883 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:19:25,884 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:19:25,886 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:19:25,886 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:19:25,889 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:19:25,890 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:19:25,890 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:19:25,891 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:19:25,892 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:19:25,893 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:19:25,893 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:19:25,894 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:19:25,895 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:19:25,896 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:19:25,897 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:19:25,897 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:19:25,898 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:19:25,898 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:19:25,898 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:19:25,899 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:19:25,900 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:19:25,901 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:25,917 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:19:25,917 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:19:25,918 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:19:25,921 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:19:25,922 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:19:25,922 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:19:25,922 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 01:19:25,923 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:19:25,923 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:19:25,923 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 01:19:25,924 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:19:25,924 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-07-29 01:19:25,924 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-07-29 01:19:25,924 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 01:19:25,925 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-07-29 01:19:25,925 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 01:19:25,925 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:19:25,926 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:19:25,926 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:19:25,926 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 01:19:25,927 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 01:19:25,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:19:25,927 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:19:25,928 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 01:19:25,928 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:19:25,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-29 01:19:25,928 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:19:25,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 -> 60dcf5da7f0124de96473d8010137f60c5cb2803 [2020-07-29 01:19:26,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:19:26,248 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:19:26,252 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:19:26,253 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:19:26,254 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:19:26,254 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-token-1.i [2020-07-29 01:19:26,336 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca4fb6365/72ef5c54edf84254a53bf563b5de9a24/FLAGaa014d773 [2020-07-29 01:19:26,873 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:19:26,874 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-1.i [2020-07-29 01:19:26,887 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca4fb6365/72ef5c54edf84254a53bf563b5de9a24/FLAGaa014d773 [2020-07-29 01:19:27,176 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca4fb6365/72ef5c54edf84254a53bf563b5de9a24 [2020-07-29 01:19:27,181 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:19:27,184 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-07-29 01:19:27,185 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:19:27,186 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:19:27,189 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:19:27,191 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:19:27" (1/1) ... [2020-07-29 01:19:27,194 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@669a2e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:19:27, skipping insertion in model container [2020-07-29 01:19:27,195 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:19:27" (1/1) ... [2020-07-29 01:19:27,203 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:19:27,263 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:19:27,742 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:19:27,756 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:19:27,800 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:19:27,858 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:19:27,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:19:27 WrapperNode [2020-07-29 01:19:27,859 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:19:27,860 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:19:27,860 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:19:27,860 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:19:27,876 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:27" (1/1) ... [2020-07-29 01:19:27,877 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:27" (1/1) ... [2020-07-29 01:19:27,894 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:27" (1/1) ... [2020-07-29 01:19:27,895 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:27" (1/1) ... [2020-07-29 01:19:27,925 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:27" (1/1) ... [2020-07-29 01:19:27,941 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:27" (1/1) ... [2020-07-29 01:19:27,949 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:27" (1/1) ... [2020-07-29 01:19:27,958 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:19:27,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:19:27,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:19:27,959 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:19:27,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:19:27" (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:28,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-29 01:19:28,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:19:28,041 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-29 01:19:28,041 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-29 01:19:28,041 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-29 01:19:28,042 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-29 01:19:28,042 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-29 01:19:28,042 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-29 01:19:28,042 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-29 01:19:28,043 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-29 01:19:28,043 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-29 01:19:28,043 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-29 01:19:28,043 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-29 01:19:28,044 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-29 01:19:28,044 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-29 01:19:28,044 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-29 01:19:28,044 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-29 01:19:28,045 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-29 01:19:28,045 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-29 01:19:28,045 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-29 01:19:28,045 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-29 01:19:28,046 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-29 01:19:28,046 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-29 01:19:28,046 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-29 01:19:28,046 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-29 01:19:28,047 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-29 01:19:28,047 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-29 01:19:28,047 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-29 01:19:28,047 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-29 01:19:28,048 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-29 01:19:28,048 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-29 01:19:28,048 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-29 01:19:28,048 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-29 01:19:28,049 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-29 01:19:28,049 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-29 01:19:28,049 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-29 01:19:28,049 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-29 01:19:28,050 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-29 01:19:28,050 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-29 01:19:28,050 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-29 01:19:28,050 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-29 01:19:28,051 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-29 01:19:28,051 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-29 01:19:28,051 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-29 01:19:28,051 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-29 01:19:28,052 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-29 01:19:28,052 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-29 01:19:28,052 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-29 01:19:28,052 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-29 01:19:28,052 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-29 01:19:28,053 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-29 01:19:28,053 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-29 01:19:28,053 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-29 01:19:28,053 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-29 01:19:28,054 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-29 01:19:28,054 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-29 01:19:28,054 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-29 01:19:28,054 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-29 01:19:28,055 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-29 01:19:28,055 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-29 01:19:28,055 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-29 01:19:28,055 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-29 01:19:28,055 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-29 01:19:28,056 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-29 01:19:28,056 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-29 01:19:28,056 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-29 01:19:28,056 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-29 01:19:28,057 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-29 01:19:28,057 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-29 01:19:28,057 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-29 01:19:28,057 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-29 01:19:28,058 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-29 01:19:28,058 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-29 01:19:28,058 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-29 01:19:28,058 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-29 01:19:28,058 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-29 01:19:28,059 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-29 01:19:28,059 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-29 01:19:28,059 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-29 01:19:28,059 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-29 01:19:28,059 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-29 01:19:28,060 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-29 01:19:28,060 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-29 01:19:28,060 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-29 01:19:28,060 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-29 01:19:28,061 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-29 01:19:28,061 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-29 01:19:28,061 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-29 01:19:28,061 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-29 01:19:28,061 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-29 01:19:28,062 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-29 01:19:28,062 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-29 01:19:28,062 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-29 01:19:28,062 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-29 01:19:28,062 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-29 01:19:28,063 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-29 01:19:28,063 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-29 01:19:28,063 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-29 01:19:28,063 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-29 01:19:28,064 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-29 01:19:28,064 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-29 01:19:28,064 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-29 01:19:28,064 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-29 01:19:28,064 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-29 01:19:28,065 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-29 01:19:28,065 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-29 01:19:28,065 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-29 01:19:28,065 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-29 01:19:28,065 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-29 01:19:28,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-29 01:19:28,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-29 01:19:28,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:19:28,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-29 01:19:28,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:19:28,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:19:28,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-29 01:19:28,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:19:28,930 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:19:28,931 INFO L295 CfgBuilder]: Removed 15 assume(true) statements. [2020-07-29 01:19:28,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:19:28 BoogieIcfgContainer [2020-07-29 01:19:28,937 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:19:28,938 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-29 01:19:28,938 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-29 01:19:28,942 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-29 01:19:28,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.07 01:19:27" (1/3) ... [2020-07-29 01:19:28,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a1f40bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:19:28, skipping insertion in model container [2020-07-29 01:19:28,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:19:27" (2/3) ... [2020-07-29 01:19:28,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a1f40bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:19:28, skipping insertion in model container [2020-07-29 01:19:28,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:19:28" (3/3) ... [2020-07-29 01:19:28,946 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-token-1.i [2020-07-29 01:19:28,959 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-29 01:19:28,969 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 54 error locations. [2020-07-29 01:19:28,984 INFO L251 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2020-07-29 01:19:29,008 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-29 01:19:29,009 INFO L376 AbstractCegarLoop]: Hoare is false [2020-07-29 01:19:29,009 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-29 01:19:29,009 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:19:29,010 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:19:29,010 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-29 01:19:29,010 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:19:29,010 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-29 01:19:29,032 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states. [2020-07-29 01:19:29,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-29 01:19:29,043 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:29,044 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:29,045 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19ASSERT_VIOLATIONMEMORY_LEAK, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_LEAK, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:29,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:29,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1914108980, now seen corresponding path program 1 times [2020-07-29 01:19:29,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:29,064 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741989285] [2020-07-29 01:19:29,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:29,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:29,302 INFO L280 TraceCheckUtils]: 0: Hoare triple {131#(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; {125#true} is VALID [2020-07-29 01:19:29,302 INFO L280 TraceCheckUtils]: 1: Hoare triple {125#true} assume true; {125#true} is VALID [2020-07-29 01:19:29,303 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {125#true} {125#true} #234#return; {125#true} is VALID [2020-07-29 01:19:29,307 INFO L263 TraceCheckUtils]: 0: Hoare triple {125#true} call ULTIMATE.init(); {131#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:29,307 INFO L280 TraceCheckUtils]: 1: Hoare triple {131#(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; {125#true} is VALID [2020-07-29 01:19:29,308 INFO L280 TraceCheckUtils]: 2: Hoare triple {125#true} assume true; {125#true} is VALID [2020-07-29 01:19:29,308 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {125#true} {125#true} #234#return; {125#true} is VALID [2020-07-29 01:19:29,308 INFO L263 TraceCheckUtils]: 4: Hoare triple {125#true} call #t~ret16 := main(); {125#true} is VALID [2020-07-29 01:19:29,311 INFO L280 TraceCheckUtils]: 5: Hoare triple {125#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {130#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-29 01:19:29,312 INFO L280 TraceCheckUtils]: 6: Hoare triple {130#(= 1 (select |#valid| main_~head~0.base))} assume !(1 == #valid[~head~0.base]); {126#false} is VALID [2020-07-29 01:19:29,313 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:29,314 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741989285] [2020-07-29 01:19:29,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:29,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:19:29,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798612244] [2020-07-29 01:19:29,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-29 01:19:29,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:29,331 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:19:29,348 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:29,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:19:29,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:29,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:19:29,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:19:29,362 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 4 states. [2020-07-29 01:19:30,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:30,040 INFO L93 Difference]: Finished difference Result 140 states and 143 transitions. [2020-07-29 01:19:30,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:19:30,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-29 01:19:30,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:30,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:19:30,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 170 transitions. [2020-07-29 01:19:30,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:19:30,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 170 transitions. [2020-07-29 01:19:30,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 170 transitions. [2020-07-29 01:19:30,296 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:30,315 INFO L225 Difference]: With dead ends: 140 [2020-07-29 01:19:30,316 INFO L226 Difference]: Without dead ends: 137 [2020-07-29 01:19:30,318 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:30,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-07-29 01:19:30,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 117. [2020-07-29 01:19:30,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:30,365 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand 117 states. [2020-07-29 01:19:30,366 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 117 states. [2020-07-29 01:19:30,366 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 117 states. [2020-07-29 01:19:30,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:30,378 INFO L93 Difference]: Finished difference Result 137 states and 140 transitions. [2020-07-29 01:19:30,378 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 140 transitions. [2020-07-29 01:19:30,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:30,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:30,381 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 137 states. [2020-07-29 01:19:30,382 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 137 states. [2020-07-29 01:19:30,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:30,393 INFO L93 Difference]: Finished difference Result 137 states and 140 transitions. [2020-07-29 01:19:30,393 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 140 transitions. [2020-07-29 01:19:30,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:30,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:30,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:30,398 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:30,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-07-29 01:19:30,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 119 transitions. [2020-07-29 01:19:30,407 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 119 transitions. Word has length 7 [2020-07-29 01:19:30,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:30,407 INFO L479 AbstractCegarLoop]: Abstraction has 117 states and 119 transitions. [2020-07-29 01:19:30,408 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:19:30,408 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 119 transitions. [2020-07-29 01:19:30,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-29 01:19:30,409 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:30,409 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:30,409 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-29 01:19:30,410 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19ASSERT_VIOLATIONMEMORY_LEAK, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_LEAK, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:30,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:30,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1914108979, now seen corresponding path program 1 times [2020-07-29 01:19:30,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:30,411 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928363328] [2020-07-29 01:19:30,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:30,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:30,521 INFO L280 TraceCheckUtils]: 0: Hoare triple {671#(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; {665#true} is VALID [2020-07-29 01:19:30,521 INFO L280 TraceCheckUtils]: 1: Hoare triple {665#true} assume true; {665#true} is VALID [2020-07-29 01:19:30,522 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {665#true} {665#true} #234#return; {665#true} is VALID [2020-07-29 01:19:30,523 INFO L263 TraceCheckUtils]: 0: Hoare triple {665#true} call ULTIMATE.init(); {671#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:30,523 INFO L280 TraceCheckUtils]: 1: Hoare triple {671#(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; {665#true} is VALID [2020-07-29 01:19:30,524 INFO L280 TraceCheckUtils]: 2: Hoare triple {665#true} assume true; {665#true} is VALID [2020-07-29 01:19:30,524 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {665#true} {665#true} #234#return; {665#true} is VALID [2020-07-29 01:19:30,524 INFO L263 TraceCheckUtils]: 4: Hoare triple {665#true} call #t~ret16 := main(); {665#true} is VALID [2020-07-29 01:19:30,527 INFO L280 TraceCheckUtils]: 5: Hoare triple {665#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {670#(and (= 8 (select |#length| main_~head~0.base)) (= 0 main_~head~0.offset))} is VALID [2020-07-29 01:19:30,529 INFO L280 TraceCheckUtils]: 6: Hoare triple {670#(and (= 8 (select |#length| main_~head~0.base)) (= 0 main_~head~0.offset))} assume !(4 + ~head~0.offset <= #length[~head~0.base] && 0 <= ~head~0.offset); {666#false} is VALID [2020-07-29 01:19:30,529 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:30,530 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928363328] [2020-07-29 01:19:30,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:30,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:19:30,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187666949] [2020-07-29 01:19:30,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-29 01:19:30,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:30,533 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:19:30,545 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:30,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:19:30,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:30,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:19:30,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:19:30,547 INFO L87 Difference]: Start difference. First operand 117 states and 119 transitions. Second operand 4 states. [2020-07-29 01:19:31,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:31,208 INFO L93 Difference]: Finished difference Result 143 states and 145 transitions. [2020-07-29 01:19:31,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:19:31,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-29 01:19:31,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:31,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:19:31,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2020-07-29 01:19:31,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:19:31,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2020-07-29 01:19:31,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 147 transitions. [2020-07-29 01:19:31,399 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:31,408 INFO L225 Difference]: With dead ends: 143 [2020-07-29 01:19:31,409 INFO L226 Difference]: Without dead ends: 143 [2020-07-29 01:19:31,410 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:31,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-07-29 01:19:31,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 115. [2020-07-29 01:19:31,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:31,430 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand 115 states. [2020-07-29 01:19:31,430 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 115 states. [2020-07-29 01:19:31,430 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 115 states. [2020-07-29 01:19:31,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:31,447 INFO L93 Difference]: Finished difference Result 143 states and 145 transitions. [2020-07-29 01:19:31,447 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 145 transitions. [2020-07-29 01:19:31,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:31,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:31,452 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 143 states. [2020-07-29 01:19:31,452 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 143 states. [2020-07-29 01:19:31,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:31,461 INFO L93 Difference]: Finished difference Result 143 states and 145 transitions. [2020-07-29 01:19:31,462 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 145 transitions. [2020-07-29 01:19:31,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:31,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:31,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:31,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:31,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-07-29 01:19:31,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2020-07-29 01:19:31,475 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 7 [2020-07-29 01:19:31,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:31,476 INFO L479 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2020-07-29 01:19:31,476 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:19:31,476 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2020-07-29 01:19:31,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-29 01:19:31,477 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:31,477 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:31,477 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-29 01:19:31,478 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19ASSERT_VIOLATIONMEMORY_LEAK, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_LEAK, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:31,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:31,478 INFO L82 PathProgramCache]: Analyzing trace with hash 889290307, now seen corresponding path program 1 times [2020-07-29 01:19:31,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:31,479 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033380743] [2020-07-29 01:19:31,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:31,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:31,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:31,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:31,606 INFO L280 TraceCheckUtils]: 0: Hoare triple {1225#(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; {1218#true} is VALID [2020-07-29 01:19:31,606 INFO L280 TraceCheckUtils]: 1: Hoare triple {1218#true} assume true; {1218#true} is VALID [2020-07-29 01:19:31,607 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1218#true} {1218#true} #234#return; {1218#true} is VALID [2020-07-29 01:19:31,608 INFO L263 TraceCheckUtils]: 0: Hoare triple {1218#true} call ULTIMATE.init(); {1225#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:31,608 INFO L280 TraceCheckUtils]: 1: Hoare triple {1225#(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; {1218#true} is VALID [2020-07-29 01:19:31,608 INFO L280 TraceCheckUtils]: 2: Hoare triple {1218#true} assume true; {1218#true} is VALID [2020-07-29 01:19:31,609 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1218#true} {1218#true} #234#return; {1218#true} is VALID [2020-07-29 01:19:31,609 INFO L263 TraceCheckUtils]: 4: Hoare triple {1218#true} call #t~ret16 := main(); {1218#true} is VALID [2020-07-29 01:19:31,609 INFO L280 TraceCheckUtils]: 5: Hoare triple {1218#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {1218#true} is VALID [2020-07-29 01:19:31,615 INFO L280 TraceCheckUtils]: 6: Hoare triple {1218#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L993 {1223#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-29 01:19:31,618 INFO L280 TraceCheckUtils]: 7: Hoare triple {1223#(= 1 (select |#valid| main_~head~0.base))} SUMMARY for call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L993-1 {1223#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-29 01:19:31,619 INFO L280 TraceCheckUtils]: 8: Hoare triple {1223#(= 1 (select |#valid| main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1224#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-29 01:19:31,620 INFO L280 TraceCheckUtils]: 9: Hoare triple {1224#(= 1 (select |#valid| main_~x~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1224#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-29 01:19:31,621 INFO L280 TraceCheckUtils]: 10: Hoare triple {1224#(= 1 (select |#valid| main_~x~0.base))} assume !(0 != #t~nondet1);havoc #t~nondet1; {1224#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-29 01:19:31,622 INFO L280 TraceCheckUtils]: 11: Hoare triple {1224#(= 1 (select |#valid| main_~x~0.base))} assume !(1 == #valid[~x~0.base]); {1219#false} is VALID [2020-07-29 01:19:31,625 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:31,625 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033380743] [2020-07-29 01:19:31,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:31,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:19:31,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335824373] [2020-07-29 01:19:31,626 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-29 01:19:31,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:31,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:19:31,643 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:31,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:19:31,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:31,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:19:31,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:19:31,646 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 5 states. [2020-07-29 01:19:32,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:32,257 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2020-07-29 01:19:32,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:19:32,258 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-29 01:19:32,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:32,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:19:32,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2020-07-29 01:19:32,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:19:32,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2020-07-29 01:19:32,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 141 transitions. [2020-07-29 01:19:32,439 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:32,444 INFO L225 Difference]: With dead ends: 121 [2020-07-29 01:19:32,444 INFO L226 Difference]: Without dead ends: 121 [2020-07-29 01:19:32,444 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:32,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-07-29 01:19:32,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 104. [2020-07-29 01:19:32,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:32,457 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand 104 states. [2020-07-29 01:19:32,457 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 104 states. [2020-07-29 01:19:32,457 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 104 states. [2020-07-29 01:19:32,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:32,465 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2020-07-29 01:19:32,466 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 124 transitions. [2020-07-29 01:19:32,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:32,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:32,467 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 121 states. [2020-07-29 01:19:32,467 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 121 states. [2020-07-29 01:19:32,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:32,472 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2020-07-29 01:19:32,473 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 124 transitions. [2020-07-29 01:19:32,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:32,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:32,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:32,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:32,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-07-29 01:19:32,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2020-07-29 01:19:32,478 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 12 [2020-07-29 01:19:32,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:32,479 INFO L479 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2020-07-29 01:19:32,479 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:19:32,479 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2020-07-29 01:19:32,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-29 01:19:32,480 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:32,480 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:32,480 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-29 01:19:32,481 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19ASSERT_VIOLATIONMEMORY_LEAK, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_LEAK, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:32,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:32,481 INFO L82 PathProgramCache]: Analyzing trace with hash 889290308, now seen corresponding path program 1 times [2020-07-29 01:19:32,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:32,482 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805534945] [2020-07-29 01:19:32,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:32,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:32,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:32,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:32,576 INFO L280 TraceCheckUtils]: 0: Hoare triple {1704#(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; {1697#true} is VALID [2020-07-29 01:19:32,577 INFO L280 TraceCheckUtils]: 1: Hoare triple {1697#true} assume true; {1697#true} is VALID [2020-07-29 01:19:32,577 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1697#true} {1697#true} #234#return; {1697#true} is VALID [2020-07-29 01:19:32,578 INFO L263 TraceCheckUtils]: 0: Hoare triple {1697#true} call ULTIMATE.init(); {1704#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:32,578 INFO L280 TraceCheckUtils]: 1: Hoare triple {1704#(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; {1697#true} is VALID [2020-07-29 01:19:32,579 INFO L280 TraceCheckUtils]: 2: Hoare triple {1697#true} assume true; {1697#true} is VALID [2020-07-29 01:19:32,579 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1697#true} {1697#true} #234#return; {1697#true} is VALID [2020-07-29 01:19:32,579 INFO L263 TraceCheckUtils]: 4: Hoare triple {1697#true} call #t~ret16 := main(); {1697#true} is VALID [2020-07-29 01:19:32,581 INFO L280 TraceCheckUtils]: 5: Hoare triple {1697#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {1702#(and (= 8 (select |#length| main_~head~0.base)) (= 0 main_~head~0.offset))} is VALID [2020-07-29 01:19:32,582 INFO L280 TraceCheckUtils]: 6: Hoare triple {1702#(and (= 8 (select |#length| main_~head~0.base)) (= 0 main_~head~0.offset))} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L993 {1702#(and (= 8 (select |#length| main_~head~0.base)) (= 0 main_~head~0.offset))} is VALID [2020-07-29 01:19:32,583 INFO L280 TraceCheckUtils]: 7: Hoare triple {1702#(and (= 8 (select |#length| main_~head~0.base)) (= 0 main_~head~0.offset))} SUMMARY for call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L993-1 {1702#(and (= 8 (select |#length| main_~head~0.base)) (= 0 main_~head~0.offset))} is VALID [2020-07-29 01:19:32,584 INFO L280 TraceCheckUtils]: 8: Hoare triple {1702#(and (= 8 (select |#length| main_~head~0.base)) (= 0 main_~head~0.offset))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1703#(and (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0))} is VALID [2020-07-29 01:19:32,585 INFO L280 TraceCheckUtils]: 9: Hoare triple {1703#(and (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1703#(and (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0))} is VALID [2020-07-29 01:19:32,586 INFO L280 TraceCheckUtils]: 10: Hoare triple {1703#(and (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0))} assume !(0 != #t~nondet1);havoc #t~nondet1; {1703#(and (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0))} is VALID [2020-07-29 01:19:32,587 INFO L280 TraceCheckUtils]: 11: Hoare triple {1703#(and (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0))} assume !(4 + (4 + ~x~0.offset) <= #length[~x~0.base] && 0 <= 4 + ~x~0.offset); {1698#false} is VALID [2020-07-29 01:19:32,588 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:32,588 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805534945] [2020-07-29 01:19:32,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:32,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:19:32,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055843012] [2020-07-29 01:19:32,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-29 01:19:32,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:32,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:19:32,605 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:32,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:19:32,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:32,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:19:32,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:19:32,606 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand 5 states. [2020-07-29 01:19:33,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:33,391 INFO L93 Difference]: Finished difference Result 184 states and 188 transitions. [2020-07-29 01:19:33,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:19:33,391 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-29 01:19:33,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:33,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:19:33,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 204 transitions. [2020-07-29 01:19:33,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:19:33,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 204 transitions. [2020-07-29 01:19:33,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 204 transitions. [2020-07-29 01:19:33,680 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:33,686 INFO L225 Difference]: With dead ends: 184 [2020-07-29 01:19:33,686 INFO L226 Difference]: Without dead ends: 184 [2020-07-29 01:19:33,686 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:33,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2020-07-29 01:19:33,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 133. [2020-07-29 01:19:33,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:33,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 184 states. Second operand 133 states. [2020-07-29 01:19:33,695 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand 133 states. [2020-07-29 01:19:33,695 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 133 states. [2020-07-29 01:19:33,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:33,702 INFO L93 Difference]: Finished difference Result 184 states and 188 transitions. [2020-07-29 01:19:33,703 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 188 transitions. [2020-07-29 01:19:33,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:33,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:33,704 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 184 states. [2020-07-29 01:19:33,704 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 184 states. [2020-07-29 01:19:33,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:33,712 INFO L93 Difference]: Finished difference Result 184 states and 188 transitions. [2020-07-29 01:19:33,712 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 188 transitions. [2020-07-29 01:19:33,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:33,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:33,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:33,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:33,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-07-29 01:19:33,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2020-07-29 01:19:33,719 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 12 [2020-07-29 01:19:33,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:33,719 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2020-07-29 01:19:33,719 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:19:33,719 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2020-07-29 01:19:33,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-29 01:19:33,720 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:33,720 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:33,720 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-29 01:19:33,721 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19ASSERT_VIOLATIONMEMORY_LEAK, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_LEAK, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:33,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:33,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1490170776, now seen corresponding path program 1 times [2020-07-29 01:19:33,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:33,722 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111020075] [2020-07-29 01:19:33,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:33,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:33,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:33,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:33,859 INFO L280 TraceCheckUtils]: 0: Hoare triple {2403#(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; {2394#true} is VALID [2020-07-29 01:19:33,859 INFO L280 TraceCheckUtils]: 1: Hoare triple {2394#true} assume true; {2394#true} is VALID [2020-07-29 01:19:33,860 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2394#true} {2394#true} #234#return; {2394#true} is VALID [2020-07-29 01:19:33,861 INFO L263 TraceCheckUtils]: 0: Hoare triple {2394#true} call ULTIMATE.init(); {2403#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:33,861 INFO L280 TraceCheckUtils]: 1: Hoare triple {2403#(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; {2394#true} is VALID [2020-07-29 01:19:33,861 INFO L280 TraceCheckUtils]: 2: Hoare triple {2394#true} assume true; {2394#true} is VALID [2020-07-29 01:19:33,861 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2394#true} {2394#true} #234#return; {2394#true} is VALID [2020-07-29 01:19:33,862 INFO L263 TraceCheckUtils]: 4: Hoare triple {2394#true} call #t~ret16 := main(); {2394#true} is VALID [2020-07-29 01:19:33,862 INFO L280 TraceCheckUtils]: 5: Hoare triple {2394#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {2394#true} is VALID [2020-07-29 01:19:33,862 INFO L280 TraceCheckUtils]: 6: Hoare triple {2394#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L993 {2394#true} is VALID [2020-07-29 01:19:33,862 INFO L280 TraceCheckUtils]: 7: Hoare triple {2394#true} SUMMARY for call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L993-1 {2394#true} is VALID [2020-07-29 01:19:33,863 INFO L280 TraceCheckUtils]: 8: Hoare triple {2394#true} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {2394#true} is VALID [2020-07-29 01:19:33,863 INFO L280 TraceCheckUtils]: 9: Hoare triple {2394#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2394#true} is VALID [2020-07-29 01:19:33,866 INFO L280 TraceCheckUtils]: 10: Hoare triple {2394#true} assume !!(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); {2399#(= (select |#valid| |main_#t~malloc2.base|) 1)} is VALID [2020-07-29 01:19:33,867 INFO L280 TraceCheckUtils]: 11: Hoare triple {2399#(= (select |#valid| |main_#t~malloc2.base|) 1)} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1002 {2400#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-29 01:19:33,867 INFO L280 TraceCheckUtils]: 12: Hoare triple {2400#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1002-1 {2401#(= 1 (select |#valid| |main_#t~mem3.base|))} is VALID [2020-07-29 01:19:33,868 INFO L280 TraceCheckUtils]: 13: Hoare triple {2401#(= 1 (select |#valid| |main_#t~mem3.base|))} ~x~0.base, ~x~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {2402#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-29 01:19:33,870 INFO L280 TraceCheckUtils]: 14: Hoare triple {2402#(= 1 (select |#valid| main_~x~0.base))} assume !(1 == #valid[~x~0.base]); {2395#false} is VALID [2020-07-29 01:19:33,870 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:33,870 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111020075] [2020-07-29 01:19:33,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:33,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-29 01:19:33,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684339900] [2020-07-29 01:19:33,871 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-07-29 01:19:33,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:33,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:19:33,888 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:33,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-29 01:19:33,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:33,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:19:33,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:19:33,890 INFO L87 Difference]: Start difference. First operand 133 states and 144 transitions. Second operand 7 states. [2020-07-29 01:19:35,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:35,228 INFO L93 Difference]: Finished difference Result 200 states and 216 transitions. [2020-07-29 01:19:35,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:19:35,228 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-07-29 01:19:35,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:35,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:19:35,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 172 transitions. [2020-07-29 01:19:35,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:19:35,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 172 transitions. [2020-07-29 01:19:35,235 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 172 transitions. [2020-07-29 01:19:35,455 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:35,460 INFO L225 Difference]: With dead ends: 200 [2020-07-29 01:19:35,461 INFO L226 Difference]: Without dead ends: 200 [2020-07-29 01:19:35,461 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:19:35,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2020-07-29 01:19:35,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 132. [2020-07-29 01:19:35,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:35,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 200 states. Second operand 132 states. [2020-07-29 01:19:35,469 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand 132 states. [2020-07-29 01:19:35,469 INFO L87 Difference]: Start difference. First operand 200 states. Second operand 132 states. [2020-07-29 01:19:35,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:35,476 INFO L93 Difference]: Finished difference Result 200 states and 216 transitions. [2020-07-29 01:19:35,477 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 216 transitions. [2020-07-29 01:19:35,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:35,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:35,478 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 200 states. [2020-07-29 01:19:35,478 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 200 states. [2020-07-29 01:19:35,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:35,485 INFO L93 Difference]: Finished difference Result 200 states and 216 transitions. [2020-07-29 01:19:35,485 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 216 transitions. [2020-07-29 01:19:35,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:35,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:35,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:35,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:35,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-07-29 01:19:35,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2020-07-29 01:19:35,491 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 15 [2020-07-29 01:19:35,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:35,492 INFO L479 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2020-07-29 01:19:35,492 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-29 01:19:35,492 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2020-07-29 01:19:35,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-29 01:19:35,492 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:35,492 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:35,493 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-29 01:19:35,493 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19ASSERT_VIOLATIONMEMORY_LEAK, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_LEAK, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:35,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:35,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1490170777, now seen corresponding path program 1 times [2020-07-29 01:19:35,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:35,494 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572060146] [2020-07-29 01:19:35,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:35,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:35,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:35,623 INFO L280 TraceCheckUtils]: 0: Hoare triple {3154#(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; {3145#true} is VALID [2020-07-29 01:19:35,623 INFO L280 TraceCheckUtils]: 1: Hoare triple {3145#true} assume true; {3145#true} is VALID [2020-07-29 01:19:35,623 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3145#true} {3145#true} #234#return; {3145#true} is VALID [2020-07-29 01:19:35,624 INFO L263 TraceCheckUtils]: 0: Hoare triple {3145#true} call ULTIMATE.init(); {3154#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:35,624 INFO L280 TraceCheckUtils]: 1: Hoare triple {3154#(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; {3145#true} is VALID [2020-07-29 01:19:35,624 INFO L280 TraceCheckUtils]: 2: Hoare triple {3145#true} assume true; {3145#true} is VALID [2020-07-29 01:19:35,625 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3145#true} {3145#true} #234#return; {3145#true} is VALID [2020-07-29 01:19:35,625 INFO L263 TraceCheckUtils]: 4: Hoare triple {3145#true} call #t~ret16 := main(); {3145#true} is VALID [2020-07-29 01:19:35,625 INFO L280 TraceCheckUtils]: 5: Hoare triple {3145#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {3145#true} is VALID [2020-07-29 01:19:35,625 INFO L280 TraceCheckUtils]: 6: Hoare triple {3145#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L993 {3145#true} is VALID [2020-07-29 01:19:35,626 INFO L280 TraceCheckUtils]: 7: Hoare triple {3145#true} SUMMARY for call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L993-1 {3145#true} is VALID [2020-07-29 01:19:35,626 INFO L280 TraceCheckUtils]: 8: Hoare triple {3145#true} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {3145#true} is VALID [2020-07-29 01:19:35,626 INFO L280 TraceCheckUtils]: 9: Hoare triple {3145#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3145#true} is VALID [2020-07-29 01:19:35,632 INFO L280 TraceCheckUtils]: 10: Hoare triple {3145#true} assume !!(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); {3150#(and (= 0 |main_#t~malloc2.offset|) (= 8 (select |#length| |main_#t~malloc2.base|)))} is VALID [2020-07-29 01:19:35,633 INFO L280 TraceCheckUtils]: 11: Hoare triple {3150#(and (= 0 |main_#t~malloc2.offset|) (= 8 (select |#length| |main_#t~malloc2.base|)))} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1002 {3151#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-29 01:19:35,634 INFO L280 TraceCheckUtils]: 12: Hoare triple {3151#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1002-1 {3152#(and (= 8 (select |#length| |main_#t~mem3.base|)) (= 0 |main_#t~mem3.offset|))} is VALID [2020-07-29 01:19:35,635 INFO L280 TraceCheckUtils]: 13: Hoare triple {3152#(and (= 8 (select |#length| |main_#t~mem3.base|)) (= 0 |main_#t~mem3.offset|))} ~x~0.base, ~x~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {3153#(and (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0))} is VALID [2020-07-29 01:19:35,636 INFO L280 TraceCheckUtils]: 14: Hoare triple {3153#(and (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0))} assume !(4 + (4 + ~x~0.offset) <= #length[~x~0.base] && 0 <= 4 + ~x~0.offset); {3146#false} is VALID [2020-07-29 01:19:35,637 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:35,637 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572060146] [2020-07-29 01:19:35,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:35,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-29 01:19:35,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969366854] [2020-07-29 01:19:35,638 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-07-29 01:19:35,638 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:35,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:19:35,655 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:35,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-29 01:19:35,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:35,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:19:35,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:19:35,656 INFO L87 Difference]: Start difference. First operand 132 states and 143 transitions. Second operand 7 states. [2020-07-29 01:19:37,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:37,330 INFO L93 Difference]: Finished difference Result 222 states and 242 transitions. [2020-07-29 01:19:37,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 01:19:37,330 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-07-29 01:19:37,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:37,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:19:37,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 186 transitions. [2020-07-29 01:19:37,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:19:37,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 186 transitions. [2020-07-29 01:19:37,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 186 transitions. [2020-07-29 01:19:37,562 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:37,569 INFO L225 Difference]: With dead ends: 222 [2020-07-29 01:19:37,569 INFO L226 Difference]: Without dead ends: 222 [2020-07-29 01:19:37,570 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:37,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-07-29 01:19:37,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 118. [2020-07-29 01:19:37,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:37,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 222 states. Second operand 118 states. [2020-07-29 01:19:37,576 INFO L74 IsIncluded]: Start isIncluded. First operand 222 states. Second operand 118 states. [2020-07-29 01:19:37,576 INFO L87 Difference]: Start difference. First operand 222 states. Second operand 118 states. [2020-07-29 01:19:37,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:37,584 INFO L93 Difference]: Finished difference Result 222 states and 242 transitions. [2020-07-29 01:19:37,584 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 242 transitions. [2020-07-29 01:19:37,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:37,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:37,586 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 222 states. [2020-07-29 01:19:37,586 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 222 states. [2020-07-29 01:19:37,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:37,594 INFO L93 Difference]: Finished difference Result 222 states and 242 transitions. [2020-07-29 01:19:37,595 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 242 transitions. [2020-07-29 01:19:37,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:37,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:37,596 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:37,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:37,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2020-07-29 01:19:37,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 128 transitions. [2020-07-29 01:19:37,600 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 128 transitions. Word has length 15 [2020-07-29 01:19:37,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:37,601 INFO L479 AbstractCegarLoop]: Abstraction has 118 states and 128 transitions. [2020-07-29 01:19:37,601 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-29 01:19:37,601 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 128 transitions. [2020-07-29 01:19:37,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-29 01:19:37,602 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:37,602 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:37,602 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-29 01:19:37,603 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19ASSERT_VIOLATIONMEMORY_LEAK, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_LEAK, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:37,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:37,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1077022969, now seen corresponding path program 1 times [2020-07-29 01:19:37,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:37,604 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970469646] [2020-07-29 01:19:37,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:37,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:37,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:37,712 INFO L280 TraceCheckUtils]: 0: Hoare triple {3960#(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; {3952#true} is VALID [2020-07-29 01:19:37,712 INFO L280 TraceCheckUtils]: 1: Hoare triple {3952#true} assume true; {3952#true} is VALID [2020-07-29 01:19:37,713 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3952#true} {3952#true} #234#return; {3952#true} is VALID [2020-07-29 01:19:37,714 INFO L263 TraceCheckUtils]: 0: Hoare triple {3952#true} call ULTIMATE.init(); {3960#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:37,714 INFO L280 TraceCheckUtils]: 1: Hoare triple {3960#(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; {3952#true} is VALID [2020-07-29 01:19:37,714 INFO L280 TraceCheckUtils]: 2: Hoare triple {3952#true} assume true; {3952#true} is VALID [2020-07-29 01:19:37,715 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3952#true} {3952#true} #234#return; {3952#true} is VALID [2020-07-29 01:19:37,715 INFO L263 TraceCheckUtils]: 4: Hoare triple {3952#true} call #t~ret16 := main(); {3952#true} is VALID [2020-07-29 01:19:37,715 INFO L280 TraceCheckUtils]: 5: Hoare triple {3952#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {3952#true} is VALID [2020-07-29 01:19:37,715 INFO L280 TraceCheckUtils]: 6: Hoare triple {3952#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L993 {3952#true} is VALID [2020-07-29 01:19:37,715 INFO L280 TraceCheckUtils]: 7: Hoare triple {3952#true} SUMMARY for call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L993-1 {3952#true} is VALID [2020-07-29 01:19:37,716 INFO L280 TraceCheckUtils]: 8: Hoare triple {3952#true} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {3952#true} is VALID [2020-07-29 01:19:37,716 INFO L280 TraceCheckUtils]: 9: Hoare triple {3952#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3952#true} is VALID [2020-07-29 01:19:37,716 INFO L280 TraceCheckUtils]: 10: Hoare triple {3952#true} assume !(0 != #t~nondet1);havoc #t~nondet1; {3952#true} is VALID [2020-07-29 01:19:37,716 INFO L280 TraceCheckUtils]: 11: Hoare triple {3952#true} SUMMARY for call write~int(1, ~x~0.base, 4 + ~x~0.offset, 4); srcloc: L999-3 {3952#true} is VALID [2020-07-29 01:19:37,718 INFO L280 TraceCheckUtils]: 12: Hoare triple {3952#true} call #t~malloc4.base, #t~malloc4.offset := #Ultimate.allocOnHeap(8); {3957#(= 1 (select |#valid| |main_#t~malloc4.base|))} is VALID [2020-07-29 01:19:37,719 INFO L280 TraceCheckUtils]: 13: Hoare triple {3957#(= 1 (select |#valid| |main_#t~malloc4.base|))} SUMMARY for call write~$Pointer$(#t~malloc4.base, #t~malloc4.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1008 {3958#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-29 01:19:37,721 INFO L280 TraceCheckUtils]: 14: Hoare triple {3958#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1008-1 {3959#(= (select |#valid| |main_#t~mem5.base|) 1)} is VALID [2020-07-29 01:19:37,723 INFO L280 TraceCheckUtils]: 15: Hoare triple {3959#(= (select |#valid| |main_#t~mem5.base|) 1)} assume !(1 == #valid[#t~mem5.base]); {3953#false} is VALID [2020-07-29 01:19:37,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:19:37,724 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970469646] [2020-07-29 01:19:37,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:37,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:19:37,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261926190] [2020-07-29 01:19:37,725 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-29 01:19:37,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:37,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:19:37,749 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:37,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:19:37,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:37,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:19:37,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:19:37,751 INFO L87 Difference]: Start difference. First operand 118 states and 128 transitions. Second operand 6 states. [2020-07-29 01:19:38,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:38,406 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2020-07-29 01:19:38,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:19:38,406 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-29 01:19:38,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:38,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:19:38,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2020-07-29 01:19:38,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:19:38,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2020-07-29 01:19:38,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 118 transitions. [2020-07-29 01:19:38,534 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:38,537 INFO L225 Difference]: With dead ends: 125 [2020-07-29 01:19:38,537 INFO L226 Difference]: Without dead ends: 125 [2020-07-29 01:19:38,537 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:38,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-07-29 01:19:38,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 117. [2020-07-29 01:19:38,541 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:38,541 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand 117 states. [2020-07-29 01:19:38,541 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 117 states. [2020-07-29 01:19:38,541 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 117 states. [2020-07-29 01:19:38,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:38,545 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2020-07-29 01:19:38,546 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 131 transitions. [2020-07-29 01:19:38,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:38,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:38,546 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 125 states. [2020-07-29 01:19:38,546 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 125 states. [2020-07-29 01:19:38,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:38,558 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2020-07-29 01:19:38,558 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 131 transitions. [2020-07-29 01:19:38,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:38,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:38,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:38,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:38,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-07-29 01:19:38,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2020-07-29 01:19:38,565 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 16 [2020-07-29 01:19:38,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:38,566 INFO L479 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2020-07-29 01:19:38,566 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:19:38,566 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2020-07-29 01:19:38,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-29 01:19:38,566 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:38,566 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:38,567 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-29 01:19:38,567 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19ASSERT_VIOLATIONMEMORY_LEAK, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_LEAK, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:38,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:38,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1077022968, now seen corresponding path program 1 times [2020-07-29 01:19:38,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:38,568 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183053251] [2020-07-29 01:19:38,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:38,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:38,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:38,663 INFO L280 TraceCheckUtils]: 0: Hoare triple {4469#(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; {4461#true} is VALID [2020-07-29 01:19:38,663 INFO L280 TraceCheckUtils]: 1: Hoare triple {4461#true} assume true; {4461#true} is VALID [2020-07-29 01:19:38,663 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4461#true} {4461#true} #234#return; {4461#true} is VALID [2020-07-29 01:19:38,667 INFO L263 TraceCheckUtils]: 0: Hoare triple {4461#true} call ULTIMATE.init(); {4469#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:38,668 INFO L280 TraceCheckUtils]: 1: Hoare triple {4469#(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; {4461#true} is VALID [2020-07-29 01:19:38,668 INFO L280 TraceCheckUtils]: 2: Hoare triple {4461#true} assume true; {4461#true} is VALID [2020-07-29 01:19:38,668 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4461#true} {4461#true} #234#return; {4461#true} is VALID [2020-07-29 01:19:38,668 INFO L263 TraceCheckUtils]: 4: Hoare triple {4461#true} call #t~ret16 := main(); {4461#true} is VALID [2020-07-29 01:19:38,669 INFO L280 TraceCheckUtils]: 5: Hoare triple {4461#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {4461#true} is VALID [2020-07-29 01:19:38,669 INFO L280 TraceCheckUtils]: 6: Hoare triple {4461#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L993 {4461#true} is VALID [2020-07-29 01:19:38,669 INFO L280 TraceCheckUtils]: 7: Hoare triple {4461#true} SUMMARY for call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L993-1 {4461#true} is VALID [2020-07-29 01:19:38,669 INFO L280 TraceCheckUtils]: 8: Hoare triple {4461#true} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {4461#true} is VALID [2020-07-29 01:19:38,670 INFO L280 TraceCheckUtils]: 9: Hoare triple {4461#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4461#true} is VALID [2020-07-29 01:19:38,670 INFO L280 TraceCheckUtils]: 10: Hoare triple {4461#true} assume !(0 != #t~nondet1);havoc #t~nondet1; {4461#true} is VALID [2020-07-29 01:19:38,670 INFO L280 TraceCheckUtils]: 11: Hoare triple {4461#true} SUMMARY for call write~int(1, ~x~0.base, 4 + ~x~0.offset, 4); srcloc: L999-3 {4461#true} is VALID [2020-07-29 01:19:38,671 INFO L280 TraceCheckUtils]: 12: Hoare triple {4461#true} call #t~malloc4.base, #t~malloc4.offset := #Ultimate.allocOnHeap(8); {4466#(and (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|)))} is VALID [2020-07-29 01:19:38,673 INFO L280 TraceCheckUtils]: 13: Hoare triple {4466#(and (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|)))} SUMMARY for call write~$Pointer$(#t~malloc4.base, #t~malloc4.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1008 {4467#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-29 01:19:38,674 INFO L280 TraceCheckUtils]: 14: Hoare triple {4467#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1008-1 {4468#(and (= 0 |main_#t~mem5.offset|) (= 8 (select |#length| |main_#t~mem5.base|)))} is VALID [2020-07-29 01:19:38,676 INFO L280 TraceCheckUtils]: 15: Hoare triple {4468#(and (= 0 |main_#t~mem5.offset|) (= 8 (select |#length| |main_#t~mem5.base|)))} assume !(4 + (4 + #t~mem5.offset) <= #length[#t~mem5.base] && 0 <= 4 + #t~mem5.offset); {4462#false} is VALID [2020-07-29 01:19:38,677 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:38,677 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183053251] [2020-07-29 01:19:38,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:38,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:19:38,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689047829] [2020-07-29 01:19:38,678 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-29 01:19:38,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:38,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:19:38,697 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:38,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:19:38,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:38,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:19:38,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:19:38,699 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand 6 states. [2020-07-29 01:19:39,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:39,392 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2020-07-29 01:19:39,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:19:39,392 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-29 01:19:39,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:39,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:19:39,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2020-07-29 01:19:39,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:19:39,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2020-07-29 01:19:39,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 96 transitions. [2020-07-29 01:19:39,520 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:39,523 INFO L225 Difference]: With dead ends: 116 [2020-07-29 01:19:39,523 INFO L226 Difference]: Without dead ends: 116 [2020-07-29 01:19:39,524 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:39,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-07-29 01:19:39,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2020-07-29 01:19:39,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:39,527 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand 116 states. [2020-07-29 01:19:39,527 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 116 states. [2020-07-29 01:19:39,527 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 116 states. [2020-07-29 01:19:39,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:39,531 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2020-07-29 01:19:39,531 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 126 transitions. [2020-07-29 01:19:39,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:39,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:39,532 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 116 states. [2020-07-29 01:19:39,532 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 116 states. [2020-07-29 01:19:39,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:39,536 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2020-07-29 01:19:39,536 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 126 transitions. [2020-07-29 01:19:39,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:39,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:39,537 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:39,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:39,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2020-07-29 01:19:39,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 126 transitions. [2020-07-29 01:19:39,540 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 126 transitions. Word has length 16 [2020-07-29 01:19:39,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:39,541 INFO L479 AbstractCegarLoop]: Abstraction has 116 states and 126 transitions. [2020-07-29 01:19:39,541 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:19:39,541 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 126 transitions. [2020-07-29 01:19:39,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-29 01:19:39,541 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:39,542 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:39,542 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-29 01:19:39,542 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19ASSERT_VIOLATIONMEMORY_LEAK, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_LEAK, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:39,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:39,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1830006328, now seen corresponding path program 1 times [2020-07-29 01:19:39,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:39,543 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989454813] [2020-07-29 01:19:39,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:39,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:39,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:39,623 INFO L280 TraceCheckUtils]: 0: Hoare triple {4951#(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; {4942#true} is VALID [2020-07-29 01:19:39,623 INFO L280 TraceCheckUtils]: 1: Hoare triple {4942#true} assume true; {4942#true} is VALID [2020-07-29 01:19:39,623 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4942#true} {4942#true} #234#return; {4942#true} is VALID [2020-07-29 01:19:39,624 INFO L263 TraceCheckUtils]: 0: Hoare triple {4942#true} call ULTIMATE.init(); {4951#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:39,625 INFO L280 TraceCheckUtils]: 1: Hoare triple {4951#(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; {4942#true} is VALID [2020-07-29 01:19:39,625 INFO L280 TraceCheckUtils]: 2: Hoare triple {4942#true} assume true; {4942#true} is VALID [2020-07-29 01:19:39,625 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4942#true} {4942#true} #234#return; {4942#true} is VALID [2020-07-29 01:19:39,625 INFO L263 TraceCheckUtils]: 4: Hoare triple {4942#true} call #t~ret16 := main(); {4942#true} is VALID [2020-07-29 01:19:39,625 INFO L280 TraceCheckUtils]: 5: Hoare triple {4942#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {4942#true} is VALID [2020-07-29 01:19:39,626 INFO L280 TraceCheckUtils]: 6: Hoare triple {4942#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L993 {4942#true} is VALID [2020-07-29 01:19:39,626 INFO L280 TraceCheckUtils]: 7: Hoare triple {4942#true} SUMMARY for call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L993-1 {4942#true} is VALID [2020-07-29 01:19:39,626 INFO L280 TraceCheckUtils]: 8: Hoare triple {4942#true} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {4942#true} is VALID [2020-07-29 01:19:39,626 INFO L280 TraceCheckUtils]: 9: Hoare triple {4942#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4942#true} is VALID [2020-07-29 01:19:39,627 INFO L280 TraceCheckUtils]: 10: Hoare triple {4942#true} assume !!(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); {4947#(not (= 0 |main_#t~malloc2.base|))} is VALID [2020-07-29 01:19:39,629 INFO L280 TraceCheckUtils]: 11: Hoare triple {4947#(not (= 0 |main_#t~malloc2.base|))} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1002 {4948#(not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-29 01:19:39,630 INFO L280 TraceCheckUtils]: 12: Hoare triple {4948#(not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1002-1 {4949#(not (= 0 |main_#t~mem3.base|))} is VALID [2020-07-29 01:19:39,637 INFO L280 TraceCheckUtils]: 13: Hoare triple {4949#(not (= 0 |main_#t~mem3.base|))} ~x~0.base, ~x~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {4950#(not (= 0 main_~x~0.base))} is VALID [2020-07-29 01:19:39,638 INFO L280 TraceCheckUtils]: 14: Hoare triple {4950#(not (= 0 main_~x~0.base))} SUMMARY for call write~int(0, ~x~0.base, 4 + ~x~0.offset, 4); srcloc: L1004 {4950#(not (= 0 main_~x~0.base))} is VALID [2020-07-29 01:19:39,641 INFO L280 TraceCheckUtils]: 15: Hoare triple {4950#(not (= 0 main_~x~0.base))} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {4943#false} is VALID [2020-07-29 01:19:39,642 INFO L280 TraceCheckUtils]: 16: Hoare triple {4943#false} assume !false; {4943#false} is VALID [2020-07-29 01:19:39,642 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:39,643 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989454813] [2020-07-29 01:19:39,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:39,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-29 01:19:39,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139036371] [2020-07-29 01:19:39,645 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-07-29 01:19:39,645 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:39,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:19:39,666 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:39,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-29 01:19:39,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:39,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:19:39,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:19:39,668 INFO L87 Difference]: Start difference. First operand 116 states and 126 transitions. Second operand 7 states. [2020-07-29 01:19:40,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:40,816 INFO L93 Difference]: Finished difference Result 216 states and 236 transitions. [2020-07-29 01:19:40,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 01:19:40,817 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-07-29 01:19:40,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:40,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:19:40,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 175 transitions. [2020-07-29 01:19:40,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:19:40,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 175 transitions. [2020-07-29 01:19:40,830 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 175 transitions. [2020-07-29 01:19:41,045 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:41,050 INFO L225 Difference]: With dead ends: 216 [2020-07-29 01:19:41,050 INFO L226 Difference]: Without dead ends: 216 [2020-07-29 01:19:41,051 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 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:41,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2020-07-29 01:19:41,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 114. [2020-07-29 01:19:41,055 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:41,055 INFO L82 GeneralOperation]: Start isEquivalent. First operand 216 states. Second operand 114 states. [2020-07-29 01:19:41,056 INFO L74 IsIncluded]: Start isIncluded. First operand 216 states. Second operand 114 states. [2020-07-29 01:19:41,056 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 114 states. [2020-07-29 01:19:41,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:41,061 INFO L93 Difference]: Finished difference Result 216 states and 236 transitions. [2020-07-29 01:19:41,061 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 236 transitions. [2020-07-29 01:19:41,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:41,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:41,062 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 216 states. [2020-07-29 01:19:41,063 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 216 states. [2020-07-29 01:19:41,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:41,068 INFO L93 Difference]: Finished difference Result 216 states and 236 transitions. [2020-07-29 01:19:41,068 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 236 transitions. [2020-07-29 01:19:41,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:41,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:41,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:41,069 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:41,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-07-29 01:19:41,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2020-07-29 01:19:41,072 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 17 [2020-07-29 01:19:41,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:41,074 INFO L479 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2020-07-29 01:19:41,074 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-29 01:19:41,075 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2020-07-29 01:19:41,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-29 01:19:41,075 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:41,075 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:41,076 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-29 01:19:41,076 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19ASSERT_VIOLATIONMEMORY_LEAK, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_LEAK, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:41,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:41,076 INFO L82 PathProgramCache]: Analyzing trace with hash 2109432891, now seen corresponding path program 1 times [2020-07-29 01:19:41,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:41,082 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990445625] [2020-07-29 01:19:41,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:41,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:41,196 INFO L280 TraceCheckUtils]: 0: Hoare triple {5734#(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; {5727#true} is VALID [2020-07-29 01:19:41,196 INFO L280 TraceCheckUtils]: 1: Hoare triple {5727#true} assume true; {5727#true} is VALID [2020-07-29 01:19:41,196 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5727#true} {5727#true} #234#return; {5727#true} is VALID [2020-07-29 01:19:41,197 INFO L263 TraceCheckUtils]: 0: Hoare triple {5727#true} call ULTIMATE.init(); {5734#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:41,198 INFO L280 TraceCheckUtils]: 1: Hoare triple {5734#(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; {5727#true} is VALID [2020-07-29 01:19:41,198 INFO L280 TraceCheckUtils]: 2: Hoare triple {5727#true} assume true; {5727#true} is VALID [2020-07-29 01:19:41,198 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5727#true} {5727#true} #234#return; {5727#true} is VALID [2020-07-29 01:19:41,198 INFO L263 TraceCheckUtils]: 4: Hoare triple {5727#true} call #t~ret16 := main(); {5727#true} is VALID [2020-07-29 01:19:41,199 INFO L280 TraceCheckUtils]: 5: Hoare triple {5727#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {5732#(not (= 0 main_~head~0.base))} is VALID [2020-07-29 01:19:41,200 INFO L280 TraceCheckUtils]: 6: Hoare triple {5732#(not (= 0 main_~head~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L993 {5732#(not (= 0 main_~head~0.base))} is VALID [2020-07-29 01:19:41,201 INFO L280 TraceCheckUtils]: 7: Hoare triple {5732#(not (= 0 main_~head~0.base))} SUMMARY for call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L993-1 {5732#(not (= 0 main_~head~0.base))} is VALID [2020-07-29 01:19:41,201 INFO L280 TraceCheckUtils]: 8: Hoare triple {5732#(not (= 0 main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {5732#(not (= 0 main_~head~0.base))} is VALID [2020-07-29 01:19:41,202 INFO L280 TraceCheckUtils]: 9: Hoare triple {5732#(not (= 0 main_~head~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {5732#(not (= 0 main_~head~0.base))} is VALID [2020-07-29 01:19:41,202 INFO L280 TraceCheckUtils]: 10: Hoare triple {5732#(not (= 0 main_~head~0.base))} assume !(0 != #t~nondet1);havoc #t~nondet1; {5732#(not (= 0 main_~head~0.base))} is VALID [2020-07-29 01:19:41,203 INFO L280 TraceCheckUtils]: 11: Hoare triple {5732#(not (= 0 main_~head~0.base))} SUMMARY for call write~int(1, ~x~0.base, 4 + ~x~0.offset, 4); srcloc: L999-3 {5732#(not (= 0 main_~head~0.base))} is VALID [2020-07-29 01:19:41,204 INFO L280 TraceCheckUtils]: 12: Hoare triple {5732#(not (= 0 main_~head~0.base))} call #t~malloc4.base, #t~malloc4.offset := #Ultimate.allocOnHeap(8); {5732#(not (= 0 main_~head~0.base))} is VALID [2020-07-29 01:19:41,205 INFO L280 TraceCheckUtils]: 13: Hoare triple {5732#(not (= 0 main_~head~0.base))} SUMMARY for call write~$Pointer$(#t~malloc4.base, #t~malloc4.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1008 {5732#(not (= 0 main_~head~0.base))} is VALID [2020-07-29 01:19:41,205 INFO L280 TraceCheckUtils]: 14: Hoare triple {5732#(not (= 0 main_~head~0.base))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1008-1 {5732#(not (= 0 main_~head~0.base))} is VALID [2020-07-29 01:19:41,206 INFO L280 TraceCheckUtils]: 15: Hoare triple {5732#(not (= 0 main_~head~0.base))} SUMMARY for call write~int(2, #t~mem5.base, 4 + #t~mem5.offset, 4); srcloc: L1009 {5732#(not (= 0 main_~head~0.base))} is VALID [2020-07-29 01:19:41,207 INFO L280 TraceCheckUtils]: 16: Hoare triple {5732#(not (= 0 main_~head~0.base))} havoc #t~mem5.base, #t~mem5.offset;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {5733#(not (= 0 main_~x~0.base))} is VALID [2020-07-29 01:19:41,207 INFO L280 TraceCheckUtils]: 17: Hoare triple {5733#(not (= 0 main_~x~0.base))} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {5728#false} is VALID [2020-07-29 01:19:41,208 INFO L280 TraceCheckUtils]: 18: Hoare triple {5728#false} assume !false; {5728#false} is VALID [2020-07-29 01:19:41,209 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:41,209 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990445625] [2020-07-29 01:19:41,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:41,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:19:41,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040419722] [2020-07-29 01:19:41,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-29 01:19:41,210 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:41,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:19:41,232 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:41,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:19:41,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:41,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:19:41,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:19:41,234 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand 5 states. [2020-07-29 01:19:41,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:41,702 INFO L93 Difference]: Finished difference Result 168 states and 173 transitions. [2020-07-29 01:19:41,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:19:41,703 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-29 01:19:41,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:41,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:19:41,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 174 transitions. [2020-07-29 01:19:41,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:19:41,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 174 transitions. [2020-07-29 01:19:41,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 174 transitions. [2020-07-29 01:19:41,897 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:41,900 INFO L225 Difference]: With dead ends: 168 [2020-07-29 01:19:41,900 INFO L226 Difference]: Without dead ends: 168 [2020-07-29 01:19:41,901 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:41,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2020-07-29 01:19:41,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 112. [2020-07-29 01:19:41,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:41,906 INFO L82 GeneralOperation]: Start isEquivalent. First operand 168 states. Second operand 112 states. [2020-07-29 01:19:41,906 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand 112 states. [2020-07-29 01:19:41,907 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 112 states. [2020-07-29 01:19:41,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:41,912 INFO L93 Difference]: Finished difference Result 168 states and 173 transitions. [2020-07-29 01:19:41,912 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 173 transitions. [2020-07-29 01:19:41,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:41,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:41,913 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 168 states. [2020-07-29 01:19:41,914 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 168 states. [2020-07-29 01:19:41,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:41,918 INFO L93 Difference]: Finished difference Result 168 states and 173 transitions. [2020-07-29 01:19:41,919 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 173 transitions. [2020-07-29 01:19:41,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:41,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:41,920 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:41,920 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:41,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-07-29 01:19:41,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2020-07-29 01:19:41,923 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 19 [2020-07-29 01:19:41,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:41,924 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2020-07-29 01:19:41,924 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:19:41,924 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2020-07-29 01:19:41,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-29 01:19:41,925 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:41,925 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:41,926 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-29 01:19:41,926 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19ASSERT_VIOLATIONMEMORY_LEAK, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_LEAK, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:41,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:41,928 INFO L82 PathProgramCache]: Analyzing trace with hash -857536838, now seen corresponding path program 1 times [2020-07-29 01:19:41,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:41,929 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258259932] [2020-07-29 01:19:41,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:42,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:19:42,007 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:19:42,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:19:42,031 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:19:42,065 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:19:42,066 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-29 01:19:42,066 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-29 01:19:42,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.07 01:19:42 BoogieIcfgContainer [2020-07-29 01:19:42,101 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-29 01:19:42,101 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:19:42,102 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:19:42,102 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:19:42,103 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:28" (3/4) ... [2020-07-29 01:19:42,106 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-07-29 01:19:42,194 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-29 01:19:42,195 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:19:42,200 INFO L168 Benchmark]: Toolchain (without parser) took 15014.83 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 392.2 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -111.6 MB). Peak memory consumption was 280.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:19:42,201 INFO L168 Benchmark]: CDTParser took 0.59 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:42,202 INFO L168 Benchmark]: CACSL2BoogieTranslator took 674.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -164.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:19:42,202 INFO L168 Benchmark]: Boogie Preprocessor took 98.20 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:42,203 INFO L168 Benchmark]: RCFGBuilder took 978.23 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: 85.0 MB). Peak memory consumption was 85.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:19:42,208 INFO L168 Benchmark]: TraceAbstraction took 13162.82 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 243.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -50.0 MB). Peak memory consumption was 193.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:19:42,209 INFO L168 Benchmark]: Witness Printer took 93.37 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:19:42,210 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.59 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 674.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -164.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 98.20 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 978.23 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: 85.0 MB). Peak memory consumption was 85.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13162.82 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 243.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -50.0 MB). Peak memory consumption was 193.8 MB. Max. memory is 11.5 GB. * Witness Printer took 93.37 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1020]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L992] SLL* head = malloc(sizeof(SLL)); VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L993] head->next = ((void*)0) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L994] head->data = 0 VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L996] SLL* x = head; VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, x={-1:0}] [L999] COND FALSE !(__VERIFIER_nondet_int()) [L1007] x->data = 1 VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, x={-1:0}] [L1008] x->next = malloc(sizeof(SLL)) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, x={-1:0}] [L1009] EXPR x->next VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, x={-1:0}, x->next={-2:0}] [L1009] x->next->data = 2 VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, x={-1:0}, x->next={-2:0}] [L1011] x = head VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, x={-1:0}] [L1013] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, x={-1:0}] [L1015] EXPR x->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, x={-1:0}, x->data=1] [L1015] COND FALSE !(1 != x->data) [L1020] EXPR x->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, x={-1:0}, x->data=1] [L1020] COND TRUE !(2 == x->data) [L1020] __VERIFIER_error() VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, x={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 122 locations, 54 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.0s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 10.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 869 SDtfs, 1165 SDslu, 1440 SDs, 0 SdLazy, 2712 SolverSat, 107 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=4, 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, 10 MinimizatonAttempts, 454 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 160 NumberOfCodeBlocks, 160 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 126 ConstructedInterpolants, 0 QuantifiedInterpolants, 6202 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...