./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 c7c6ca5d 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-?-c7c6ca5-m [2024-11-09 07:51:41,952 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:51:42,034 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 07:51:42,041 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:51:42,042 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:51:42,075 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:51:42,076 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:51:42,076 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:51:42,077 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:51:42,078 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:51:42,079 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:51:42,079 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:51:42,080 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:51:42,081 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:51:42,081 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:51:42,082 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:51:42,082 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:51:42,082 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:51:42,082 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:51:42,083 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:51:42,083 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:51:42,086 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:51:42,087 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:51:42,087 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:51:42,087 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:51:42,087 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:51:42,088 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:51:42,088 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:51:42,088 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:51:42,088 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:51:42,088 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:51:42,089 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:51:42,089 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:51:42,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:51:42,089 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:51:42,089 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:51:42,090 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:51:42,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:51:42,090 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:51:42,090 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:51:42,090 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:51:42,091 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:51:42,092 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-09 07:51:42,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:51:42,352 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:51:42,356 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:51:42,357 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:51:42,358 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:51:42,360 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-09 07:51:43,797 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:51:44,042 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:51:44,044 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test20-2.i [2024-11-09 07:51:44,064 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba588d0d3/168b67fa6e0c4a3badb4328062b431fb/FLAG72b7b2d4e [2024-11-09 07:51:44,078 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba588d0d3/168b67fa6e0c4a3badb4328062b431fb [2024-11-09 07:51:44,080 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:51:44,081 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:51:44,084 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:51:44,084 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:51:44,091 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:51:44,091 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:51:44" (1/1) ... [2024-11-09 07:51:44,092 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@698e637a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:51:44, skipping insertion in model container [2024-11-09 07:51:44,092 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:51:44" (1/1) ... [2024-11-09 07:51:44,139 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:51:44,492 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:51:44,545 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:51:44,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:51:44,570 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-09 07:51:44,571 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@77faaa98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:51:44, skipping insertion in model container [2024-11-09 07:51:44,571 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:51:44,571 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-09 07:51:44,573 INFO L158 Benchmark]: Toolchain (without parser) took 490.62ms. Allocated memory is still 138.4MB. Free memory was 65.3MB in the beginning and 49.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 07:51:44,574 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 138.4MB. Free memory is still 101.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:51:44,574 INFO L158 Benchmark]: CACSL2BoogieTranslator took 487.38ms. Allocated memory is still 138.4MB. Free memory was 65.3MB in the beginning and 49.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 07:51:44,576 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.23ms. Allocated memory is still 138.4MB. Free memory is still 101.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 487.38ms. Allocated memory is still 138.4MB. Free memory was 65.3MB in the beginning and 49.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.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-?-c7c6ca5-m [2024-11-09 07:51:46,612 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:51:46,688 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 07:51:46,696 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:51:46,696 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:51:46,731 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:51:46,732 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:51:46,732 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:51:46,733 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:51:46,737 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:51:46,738 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:51:46,738 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:51:46,739 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:51:46,739 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:51:46,740 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:51:46,740 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:51:46,740 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:51:46,741 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:51:46,741 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:51:46,744 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:51:46,744 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:51:46,747 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:51:46,748 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:51:46,748 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:51:46,749 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:51:46,749 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 07:51:46,749 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:51:46,750 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 07:51:46,750 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:51:46,750 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:51:46,750 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:51:46,752 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:51:46,752 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:51:46,752 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:51:46,752 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:51:46,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:51:46,754 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:51:46,754 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:51:46,755 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 07:51:46,755 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 07:51:46,755 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:51:46,755 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:51:46,756 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:51:46,756 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:51:46,756 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-09 07:51:47,117 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:51:47,147 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:51:47,150 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:51:47,151 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:51:47,152 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:51:47,153 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-09 07:51:48,723 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:51:49,020 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:51:49,021 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test20-2.i [2024-11-09 07:51:49,043 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbeb1cca8/6d1785216f434708b127bd7fa1c7fce3/FLAGff92ee03e [2024-11-09 07:51:49,063 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbeb1cca8/6d1785216f434708b127bd7fa1c7fce3 [2024-11-09 07:51:49,066 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:51:49,067 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:51:49,070 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:51:49,071 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:51:49,078 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:51:49,080 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:51:49" (1/1) ... [2024-11-09 07:51:49,081 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a352852 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:51:49, skipping insertion in model container [2024-11-09 07:51:49,082 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:51:49" (1/1) ... [2024-11-09 07:51:49,140 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:51:49,486 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:51:49,558 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:51:49,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:51:49,599 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-09 07:51:49,607 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:51:49,631 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:51:49,656 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:51:49,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:51:49,672 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:51:49,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:51:49,782 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:51:49,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:51:49 WrapperNode [2024-11-09 07:51:49,783 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:51:49,784 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:51:49,784 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:51:49,784 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:51:49,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:51:49" (1/1) ... [2024-11-09 07:51:49,833 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:51:49" (1/1) ... [2024-11-09 07:51:49,859 INFO L138 Inliner]: procedures = 170, calls = 73, calls flagged for inlining = 25, calls inlined = 7, statements flattened = 37 [2024-11-09 07:51:49,859 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:51:49,860 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:51:49,860 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:51:49,860 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:51:49,872 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:51:49" (1/1) ... [2024-11-09 07:51:49,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:51:49" (1/1) ... [2024-11-09 07:51:49,877 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:51:49" (1/1) ... [2024-11-09 07:51:49,904 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-09 07:51:49,905 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:51:49" (1/1) ... [2024-11-09 07:51:49,905 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:51:49" (1/1) ... [2024-11-09 07:51:49,915 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:51:49" (1/1) ... [2024-11-09 07:51:49,917 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:51:49" (1/1) ... [2024-11-09 07:51:49,918 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:51:49" (1/1) ... [2024-11-09 07:51:49,927 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:51:49" (1/1) ... [2024-11-09 07:51:49,931 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:51:49,932 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:51:49,932 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:51:49,932 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:51:49,933 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:51:49" (1/1) ... [2024-11-09 07:51:49,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:51:49,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:51:49,985 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-09 07:51:49,989 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-09 07:51:50,045 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-09 07:51:50,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-09 07:51:50,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:51:50,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:51:50,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:51:50,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 07:51:50,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 07:51:50,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:51:50,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:51:50,182 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:51:50,184 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:51:50,349 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-09 07:51:50,349 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:51:50,362 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:51:50,362 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 07:51:50,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:51:50 BoogieIcfgContainer [2024-11-09 07:51:50,362 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:51:50,364 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:51:50,364 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:51:50,367 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:51:50,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:51:49" (1/3) ... [2024-11-09 07:51:50,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2160df2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:51:50, skipping insertion in model container [2024-11-09 07:51:50,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:51:49" (2/3) ... [2024-11-09 07:51:50,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2160df2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:51:50, skipping insertion in model container [2024-11-09 07:51:50,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:51:50" (3/3) ... [2024-11-09 07:51:50,370 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test20-2.i [2024-11-09 07:51:50,385 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:51:50,385 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-09 07:51:50,433 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:51:50,439 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;@4a3ccb32, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:51:50,439 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-09 07:51:50,444 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 22 states have internal predecessors, (25), 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-09 07:51:50,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 07:51:50,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:51:50,453 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:51:50,453 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2024-11-09 07:51:50,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:51:50,461 INFO L85 PathProgramCache]: Analyzing trace with hash 320838968, now seen corresponding path program 1 times [2024-11-09 07:51:50,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:51:50,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2013495255] [2024-11-09 07:51:50,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:51:50,476 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-09 07:51:50,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:51:50,480 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-09 07:51:50,481 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-09 07:51:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:51:50,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:51:50,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:51:50,697 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-09 07:51:50,697 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:51:50,698 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:51:50,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2013495255] [2024-11-09 07:51:50,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2013495255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:51:50,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:51:50,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:51:50,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494423281] [2024-11-09 07:51:50,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:51:50,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:51:50,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:51:50,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:51:50,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:51:50,763 INFO L87 Difference]: Start difference. First operand has 25 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 22 states have internal predecessors, (25), 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-09 07:51:50,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:51:50,808 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2024-11-09 07:51:50,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:51:50,811 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-09 07:51:50,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:51:50,818 INFO L225 Difference]: With dead ends: 29 [2024-11-09 07:51:50,818 INFO L226 Difference]: Without dead ends: 27 [2024-11-09 07:51:50,820 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-09 07:51:50,824 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 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-09 07:51:50,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:51:50,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-09 07:51:50,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-09 07:51:50,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.3) internal successors, (26), 23 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-09 07:51:50,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2024-11-09 07:51:50,865 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 13 [2024-11-09 07:51:50,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:51:50,865 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2024-11-09 07:51:50,866 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-09 07:51:50,866 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2024-11-09 07:51:50,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 07:51:50,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:51:50,867 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:51:50,872 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-09 07:51:51,069 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-09 07:51:51,069 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2024-11-09 07:51:51,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:51:51,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1486615495, now seen corresponding path program 1 times [2024-11-09 07:51:51,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:51:51,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1697826166] [2024-11-09 07:51:51,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:51:51,071 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-09 07:51:51,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:51:51,075 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-09 07:51:51,076 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-09 07:51:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:51:51,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 07:51:51,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:51:51,327 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-09 07:51:51,327 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:51:51,327 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:51:51,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1697826166] [2024-11-09 07:51:51,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1697826166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:51:51,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:51:51,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:51:51,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860856502] [2024-11-09 07:51:51,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:51:51,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:51:51,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:51:51,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:51:51,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:51:51,330 INFO L87 Difference]: Start difference. First operand 27 states and 29 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-09 07:51:51,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:51:51,395 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2024-11-09 07:51:51,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:51:51,397 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-09 07:51:51,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:51:51,398 INFO L225 Difference]: With dead ends: 31 [2024-11-09 07:51:51,398 INFO L226 Difference]: Without dead ends: 31 [2024-11-09 07:51:51,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:51:51,400 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 74 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-09 07:51:51,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 74 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:51:51,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-09 07:51:51,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2024-11-09 07:51:51,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 26 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-09 07:51:51,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2024-11-09 07:51:51,410 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 13 [2024-11-09 07:51:51,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:51:51,411 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2024-11-09 07:51:51,411 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-09 07:51:51,411 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2024-11-09 07:51:51,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 07:51:51,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:51:51,412 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:51:51,418 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-09 07:51:51,616 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-09 07:51:51,616 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2024-11-09 07:51:51,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:51:51,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1237800257, now seen corresponding path program 1 times [2024-11-09 07:51:51,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:51:51,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1997408292] [2024-11-09 07:51:51,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:51:51,618 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-09 07:51:51,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:51:51,621 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-09 07:51:51,624 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-09 07:51:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:51:51,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 07:51:51,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:51:51,774 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-09 07:51:51,774 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:51:51,775 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:51:51,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1997408292] [2024-11-09 07:51:51,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1997408292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:51:51,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:51:51,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:51:51,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345233403] [2024-11-09 07:51:51,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:51:51,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:51:51,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:51:51,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:51:51,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:51:51,780 INFO L87 Difference]: Start difference. First operand 30 states and 32 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-09 07:51:51,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:51:51,888 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2024-11-09 07:51:51,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:51:51,889 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-09 07:51:51,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:51:51,889 INFO L225 Difference]: With dead ends: 30 [2024-11-09 07:51:51,890 INFO L226 Difference]: Without dead ends: 30 [2024-11-09 07:51:51,890 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-09 07:51:51,891 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 8 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 132 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-09 07:51:51,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 132 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:51:51,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-09 07:51:51,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2024-11-09 07:51:51,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.173913043478261) internal successors, (27), 25 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-09 07:51:51,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2024-11-09 07:51:51,897 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 14 [2024-11-09 07:51:51,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:51:51,898 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2024-11-09 07:51:51,898 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-09 07:51:51,899 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2024-11-09 07:51:51,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 07:51:51,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:51:51,900 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:51:51,904 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-09 07:51:52,101 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-09 07:51:52,102 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2024-11-09 07:51:52,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:51:52,102 INFO L85 PathProgramCache]: Analyzing trace with hash -282897639, now seen corresponding path program 1 times [2024-11-09 07:51:52,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:51:52,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [576730980] [2024-11-09 07:51:52,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:51:52,103 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-09 07:51:52,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:51:52,107 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-09 07:51:52,108 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-09 07:51:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:51:52,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 07:51:52,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:51:52,338 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-09 07:51:52,339 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:51:52,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:51:52,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [576730980] [2024-11-09 07:51:52,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [576730980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:51:52,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:51:52,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:51:52,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539993984] [2024-11-09 07:51:52,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:51:52,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:51:52,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:51:52,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:51:52,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:51:52,342 INFO L87 Difference]: Start difference. First operand 29 states and 30 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-09 07:51:52,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:51:52,565 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2024-11-09 07:51:52,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:51:52,566 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-09 07:51:52,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:51:52,567 INFO L225 Difference]: With dead ends: 38 [2024-11-09 07:51:52,567 INFO L226 Difference]: Without dead ends: 38 [2024-11-09 07:51:52,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:51:52,569 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 30 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:51:52,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 99 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:51:52,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-09 07:51:52,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2024-11-09 07:51:52,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 31 states have internal predecessors, (33), 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-09 07:51:52,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2024-11-09 07:51:52,578 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 15 [2024-11-09 07:51:52,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:51:52,578 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2024-11-09 07:51:52,578 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-09 07:51:52,579 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2024-11-09 07:51:52,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 07:51:52,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:51:52,579 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:51:52,583 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 (5)] Forceful destruction successful, exit code 0 [2024-11-09 07:51:52,781 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-09 07:51:52,781 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2024-11-09 07:51:52,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:51:52,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1586867004, now seen corresponding path program 1 times [2024-11-09 07:51:52,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:51:52,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [226686423] [2024-11-09 07:51:52,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:51:52,782 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-09 07:51:52,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:51:52,785 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-09 07:51:52,786 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-09 07:51:52,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:51:52,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:51:52,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:51:52,861 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-09 07:51:52,861 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:51:52,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:51:52,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [226686423] [2024-11-09 07:51:52,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [226686423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:51:52,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:51:52,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:51:52,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101565480] [2024-11-09 07:51:52,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:51:52,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:51:52,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:51:52,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:51:52,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:51:52,864 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) 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-09 07:51:52,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:51:52,892 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2024-11-09 07:51:52,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:51:52,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) 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-09 07:51:52,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:51:52,893 INFO L225 Difference]: With dead ends: 40 [2024-11-09 07:51:52,893 INFO L226 Difference]: Without dead ends: 34 [2024-11-09 07:51:52,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 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-09 07:51:52,894 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 7 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:51:52,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 65 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:51:52,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-09 07:51:52,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2024-11-09 07:51:52,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 28 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-09 07:51:52,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2024-11-09 07:51:52,899 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 15 [2024-11-09 07:51:52,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:51:52,900 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2024-11-09 07:51:52,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) 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-09 07:51:52,900 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2024-11-09 07:51:52,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 07:51:52,901 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:51:52,901 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:51:52,905 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-09 07:51:53,101 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-09 07:51:53,102 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2024-11-09 07:51:53,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:51:53,103 INFO L85 PathProgramCache]: Analyzing trace with hash -2079848998, now seen corresponding path program 1 times [2024-11-09 07:51:53,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:51:53,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [430447993] [2024-11-09 07:51:53,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:51:53,103 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-09 07:51:53,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:51:53,106 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-09 07:51:53,108 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-09 07:51:53,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:51:53,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 07:51:53,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:51:53,207 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-09 07:51:53,211 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:51:53,212 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:51:53,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [430447993] [2024-11-09 07:51:53,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [430447993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:51:53,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:51:53,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:51:53,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560222263] [2024-11-09 07:51:53,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:51:53,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:51:53,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:51:53,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:51:53,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:51:53,215 INFO L87 Difference]: Start difference. First operand 32 states and 32 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-09 07:51:53,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:51:53,232 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2024-11-09 07:51:53,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:51:53,232 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-09 07:51:53,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:51:53,233 INFO L225 Difference]: With dead ends: 25 [2024-11-09 07:51:53,233 INFO L226 Difference]: Without dead ends: 21 [2024-11-09 07:51:53,234 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-09 07:51:53,234 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:51:53,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:51:53,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-09 07:51:53,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-09 07:51:53,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 18 states have internal predecessors, (18), 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-09 07:51:53,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 20 transitions. [2024-11-09 07:51:53,238 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 20 transitions. Word has length 15 [2024-11-09 07:51:53,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:51:53,238 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 20 transitions. [2024-11-09 07:51:53,238 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-09 07:51:53,238 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2024-11-09 07:51:53,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 07:51:53,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:51:53,239 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:51:53,243 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-09 07:51:53,440 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-09 07:51:53,440 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2024-11-09 07:51:53,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:51:53,441 INFO L85 PathProgramCache]: Analyzing trace with hash -179892157, now seen corresponding path program 1 times [2024-11-09 07:51:53,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:51:53,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [863139282] [2024-11-09 07:51:53,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:51:53,441 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-09 07:51:53,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:51:53,443 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-09 07:51:53,444 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-09 07:51:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:51:53,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 07:51:53,505 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:51:53,539 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-09 07:51:53,618 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-09 07:51:53,618 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:51:53,619 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:51:53,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [863139282] [2024-11-09 07:51:53,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [863139282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:51:53,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:51:53,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:51:53,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194943527] [2024-11-09 07:51:53,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:51:53,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:51:53,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:51:53,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:51:53,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:51:53,621 INFO L87 Difference]: Start difference. First operand 21 states and 20 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-09 07:51:53,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:51:53,741 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2024-11-09 07:51:53,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:51:53,741 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-09 07:51:53,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:51:53,742 INFO L225 Difference]: With dead ends: 20 [2024-11-09 07:51:53,742 INFO L226 Difference]: Without dead ends: 20 [2024-11-09 07:51:53,742 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-09 07:51:53,743 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 5 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:51:53,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 54 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:51:53,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-09 07:51:53,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-09 07:51:53,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 17 states have (on average 1.0) internal successors, (17), 17 states have internal predecessors, (17), 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-09 07:51:53,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 19 transitions. [2024-11-09 07:51:53,746 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 19 transitions. Word has length 16 [2024-11-09 07:51:53,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:51:53,746 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 19 transitions. [2024-11-09 07:51:53,746 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-09 07:51:53,746 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions. [2024-11-09 07:51:53,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 07:51:53,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:51:53,747 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:51:53,752 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-09 07:51:53,947 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-09 07:51:53,948 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2024-11-09 07:51:53,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:51:53,949 INFO L85 PathProgramCache]: Analyzing trace with hash 951999840, now seen corresponding path program 1 times [2024-11-09 07:51:53,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:51:53,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [455375944] [2024-11-09 07:51:53,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:51:53,949 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-09 07:51:53,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:51:53,952 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-09 07:51:53,954 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-09 07:51:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:51:54,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 07:51:54,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:51:54,234 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_free_20_~p~1#1.base_9| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_free_20_~p~1#1.base_9|)) (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_free_20_~p~1#1.base_9| (_ bv0 1))))) is different from true [2024-11-09 07:51:54,251 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-09 07:51:54,252 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:51:54,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:51:54,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [455375944] [2024-11-09 07:51:54,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [455375944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:51:54,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:51:54,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 07:51:54,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797277271] [2024-11-09 07:51:54,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:51:54,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:51:54,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:51:54,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:51:54,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=92, Unknown=1, NotChecked=18, Total=132 [2024-11-09 07:51:54,254 INFO L87 Difference]: Start difference. First operand 20 states and 19 transitions. Second operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 11 states have internal predecessors, (17), 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-09 07:51:54,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:51:54,498 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2024-11-09 07:51:54,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:51:54,498 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 11 states have internal predecessors, (17), 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 19 [2024-11-09 07:51:54,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:51:54,499 INFO L225 Difference]: With dead ends: 19 [2024-11-09 07:51:54,499 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 07:51:54,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 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-09 07:51:54,500 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 7 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:51:54,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 53 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 15 Unchecked, 0.1s Time] [2024-11-09 07:51:54,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 07:51:54,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 07:51:54,501 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-09 07:51:54,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 07:51:54,502 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2024-11-09 07:51:54,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:51:54,502 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 07:51:54,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 11 states have internal predecessors, (17), 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-09 07:51:54,503 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 07:51:54,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 07:51:54,505 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE (3 of 4 remaining) [2024-11-09 07:51:54,506 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (2 of 4 remaining) [2024-11-09 07:51:54,506 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (1 of 4 remaining) [2024-11-09 07:51:54,506 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (0 of 4 remaining) [2024-11-09 07:51:54,511 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-09 07:51:54,707 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-09 07:51:54,710 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:51:54,712 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 07:51:54,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:51:54 BoogieIcfgContainer [2024-11-09 07:51:54,715 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 07:51:54,716 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 07:51:54,716 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 07:51:54,716 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 07:51:54,717 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:51:50" (3/4) ... [2024-11-09 07:51:54,719 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 07:51:54,723 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2024-11-09 07:51:54,727 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-09 07:51:54,728 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 07:51:54,729 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-09 07:51:54,817 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 07:51:54,826 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 07:51:54,826 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 07:51:54,827 INFO L158 Benchmark]: Toolchain (without parser) took 5759.40ms. Allocated memory was 79.7MB in the beginning and 100.7MB in the end (delta: 21.0MB). Free memory was 43.2MB in the beginning and 75.4MB in the end (delta: -32.3MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. [2024-11-09 07:51:54,827 INFO L158 Benchmark]: CDTParser took 1.28ms. Allocated memory is still 56.6MB. Free memory was 37.5MB in the beginning and 37.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:51:54,827 INFO L158 Benchmark]: CACSL2BoogieTranslator took 713.67ms. Allocated memory is still 79.7MB. Free memory was 42.9MB in the beginning and 30.5MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 07:51:54,827 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.15ms. Allocated memory is still 79.7MB. Free memory was 30.5MB in the beginning and 55.8MB in the end (delta: -25.2MB). Peak memory consumption was 3.9MB. Max. memory is 16.1GB. [2024-11-09 07:51:54,828 INFO L158 Benchmark]: Boogie Preprocessor took 71.50ms. Allocated memory is still 79.7MB. Free memory was 55.8MB in the beginning and 53.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:51:54,828 INFO L158 Benchmark]: RCFGBuilder took 430.33ms. Allocated memory is still 79.7MB. Free memory was 53.1MB in the beginning and 39.5MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 07:51:54,828 INFO L158 Benchmark]: TraceAbstraction took 4351.06ms. Allocated memory was 79.7MB in the beginning and 100.7MB in the end (delta: 21.0MB). Free memory was 39.0MB in the beginning and 32.6MB in the end (delta: 6.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-09 07:51:54,828 INFO L158 Benchmark]: Witness Printer took 110.26ms. Allocated memory is still 100.7MB. Free memory was 32.6MB in the beginning and 75.4MB in the end (delta: -42.8MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2024-11-09 07:51:54,831 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.28ms. Allocated memory is still 56.6MB. Free memory was 37.5MB in the beginning and 37.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 713.67ms. Allocated memory is still 79.7MB. Free memory was 42.9MB in the beginning and 30.5MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.15ms. Allocated memory is still 79.7MB. Free memory was 30.5MB in the beginning and 55.8MB in the end (delta: -25.2MB). Peak memory consumption was 3.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.50ms. Allocated memory is still 79.7MB. Free memory was 55.8MB in the beginning and 53.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 430.33ms. Allocated memory is still 79.7MB. Free memory was 53.1MB in the beginning and 39.5MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4351.06ms. Allocated memory was 79.7MB in the beginning and 100.7MB in the end (delta: 21.0MB). Free memory was 39.0MB in the beginning and 32.6MB in the end (delta: 6.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Witness Printer took 110.26ms. Allocated memory is still 100.7MB. Free memory was 32.6MB in the beginning and 75.4MB in the end (delta: -42.8MB). Peak memory consumption was 6.5MB. 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: 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 - PositiveResult [Line: 789]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 63 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 63 mSDsluCounter, 651 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 15 IncrementalHoareTripleChecker+Unchecked, 493 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 423 IncrementalHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 158 mSDtfsCounter, 423 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred 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, 7 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 120 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 112 ConstructedInterpolants, 3 QuantifiedInterpolants, 587 SizeOfPredicates, 6 NumberOfNonLiveVariables, 395 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-09 07:51:54,860 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