./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memcleanup.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_max.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_max.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e98a60ea9ee0c00575c08606ce8b95d0660c5b235c5932147dfee4b13512f57c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:22:05,071 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:22:05,142 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-14 17:22:05,154 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:22:05,154 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:22:05,181 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:22:05,181 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:22:05,182 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:22:05,183 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:22:05,183 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:22:05,184 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:22:05,184 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:22:05,185 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:22:05,186 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:22:05,187 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:22:05,187 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:22:05,187 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 17:22:05,188 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:22:05,188 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:22:05,188 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:22:05,189 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:22:05,189 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 17:22:05,189 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:22:05,190 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:22:05,190 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:22:05,190 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 17:22:05,191 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:22:05,191 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:22:05,191 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:22:05,192 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:22:05,192 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 17:22:05,192 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:22:05,193 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:22:05,193 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:22:05,193 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:22:05,194 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:22:05,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:22:05,194 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:22:05,194 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:22:05,194 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:22:05,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:22:05,195 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:22:05,195 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:22:05,196 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:22:05,196 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:22:05,196 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e98a60ea9ee0c00575c08606ce8b95d0660c5b235c5932147dfee4b13512f57c [2024-10-14 17:22:05,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:22:05,467 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:22:05,470 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:22:05,471 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:22:05,473 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:22:05,474 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_max.c [2024-10-14 17:22:06,850 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:22:07,021 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:22:07,022 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_max.c [2024-10-14 17:22:07,028 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f7494e7c/6089b34ead6b44bc89dffa0b183f9089/FLAGa0e82040e [2024-10-14 17:22:07,040 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f7494e7c/6089b34ead6b44bc89dffa0b183f9089 [2024-10-14 17:22:07,043 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:22:07,044 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:22:07,046 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:22:07,046 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:22:07,051 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:22:07,052 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:22:07" (1/1) ... [2024-10-14 17:22:07,053 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51600696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:22:07, skipping insertion in model container [2024-10-14 17:22:07,053 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:22:07" (1/1) ... [2024-10-14 17:22:07,073 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:22:07,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:22:07,242 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-14 17:22:07,243 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@751c7159 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:22:07, skipping insertion in model container [2024-10-14 17:22:07,243 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:22:07,244 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-14 17:22:07,246 INFO L158 Benchmark]: Toolchain (without parser) took 200.97ms. Allocated memory is still 151.0MB. Free memory was 94.0MB in the beginning and 84.0MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 17:22:07,247 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 151.0MB. Free memory was 113.8MB in the beginning and 113.8MB in the end (delta: 14.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:22:07,248 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.70ms. Allocated memory is still 151.0MB. Free memory was 93.5MB in the beginning and 84.0MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 17:22:07,249 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 151.0MB. Free memory was 113.8MB in the beginning and 113.8MB in the end (delta: 14.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 197.70ms. Allocated memory is still 151.0MB. Free memory was 93.5MB in the beginning and 84.0MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 27]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_max.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e98a60ea9ee0c00575c08606ce8b95d0660c5b235c5932147dfee4b13512f57c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:22:09,196 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:22:09,268 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-14 17:22:09,273 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:22:09,273 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:22:09,316 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:22:09,318 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:22:09,318 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:22:09,319 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:22:09,320 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:22:09,320 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:22:09,320 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:22:09,321 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:22:09,323 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:22:09,323 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:22:09,323 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:22:09,324 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 17:22:09,324 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:22:09,324 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:22:09,324 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:22:09,325 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:22:09,328 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 17:22:09,328 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:22:09,329 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:22:09,329 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:22:09,329 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 17:22:09,329 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:22:09,329 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 17:22:09,330 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:22:09,330 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 17:22:09,330 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:22:09,330 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:22:09,331 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 17:22:09,331 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:22:09,332 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:22:09,333 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:22:09,333 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:22:09,334 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:22:09,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:22:09,334 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:22:09,334 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:22:09,335 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 17:22:09,335 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 17:22:09,335 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:22:09,335 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:22:09,336 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:22:09,336 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:22:09,336 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 17:22:09,336 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e98a60ea9ee0c00575c08606ce8b95d0660c5b235c5932147dfee4b13512f57c [2024-10-14 17:22:09,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:22:09,654 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:22:09,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:22:09,659 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:22:09,659 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:22:09,660 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_max.c [2024-10-14 17:22:11,133 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:22:11,321 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:22:11,322 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_max.c [2024-10-14 17:22:11,331 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d5c82626/4b8c00b29c27452ba25d6c1eeec1a4e9/FLAG6a72b8b0a [2024-10-14 17:22:11,694 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d5c82626/4b8c00b29c27452ba25d6c1eeec1a4e9 [2024-10-14 17:22:11,697 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:22:11,698 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:22:11,700 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:22:11,701 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:22:11,706 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:22:11,706 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:22:11" (1/1) ... [2024-10-14 17:22:11,707 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@769f1c51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:22:11, skipping insertion in model container [2024-10-14 17:22:11,707 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:22:11" (1/1) ... [2024-10-14 17:22:11,724 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:22:11,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:22:11,918 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-14 17:22:11,923 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:22:11,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:22:11,962 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:22:11,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:22:12,008 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:22:12,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:22:12 WrapperNode [2024-10-14 17:22:12,009 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:22:12,011 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:22:12,011 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:22:12,012 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:22:12,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:22:12" (1/1) ... [2024-10-14 17:22:12,029 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:22:12" (1/1) ... [2024-10-14 17:22:12,052 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 39 [2024-10-14 17:22:12,053 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:22:12,055 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:22:12,055 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:22:12,055 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:22:12,064 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:22:12" (1/1) ... [2024-10-14 17:22:12,064 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:22:12" (1/1) ... [2024-10-14 17:22:12,067 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:22:12" (1/1) ... [2024-10-14 17:22:12,090 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2024-10-14 17:22:12,090 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:22:12" (1/1) ... [2024-10-14 17:22:12,090 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:22:12" (1/1) ... [2024-10-14 17:22:12,100 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:22:12" (1/1) ... [2024-10-14 17:22:12,105 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:22:12" (1/1) ... [2024-10-14 17:22:12,107 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:22:12" (1/1) ... [2024-10-14 17:22:12,111 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:22:12" (1/1) ... [2024-10-14 17:22:12,116 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:22:12,117 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:22:12,117 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:22:12,117 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:22:12,118 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:22:12" (1/1) ... [2024-10-14 17:22:12,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:22:12,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:22:12,155 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 17:22:12,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 17:22:12,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 17:22:12,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 17:22:12,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 17:22:12,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 17:22:12,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 17:22:12,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 17:22:12,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 17:22:12,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 17:22:12,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 17:22:12,206 INFO L130 BoogieDeclarations]: Found specification of procedure max [2024-10-14 17:22:12,206 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2024-10-14 17:22:12,206 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2024-10-14 17:22:12,206 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2024-10-14 17:22:12,206 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-10-14 17:22:12,207 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-10-14 17:22:12,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 17:22:12,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:22:12,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:22:12,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 17:22:12,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-14 17:22:12,317 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:22:12,319 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:22:12,591 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2024-10-14 17:22:12,591 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:22:12,617 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:22:12,617 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 17:22:12,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:22:12 BoogieIcfgContainer [2024-10-14 17:22:12,617 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:22:12,620 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:22:12,620 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:22:12,623 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:22:12,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:22:11" (1/3) ... [2024-10-14 17:22:12,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12947665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:22:12, skipping insertion in model container [2024-10-14 17:22:12,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:22:12" (2/3) ... [2024-10-14 17:22:12,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12947665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:22:12, skipping insertion in model container [2024-10-14 17:22:12,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:22:12" (3/3) ... [2024-10-14 17:22:12,626 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_max.c [2024-10-14 17:22:12,643 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:22:12,643 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 17:22:12,690 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:22:12,698 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@65df4127, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:22:12,699 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 17:22:12,703 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 28 states have internal predecessors, (35), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 17:22:12,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 17:22:12,713 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:22:12,713 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:22:12,714 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting checkErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:22:12,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:22:12,721 INFO L85 PathProgramCache]: Analyzing trace with hash 2120221298, now seen corresponding path program 1 times [2024-10-14 17:22:12,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:22:12,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [123701100] [2024-10-14 17:22:12,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:22:12,736 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:22:12,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:22:12,740 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:22:12,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 17:22:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:22:12,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-14 17:22:12,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:22:13,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:22:13,050 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:22:13,051 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:22:13,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [123701100] [2024-10-14 17:22:13,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [123701100] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:22:13,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:22:13,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 17:22:13,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285946342] [2024-10-14 17:22:13,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:22:13,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 17:22:13,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:22:13,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 17:22:13,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:22:13,087 INFO L87 Difference]: Start difference. First operand has 41 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 28 states have internal predecessors, (35), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:22:13,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:22:13,204 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2024-10-14 17:22:13,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 17:22:13,206 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2024-10-14 17:22:13,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:22:13,214 INFO L225 Difference]: With dead ends: 52 [2024-10-14 17:22:13,214 INFO L226 Difference]: Without dead ends: 51 [2024-10-14 17:22:13,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:22:13,221 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 3 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:22:13,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 268 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:22:13,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-14 17:22:13,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2024-10-14 17:22:13,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.21875) internal successors, (39), 34 states have internal predecessors, (39), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2024-10-14 17:22:13,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2024-10-14 17:22:13,264 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 18 [2024-10-14 17:22:13,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:22:13,265 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2024-10-14 17:22:13,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:22:13,265 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2024-10-14 17:22:13,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 17:22:13,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:22:13,267 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:22:13,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 17:22:13,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:22:13,470 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:22:13,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:22:13,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1740118506, now seen corresponding path program 1 times [2024-10-14 17:22:13,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:22:13,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2022317013] [2024-10-14 17:22:13,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:22:13,471 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:22:13,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:22:13,474 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:22:13,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 17:22:13,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:22:13,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 17:22:13,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:22:13,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:22:13,625 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:22:13,625 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:22:13,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2022317013] [2024-10-14 17:22:13,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2022317013] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:22:13,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:22:13,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:22:13,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238539616] [2024-10-14 17:22:13,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:22:13,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:22:13,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:22:13,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:22:13,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:22:13,629 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 17:22:13,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:22:13,792 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2024-10-14 17:22:13,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:22:13,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 20 [2024-10-14 17:22:13,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:22:13,794 INFO L225 Difference]: With dead ends: 52 [2024-10-14 17:22:13,794 INFO L226 Difference]: Without dead ends: 42 [2024-10-14 17:22:13,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:22:13,796 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 26 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:22:13,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 32 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:22:13,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-14 17:22:13,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-14 17:22:13,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2024-10-14 17:22:13,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2024-10-14 17:22:13,803 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 54 transitions. Word has length 20 [2024-10-14 17:22:13,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:22:13,804 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 54 transitions. [2024-10-14 17:22:13,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 17:22:13,804 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 54 transitions. [2024-10-14 17:22:13,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-14 17:22:13,805 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:22:13,805 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:22:13,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-14 17:22:14,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:22:14,009 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting checkErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:22:14,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:22:14,010 INFO L85 PathProgramCache]: Analyzing trace with hash -687749469, now seen corresponding path program 1 times [2024-10-14 17:22:14,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:22:14,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1113879725] [2024-10-14 17:22:14,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:22:14,011 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:22:14,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:22:14,014 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:22:14,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 17:22:14,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:22:14,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 17:22:14,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:22:14,185 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 17:22:14,185 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:22:14,186 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:22:14,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1113879725] [2024-10-14 17:22:14,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1113879725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:22:14,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:22:14,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 17:22:14,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039961041] [2024-10-14 17:22:14,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:22:14,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 17:22:14,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:22:14,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 17:22:14,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:22:14,188 INFO L87 Difference]: Start difference. First operand 42 states and 54 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 17:22:14,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:22:14,274 INFO L93 Difference]: Finished difference Result 44 states and 57 transitions. [2024-10-14 17:22:14,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 17:22:14,275 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2024-10-14 17:22:14,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:22:14,276 INFO L225 Difference]: With dead ends: 44 [2024-10-14 17:22:14,276 INFO L226 Difference]: Without dead ends: 44 [2024-10-14 17:22:14,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:22:14,278 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 2 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:22:14,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 290 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:22:14,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-14 17:22:14,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-14 17:22:14,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.25) internal successors, (35), 31 states have internal predecessors, (35), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (13), 9 states have call predecessors, (13), 9 states have call successors, (13) [2024-10-14 17:22:14,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 57 transitions. [2024-10-14 17:22:14,292 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 57 transitions. Word has length 30 [2024-10-14 17:22:14,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:22:14,293 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 57 transitions. [2024-10-14 17:22:14,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 17:22:14,293 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 57 transitions. [2024-10-14 17:22:14,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-14 17:22:14,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:22:14,295 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:22:14,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-14 17:22:14,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:22:14,496 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting checkErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:22:14,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:22:14,497 INFO L85 PathProgramCache]: Analyzing trace with hash 834642753, now seen corresponding path program 1 times [2024-10-14 17:22:14,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:22:14,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [62090267] [2024-10-14 17:22:14,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:22:14,498 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:22:14,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:22:14,501 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:22:14,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 17:22:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:22:14,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-14 17:22:14,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:22:15,047 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:22:15,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 38 [2024-10-14 17:22:15,083 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 17:22:15,083 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:22:15,432 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:22:15,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 1 [2024-10-14 17:22:16,145 INFO L349 Elim1Store]: treesize reduction 37, result has 81.6 percent of original size [2024-10-14 17:22:16,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 64 treesize of output 183 [2024-10-14 17:22:24,452 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 17:22:24,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:22:24,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [62090267] [2024-10-14 17:22:24,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [62090267] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:22:24,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:22:24,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2024-10-14 17:22:24,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583332857] [2024-10-14 17:22:24,453 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:22:24,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-14 17:22:24,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:22:24,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-14 17:22:24,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2024-10-14 17:22:24,455 INFO L87 Difference]: Start difference. First operand 44 states and 57 transitions. Second operand has 23 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 17 states have internal predecessors, (35), 7 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2024-10-14 17:22:25,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:22:25,481 INFO L93 Difference]: Finished difference Result 76 states and 103 transitions. [2024-10-14 17:22:25,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-14 17:22:25,482 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 17 states have internal predecessors, (35), 7 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) Word has length 43 [2024-10-14 17:22:25,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:22:25,484 INFO L225 Difference]: With dead ends: 76 [2024-10-14 17:22:25,484 INFO L226 Difference]: Without dead ends: 76 [2024-10-14 17:22:25,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2024-10-14 17:22:25,485 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 39 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 17:22:25,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 421 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 17:22:25,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-14 17:22:25,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2024-10-14 17:22:25,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 36 states have (on average 1.25) internal successors, (45), 39 states have internal predecessors, (45), 11 states have call successors, (11), 4 states have call predecessors, (11), 6 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2024-10-14 17:22:25,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 71 transitions. [2024-10-14 17:22:25,494 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 71 transitions. Word has length 43 [2024-10-14 17:22:25,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:22:25,494 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 71 transitions. [2024-10-14 17:22:25,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 17 states have internal predecessors, (35), 7 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2024-10-14 17:22:25,494 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 71 transitions. [2024-10-14 17:22:25,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-14 17:22:25,496 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:22:25,496 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:22:25,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-14 17:22:25,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:22:25,700 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:22:25,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:22:25,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1045249287, now seen corresponding path program 1 times [2024-10-14 17:22:25,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:22:25,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [78993123] [2024-10-14 17:22:25,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:22:25,701 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:22:25,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:22:25,703 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:22:25,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-14 17:22:25,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:22:25,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 17:22:25,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:22:25,859 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-14 17:22:25,859 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:22:25,859 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:22:25,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [78993123] [2024-10-14 17:22:25,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [78993123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:22:25,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:22:25,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 17:22:25,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009435055] [2024-10-14 17:22:25,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:22:25,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 17:22:25,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:22:25,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 17:22:25,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:22:25,862 INFO L87 Difference]: Start difference. First operand 55 states and 71 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 17:22:25,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:22:25,927 INFO L93 Difference]: Finished difference Result 59 states and 77 transitions. [2024-10-14 17:22:25,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 17:22:25,927 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 45 [2024-10-14 17:22:25,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:22:25,929 INFO L225 Difference]: With dead ends: 59 [2024-10-14 17:22:25,929 INFO L226 Difference]: Without dead ends: 57 [2024-10-14 17:22:25,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:22:25,931 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 5 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:22:25,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 283 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:22:25,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-14 17:22:25,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2024-10-14 17:22:25,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 39 states have internal predecessors, (44), 11 states have call successors, (11), 4 states have call predecessors, (11), 6 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2024-10-14 17:22:25,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2024-10-14 17:22:25,938 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 45 [2024-10-14 17:22:25,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:22:25,939 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2024-10-14 17:22:25,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 17:22:25,939 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2024-10-14 17:22:25,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 17:22:25,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:22:25,941 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:22:25,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-14 17:22:26,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:22:26,142 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting checkErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:22:26,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:22:26,142 INFO L85 PathProgramCache]: Analyzing trace with hash -429837370, now seen corresponding path program 1 times [2024-10-14 17:22:26,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:22:26,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024865181] [2024-10-14 17:22:26,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:22:26,143 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:22:26,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:22:26,144 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:22:26,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-14 17:22:26,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:22:26,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-14 17:22:26,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:22:26,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-14 17:22:26,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-14 17:22:26,584 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-14 17:22:26,584 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:22:26,822 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-14 17:22:26,823 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:22:26,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024865181] [2024-10-14 17:22:26,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2024865181] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:22:26,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:22:26,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 13 [2024-10-14 17:22:26,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442632966] [2024-10-14 17:22:26,823 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:22:26,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 17:22:26,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:22:26,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 17:22:26,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-10-14 17:22:26,825 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-14 17:22:30,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 17:22:34,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 17:22:38,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 17:22:43,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 17:22:47,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 17:22:47,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:22:47,718 INFO L93 Difference]: Finished difference Result 106 states and 133 transitions. [2024-10-14 17:22:47,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 17:22:47,719 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) Word has length 49 [2024-10-14 17:22:47,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:22:47,720 INFO L225 Difference]: With dead ends: 106 [2024-10-14 17:22:47,721 INFO L226 Difference]: Without dead ends: 106 [2024-10-14 17:22:47,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2024-10-14 17:22:47,722 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 36 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 5 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.7s IncrementalHoareTripleChecker+Time [2024-10-14 17:22:47,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 397 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 249 Invalid, 5 Unknown, 0 Unchecked, 20.7s Time] [2024-10-14 17:22:47,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-14 17:22:47,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 100. [2024-10-14 17:22:47,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 71 states have internal predecessors, (82), 19 states have call successors, (19), 8 states have call predecessors, (19), 12 states have return successors, (28), 20 states have call predecessors, (28), 19 states have call successors, (28) [2024-10-14 17:22:47,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 129 transitions. [2024-10-14 17:22:47,739 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 129 transitions. Word has length 49 [2024-10-14 17:22:47,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:22:47,739 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 129 transitions. [2024-10-14 17:22:47,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-14 17:22:47,740 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 129 transitions. [2024-10-14 17:22:47,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 17:22:47,741 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:22:47,742 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:22:47,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-14 17:22:47,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:22:47,943 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting checkErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:22:47,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:22:47,943 INFO L85 PathProgramCache]: Analyzing trace with hash -546201016, now seen corresponding path program 1 times [2024-10-14 17:22:47,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:22:47,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1843006176] [2024-10-14 17:22:47,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:22:47,944 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:22:47,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:22:47,945 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:22:47,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-14 17:22:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:22:48,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-14 17:22:48,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:22:48,531 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 17:22:48,532 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:22:50,501 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-14 17:22:50,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2024-10-14 17:22:50,525 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-10-14 17:22:50,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2024-10-14 17:22:50,566 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-14 17:22:50,566 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:22:50,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1843006176] [2024-10-14 17:22:50,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1843006176] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:22:50,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:22:50,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 16 [2024-10-14 17:22:50,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629560443] [2024-10-14 17:22:50,567 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:22:50,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-14 17:22:50,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:22:50,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-14 17:22:50,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-10-14 17:22:50,568 INFO L87 Difference]: Start difference. First operand 100 states and 129 transitions. Second operand has 16 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 6 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-14 17:22:54,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 17:22:58,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 17:23:00,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:23:00,660 INFO L93 Difference]: Finished difference Result 159 states and 212 transitions. [2024-10-14 17:23:00,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 17:23:00,661 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 6 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 49 [2024-10-14 17:23:00,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:23:00,663 INFO L225 Difference]: With dead ends: 159 [2024-10-14 17:23:00,663 INFO L226 Difference]: Without dead ends: 159 [2024-10-14 17:23:00,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2024-10-14 17:23:00,665 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 52 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 13 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:23:00,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 447 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 378 Invalid, 2 Unknown, 0 Unchecked, 9.3s Time] [2024-10-14 17:23:00,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-14 17:23:00,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2024-10-14 17:23:00,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 107 states have (on average 1.2149532710280373) internal successors, (130), 113 states have internal predecessors, (130), 29 states have call successors, (29), 14 states have call predecessors, (29), 20 states have return successors, (52), 30 states have call predecessors, (52), 29 states have call successors, (52) [2024-10-14 17:23:00,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 211 transitions. [2024-10-14 17:23:00,688 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 211 transitions. Word has length 49 [2024-10-14 17:23:00,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:23:00,688 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 211 transitions. [2024-10-14 17:23:00,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 6 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-14 17:23:00,689 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 211 transitions. [2024-10-14 17:23:00,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-14 17:23:00,691 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:23:00,691 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:23:00,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-14 17:23:00,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:23:00,892 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting checkErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:23:00,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:23:00,893 INFO L85 PathProgramCache]: Analyzing trace with hash 178316087, now seen corresponding path program 2 times [2024-10-14 17:23:00,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:23:00,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [567423935] [2024-10-14 17:23:00,893 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:23:00,893 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:23:00,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:23:00,894 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:23:00,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-14 17:23:01,006 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 17:23:01,007 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:23:01,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-14 17:23:01,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:23:01,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 17:23:01,590 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-14 17:23:01,590 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:23:02,341 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-14 17:23:02,342 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:23:02,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [567423935] [2024-10-14 17:23:02,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [567423935] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:23:02,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:23:02,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 24 [2024-10-14 17:23:02,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036786289] [2024-10-14 17:23:02,342 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:23:02,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-14 17:23:02,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:23:02,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-14 17:23:02,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2024-10-14 17:23:02,344 INFO L87 Difference]: Start difference. First operand 158 states and 211 transitions. Second operand has 24 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 10 states have call successors, (15), 3 states have call predecessors, (15), 9 states have return successors, (14), 12 states have call predecessors, (14), 9 states have call successors, (14) [2024-10-14 17:23:04,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:23:04,119 INFO L93 Difference]: Finished difference Result 192 states and 271 transitions. [2024-10-14 17:23:04,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-14 17:23:04,120 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 10 states have call successors, (15), 3 states have call predecessors, (15), 9 states have return successors, (14), 12 states have call predecessors, (14), 9 states have call successors, (14) Word has length 61 [2024-10-14 17:23:04,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:23:04,122 INFO L225 Difference]: With dead ends: 192 [2024-10-14 17:23:04,122 INFO L226 Difference]: Without dead ends: 192 [2024-10-14 17:23:04,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=117, Invalid=813, Unknown=0, NotChecked=0, Total=930 [2024-10-14 17:23:04,123 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 42 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 17:23:04,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 1079 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 17:23:04,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-10-14 17:23:04,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 163. [2024-10-14 17:23:04,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 111 states have (on average 1.2252252252252251) internal successors, (136), 117 states have internal predecessors, (136), 29 states have call successors, (29), 14 states have call predecessors, (29), 21 states have return successors, (56), 31 states have call predecessors, (56), 29 states have call successors, (56) [2024-10-14 17:23:04,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 221 transitions. [2024-10-14 17:23:04,156 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 221 transitions. Word has length 61 [2024-10-14 17:23:04,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:23:04,157 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 221 transitions. [2024-10-14 17:23:04,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 10 states have call successors, (15), 3 states have call predecessors, (15), 9 states have return successors, (14), 12 states have call predecessors, (14), 9 states have call successors, (14) [2024-10-14 17:23:04,158 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 221 transitions. [2024-10-14 17:23:04,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-14 17:23:04,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:23:04,163 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:23:04,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-14 17:23:04,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:23:04,364 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:23:04,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:23:04,365 INFO L85 PathProgramCache]: Analyzing trace with hash 2070385375, now seen corresponding path program 1 times [2024-10-14 17:23:04,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:23:04,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [14288724] [2024-10-14 17:23:04,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:23:04,365 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:23:04,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:23:04,366 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:23:04,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-14 17:23:04,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 17:23:04,476 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 17:23:04,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 17:23:04,611 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-14 17:23:04,613 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 17:23:04,614 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-10-14 17:23:04,615 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-10-14 17:23:04,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-14 17:23:04,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:23:04,819 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:23:04,848 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 17:23:04,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 05:23:04 BoogieIcfgContainer [2024-10-14 17:23:04,851 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 17:23:04,851 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 17:23:04,851 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 17:23:04,852 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 17:23:04,852 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:22:12" (3/4) ... [2024-10-14 17:23:04,853 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-14 17:23:04,899 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 17:23:04,899 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 17:23:04,899 INFO L158 Benchmark]: Toolchain (without parser) took 53201.09ms. Allocated memory was 69.2MB in the beginning and 188.7MB in the end (delta: 119.5MB). Free memory was 39.6MB in the beginning and 110.6MB in the end (delta: -71.0MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. [2024-10-14 17:23:04,900 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 50.3MB. Free memory is still 23.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:23:04,900 INFO L158 Benchmark]: CACSL2BoogieTranslator took 308.68ms. Allocated memory is still 69.2MB. Free memory was 39.4MB in the beginning and 46.1MB in the end (delta: -6.6MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. [2024-10-14 17:23:04,900 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.73ms. Allocated memory is still 69.2MB. Free memory was 46.1MB in the beginning and 44.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 17:23:04,900 INFO L158 Benchmark]: Boogie Preprocessor took 61.88ms. Allocated memory is still 69.2MB. Free memory was 44.4MB in the beginning and 42.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 17:23:04,900 INFO L158 Benchmark]: RCFGBuilder took 500.24ms. Allocated memory is still 69.2MB. Free memory was 41.8MB in the beginning and 43.2MB in the end (delta: -1.4MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2024-10-14 17:23:04,901 INFO L158 Benchmark]: TraceAbstraction took 52230.90ms. Allocated memory was 69.2MB in the beginning and 188.7MB in the end (delta: 119.5MB). Free memory was 42.4MB in the beginning and 112.7MB in the end (delta: -70.3MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. [2024-10-14 17:23:04,901 INFO L158 Benchmark]: Witness Printer took 47.65ms. Allocated memory is still 188.7MB. Free memory was 112.7MB in the beginning and 110.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 17:23:04,902 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 50.3MB. Free memory is still 23.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 308.68ms. Allocated memory is still 69.2MB. Free memory was 39.4MB in the beginning and 46.1MB in the end (delta: -6.6MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.73ms. Allocated memory is still 69.2MB. Free memory was 46.1MB in the beginning and 44.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.88ms. Allocated memory is still 69.2MB. Free memory was 44.4MB in the beginning and 42.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 500.24ms. Allocated memory is still 69.2MB. Free memory was 41.8MB in the beginning and 43.2MB in the end (delta: -1.4MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * TraceAbstraction took 52230.90ms. Allocated memory was 69.2MB in the beginning and 188.7MB in the end (delta: 119.5MB). Free memory was 42.4MB in the beginning and 112.7MB in the end (delta: -70.3MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. * Witness Printer took 47.65ms. Allocated memory is still 188.7MB. Free memory was 112.7MB in the beginning and 110.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 65]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L66] CALL, EXPR nondet_tree() [L24] COND FALSE !(__VERIFIER_nondet_bool()) [L27] struct node *n = (struct node *)malloc(sizeof(struct node)); [L28] n->data = __VERIFIER_nondet_int() [L29] CALL, EXPR nondet_tree() [L24] COND TRUE __VERIFIER_nondet_bool() [L25] return 0; VAL [\result={0:0}] [L29] RET, EXPR nondet_tree() VAL [n={6:0}] [L29] n->left = nondet_tree() [L30] CALL, EXPR nondet_tree() [L24] COND TRUE __VERIFIER_nondet_bool() [L25] return 0; VAL [\result={0:0}] [L30] RET, EXPR nondet_tree() VAL [n={6:0}] [L30] n->right = nondet_tree() [L31] return n; VAL [\result={6:0}] [L66] RET, EXPR nondet_tree() [L66] CALL task(nondet_tree()) [L61] CALL, EXPR max(n) VAL [\old(n)={6:0}] [L36] COND FALSE !(!n) [L39] EXPR n->data [L39] int a = n->data; [L40] EXPR n->left VAL [\old(n)={6:0}, a=-2147483648, n={6:0}] [L40] CALL, EXPR max(n->left) VAL [\old(n)={0:0}] [L36] COND TRUE !n [L37] return -2147483648; VAL [\old(n)={0:0}, \result=-2147483648] [L40] RET, EXPR max(n->left) VAL [\old(n)={6:0}, a=-2147483648, n={6:0}] [L40] int b = max(n->left); [L41] EXPR n->right VAL [\old(n)={6:0}, a=-2147483648, b=-2147483648] [L41] CALL, EXPR max(n->right) VAL [\old(n)={0:0}] [L36] COND TRUE !n [L37] return -2147483648; VAL [\old(n)={0:0}, \result=-2147483648] [L41] RET, EXPR max(n->right) VAL [\old(n)={6:0}, a=-2147483648, b=-2147483648] [L41] int c = max(n->right); [L42] COND TRUE b >= a && b >= c [L42] return b; VAL [\old(n)={6:0}, \result=-2147483648] [L61] RET, EXPR max(n) VAL [n={6:0}] [L61] int a = max(n); [L62] CALL check(n, a) [L49] COND TRUE \read(*n) [L50] EXPR n->data [L50] CALL __VERIFIER_assert(n->data <= a) [L15] COND FALSE !(!cond) [L50] RET __VERIFIER_assert(n->data <= a) [L52] COND FALSE !(__VERIFIER_nondet_bool()) [L55] EXPR n->right VAL [\old(a)=-2147483648, \old(n)={6:0}, a=-2147483648] [L55] CALL check(n->right, a) VAL [\old(a)=-2147483648, \old(n)={0:0}] [L49] COND FALSE !(\read(*n)) [L55] RET check(n->right, a) VAL [\old(a)=-2147483648, \old(n)={6:0}, a=-2147483648] [L62] RET check(n, a) VAL [a=-2147483648, n={6:0}] [L66] RET task(nondet_tree()) - UnprovableResult [Line: 13]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 41 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 52.2s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 34.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 236 SdHoareTripleChecker+Valid, 32.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 205 mSDsluCounter, 3217 SdHoareTripleChecker+Invalid, 32.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2858 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2041 IncrementalHoareTripleChecker+Invalid, 2100 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 359 mSDtfsCounter, 2041 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 536 GetRequests, 420 SyntacticMatches, 2 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163occurred in iteration=8, InterpolantAutomatonStates: 97, 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, 8 MinimizatonAttempts, 60 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 14.7s InterpolantComputationTime, 369 NumberOfCodeBlocks, 369 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 505 ConstructedInterpolants, 46 QuantifiedInterpolants, 3497 SizeOfPredicates, 35 NumberOfNonLiveVariables, 1249 ConjunctsInSsa, 145 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 258/310 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! [2024-10-14 17:23:04,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)