./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test20-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/ldv-memsafety/memleaks_test20-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c03aa9fd4feebd47970076773e3fcb11c7b82646fa9d57d8ea4dde0614545dfa --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:17:27,809 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:17:27,846 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 15:17:27,851 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:17:27,852 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:17:27,875 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:17:27,875 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:17:27,876 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:17:27,876 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:17:27,877 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:17:27,878 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:17:27,878 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:17:27,878 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:17:27,880 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:17:27,880 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:17:27,880 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:17:27,880 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 15:17:27,881 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:17:27,881 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 15:17:27,881 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:17:27,881 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:17:27,883 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:17:27,884 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:17:27,884 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:17:27,884 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:17:27,884 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:17:27,884 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:17:27,884 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 15:17:27,885 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:17:27,885 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:17:27,885 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:17:27,885 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:17:27,885 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:17:27,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:17:27,885 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:17:27,886 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:17:27,886 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 15:17:27,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 15:17:27,886 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:17:27,886 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:17:27,886 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:17:27,887 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:17:27,887 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c03aa9fd4feebd47970076773e3fcb11c7b82646fa9d57d8ea4dde0614545dfa [2024-11-10 15:17:28,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:17:28,065 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:17:28,067 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:17:28,068 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:17:28,068 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:17:28,069 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test20-2.i [2024-11-10 15:17:29,219 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:17:29,420 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:17:29,421 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test20-2.i [2024-11-10 15:17:29,437 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2218ce620/9a6e9e776d5c45cb8b37257a73f7bcee/FLAG4097cf497 [2024-11-10 15:17:29,769 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2218ce620/9a6e9e776d5c45cb8b37257a73f7bcee [2024-11-10 15:17:29,771 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:17:29,772 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:17:29,774 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:17:29,774 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:17:29,778 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:17:29,778 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:17:29" (1/1) ... [2024-11-10 15:17:29,779 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b9024da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:17:29, skipping insertion in model container [2024-11-10 15:17:29,779 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:17:29" (1/1) ... [2024-11-10 15:17:29,856 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:17:30,082 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:17:30,126 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:17:30,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:17:30,146 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-11-10 15:17:30,146 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7eef2cd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:17:30, skipping insertion in model container [2024-11-10 15:17:30,146 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:17:30,146 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-10 15:17:30,148 INFO L158 Benchmark]: Toolchain (without parser) took 375.41ms. Allocated memory is still 155.2MB. Free memory was 83.8MB in the beginning and 111.1MB in the end (delta: -27.3MB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. [2024-11-10 15:17:30,148 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 104.9MB. Free memory was 61.8MB in the beginning and 61.7MB in the end (delta: 117.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 15:17:30,149 INFO L158 Benchmark]: CACSL2BoogieTranslator took 372.61ms. Allocated memory is still 155.2MB. Free memory was 83.7MB in the beginning and 111.1MB in the end (delta: -27.4MB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. [2024-11-10 15:17:30,149 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.14ms. Allocated memory is still 104.9MB. Free memory was 61.8MB in the beginning and 61.7MB in the end (delta: 117.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 372.61ms. Allocated memory is still 155.2MB. Free memory was 83.7MB in the beginning and 111.1MB in the end (delta: -27.4MB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 607]: 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/11.0.12-open/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 ../sv-benchmarks/c/ldv-memsafety/memleaks_test20-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c03aa9fd4feebd47970076773e3fcb11c7b82646fa9d57d8ea4dde0614545dfa --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:17:31,658 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:17:31,720 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-10 15:17:31,725 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:17:31,725 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:17:31,745 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:17:31,747 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:17:31,747 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:17:31,747 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:17:31,748 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:17:31,748 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:17:31,749 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:17:31,749 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:17:31,749 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:17:31,749 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:17:31,751 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:17:31,751 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 15:17:31,751 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:17:31,751 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 15:17:31,752 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:17:31,753 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:17:31,754 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:17:31,755 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:17:31,755 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:17:31,755 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:17:31,755 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 15:17:31,755 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:17:31,755 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 15:17:31,755 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:17:31,755 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 15:17:31,756 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:17:31,756 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:17:31,756 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:17:31,756 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:17:31,756 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:17:31,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:17:31,756 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:17:31,756 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:17:31,757 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 15:17:31,757 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 15:17:31,757 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:17:31,759 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:17:31,759 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:17:31,759 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:17:31,759 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c03aa9fd4feebd47970076773e3fcb11c7b82646fa9d57d8ea4dde0614545dfa [2024-11-10 15:17:31,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:17:32,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:17:32,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:17:32,017 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:17:32,017 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:17:32,018 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test20-2.i [2024-11-10 15:17:33,251 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:17:33,467 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:17:33,467 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test20-2.i [2024-11-10 15:17:33,483 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bc3decfe/aad869726edf48a38a614e1c7a670f64/FLAGc5da553b5 [2024-11-10 15:17:33,807 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bc3decfe/aad869726edf48a38a614e1c7a670f64 [2024-11-10 15:17:33,809 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:17:33,810 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:17:33,814 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:17:33,814 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:17:33,817 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:17:33,818 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:17:33" (1/1) ... [2024-11-10 15:17:33,818 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79c12753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:17:33, skipping insertion in model container [2024-11-10 15:17:33,819 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:17:33" (1/1) ... [2024-11-10 15:17:33,856 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:17:34,132 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:17:34,175 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:17:34,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:17:34,196 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-10 15:17:34,203 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:17:34,219 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:17:34,237 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:17:34,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:17:34,245 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 15:17:34,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:17:34,321 INFO L204 MainTranslator]: Completed translation [2024-11-10 15:17:34,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:17:34 WrapperNode [2024-11-10 15:17:34,322 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:17:34,323 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 15:17:34,323 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 15:17:34,323 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 15:17:34,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:17:34" (1/1) ... [2024-11-10 15:17:34,344 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:17:34" (1/1) ... [2024-11-10 15:17:34,356 INFO L138 Inliner]: procedures = 170, calls = 73, calls flagged for inlining = 25, calls inlined = 7, statements flattened = 37 [2024-11-10 15:17:34,357 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 15:17:34,357 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 15:17:34,357 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 15:17:34,357 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 15:17:34,364 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:17:34" (1/1) ... [2024-11-10 15:17:34,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:17:34" (1/1) ... [2024-11-10 15:17:34,366 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:17:34" (1/1) ... [2024-11-10 15:17:34,386 INFO L175 MemorySlicer]: Split 2 memory accesses to 2 slices as follows [2, 0]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 0 writes are split as follows [0, 0]. [2024-11-10 15:17:34,386 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:17:34" (1/1) ... [2024-11-10 15:17:34,386 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:17:34" (1/1) ... [2024-11-10 15:17:34,394 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:17:34" (1/1) ... [2024-11-10 15:17:34,394 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:17:34" (1/1) ... [2024-11-10 15:17:34,395 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:17:34" (1/1) ... [2024-11-10 15:17:34,396 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:17:34" (1/1) ... [2024-11-10 15:17:34,397 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 15:17:34,398 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 15:17:34,398 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 15:17:34,398 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 15:17:34,399 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:17:34" (1/1) ... [2024-11-10 15:17:34,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:17:34,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:17:34,424 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-11-10 15:17:34,427 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-11-10 15:17:34,455 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-10 15:17:34,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-10 15:17:34,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 15:17:34,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 15:17:34,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 15:17:34,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-10 15:17:34,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-10 15:17:34,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 15:17:34,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 15:17:34,544 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 15:17:34,545 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 15:17:34,585 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L527: havoc #t~malloc12.base, #t~malloc12.offset; [2024-11-10 15:17:34,669 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-10 15:17:34,670 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 15:17:34,681 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 15:17:34,682 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 15:17:34,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:17:34 BoogieIcfgContainer [2024-11-10 15:17:34,683 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 15:17:34,684 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 15:17:34,684 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 15:17:34,687 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 15:17:34,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:17:33" (1/3) ... [2024-11-10 15:17:34,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79c75d64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:17:34, skipping insertion in model container [2024-11-10 15:17:34,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:17:34" (2/3) ... [2024-11-10 15:17:34,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79c75d64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:17:34, skipping insertion in model container [2024-11-10 15:17:34,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:17:34" (3/3) ... [2024-11-10 15:17:34,690 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test20-2.i [2024-11-10 15:17:34,702 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 15:17:34,702 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-10 15:17:34,731 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 15:17:34,735 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;@4a50618a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 15:17:34,735 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-10 15:17:34,738 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 25 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:17:34,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 15:17:34,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:17:34,746 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:17:34,746 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2024-11-10 15:17:34,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:17:34,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1593132747, now seen corresponding path program 1 times [2024-11-10 15:17:34,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:17:34,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1993539277] [2024-11-10 15:17:34,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:17:34,758 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-11-10 15:17:34,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:17:34,760 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-11-10 15:17:34,761 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-11-10 15:17:34,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:17:34,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 15:17:34,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:17:34,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:17:34,906 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:17:34,906 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:17:34,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1993539277] [2024-11-10 15:17:34,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1993539277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:17:34,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:17:34,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:17:34,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101783500] [2024-11-10 15:17:34,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:17:34,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:17:34,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:17:34,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:17:34,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:17:34,936 INFO L87 Difference]: Start difference. First operand has 28 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 25 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:17:34,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:17:34,966 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2024-11-10 15:17:34,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:17:34,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-10 15:17:34,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:17:34,975 INFO L225 Difference]: With dead ends: 32 [2024-11-10 15:17:34,976 INFO L226 Difference]: Without dead ends: 29 [2024-11-10 15:17:34,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:17:34,981 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:17:34,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:17:34,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-10 15:17:35,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-10 15:17:35,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 25 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:17:35,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2024-11-10 15:17:35,006 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 13 [2024-11-10 15:17:35,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:17:35,006 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2024-11-10 15:17:35,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:17:35,006 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2024-11-10 15:17:35,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 15:17:35,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:17:35,007 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:17:35,010 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-11-10 15:17:35,207 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-11-10 15:17:35,208 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2024-11-10 15:17:35,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:17:35,209 INFO L85 PathProgramCache]: Analyzing trace with hash 894380086, now seen corresponding path program 1 times [2024-11-10 15:17:35,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:17:35,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1221271431] [2024-11-10 15:17:35,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:17:35,209 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-11-10 15:17:35,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:17:35,211 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-11-10 15:17:35,212 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-11-10 15:17:35,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:17:35,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 15:17:35,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:17:35,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:17:35,397 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:17:35,397 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:17:35,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1221271431] [2024-11-10 15:17:35,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1221271431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:17:35,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:17:35,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:17:35,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559109401] [2024-11-10 15:17:35,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:17:35,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:17:35,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:17:35,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:17:35,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:17:35,404 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:17:35,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:17:35,450 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2024-11-10 15:17:35,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:17:35,451 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-10 15:17:35,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:17:35,452 INFO L225 Difference]: With dead ends: 33 [2024-11-10 15:17:35,452 INFO L226 Difference]: Without dead ends: 33 [2024-11-10 15:17:35,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:17:35,453 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 7 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:17:35,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 81 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:17:35,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-10 15:17:35,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2024-11-10 15:17:35,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:17:35,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2024-11-10 15:17:35,459 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 13 [2024-11-10 15:17:35,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:17:35,467 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2024-11-10 15:17:35,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:17:35,467 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2024-11-10 15:17:35,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-10 15:17:35,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:17:35,468 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:17:35,471 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-11-10 15:17:35,669 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-11-10 15:17:35,670 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2024-11-10 15:17:35,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:17:35,671 INFO L85 PathProgramCache]: Analyzing trace with hash 2124848317, now seen corresponding path program 1 times [2024-11-10 15:17:35,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:17:35,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1023664100] [2024-11-10 15:17:35,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:17:35,671 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-11-10 15:17:35,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:17:35,673 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-11-10 15:17:35,674 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-11-10 15:17:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:17:35,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 15:17:35,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:17:35,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:17:35,788 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:17:35,789 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:17:35,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1023664100] [2024-11-10 15:17:35,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1023664100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:17:35,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:17:35,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 15:17:35,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605281973] [2024-11-10 15:17:35,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:17:35,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 15:17:35,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:17:35,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 15:17:35,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:17:35,790 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:17:35,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:17:35,876 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2024-11-10 15:17:35,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 15:17:35,877 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-10 15:17:35,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:17:35,877 INFO L225 Difference]: With dead ends: 32 [2024-11-10 15:17:35,877 INFO L226 Difference]: Without dead ends: 32 [2024-11-10 15:17:35,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-10 15:17:35,879 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 9 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:17:35,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 147 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:17:35,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-10 15:17:35,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2024-11-10 15:17:35,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.16) internal successors, (29), 27 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:17:35,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2024-11-10 15:17:35,888 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 14 [2024-11-10 15:17:35,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:17:35,888 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2024-11-10 15:17:35,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:17:35,888 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2024-11-10 15:17:35,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-10 15:17:35,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:17:35,888 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:17:35,893 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-11-10 15:17:36,089 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-11-10 15:17:36,089 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2024-11-10 15:17:36,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:17:36,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1445788371, now seen corresponding path program 1 times [2024-11-10 15:17:36,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:17:36,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [512372087] [2024-11-10 15:17:36,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:17:36,090 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-11-10 15:17:36,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:17:36,093 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-11-10 15:17:36,094 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-11-10 15:17:36,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:17:36,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 15:17:36,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:17:36,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:17:36,275 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:17:36,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:17:36,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [512372087] [2024-11-10 15:17:36,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [512372087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:17:36,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:17:36,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 15:17:36,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893988886] [2024-11-10 15:17:36,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:17:36,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:17:36,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:17:36,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:17:36,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:17:36,277 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:17:36,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:17:36,438 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2024-11-10 15:17:36,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:17:36,439 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-10 15:17:36,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:17:36,439 INFO L225 Difference]: With dead ends: 41 [2024-11-10 15:17:36,439 INFO L226 Difference]: Without dead ends: 41 [2024-11-10 15:17:36,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-10 15:17:36,440 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 33 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:17:36,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 108 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:17:36,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-10 15:17:36,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2024-11-10 15:17:36,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 33 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:17:36,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2024-11-10 15:17:36,447 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 15 [2024-11-10 15:17:36,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:17:36,447 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2024-11-10 15:17:36,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:17:36,447 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2024-11-10 15:17:36,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-10 15:17:36,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:17:36,448 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:17:36,451 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-11-10 15:17:36,648 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-11-10 15:17:36,649 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2024-11-10 15:17:36,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:17:36,649 INFO L85 PathProgramCache]: Analyzing trace with hash -351162988, now seen corresponding path program 1 times [2024-11-10 15:17:36,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:17:36,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1188343024] [2024-11-10 15:17:36,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:17:36,650 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-11-10 15:17:36,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:17:36,652 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-11-10 15:17:36,652 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-11-10 15:17:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:17:36,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 15:17:36,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:17:36,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:17:36,715 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:17:36,715 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:17:36,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1188343024] [2024-11-10 15:17:36,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1188343024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:17:36,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:17:36,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:17:36,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190657477] [2024-11-10 15:17:36,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:17:36,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:17:36,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:17:36,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:17:36,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:17:36,717 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:17:36,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:17:36,730 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2024-11-10 15:17:36,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:17:36,734 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-10 15:17:36,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:17:36,734 INFO L225 Difference]: With dead ends: 30 [2024-11-10 15:17:36,734 INFO L226 Difference]: Without dead ends: 30 [2024-11-10 15:17:36,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:17:36,735 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:17:36,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:17:36,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-10 15:17:36,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-10 15:17:36,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:17:36,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2024-11-10 15:17:36,741 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 15 [2024-11-10 15:17:36,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:17:36,741 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2024-11-10 15:17:36,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:17:36,741 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2024-11-10 15:17:36,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-10 15:17:36,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:17:36,742 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:17:36,745 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 (6)] Ended with exit code 0 [2024-11-10 15:17:36,944 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-11-10 15:17:36,945 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2024-11-10 15:17:36,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:17:36,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1869766523, now seen corresponding path program 1 times [2024-11-10 15:17:36,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:17:36,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1450565677] [2024-11-10 15:17:36,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:17:36,946 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-11-10 15:17:36,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:17:36,948 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-11-10 15:17:36,949 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-11-10 15:17:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:17:36,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 15:17:36,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:17:37,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-11-10 15:17:37,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:17:37,059 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:17:37,060 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:17:37,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1450565677] [2024-11-10 15:17:37,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1450565677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:17:37,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:17:37,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 15:17:37,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268342045] [2024-11-10 15:17:37,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:17:37,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 15:17:37,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:17:37,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 15:17:37,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:17:37,061 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:17:37,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:17:37,142 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2024-11-10 15:17:37,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 15:17:37,143 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-10 15:17:37,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:17:37,144 INFO L225 Difference]: With dead ends: 29 [2024-11-10 15:17:37,144 INFO L226 Difference]: Without dead ends: 29 [2024-11-10 15:17:37,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-10 15:17:37,144 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 7 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:17:37,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 93 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:17:37,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-10 15:17:37,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-10 15:17:37,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:17:37,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2024-11-10 15:17:37,147 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 16 [2024-11-10 15:17:37,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:17:37,147 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2024-11-10 15:17:37,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:17:37,147 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2024-11-10 15:17:37,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-10 15:17:37,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:17:37,152 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:17:37,157 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-11-10 15:17:37,353 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-11-10 15:17:37,353 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2024-11-10 15:17:37,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:17:37,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1499238470, now seen corresponding path program 1 times [2024-11-10 15:17:37,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:17:37,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1604463835] [2024-11-10 15:17:37,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:17:37,354 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-11-10 15:17:37,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:17:37,355 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-11-10 15:17:37,356 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-11-10 15:17:37,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:17:37,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 15:17:37,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:17:37,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:17:37,402 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:17:37,402 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:17:37,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1604463835] [2024-11-10 15:17:37,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1604463835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:17:37,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:17:37,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:17:37,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063392233] [2024-11-10 15:17:37,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:17:37,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:17:37,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:17:37,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:17:37,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:17:37,404 INFO L87 Difference]: Start difference. First operand 29 states and 29 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:17:37,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:17:37,418 INFO L93 Difference]: Finished difference Result 33 states and 32 transitions. [2024-11-10 15:17:37,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:17:37,418 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-10 15:17:37,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:17:37,419 INFO L225 Difference]: With dead ends: 33 [2024-11-10 15:17:37,419 INFO L226 Difference]: Without dead ends: 22 [2024-11-10 15:17:37,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 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-11-10 15:17:37,420 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:17:37,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:17:37,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-10 15:17:37,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-10 15:17:37,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 19 states have (on average 1.0) internal successors, (19), 19 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:17:37,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 21 transitions. [2024-11-10 15:17:37,422 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 21 transitions. Word has length 16 [2024-11-10 15:17:37,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:17:37,422 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 21 transitions. [2024-11-10 15:17:37,422 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:17:37,422 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 21 transitions. [2024-11-10 15:17:37,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-10 15:17:37,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:17:37,422 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, 1] [2024-11-10 15:17:37,429 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-11-10 15:17:37,623 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-11-10 15:17:37,623 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2024-11-10 15:17:37,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:17:37,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1426058703, now seen corresponding path program 1 times [2024-11-10 15:17:37,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:17:37,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [504392835] [2024-11-10 15:17:37,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:17:37,624 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-11-10 15:17:37,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:17:37,638 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-11-10 15:17:37,652 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-11-10 15:17:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:17:37,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 15:17:37,689 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:17:37,842 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_free_20_~p~1#1.base_10| (_ BitVec 32))) (and (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_free_20_~p~1#1.base_10| (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_free_20_~p~1#1.base_10|)))) is different from true [2024-11-10 15:17:37,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:17:37,870 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:17:37,870 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:17:37,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [504392835] [2024-11-10 15:17:37,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [504392835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:17:37,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:17:37,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 15:17:37,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901984323] [2024-11-10 15:17:37,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:17:37,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 15:17:37,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:17:37,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 15:17:37,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=92, Unknown=1, NotChecked=18, Total=132 [2024-11-10 15:17:37,871 INFO L87 Difference]: Start difference. First operand 22 states and 21 transitions. Second operand has 12 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:17:38,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:17:38,043 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2024-11-10 15:17:38,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 15:17:38,044 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-11-10 15:17:38,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:17:38,044 INFO L225 Difference]: With dead ends: 21 [2024-11-10 15:17:38,044 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 15:17:38,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=202, Unknown=1, NotChecked=28, Total=272 [2024-11-10 15:17:38,045 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:17:38,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 62 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 16 Unchecked, 0.1s Time] [2024-11-10 15:17:38,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 15:17:38,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 15:17:38,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:17:38,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 15:17:38,045 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2024-11-10 15:17:38,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:17:38,045 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 15:17:38,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:17:38,046 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 15:17:38,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 15:17:38,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 4 remaining) [2024-11-10 15:17:38,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (2 of 4 remaining) [2024-11-10 15:17:38,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (1 of 4 remaining) [2024-11-10 15:17:38,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (0 of 4 remaining) [2024-11-10 15:17:38,052 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-11-10 15:17:38,251 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-11-10 15:17:38,253 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:17:38,255 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 15:17:38,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:17:38 BoogieIcfgContainer [2024-11-10 15:17:38,257 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 15:17:38,257 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 15:17:38,257 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 15:17:38,257 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 15:17:38,264 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:17:34" (3/4) ... [2024-11-10 15:17:38,266 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 15:17:38,269 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2024-11-10 15:17:38,273 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-11-10 15:17:38,273 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-10 15:17:38,273 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 15:17:38,339 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 15:17:38,340 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 15:17:38,340 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 15:17:38,340 INFO L158 Benchmark]: Toolchain (without parser) took 4530.87ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 42.7MB in the beginning and 68.2MB in the end (delta: -25.5MB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. [2024-11-10 15:17:38,341 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 48.2MB. Free memory was 24.7MB in the beginning and 24.6MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 15:17:38,341 INFO L158 Benchmark]: CACSL2BoogieTranslator took 508.66ms. Allocated memory is still 79.7MB. Free memory was 42.4MB in the beginning and 35.8MB in the end (delta: 6.6MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2024-11-10 15:17:38,341 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.87ms. Allocated memory is still 79.7MB. Free memory was 35.8MB in the beginning and 33.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 15:17:38,341 INFO L158 Benchmark]: Boogie Preprocessor took 40.24ms. Allocated memory is still 79.7MB. Free memory was 33.5MB in the beginning and 57.2MB in the end (delta: -23.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 15:17:38,342 INFO L158 Benchmark]: IcfgBuilder took 285.11ms. Allocated memory is still 79.7MB. Free memory was 57.2MB in the beginning and 43.3MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 15:17:38,342 INFO L158 Benchmark]: TraceAbstraction took 3572.77ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 43.0MB in the beginning and 25.1MB in the end (delta: 17.9MB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB. [2024-11-10 15:17:38,342 INFO L158 Benchmark]: Witness Printer took 83.03ms. Allocated memory is still 96.5MB. Free memory was 25.1MB in the beginning and 68.2MB in the end (delta: -43.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 15:17:38,343 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.11ms. Allocated memory is still 48.2MB. Free memory was 24.7MB in the beginning and 24.6MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 508.66ms. Allocated memory is still 79.7MB. Free memory was 42.4MB in the beginning and 35.8MB in the end (delta: 6.6MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.87ms. Allocated memory is still 79.7MB. Free memory was 35.8MB in the beginning and 33.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.24ms. Allocated memory is still 79.7MB. Free memory was 33.5MB in the beginning and 57.2MB in the end (delta: -23.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 285.11ms. Allocated memory is still 79.7MB. Free memory was 57.2MB in the beginning and 43.3MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3572.77ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 43.0MB in the beginning and 25.1MB in the end (delta: 17.9MB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB. * Witness Printer took 83.03ms. Allocated memory is still 96.5MB. Free memory was 25.1MB in the beginning and 68.2MB in the end (delta: -43.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 - PositiveResult [Line: 789]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 781]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 781]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 781]: free always succeeds For all program executions holds that free always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 65 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 65 mSDsluCounter, 745 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 16 IncrementalHoareTripleChecker+Unchecked, 574 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 455 IncrementalHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 171 mSDtfsCounter, 455 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=4, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 123 NumberOfCodeBlocks, 123 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 115 ConstructedInterpolants, 4 QuantifiedInterpolants, 617 SizeOfPredicates, 6 NumberOfNonLiveVariables, 397 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-10 15:17:38,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE