./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/cmp-freed-ptr.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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/memsafety/cmp-freed-ptr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3444bab46e3acd40907f623c997f9115bc97543a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free) --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 00:53:25,089 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 00:53:25,091 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 00:53:25,109 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 00:53:25,110 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 00:53:25,112 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 00:53:25,115 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 00:53:25,128 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 00:53:25,129 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 00:53:25,132 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 00:53:25,134 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 00:53:25,135 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 00:53:25,136 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 00:53:25,140 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 00:53:25,141 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 00:53:25,142 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 00:53:25,143 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 00:53:25,144 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 00:53:25,146 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 00:53:25,148 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 00:53:25,149 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 00:53:25,150 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 00:53:25,151 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 00:53:25,152 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 00:53:25,155 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 00:53:25,155 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 00:53:25,155 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 00:53:25,156 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 00:53:25,157 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 00:53:25,158 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 00:53:25,158 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 00:53:25,159 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 00:53:25,159 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 00:53:25,160 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 00:53:25,161 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 00:53:25,162 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 00:53:25,162 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 00:53:25,163 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 00:53:25,163 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 00:53:25,164 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 00:53:25,164 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 00:53:25,165 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2020-07-29 00:53:25,180 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 00:53:25,180 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 00:53:25,182 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 00:53:25,182 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 00:53:25,182 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 00:53:25,182 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 00:53:25,183 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 00:53:25,183 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 00:53:25,183 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 00:53:25,183 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 00:53:25,183 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 00:53:25,184 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-07-29 00:53:25,184 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-07-29 00:53:25,184 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-07-29 00:53:25,184 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 00:53:25,184 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-07-29 00:53:25,185 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 00:53:25,185 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 00:53:25,185 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 00:53:25,185 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 00:53:25,186 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 00:53:25,186 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 00:53:25,186 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 00:53:25,186 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 00:53:25,187 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 00:53:25,187 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 00:53:25,187 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-29 00:53:25,187 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 00:53:25,188 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 3444bab46e3acd40907f623c997f9115bc97543a [2020-07-29 00:53:25,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 00:53:25,518 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 00:53:25,522 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 00:53:25,523 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 00:53:25,524 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 00:53:25,525 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/cmp-freed-ptr.i [2020-07-29 00:53:25,604 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34d93f8db/24788140b8eb41d3a2403ad9193ee92e/FLAGdd010db74 [2020-07-29 00:53:26,184 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 00:53:26,185 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/cmp-freed-ptr.i [2020-07-29 00:53:26,203 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34d93f8db/24788140b8eb41d3a2403ad9193ee92e/FLAGdd010db74 [2020-07-29 00:53:26,438 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34d93f8db/24788140b8eb41d3a2403ad9193ee92e [2020-07-29 00:53:26,442 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 00:53:26,445 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-07-29 00:53:26,447 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 00:53:26,447 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 00:53:26,451 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 00:53:26,453 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 12:53:26" (1/1) ... [2020-07-29 00:53:26,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ac37d17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:53:26, skipping insertion in model container [2020-07-29 00:53:26,457 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 12:53:26" (1/1) ... [2020-07-29 00:53:26,465 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 00:53:26,519 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 00:53:26,853 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 00:53:26,932 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 00:53:27,001 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 00:53:27,068 INFO L208 MainTranslator]: Completed translation [2020-07-29 00:53:27,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:53:27 WrapperNode [2020-07-29 00:53:27,070 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 00:53:27,071 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 00:53:27,071 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 00:53:27,071 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 00:53:27,086 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:53:27" (1/1) ... [2020-07-29 00:53:27,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:53:27" (1/1) ... [2020-07-29 00:53:27,114 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:53:27" (1/1) ... [2020-07-29 00:53:27,114 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:53:27" (1/1) ... [2020-07-29 00:53:27,134 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:53:27" (1/1) ... [2020-07-29 00:53:27,136 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:53:27" (1/1) ... [2020-07-29 00:53:27,139 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:53:27" (1/1) ... [2020-07-29 00:53:27,145 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 00:53:27,146 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 00:53:27,146 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 00:53:27,146 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 00:53:27,147 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:53: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 00:53:27,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-29 00:53:27,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 00:53:27,216 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-29 00:53:27,216 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-29 00:53:27,216 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-07-29 00:53:27,217 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-07-29 00:53:27,217 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-07-29 00:53:27,217 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-29 00:53:27,217 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-29 00:53:27,217 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-29 00:53:27,218 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-29 00:53:27,218 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-29 00:53:27,218 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-29 00:53:27,218 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-29 00:53:27,218 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-29 00:53:27,219 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-29 00:53:27,219 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-29 00:53:27,219 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-29 00:53:27,219 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-29 00:53:27,219 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-29 00:53:27,220 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-29 00:53:27,220 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-29 00:53:27,220 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-29 00:53:27,220 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-29 00:53:27,220 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-29 00:53:27,220 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-29 00:53:27,221 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-07-29 00:53:27,221 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-07-29 00:53:27,221 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-07-29 00:53:27,221 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-29 00:53:27,221 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-29 00:53:27,221 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-29 00:53:27,221 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-29 00:53:27,222 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-29 00:53:27,222 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-29 00:53:27,222 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-29 00:53:27,222 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-29 00:53:27,222 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-29 00:53:27,222 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-29 00:53:27,222 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-29 00:53:27,223 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-29 00:53:27,223 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-29 00:53:27,223 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-29 00:53:27,223 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-29 00:53:27,223 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-29 00:53:27,223 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-29 00:53:27,224 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-29 00:53:27,224 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-29 00:53:27,224 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-29 00:53:27,224 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-29 00:53:27,224 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-29 00:53:27,224 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-29 00:53:27,224 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-29 00:53:27,225 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-29 00:53:27,225 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-29 00:53:27,225 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-29 00:53:27,225 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-29 00:53:27,225 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-29 00:53:27,225 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-29 00:53:27,225 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-29 00:53:27,226 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-29 00:53:27,226 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-29 00:53:27,226 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-29 00:53:27,226 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-29 00:53:27,226 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-29 00:53:27,226 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-29 00:53:27,226 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-29 00:53:27,227 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-29 00:53:27,227 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-29 00:53:27,227 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-29 00:53:27,227 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-29 00:53:27,227 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-29 00:53:27,227 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-29 00:53:27,227 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-29 00:53:27,227 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-29 00:53:27,228 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-29 00:53:27,228 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-29 00:53:27,228 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-29 00:53:27,228 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-29 00:53:27,228 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-29 00:53:27,229 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-29 00:53:27,229 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-29 00:53:27,229 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-29 00:53:27,229 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-29 00:53:27,229 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-29 00:53:27,229 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-29 00:53:27,230 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-29 00:53:27,230 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-29 00:53:27,230 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-29 00:53:27,230 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-29 00:53:27,230 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-29 00:53:27,230 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-29 00:53:27,230 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-29 00:53:27,231 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-29 00:53:27,231 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-29 00:53:27,231 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-29 00:53:27,231 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-29 00:53:27,231 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-29 00:53:27,231 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-29 00:53:27,232 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-29 00:53:27,232 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-29 00:53:27,232 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-29 00:53:27,232 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-29 00:53:27,232 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-29 00:53:27,232 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-29 00:53:27,233 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-29 00:53:27,233 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-29 00:53:27,233 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-29 00:53:27,233 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-29 00:53:27,233 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-29 00:53:27,233 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-29 00:53:27,234 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-29 00:53:27,234 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-29 00:53:27,234 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-29 00:53:27,234 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-29 00:53:27,234 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-29 00:53:27,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-29 00:53:27,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 00:53:27,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-29 00:53:27,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 00:53:27,740 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 00:53:27,741 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-29 00:53:27,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 12:53:27 BoogieIcfgContainer [2020-07-29 00:53:27,749 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 00:53:27,751 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-29 00:53:27,751 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-29 00:53:27,755 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-29 00:53:27,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.07 12:53:26" (1/3) ... [2020-07-29 00:53:27,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d54fbec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 12:53:27, skipping insertion in model container [2020-07-29 00:53:27,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:53:27" (2/3) ... [2020-07-29 00:53:27,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d54fbec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 12:53:27, skipping insertion in model container [2020-07-29 00:53:27,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 12:53:27" (3/3) ... [2020-07-29 00:53:27,764 INFO L109 eAbstractionObserver]: Analyzing ICFG cmp-freed-ptr.i [2020-07-29 00:53:27,777 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-29 00:53:27,787 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2020-07-29 00:53:27,803 INFO L251 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2020-07-29 00:53:27,824 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-29 00:53:27,824 INFO L376 AbstractCegarLoop]: Hoare is false [2020-07-29 00:53:27,824 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-29 00:53:27,824 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 00:53:27,825 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 00:53:27,825 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-29 00:53:27,825 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 00:53:27,825 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-29 00:53:27,842 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-07-29 00:53:27,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-29 00:53:27,853 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 00:53:27,854 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 00:53:27,855 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr1ASSERT_VIOLATIONMEMORY_FREE, mainErr9ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2020-07-29 00:53:27,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 00:53:27,862 INFO L82 PathProgramCache]: Analyzing trace with hash 542822380, now seen corresponding path program 1 times [2020-07-29 00:53:27,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 00:53:27,873 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846954428] [2020-07-29 00:53:27,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 00:53:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:53:28,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 00:53:28,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:53:28,145 INFO L280 TraceCheckUtils]: 0: Hoare triple {39#(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; {33#true} is VALID [2020-07-29 00:53:28,146 INFO L280 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2020-07-29 00:53:28,146 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #43#return; {33#true} is VALID [2020-07-29 00:53:28,151 INFO L263 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {39#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 00:53:28,151 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#(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; {33#true} is VALID [2020-07-29 00:53:28,151 INFO L280 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2020-07-29 00:53:28,152 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #43#return; {33#true} is VALID [2020-07-29 00:53:28,152 INFO L263 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret4 := main(); {33#true} is VALID [2020-07-29 00:53:28,155 INFO L280 TraceCheckUtils]: 5: Hoare triple {33#true} ~x~0.base, ~x~0.offset := 0, 0;~y~0.base, ~y~0.offset := 0, 0;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~y~0.base, ~y~0.offset := #t~malloc2.base, #t~malloc2.offset;~adressY~0 := ~y~0.base + ~y~0.offset; {38#(and (<= 0 main_~y~0.offset) (<= main_~y~0.offset 0))} is VALID [2020-07-29 00:53:28,158 INFO L280 TraceCheckUtils]: 6: Hoare triple {38#(and (<= 0 main_~y~0.offset) (<= main_~y~0.offset 0))} assume !(0 == ~y~0.offset); {34#false} is VALID [2020-07-29 00:53:28,159 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 00:53:28,159 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846954428] [2020-07-29 00:53:28,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 00:53:28,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 00:53:28,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001426289] [2020-07-29 00:53:28,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-29 00:53:28,171 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 00:53:28,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 00:53:28,193 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 00:53:28,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 00:53:28,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 00:53:28,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 00:53:28,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 00:53:28,207 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 4 states. [2020-07-29 00:53:28,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:53:28,404 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2020-07-29 00:53:28,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 00:53:28,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-29 00:53:28,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 00:53:28,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 00:53:28,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2020-07-29 00:53:28,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 00:53:28,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2020-07-29 00:53:28,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2020-07-29 00:53:28,478 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:53:28,491 INFO L225 Difference]: With dead ends: 29 [2020-07-29 00:53:28,491 INFO L226 Difference]: Without dead ends: 26 [2020-07-29 00:53:28,493 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-29 00:53:28,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-29 00:53:28,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-29 00:53:28,529 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 00:53:28,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2020-07-29 00:53:28,531 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-29 00:53:28,531 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-29 00:53:28,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:53:28,536 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2020-07-29 00:53:28,536 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2020-07-29 00:53:28,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:53:28,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:53:28,537 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-29 00:53:28,537 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-29 00:53:28,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:53:28,541 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2020-07-29 00:53:28,542 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2020-07-29 00:53:28,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:53:28,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:53:28,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 00:53:28,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 00:53:28,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-29 00:53:28,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2020-07-29 00:53:28,547 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 7 [2020-07-29 00:53:28,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 00:53:28,548 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2020-07-29 00:53:28,548 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 00:53:28,548 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2020-07-29 00:53:28,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-29 00:53:28,549 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 00:53:28,549 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 00:53:28,549 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-29 00:53:28,550 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr1ASSERT_VIOLATIONMEMORY_FREE, mainErr9ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2020-07-29 00:53:28,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 00:53:28,550 INFO L82 PathProgramCache]: Analyzing trace with hash -352375362, now seen corresponding path program 1 times [2020-07-29 00:53:28,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 00:53:28,551 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412676867] [2020-07-29 00:53:28,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 00:53:28,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:53:28,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 00:53:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:53:28,691 INFO L280 TraceCheckUtils]: 0: Hoare triple {157#(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; {151#true} is VALID [2020-07-29 00:53:28,692 INFO L280 TraceCheckUtils]: 1: Hoare triple {151#true} assume true; {151#true} is VALID [2020-07-29 00:53:28,692 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {151#true} {151#true} #43#return; {151#true} is VALID [2020-07-29 00:53:28,694 INFO L263 TraceCheckUtils]: 0: Hoare triple {151#true} call ULTIMATE.init(); {157#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 00:53:28,694 INFO L280 TraceCheckUtils]: 1: Hoare triple {157#(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; {151#true} is VALID [2020-07-29 00:53:28,695 INFO L280 TraceCheckUtils]: 2: Hoare triple {151#true} assume true; {151#true} is VALID [2020-07-29 00:53:28,695 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {151#true} {151#true} #43#return; {151#true} is VALID [2020-07-29 00:53:28,695 INFO L263 TraceCheckUtils]: 4: Hoare triple {151#true} call #t~ret4 := main(); {151#true} is VALID [2020-07-29 00:53:28,698 INFO L280 TraceCheckUtils]: 5: Hoare triple {151#true} ~x~0.base, ~x~0.offset := 0, 0;~y~0.base, ~y~0.offset := 0, 0;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~y~0.base, ~y~0.offset := #t~malloc2.base, #t~malloc2.offset;~adressY~0 := ~y~0.base + ~y~0.offset; {156#(<= (+ main_~y~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 00:53:28,700 INFO L280 TraceCheckUtils]: 6: Hoare triple {156#(<= (+ main_~y~0.base 1) |#StackHeapBarrier|)} assume 0 == ~y~0.offset; {156#(<= (+ main_~y~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 00:53:28,701 INFO L280 TraceCheckUtils]: 7: Hoare triple {156#(<= (+ main_~y~0.base 1) |#StackHeapBarrier|)} assume !(~y~0.base < #StackHeapBarrier); {152#false} is VALID [2020-07-29 00:53:28,702 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 00:53:28,703 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412676867] [2020-07-29 00:53:28,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 00:53:28,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 00:53:28,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474047994] [2020-07-29 00:53:28,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-29 00:53:28,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 00:53:28,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 00:53:28,722 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:53:28,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 00:53:28,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 00:53:28,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 00:53:28,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 00:53:28,724 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 4 states. [2020-07-29 00:53:28,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:53:28,865 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2020-07-29 00:53:28,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 00:53:28,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-29 00:53:28,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 00:53:28,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 00:53:28,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2020-07-29 00:53:28,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 00:53:28,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2020-07-29 00:53:28,879 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2020-07-29 00:53:28,921 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:53:28,923 INFO L225 Difference]: With dead ends: 25 [2020-07-29 00:53:28,923 INFO L226 Difference]: Without dead ends: 25 [2020-07-29 00:53:28,926 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 00:53:28,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-29 00:53:28,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-29 00:53:28,931 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 00:53:28,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2020-07-29 00:53:28,932 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-29 00:53:28,932 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-29 00:53:28,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:53:28,936 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2020-07-29 00:53:28,936 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2020-07-29 00:53:28,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:53:28,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:53:28,939 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-29 00:53:28,939 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-29 00:53:28,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:53:28,946 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2020-07-29 00:53:28,946 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2020-07-29 00:53:28,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:53:28,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:53:28,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 00:53:28,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 00:53:28,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-29 00:53:28,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2020-07-29 00:53:28,951 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 8 [2020-07-29 00:53:28,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 00:53:28,952 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2020-07-29 00:53:28,952 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 00:53:28,952 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2020-07-29 00:53:28,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-29 00:53:28,954 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 00:53:28,954 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 00:53:28,954 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-29 00:53:28,955 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr1ASSERT_VIOLATIONMEMORY_FREE, mainErr9ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2020-07-29 00:53:28,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 00:53:28,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1961265710, now seen corresponding path program 1 times [2020-07-29 00:53:28,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 00:53:28,956 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463505193] [2020-07-29 00:53:28,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 00:53:28,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:53:29,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 00:53:29,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:53:29,030 INFO L280 TraceCheckUtils]: 0: Hoare triple {266#(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; {260#true} is VALID [2020-07-29 00:53:29,031 INFO L280 TraceCheckUtils]: 1: Hoare triple {260#true} assume true; {260#true} is VALID [2020-07-29 00:53:29,031 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {260#true} {260#true} #43#return; {260#true} is VALID [2020-07-29 00:53:29,033 INFO L263 TraceCheckUtils]: 0: Hoare triple {260#true} call ULTIMATE.init(); {266#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 00:53:29,033 INFO L280 TraceCheckUtils]: 1: Hoare triple {266#(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; {260#true} is VALID [2020-07-29 00:53:29,034 INFO L280 TraceCheckUtils]: 2: Hoare triple {260#true} assume true; {260#true} is VALID [2020-07-29 00:53:29,034 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {260#true} {260#true} #43#return; {260#true} is VALID [2020-07-29 00:53:29,035 INFO L263 TraceCheckUtils]: 4: Hoare triple {260#true} call #t~ret4 := main(); {260#true} is VALID [2020-07-29 00:53:29,036 INFO L280 TraceCheckUtils]: 5: Hoare triple {260#true} ~x~0.base, ~x~0.offset := 0, 0;~y~0.base, ~y~0.offset := 0, 0;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~y~0.base, ~y~0.offset := #t~malloc2.base, #t~malloc2.offset;~adressY~0 := ~y~0.base + ~y~0.offset; {265#(= 1 (select |#valid| main_~y~0.base))} is VALID [2020-07-29 00:53:29,038 INFO L280 TraceCheckUtils]: 6: Hoare triple {265#(= 1 (select |#valid| main_~y~0.base))} assume 0 == ~y~0.offset; {265#(= 1 (select |#valid| main_~y~0.base))} is VALID [2020-07-29 00:53:29,039 INFO L280 TraceCheckUtils]: 7: Hoare triple {265#(= 1 (select |#valid| main_~y~0.base))} assume ~y~0.base < #StackHeapBarrier; {265#(= 1 (select |#valid| main_~y~0.base))} is VALID [2020-07-29 00:53:29,040 INFO L280 TraceCheckUtils]: 8: Hoare triple {265#(= 1 (select |#valid| main_~y~0.base))} assume !(0 == ~y~0.base || 1 == #valid[~y~0.base]); {261#false} is VALID [2020-07-29 00:53:29,041 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 00:53:29,042 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463505193] [2020-07-29 00:53:29,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 00:53:29,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 00:53:29,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913954954] [2020-07-29 00:53:29,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-07-29 00:53:29,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 00:53:29,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 00:53:29,057 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:53:29,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 00:53:29,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 00:53:29,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 00:53:29,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 00:53:29,058 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 4 states. [2020-07-29 00:53:29,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:53:29,170 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2020-07-29 00:53:29,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 00:53:29,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-07-29 00:53:29,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 00:53:29,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 00:53:29,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2020-07-29 00:53:29,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 00:53:29,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2020-07-29 00:53:29,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 25 transitions. [2020-07-29 00:53:29,210 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:53:29,211 INFO L225 Difference]: With dead ends: 24 [2020-07-29 00:53:29,211 INFO L226 Difference]: Without dead ends: 24 [2020-07-29 00:53:29,212 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 00:53:29,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-29 00:53:29,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-29 00:53:29,216 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 00:53:29,216 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2020-07-29 00:53:29,216 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-29 00:53:29,217 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-29 00:53:29,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:53:29,219 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2020-07-29 00:53:29,220 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2020-07-29 00:53:29,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:53:29,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:53:29,221 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-29 00:53:29,221 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-29 00:53:29,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:53:29,224 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2020-07-29 00:53:29,224 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2020-07-29 00:53:29,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:53:29,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:53:29,225 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 00:53:29,225 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 00:53:29,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-29 00:53:29,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2020-07-29 00:53:29,228 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 9 [2020-07-29 00:53:29,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 00:53:29,228 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2020-07-29 00:53:29,229 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 00:53:29,229 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2020-07-29 00:53:29,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-29 00:53:29,230 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 00:53:29,230 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 00:53:29,230 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-29 00:53:29,231 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr1ASSERT_VIOLATIONMEMORY_FREE, mainErr9ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2020-07-29 00:53:29,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 00:53:29,231 INFO L82 PathProgramCache]: Analyzing trace with hash -714294128, now seen corresponding path program 1 times [2020-07-29 00:53:29,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 00:53:29,232 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112099224] [2020-07-29 00:53:29,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 00:53:29,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:53:29,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 00:53:29,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:53:29,332 INFO L280 TraceCheckUtils]: 0: Hoare triple {371#(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; {365#true} is VALID [2020-07-29 00:53:29,333 INFO L280 TraceCheckUtils]: 1: Hoare triple {365#true} assume true; {365#true} is VALID [2020-07-29 00:53:29,333 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {365#true} {365#true} #43#return; {365#true} is VALID [2020-07-29 00:53:29,335 INFO L263 TraceCheckUtils]: 0: Hoare triple {365#true} call ULTIMATE.init(); {371#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 00:53:29,336 INFO L280 TraceCheckUtils]: 1: Hoare triple {371#(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; {365#true} is VALID [2020-07-29 00:53:29,336 INFO L280 TraceCheckUtils]: 2: Hoare triple {365#true} assume true; {365#true} is VALID [2020-07-29 00:53:29,336 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {365#true} {365#true} #43#return; {365#true} is VALID [2020-07-29 00:53:29,337 INFO L263 TraceCheckUtils]: 4: Hoare triple {365#true} call #t~ret4 := main(); {365#true} is VALID [2020-07-29 00:53:29,337 INFO L280 TraceCheckUtils]: 5: Hoare triple {365#true} ~x~0.base, ~x~0.offset := 0, 0;~y~0.base, ~y~0.offset := 0, 0;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~y~0.base, ~y~0.offset := #t~malloc2.base, #t~malloc2.offset;~adressY~0 := ~y~0.base + ~y~0.offset; {365#true} is VALID [2020-07-29 00:53:29,338 INFO L280 TraceCheckUtils]: 6: Hoare triple {365#true} assume 0 == ~y~0.offset; {365#true} is VALID [2020-07-29 00:53:29,338 INFO L280 TraceCheckUtils]: 7: Hoare triple {365#true} assume ~y~0.base < #StackHeapBarrier; {365#true} is VALID [2020-07-29 00:53:29,340 INFO L280 TraceCheckUtils]: 8: Hoare triple {365#true} assume 0 == ~y~0.base || 1 == #valid[~y~0.base];call ULTIMATE.dealloc(~y~0.base, ~y~0.offset);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~x~0.base, ~x~0.offset := #t~malloc3.base, #t~malloc3.offset;~adressX~0 := ~x~0.base + ~x~0.offset; {370#(and (<= main_~x~0.offset 0) (< 0 (+ main_~x~0.offset 1)))} is VALID [2020-07-29 00:53:29,342 INFO L280 TraceCheckUtils]: 9: Hoare triple {370#(and (<= main_~x~0.offset 0) (< 0 (+ main_~x~0.offset 1)))} assume ~adressX~0 == ~adressY~0; {370#(and (<= main_~x~0.offset 0) (< 0 (+ main_~x~0.offset 1)))} is VALID [2020-07-29 00:53:29,343 INFO L280 TraceCheckUtils]: 10: Hoare triple {370#(and (<= main_~x~0.offset 0) (< 0 (+ main_~x~0.offset 1)))} assume !(0 == ~x~0.offset); {366#false} is VALID [2020-07-29 00:53:29,344 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 00:53:29,345 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112099224] [2020-07-29 00:53:29,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 00:53:29,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 00:53:29,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247371627] [2020-07-29 00:53:29,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-07-29 00:53:29,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 00:53:29,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 00:53:29,364 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:53:29,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 00:53:29,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 00:53:29,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 00:53:29,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 00:53:29,365 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 4 states. [2020-07-29 00:53:29,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:53:29,472 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2020-07-29 00:53:29,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 00:53:29,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-07-29 00:53:29,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 00:53:29,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 00:53:29,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2020-07-29 00:53:29,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 00:53:29,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2020-07-29 00:53:29,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 24 transitions. [2020-07-29 00:53:29,513 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:53:29,514 INFO L225 Difference]: With dead ends: 22 [2020-07-29 00:53:29,515 INFO L226 Difference]: Without dead ends: 22 [2020-07-29 00:53:29,515 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 00:53:29,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-29 00:53:29,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-29 00:53:29,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 00:53:29,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2020-07-29 00:53:29,518 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-29 00:53:29,518 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-29 00:53:29,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:53:29,520 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2020-07-29 00:53:29,520 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2020-07-29 00:53:29,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:53:29,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:53:29,521 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-29 00:53:29,521 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-29 00:53:29,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:53:29,523 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2020-07-29 00:53:29,523 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2020-07-29 00:53:29,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:53:29,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:53:29,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 00:53:29,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 00:53:29,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-29 00:53:29,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2020-07-29 00:53:29,527 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 11 [2020-07-29 00:53:29,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 00:53:29,528 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2020-07-29 00:53:29,528 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 00:53:29,528 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2020-07-29 00:53:29,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-29 00:53:29,528 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 00:53:29,529 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 00:53:29,529 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-29 00:53:29,529 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr1ASSERT_VIOLATIONMEMORY_FREE, mainErr9ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2020-07-29 00:53:29,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 00:53:29,530 INFO L82 PathProgramCache]: Analyzing trace with hash -668281437, now seen corresponding path program 1 times [2020-07-29 00:53:29,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 00:53:29,530 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583397413] [2020-07-29 00:53:29,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 00:53:29,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:53:29,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 00:53:29,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:53:29,666 INFO L280 TraceCheckUtils]: 0: Hoare triple {472#(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; {462#true} is VALID [2020-07-29 00:53:29,666 INFO L280 TraceCheckUtils]: 1: Hoare triple {462#true} assume true; {462#true} is VALID [2020-07-29 00:53:29,667 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {462#true} {462#true} #43#return; {462#true} is VALID [2020-07-29 00:53:29,668 INFO L263 TraceCheckUtils]: 0: Hoare triple {462#true} call ULTIMATE.init(); {472#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 00:53:29,669 INFO L280 TraceCheckUtils]: 1: Hoare triple {472#(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; {462#true} is VALID [2020-07-29 00:53:29,669 INFO L280 TraceCheckUtils]: 2: Hoare triple {462#true} assume true; {462#true} is VALID [2020-07-29 00:53:29,669 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {462#true} {462#true} #43#return; {462#true} is VALID [2020-07-29 00:53:29,669 INFO L263 TraceCheckUtils]: 4: Hoare triple {462#true} call #t~ret4 := main(); {462#true} is VALID [2020-07-29 00:53:29,671 INFO L280 TraceCheckUtils]: 5: Hoare triple {462#true} ~x~0.base, ~x~0.offset := 0, 0;~y~0.base, ~y~0.offset := 0, 0;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~y~0.base, ~y~0.offset := #t~malloc2.base, #t~malloc2.offset;~adressY~0 := ~y~0.base + ~y~0.offset; {467#(<= (+ main_~adressY~0 1) (+ main_~y~0.offset |#StackHeapBarrier|))} is VALID [2020-07-29 00:53:29,672 INFO L280 TraceCheckUtils]: 6: Hoare triple {467#(<= (+ main_~adressY~0 1) (+ main_~y~0.offset |#StackHeapBarrier|))} assume 0 == ~y~0.offset; {468#(<= (+ main_~adressY~0 1) |#StackHeapBarrier|)} is VALID [2020-07-29 00:53:29,673 INFO L280 TraceCheckUtils]: 7: Hoare triple {468#(<= (+ main_~adressY~0 1) |#StackHeapBarrier|)} assume ~y~0.base < #StackHeapBarrier; {468#(<= (+ main_~adressY~0 1) |#StackHeapBarrier|)} is VALID [2020-07-29 00:53:29,675 INFO L280 TraceCheckUtils]: 8: Hoare triple {468#(<= (+ main_~adressY~0 1) |#StackHeapBarrier|)} assume 0 == ~y~0.base || 1 == #valid[~y~0.base];call ULTIMATE.dealloc(~y~0.base, ~y~0.offset);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~x~0.base, ~x~0.offset := #t~malloc3.base, #t~malloc3.offset;~adressX~0 := ~x~0.base + ~x~0.offset; {469#(<= (+ main_~x~0.base main_~x~0.offset main_~adressY~0 1) (+ |#StackHeapBarrier| main_~adressX~0))} is VALID [2020-07-29 00:53:29,676 INFO L280 TraceCheckUtils]: 9: Hoare triple {469#(<= (+ main_~x~0.base main_~x~0.offset main_~adressY~0 1) (+ |#StackHeapBarrier| main_~adressX~0))} assume ~adressX~0 == ~adressY~0; {470#(<= (+ main_~x~0.base main_~x~0.offset 1) |#StackHeapBarrier|)} is VALID [2020-07-29 00:53:29,677 INFO L280 TraceCheckUtils]: 10: Hoare triple {470#(<= (+ main_~x~0.base main_~x~0.offset 1) |#StackHeapBarrier|)} assume 0 == ~x~0.offset; {471#(<= (+ main_~x~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 00:53:29,678 INFO L280 TraceCheckUtils]: 11: Hoare triple {471#(<= (+ main_~x~0.base 1) |#StackHeapBarrier|)} assume !(~x~0.base < #StackHeapBarrier); {463#false} is VALID [2020-07-29 00:53:29,679 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 00:53:29,679 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583397413] [2020-07-29 00:53:29,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 00:53:29,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-29 00:53:29,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824502873] [2020-07-29 00:53:29,680 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2020-07-29 00:53:29,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 00:53:29,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 00:53:29,702 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 00:53:29,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-29 00:53:29,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 00:53:29,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-29 00:53:29,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-29 00:53:29,703 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 8 states. [2020-07-29 00:53:29,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:53:29,939 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2020-07-29 00:53:29,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 00:53:29,940 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2020-07-29 00:53:29,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 00:53:29,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 00:53:29,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2020-07-29 00:53:29,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 00:53:29,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2020-07-29 00:53:29,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 22 transitions. [2020-07-29 00:53:29,986 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:53:29,987 INFO L225 Difference]: With dead ends: 20 [2020-07-29 00:53:29,987 INFO L226 Difference]: Without dead ends: 20 [2020-07-29 00:53:29,988 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-07-29 00:53:29,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-29 00:53:29,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-29 00:53:29,991 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 00:53:29,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2020-07-29 00:53:29,991 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-29 00:53:29,992 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-29 00:53:29,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:53:29,994 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2020-07-29 00:53:29,994 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2020-07-29 00:53:29,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:53:29,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:53:29,995 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-29 00:53:29,996 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-29 00:53:29,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:53:29,998 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2020-07-29 00:53:29,999 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2020-07-29 00:53:29,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:53:29,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:53:30,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 00:53:30,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 00:53:30,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-29 00:53:30,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2020-07-29 00:53:30,002 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 12 [2020-07-29 00:53:30,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 00:53:30,003 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2020-07-29 00:53:30,003 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-29 00:53:30,003 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2020-07-29 00:53:30,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-29 00:53:30,004 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 00:53:30,004 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 00:53:30,005 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-29 00:53:30,005 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr1ASSERT_VIOLATIONMEMORY_FREE, mainErr9ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2020-07-29 00:53:30,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 00:53:30,006 INFO L82 PathProgramCache]: Analyzing trace with hash 758111986, now seen corresponding path program 1 times [2020-07-29 00:53:30,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 00:53:30,006 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748523682] [2020-07-29 00:53:30,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 00:53:30,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:53:30,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 00:53:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:53:30,083 INFO L280 TraceCheckUtils]: 0: Hoare triple {565#(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; {559#true} is VALID [2020-07-29 00:53:30,084 INFO L280 TraceCheckUtils]: 1: Hoare triple {559#true} assume true; {559#true} is VALID [2020-07-29 00:53:30,084 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {559#true} {559#true} #43#return; {559#true} is VALID [2020-07-29 00:53:30,086 INFO L263 TraceCheckUtils]: 0: Hoare triple {559#true} call ULTIMATE.init(); {565#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 00:53:30,086 INFO L280 TraceCheckUtils]: 1: Hoare triple {565#(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; {559#true} is VALID [2020-07-29 00:53:30,087 INFO L280 TraceCheckUtils]: 2: Hoare triple {559#true} assume true; {559#true} is VALID [2020-07-29 00:53:30,087 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {559#true} {559#true} #43#return; {559#true} is VALID [2020-07-29 00:53:30,087 INFO L263 TraceCheckUtils]: 4: Hoare triple {559#true} call #t~ret4 := main(); {559#true} is VALID [2020-07-29 00:53:30,088 INFO L280 TraceCheckUtils]: 5: Hoare triple {559#true} ~x~0.base, ~x~0.offset := 0, 0;~y~0.base, ~y~0.offset := 0, 0;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~y~0.base, ~y~0.offset := #t~malloc2.base, #t~malloc2.offset;~adressY~0 := ~y~0.base + ~y~0.offset; {559#true} is VALID [2020-07-29 00:53:30,088 INFO L280 TraceCheckUtils]: 6: Hoare triple {559#true} assume 0 == ~y~0.offset; {559#true} is VALID [2020-07-29 00:53:30,089 INFO L280 TraceCheckUtils]: 7: Hoare triple {559#true} assume ~y~0.base < #StackHeapBarrier; {559#true} is VALID [2020-07-29 00:53:30,091 INFO L280 TraceCheckUtils]: 8: Hoare triple {559#true} assume 0 == ~y~0.base || 1 == #valid[~y~0.base];call ULTIMATE.dealloc(~y~0.base, ~y~0.offset);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~x~0.base, ~x~0.offset := #t~malloc3.base, #t~malloc3.offset;~adressX~0 := ~x~0.base + ~x~0.offset; {564#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-29 00:53:30,092 INFO L280 TraceCheckUtils]: 9: Hoare triple {564#(= 1 (select |#valid| main_~x~0.base))} assume ~adressX~0 == ~adressY~0; {564#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-29 00:53:30,093 INFO L280 TraceCheckUtils]: 10: Hoare triple {564#(= 1 (select |#valid| main_~x~0.base))} assume 0 == ~x~0.offset; {564#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-29 00:53:30,093 INFO L280 TraceCheckUtils]: 11: Hoare triple {564#(= 1 (select |#valid| main_~x~0.base))} assume ~x~0.base < #StackHeapBarrier; {564#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-29 00:53:30,094 INFO L280 TraceCheckUtils]: 12: Hoare triple {564#(= 1 (select |#valid| main_~x~0.base))} assume !(0 == ~x~0.base || 1 == #valid[~x~0.base]); {560#false} is VALID [2020-07-29 00:53:30,095 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 00:53:30,095 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748523682] [2020-07-29 00:53:30,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 00:53:30,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 00:53:30,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16225235] [2020-07-29 00:53:30,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-07-29 00:53:30,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 00:53:30,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 00:53:30,118 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:53:30,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 00:53:30,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 00:53:30,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 00:53:30,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 00:53:30,120 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 4 states. [2020-07-29 00:53:30,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:53:30,214 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2020-07-29 00:53:30,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 00:53:30,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-07-29 00:53:30,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 00:53:30,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 00:53:30,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2020-07-29 00:53:30,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 00:53:30,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2020-07-29 00:53:30,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 24 transitions. [2020-07-29 00:53:30,274 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:53:30,274 INFO L225 Difference]: With dead ends: 22 [2020-07-29 00:53:30,275 INFO L226 Difference]: Without dead ends: 22 [2020-07-29 00:53:30,275 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 00:53:30,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-29 00:53:30,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-29 00:53:30,278 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 00:53:30,278 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2020-07-29 00:53:30,278 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-29 00:53:30,278 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-29 00:53:30,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:53:30,280 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2020-07-29 00:53:30,280 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2020-07-29 00:53:30,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:53:30,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:53:30,282 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-29 00:53:30,282 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-29 00:53:30,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:53:30,284 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2020-07-29 00:53:30,284 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2020-07-29 00:53:30,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:53:30,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:53:30,285 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 00:53:30,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 00:53:30,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-29 00:53:30,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2020-07-29 00:53:30,287 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 13 [2020-07-29 00:53:30,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 00:53:30,288 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2020-07-29 00:53:30,288 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 00:53:30,288 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2020-07-29 00:53:30,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-29 00:53:30,289 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 00:53:30,289 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 00:53:30,290 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-29 00:53:30,290 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr1ASSERT_VIOLATIONMEMORY_FREE, mainErr9ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2020-07-29 00:53:30,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 00:53:30,291 INFO L82 PathProgramCache]: Analyzing trace with hash 2034300366, now seen corresponding path program 1 times [2020-07-29 00:53:30,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 00:53:30,291 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5104685] [2020-07-29 00:53:30,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 00:53:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:53:30,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 00:53:30,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:53:30,399 INFO L280 TraceCheckUtils]: 0: Hoare triple {664#(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; {656#true} is VALID [2020-07-29 00:53:30,399 INFO L280 TraceCheckUtils]: 1: Hoare triple {656#true} assume true; {656#true} is VALID [2020-07-29 00:53:30,399 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {656#true} {656#true} #43#return; {656#true} is VALID [2020-07-29 00:53:30,400 INFO L263 TraceCheckUtils]: 0: Hoare triple {656#true} call ULTIMATE.init(); {664#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 00:53:30,401 INFO L280 TraceCheckUtils]: 1: Hoare triple {664#(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; {656#true} is VALID [2020-07-29 00:53:30,401 INFO L280 TraceCheckUtils]: 2: Hoare triple {656#true} assume true; {656#true} is VALID [2020-07-29 00:53:30,401 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {656#true} {656#true} #43#return; {656#true} is VALID [2020-07-29 00:53:30,402 INFO L263 TraceCheckUtils]: 4: Hoare triple {656#true} call #t~ret4 := main(); {661#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 00:53:30,404 INFO L280 TraceCheckUtils]: 5: Hoare triple {661#(= |#valid| |old(#valid)|)} ~x~0.base, ~x~0.offset := 0, 0;~y~0.base, ~y~0.offset := 0, 0;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~y~0.base, ~y~0.offset := #t~malloc2.base, #t~malloc2.offset;~adressY~0 := ~y~0.base + ~y~0.offset; {662#(= (store |#valid| main_~y~0.base 0) |old(#valid)|)} is VALID [2020-07-29 00:53:30,404 INFO L280 TraceCheckUtils]: 6: Hoare triple {662#(= (store |#valid| main_~y~0.base 0) |old(#valid)|)} assume 0 == ~y~0.offset; {662#(= (store |#valid| main_~y~0.base 0) |old(#valid)|)} is VALID [2020-07-29 00:53:30,405 INFO L280 TraceCheckUtils]: 7: Hoare triple {662#(= (store |#valid| main_~y~0.base 0) |old(#valid)|)} assume ~y~0.base < #StackHeapBarrier; {662#(= (store |#valid| main_~y~0.base 0) |old(#valid)|)} is VALID [2020-07-29 00:53:30,407 INFO L280 TraceCheckUtils]: 8: Hoare triple {662#(= (store |#valid| main_~y~0.base 0) |old(#valid)|)} assume 0 == ~y~0.base || 1 == #valid[~y~0.base];call ULTIMATE.dealloc(~y~0.base, ~y~0.offset);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~x~0.base, ~x~0.offset := #t~malloc3.base, #t~malloc3.offset;~adressX~0 := ~x~0.base + ~x~0.offset; {663#(= |old(#valid)| (store |#valid| main_~x~0.base 0))} is VALID [2020-07-29 00:53:30,407 INFO L280 TraceCheckUtils]: 9: Hoare triple {663#(= |old(#valid)| (store |#valid| main_~x~0.base 0))} assume !(~adressX~0 == ~adressY~0); {663#(= |old(#valid)| (store |#valid| main_~x~0.base 0))} is VALID [2020-07-29 00:53:30,408 INFO L280 TraceCheckUtils]: 10: Hoare triple {663#(= |old(#valid)| (store |#valid| main_~x~0.base 0))} assume 0 == ~x~0.offset; {663#(= |old(#valid)| (store |#valid| main_~x~0.base 0))} is VALID [2020-07-29 00:53:30,409 INFO L280 TraceCheckUtils]: 11: Hoare triple {663#(= |old(#valid)| (store |#valid| main_~x~0.base 0))} assume ~x~0.base < #StackHeapBarrier; {663#(= |old(#valid)| (store |#valid| main_~x~0.base 0))} is VALID [2020-07-29 00:53:30,410 INFO L280 TraceCheckUtils]: 12: Hoare triple {663#(= |old(#valid)| (store |#valid| main_~x~0.base 0))} assume 0 == ~x~0.base || 1 == #valid[~x~0.base];call ULTIMATE.dealloc(~x~0.base, ~x~0.offset);#res := 0; {661#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 00:53:30,410 INFO L280 TraceCheckUtils]: 13: Hoare triple {661#(= |#valid| |old(#valid)|)} assume !(#valid == old(#valid)); {657#false} is VALID [2020-07-29 00:53:30,411 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 00:53:30,411 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5104685] [2020-07-29 00:53:30,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 00:53:30,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 00:53:30,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824584545] [2020-07-29 00:53:30,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-29 00:53:30,413 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 00:53:30,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 00:53:30,431 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:53:30,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 00:53:30,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 00:53:30,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 00:53:30,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-29 00:53:30,432 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 6 states. [2020-07-29 00:53:30,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:53:30,564 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2020-07-29 00:53:30,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 00:53:30,565 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-29 00:53:30,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 00:53:30,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 00:53:30,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2020-07-29 00:53:30,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 00:53:30,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2020-07-29 00:53:30,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 22 transitions. [2020-07-29 00:53:30,596 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:53:30,597 INFO L225 Difference]: With dead ends: 21 [2020-07-29 00:53:30,597 INFO L226 Difference]: Without dead ends: 17 [2020-07-29 00:53:30,598 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-29 00:53:30,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-07-29 00:53:30,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-07-29 00:53:30,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 00:53:30,600 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2020-07-29 00:53:30,600 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2020-07-29 00:53:30,600 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2020-07-29 00:53:30,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:53:30,602 INFO L93 Difference]: Finished difference Result 17 states and 16 transitions. [2020-07-29 00:53:30,602 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 16 transitions. [2020-07-29 00:53:30,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:53:30,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:53:30,603 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2020-07-29 00:53:30,603 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2020-07-29 00:53:30,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:53:30,605 INFO L93 Difference]: Finished difference Result 17 states and 16 transitions. [2020-07-29 00:53:30,605 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 16 transitions. [2020-07-29 00:53:30,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:53:30,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:53:30,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 00:53:30,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 00:53:30,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-29 00:53:30,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 16 transitions. [2020-07-29 00:53:30,608 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 16 transitions. Word has length 14 [2020-07-29 00:53:30,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 00:53:30,608 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 16 transitions. [2020-07-29 00:53:30,608 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 00:53:30,608 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 16 transitions. [2020-07-29 00:53:30,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-29 00:53:30,609 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 00:53:30,609 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 00:53:30,610 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-29 00:53:30,610 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr1ASSERT_VIOLATIONMEMORY_FREE, mainErr9ENSURES_VIOLATIONMEMORY_LEAK, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2020-07-29 00:53:30,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 00:53:30,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1976190218, now seen corresponding path program 1 times [2020-07-29 00:53:30,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 00:53:30,611 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607278825] [2020-07-29 00:53:30,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 00:53:30,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 00:53:30,627 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 00:53:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 00:53:30,640 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 00:53:30,666 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 00:53:30,667 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-29 00:53:30,667 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-29 00:53:30,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.07 12:53:30 BoogieIcfgContainer [2020-07-29 00:53:30,697 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-29 00:53:30,697 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 00:53:30,697 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 00:53:30,698 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 00:53:30,698 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 12:53:27" (3/4) ... [2020-07-29 00:53:30,701 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-07-29 00:53:30,759 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-29 00:53:30,759 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 00:53:30,768 INFO L168 Benchmark]: Toolchain (without parser) took 4318.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 213.9 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -193.0 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2020-07-29 00:53:30,769 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 00:53:30,770 INFO L168 Benchmark]: CACSL2BoogieTranslator took 623.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -168.1 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2020-07-29 00:53:30,771 INFO L168 Benchmark]: Boogie Preprocessor took 74.90 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2020-07-29 00:53:30,774 INFO L168 Benchmark]: RCFGBuilder took 602.91 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: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 11.5 GB. [2020-07-29 00:53:30,775 INFO L168 Benchmark]: TraceAbstraction took 2945.85 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 77.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -83.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 00:53:30,776 INFO L168 Benchmark]: Witness Printer took 61.95 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 00:53:30,782 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.33 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 623.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -168.1 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 74.90 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 602.91 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: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2945.85 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 77.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -83.6 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 61.95 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 554]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L543] struct T* x = ((void *)0); [L544] struct T* y = ((void *)0); [L545] y = malloc(sizeof(*y)) [L546] intptr_t adressY = (intptr_t) y; VAL [adressY=-1, malloc(sizeof(*y))={-1:0}, x={0:0}, y={-1:0}] [L547] free(y) VAL [adressY=-1, malloc(sizeof(*y))={-1:0}, x={0:0}, y={-1:0}] [L547] free(y) VAL [adressY=-1, malloc(sizeof(*y))={-1:0}, x={0:0}, y={-1:0}] [L547] free(y) [L548] x = malloc(sizeof(*x)) [L549] intptr_t adressX = (intptr_t) x; VAL [adressX=-1, adressY=-1, malloc(sizeof(*x))={-1:0}, malloc(sizeof(*y))={-1:0}, x={-1:0}, y={-1:0}] [L550] COND TRUE adressX == adressY VAL [adressX=-1, adressY=-1, malloc(sizeof(*x))={-1:0}, malloc(sizeof(*y))={-1:0}, x={-1:0}, y={-1:0}] [L552] free(x) VAL [adressX=-1, adressY=-1, malloc(sizeof(*x))={-1:0}, malloc(sizeof(*y))={-1:0}, x={-1:0}, y={-1:0}] [L552] free(x) VAL [adressX=-1, adressY=-1, malloc(sizeof(*x))={-1:0}, malloc(sizeof(*y))={-1:0}, x={-1:0}, y={-1:0}] [L552] free(x) [L554] free(x) VAL [adressX=-1, adressY=-1, malloc(sizeof(*x))={-1:0}, malloc(sizeof(*y))={-1:0}, x={-1:0}, y={-1:0}] [L554] free(x) VAL [adressX=-1, adressY=-1, malloc(sizeof(*x))={-1:0}, malloc(sizeof(*y))={-1:0}, x={-1:0}, y={-1:0}] [L554] free(x) VAL [adressX=-1, adressY=-1, malloc(sizeof(*x))={-1:0}, malloc(sizeof(*y))={-1:0}, x={-1:0}, y={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 45 locations, 10 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 2.8s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 108 SDtfs, 123 SDslu, 84 SDs, 0 SdLazy, 219 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 67 ConstructedInterpolants, 0 QuantifiedInterpolants, 2674 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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...