./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_3-container_of.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_3-container_of.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 11cd6df53312b6388eb67fa3ddad4ddfe9675663ccf0a1507d8b60fd9abceccc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 19:06:08,769 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 19:06:08,833 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-24 19:06:08,837 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 19:06:08,840 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 19:06:08,868 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 19:06:08,869 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 19:06:08,869 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 19:06:08,870 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 19:06:08,870 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 19:06:08,871 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 19:06:08,871 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 19:06:08,872 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 19:06:08,872 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 19:06:08,872 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 19:06:08,874 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 19:06:08,874 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 19:06:08,875 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 19:06:08,875 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 19:06:08,875 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 19:06:08,876 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 19:06:08,879 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 19:06:08,880 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 19:06:08,880 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 19:06:08,881 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 19:06:08,881 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 19:06:08,881 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 19:06:08,882 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 19:06:08,882 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 19:06:08,883 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 19:06:08,883 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 19:06:08,883 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 19:06:08,884 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 19:06:08,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:06:08,884 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 19:06:08,885 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 19:06:08,885 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 19:06:08,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 19:06:08,886 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 19:06:08,886 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 19:06:08,886 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 19:06:08,887 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 19:06:08,888 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 -> 11cd6df53312b6388eb67fa3ddad4ddfe9675663ccf0a1507d8b60fd9abceccc [2024-10-24 19:06:09,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 19:06:09,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 19:06:09,178 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 19:06:09,179 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 19:06:09,180 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 19:06:09,181 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_3-container_of.i [2024-10-24 19:06:10,642 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 19:06:10,934 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 19:06:10,935 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_3-container_of.i [2024-10-24 19:06:10,972 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b37daa01/ce4961f2bdab4084a356385180226056/FLAG8f5d5bd6a [2024-10-24 19:06:10,985 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b37daa01/ce4961f2bdab4084a356385180226056 [2024-10-24 19:06:10,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 19:06:10,988 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 19:06:10,991 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 19:06:10,991 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 19:06:10,996 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 19:06:10,996 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:06:10" (1/1) ... [2024-10-24 19:06:10,997 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36fedb53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:06:10, skipping insertion in model container [2024-10-24 19:06:11,000 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:06:10" (1/1) ... [2024-10-24 19:06:11,062 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 19:06:11,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:06:11,564 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-24 19:06:11,565 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@c086391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:06:11, skipping insertion in model container [2024-10-24 19:06:11,565 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 19:06:11,566 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-24 19:06:11,568 INFO L158 Benchmark]: Toolchain (without parser) took 578.17ms. Allocated memory is still 151.0MB. Free memory was 92.7MB in the beginning and 69.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-24 19:06:11,568 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 151.0MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 19:06:11,569 INFO L158 Benchmark]: CACSL2BoogieTranslator took 575.02ms. Allocated memory is still 151.0MB. Free memory was 92.7MB in the beginning and 69.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-24 19:06:11,571 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.18ms. Allocated memory is still 151.0MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 575.02ms. Allocated memory is still 151.0MB. Free memory was 92.7MB in the beginning and 69.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 3904]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_3-container_of.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 11cd6df53312b6388eb67fa3ddad4ddfe9675663ccf0a1507d8b60fd9abceccc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 19:06:13,658 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 19:06:13,737 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-24 19:06:13,742 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 19:06:13,744 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 19:06:13,779 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 19:06:13,780 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 19:06:13,780 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 19:06:13,781 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 19:06:13,781 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 19:06:13,782 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 19:06:13,786 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 19:06:13,786 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 19:06:13,788 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 19:06:13,788 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 19:06:13,789 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 19:06:13,789 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 19:06:13,790 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 19:06:13,790 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 19:06:13,791 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 19:06:13,794 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 19:06:13,794 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 19:06:13,795 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 19:06:13,795 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 19:06:13,795 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 19:06:13,795 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 19:06:13,796 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 19:06:13,796 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 19:06:13,796 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 19:06:13,796 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 19:06:13,797 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 19:06:13,797 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 19:06:13,799 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 19:06:13,799 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 19:06:13,799 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 19:06:13,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:06:13,800 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 19:06:13,801 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 19:06:13,801 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 19:06:13,801 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 19:06:13,801 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 19:06:13,802 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 19:06:13,802 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 19:06:13,802 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 19:06:13,802 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 19:06:13,803 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 -> 11cd6df53312b6388eb67fa3ddad4ddfe9675663ccf0a1507d8b60fd9abceccc [2024-10-24 19:06:14,166 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 19:06:14,189 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 19:06:14,192 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 19:06:14,193 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 19:06:14,194 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 19:06:14,196 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_3-container_of.i [2024-10-24 19:06:15,782 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 19:06:16,113 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 19:06:16,113 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_3-container_of.i [2024-10-24 19:06:16,161 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6f79f7de/477c67bd25f343f8aa3668492234ca17/FLAG04fe83cd3 [2024-10-24 19:06:16,180 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6f79f7de/477c67bd25f343f8aa3668492234ca17 [2024-10-24 19:06:16,182 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 19:06:16,184 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 19:06:16,185 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 19:06:16,185 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 19:06:16,192 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 19:06:16,193 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:06:16" (1/1) ... [2024-10-24 19:06:16,194 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22eb946e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:06:16, skipping insertion in model container [2024-10-24 19:06:16,194 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:06:16" (1/1) ... [2024-10-24 19:06:16,265 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 19:06:16,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:06:16,774 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-24 19:06:16,794 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 19:06:16,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:06:16,854 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 19:06:16,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:06:16,982 INFO L204 MainTranslator]: Completed translation [2024-10-24 19:06:16,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:06:16 WrapperNode [2024-10-24 19:06:16,983 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 19:06:16,984 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 19:06:16,984 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 19:06:16,984 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 19:06:16,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:06:16" (1/1) ... [2024-10-24 19:06:17,031 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:06:16" (1/1) ... [2024-10-24 19:06:17,062 INFO L138 Inliner]: procedures = 251, calls = 56, calls flagged for inlining = 13, calls inlined = 18, statements flattened = 152 [2024-10-24 19:06:17,066 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 19:06:17,067 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 19:06:17,068 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 19:06:17,068 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 19:06:17,078 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:06:16" (1/1) ... [2024-10-24 19:06:17,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:06:16" (1/1) ... [2024-10-24 19:06:17,085 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:06:16" (1/1) ... [2024-10-24 19:06:17,117 INFO L175 MemorySlicer]: Split 19 memory accesses to 3 slices as follows [2, 2, 15]. 79 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 10 writes are split as follows [0, 2, 8]. [2024-10-24 19:06:17,117 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:06:16" (1/1) ... [2024-10-24 19:06:17,118 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:06:16" (1/1) ... [2024-10-24 19:06:17,135 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:06:16" (1/1) ... [2024-10-24 19:06:17,138 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:06:16" (1/1) ... [2024-10-24 19:06:17,142 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:06:16" (1/1) ... [2024-10-24 19:06:17,145 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:06:16" (1/1) ... [2024-10-24 19:06:17,151 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 19:06:17,152 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 19:06:17,152 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 19:06:17,152 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 19:06:17,154 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:06:16" (1/1) ... [2024-10-24 19:06:17,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:06:17,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:06:17,195 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 19:06:17,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 19:06:17,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 19:06:17,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 19:06:17,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-24 19:06:17,234 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2024-10-24 19:06:17,234 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2024-10-24 19:06:17,234 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-24 19:06:17,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 19:06:17,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 19:06:17,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 19:06:17,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 19:06:17,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-24 19:06:17,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 19:06:17,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 19:06:17,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-24 19:06:17,235 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-24 19:06:17,235 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-24 19:06:17,236 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-24 19:06:17,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 19:06:17,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 19:06:17,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 19:06:17,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-24 19:06:17,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 19:06:17,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 19:06:17,238 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-24 19:06:17,556 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 19:06:17,559 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 19:06:18,125 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-24 19:06:18,125 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 19:06:18,322 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 19:06:18,323 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 19:06:18,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:06:18 BoogieIcfgContainer [2024-10-24 19:06:18,323 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 19:06:18,326 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 19:06:18,326 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 19:06:18,329 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 19:06:18,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:06:16" (1/3) ... [2024-10-24 19:06:18,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ebd64fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:06:18, skipping insertion in model container [2024-10-24 19:06:18,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:06:16" (2/3) ... [2024-10-24 19:06:18,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ebd64fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:06:18, skipping insertion in model container [2024-10-24 19:06:18,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:06:18" (3/3) ... [2024-10-24 19:06:18,333 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_3-container_of.i [2024-10-24 19:06:18,351 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 19:06:18,351 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2024-10-24 19:06:18,352 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-24 19:06:18,449 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-24 19:06:18,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 125 transitions, 264 flow [2024-10-24 19:06:18,559 INFO L124 PetriNetUnfolderBase]: 14/158 cut-off events. [2024-10-24 19:06:18,560 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-24 19:06:18,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 158 events. 14/158 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 534 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 84. Up to 4 conditions per place. [2024-10-24 19:06:18,564 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 125 transitions, 264 flow [2024-10-24 19:06:18,569 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 123 transitions, 258 flow [2024-10-24 19:06:18,581 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 19:06:18,589 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;@130a4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 19:06:18,589 INFO L334 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2024-10-24 19:06:18,594 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 19:06:18,596 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-10-24 19:06:18,596 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 19:06:18,597 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:06:18,597 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-24 19:06:18,598 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-24 19:06:18,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:06:18,604 INFO L85 PathProgramCache]: Analyzing trace with hash 557403, now seen corresponding path program 1 times [2024-10-24 19:06:18,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:06:18,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [203969767] [2024-10-24 19:06:18,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:06:18,620 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:06:18,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:06:18,621 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:06:18,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 19:06:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:06:18,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 19:06:18,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:06:18,826 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-10-24 19:06:18,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:06:18,837 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:06:18,837 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:06:18,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [203969767] [2024-10-24 19:06:18,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [203969767] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:06:18,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:06:18,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:06:18,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060482123] [2024-10-24 19:06:18,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:06:18,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:06:18,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:06:18,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:06:18,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:06:18,965 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 125 [2024-10-24 19:06:18,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 123 transitions, 258 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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-10-24 19:06:18,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:06:18,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 125 [2024-10-24 19:06:18,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:06:21,391 INFO L124 PetriNetUnfolderBase]: 7867/16174 cut-off events. [2024-10-24 19:06:21,391 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2024-10-24 19:06:21,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28480 conditions, 16174 events. 7867/16174 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 575. Compared 148472 event pairs, 4199 based on Foata normal form. 792/10803 useless extension candidates. Maximal degree in co-relation 28239. Up to 6584 conditions per place. [2024-10-24 19:06:21,540 INFO L140 encePairwiseOnDemand]: 109/125 looper letters, 90 selfloop transitions, 2 changer transitions 0/131 dead transitions. [2024-10-24 19:06:21,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 131 transitions, 458 flow [2024-10-24 19:06:21,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:06:21,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:06:21,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 229 transitions. [2024-10-24 19:06:21,551 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6106666666666667 [2024-10-24 19:06:21,552 INFO L175 Difference]: Start difference. First operand has 119 places, 123 transitions, 258 flow. Second operand 3 states and 229 transitions. [2024-10-24 19:06:21,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 131 transitions, 458 flow [2024-10-24 19:06:21,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 131 transitions, 450 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-24 19:06:21,565 INFO L231 Difference]: Finished difference. Result has 107 places, 105 transitions, 218 flow [2024-10-24 19:06:21,567 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=218, PETRI_PLACES=107, PETRI_TRANSITIONS=105} [2024-10-24 19:06:21,572 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, -12 predicate places. [2024-10-24 19:06:21,572 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 105 transitions, 218 flow [2024-10-24 19:06:21,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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-10-24 19:06:21,573 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:06:21,573 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-24 19:06:21,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 19:06:21,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:06:21,778 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-24 19:06:21,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:06:21,779 INFO L85 PathProgramCache]: Analyzing trace with hash 557404, now seen corresponding path program 1 times [2024-10-24 19:06:21,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:06:21,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1528866552] [2024-10-24 19:06:21,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:06:21,780 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:06:21,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:06:21,782 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:06:21,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 19:06:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:06:21,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 19:06:21,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:06:21,907 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 5 [2024-10-24 19:06:21,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:06:21,919 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:06:21,919 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:06:21,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1528866552] [2024-10-24 19:06:21,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1528866552] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:06:21,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:06:21,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:06:21,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631395218] [2024-10-24 19:06:21,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:06:21,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:06:21,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:06:21,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:06:21,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:06:22,011 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 125 [2024-10-24 19:06:22,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 105 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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-10-24 19:06:22,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:06:22,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 125 [2024-10-24 19:06:22,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:06:23,711 INFO L124 PetriNetUnfolderBase]: 6411/13932 cut-off events. [2024-10-24 19:06:23,712 INFO L125 PetriNetUnfolderBase]: For 196/196 co-relation queries the response was YES. [2024-10-24 19:06:23,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24164 conditions, 13932 events. 6411/13932 cut-off events. For 196/196 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 132185 event pairs, 2743 based on Foata normal form. 1/9232 useless extension candidates. Maximal degree in co-relation 8831. Up to 5674 conditions per place. [2024-10-24 19:06:23,811 INFO L140 encePairwiseOnDemand]: 117/125 looper letters, 85 selfloop transitions, 2 changer transitions 0/125 dead transitions. [2024-10-24 19:06:23,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 125 transitions, 432 flow [2024-10-24 19:06:23,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:06:23,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:06:23,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 219 transitions. [2024-10-24 19:06:23,816 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.584 [2024-10-24 19:06:23,817 INFO L175 Difference]: Start difference. First operand has 107 places, 105 transitions, 218 flow. Second operand 3 states and 219 transitions. [2024-10-24 19:06:23,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 125 transitions, 432 flow [2024-10-24 19:06:23,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 125 transitions, 428 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 19:06:23,830 INFO L231 Difference]: Finished difference. Result has 101 places, 99 transitions, 206 flow [2024-10-24 19:06:23,830 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=101, PETRI_TRANSITIONS=99} [2024-10-24 19:06:23,831 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, -18 predicate places. [2024-10-24 19:06:23,832 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 99 transitions, 206 flow [2024-10-24 19:06:23,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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-10-24 19:06:23,832 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:06:23,833 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-24 19:06:23,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 19:06:24,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:06:24,037 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-24 19:06:24,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:06:24,038 INFO L85 PathProgramCache]: Analyzing trace with hash 17277970, now seen corresponding path program 1 times [2024-10-24 19:06:24,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:06:24,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1956830268] [2024-10-24 19:06:24,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:06:24,039 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:06:24,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:06:24,041 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:06:24,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 19:06:24,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:06:24,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 19:06:24,130 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:06:24,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:06:24,138 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:06:24,138 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:06:24,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1956830268] [2024-10-24 19:06:24,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1956830268] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:06:24,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:06:24,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:06:24,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324474485] [2024-10-24 19:06:24,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:06:24,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:06:24,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:06:24,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:06:24,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:06:24,141 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 125 [2024-10-24 19:06:24,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 99 transitions, 206 flow. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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-10-24 19:06:24,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:06:24,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 125 [2024-10-24 19:06:24,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:06:25,618 INFO L124 PetriNetUnfolderBase]: 6410/12532 cut-off events. [2024-10-24 19:06:25,619 INFO L125 PetriNetUnfolderBase]: For 201/201 co-relation queries the response was YES. [2024-10-24 19:06:25,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22764 conditions, 12532 events. 6410/12532 cut-off events. For 201/201 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 107472 event pairs, 6045 based on Foata normal form. 1/8162 useless extension candidates. Maximal degree in co-relation 8831. Up to 9455 conditions per place. [2024-10-24 19:06:25,693 INFO L140 encePairwiseOnDemand]: 122/125 looper letters, 85 selfloop transitions, 2 changer transitions 0/124 dead transitions. [2024-10-24 19:06:25,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 124 transitions, 430 flow [2024-10-24 19:06:25,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:06:25,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:06:25,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 217 transitions. [2024-10-24 19:06:25,696 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5786666666666667 [2024-10-24 19:06:25,696 INFO L175 Difference]: Start difference. First operand has 101 places, 99 transitions, 206 flow. Second operand 3 states and 217 transitions. [2024-10-24 19:06:25,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 124 transitions, 430 flow [2024-10-24 19:06:25,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 124 transitions, 426 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 19:06:25,707 INFO L231 Difference]: Finished difference. Result has 101 places, 98 transitions, 204 flow [2024-10-24 19:06:25,707 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=101, PETRI_TRANSITIONS=98} [2024-10-24 19:06:25,708 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, -18 predicate places. [2024-10-24 19:06:25,709 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 98 transitions, 204 flow [2024-10-24 19:06:25,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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-10-24 19:06:25,709 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:06:25,710 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:06:25,717 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 (4)] Forceful destruction successful, exit code 0 [2024-10-24 19:06:25,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:06:25,915 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-24 19:06:25,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:06:25,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1608668968, now seen corresponding path program 1 times [2024-10-24 19:06:25,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:06:25,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1282935615] [2024-10-24 19:06:25,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:06:25,917 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:06:25,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:06:25,920 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:06:25,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 19:06:26,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:06:26,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 19:06:26,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:06:26,047 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-10-24 19:06:26,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:06:26,067 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:06:26,068 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:06:26,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1282935615] [2024-10-24 19:06:26,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1282935615] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:06:26,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:06:26,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:06:26,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210895906] [2024-10-24 19:06:26,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:06:26,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:06:26,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:06:26,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:06:26,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:06:26,134 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 125 [2024-10-24 19:06:26,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 98 transitions, 204 flow. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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-10-24 19:06:26,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:06:26,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 125 [2024-10-24 19:06:26,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:06:27,079 INFO L124 PetriNetUnfolderBase]: 7138/13103 cut-off events. [2024-10-24 19:06:27,080 INFO L125 PetriNetUnfolderBase]: For 202/202 co-relation queries the response was YES. [2024-10-24 19:06:27,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24458 conditions, 13103 events. 7138/13103 cut-off events. For 202/202 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 105252 event pairs, 6409 based on Foata normal form. 0/9201 useless extension candidates. Maximal degree in co-relation 23133. Up to 10014 conditions per place. [2024-10-24 19:06:27,156 INFO L140 encePairwiseOnDemand]: 116/125 looper letters, 86 selfloop transitions, 4 changer transitions 0/119 dead transitions. [2024-10-24 19:06:27,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 119 transitions, 426 flow [2024-10-24 19:06:27,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:06:27,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:06:27,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 203 transitions. [2024-10-24 19:06:27,158 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5413333333333333 [2024-10-24 19:06:27,158 INFO L175 Difference]: Start difference. First operand has 101 places, 98 transitions, 204 flow. Second operand 3 states and 203 transitions. [2024-10-24 19:06:27,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 119 transitions, 426 flow [2024-10-24 19:06:27,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 119 transitions, 422 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 19:06:27,168 INFO L231 Difference]: Finished difference. Result has 96 places, 93 transitions, 198 flow [2024-10-24 19:06:27,168 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=96, PETRI_TRANSITIONS=93} [2024-10-24 19:06:27,169 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, -23 predicate places. [2024-10-24 19:06:27,169 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 93 transitions, 198 flow [2024-10-24 19:06:27,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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-10-24 19:06:27,170 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:06:27,170 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:06:27,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-24 19:06:27,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:06:27,371 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-24 19:06:27,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:06:27,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1608668967, now seen corresponding path program 1 times [2024-10-24 19:06:27,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:06:27,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1797606482] [2024-10-24 19:06:27,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:06:27,372 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:06:27,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:06:27,375 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:06:27,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 19:06:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:06:27,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 19:06:27,505 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:06:27,519 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 5 [2024-10-24 19:06:27,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:06:27,594 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:06:27,594 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:06:27,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1797606482] [2024-10-24 19:06:27,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1797606482] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:06:27,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:06:27,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:06:27,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694228356] [2024-10-24 19:06:27,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:06:27,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:06:27,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:06:27,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:06:27,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:06:27,666 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 125 [2024-10-24 19:06:27,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 93 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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-10-24 19:06:27,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:06:27,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 125 [2024-10-24 19:06:27,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:06:28,485 INFO L124 PetriNetUnfolderBase]: 6410/11764 cut-off events. [2024-10-24 19:06:28,485 INFO L125 PetriNetUnfolderBase]: For 198/198 co-relation queries the response was YES. [2024-10-24 19:06:28,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22012 conditions, 11764 events. 6410/11764 cut-off events. For 198/198 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 92345 event pairs, 5291 based on Foata normal form. 394/8542 useless extension candidates. Maximal degree in co-relation 19111. Up to 8270 conditions per place. [2024-10-24 19:06:28,544 INFO L140 encePairwiseOnDemand]: 118/125 looper letters, 97 selfloop transitions, 3 changer transitions 0/126 dead transitions. [2024-10-24 19:06:28,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 126 transitions, 466 flow [2024-10-24 19:06:28,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:06:28,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:06:28,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 218 transitions. [2024-10-24 19:06:28,546 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5813333333333334 [2024-10-24 19:06:28,546 INFO L175 Difference]: Start difference. First operand has 96 places, 93 transitions, 198 flow. Second operand 3 states and 218 transitions. [2024-10-24 19:06:28,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 126 transitions, 466 flow [2024-10-24 19:06:28,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 126 transitions, 456 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 19:06:28,555 INFO L231 Difference]: Finished difference. Result has 97 places, 94 transitions, 211 flow [2024-10-24 19:06:28,555 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=211, PETRI_PLACES=97, PETRI_TRANSITIONS=94} [2024-10-24 19:06:28,557 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, -22 predicate places. [2024-10-24 19:06:28,558 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 94 transitions, 211 flow [2024-10-24 19:06:28,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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-10-24 19:06:28,558 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:06:28,558 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:06:28,565 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-10-24 19:06:28,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:06:28,759 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-24 19:06:28,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:06:28,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1751356453, now seen corresponding path program 1 times [2024-10-24 19:06:28,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:06:28,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2104050929] [2024-10-24 19:06:28,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:06:28,761 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:06:28,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:06:28,764 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:06:28,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-24 19:06:28,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:06:28,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 19:06:28,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:06:28,908 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-10-24 19:06:28,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:06:28,942 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:06:28,942 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:06:28,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2104050929] [2024-10-24 19:06:28,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2104050929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:06:28,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:06:28,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:06:28,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107505031] [2024-10-24 19:06:28,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:06:28,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:06:28,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:06:28,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:06:28,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:06:29,104 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 125 [2024-10-24 19:06:29,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 94 transitions, 211 flow. Second operand has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 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-10-24 19:06:29,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:06:29,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 125 [2024-10-24 19:06:29,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:06:30,680 INFO L124 PetriNetUnfolderBase]: 5360/10373 cut-off events. [2024-10-24 19:06:30,680 INFO L125 PetriNetUnfolderBase]: For 157/157 co-relation queries the response was YES. [2024-10-24 19:06:30,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19506 conditions, 10373 events. 5360/10373 cut-off events. For 157/157 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 82588 event pairs, 133 based on Foata normal form. 0/7822 useless extension candidates. Maximal degree in co-relation 14441. Up to 3335 conditions per place. [2024-10-24 19:06:30,738 INFO L140 encePairwiseOnDemand]: 113/125 looper letters, 167 selfloop transitions, 13 changer transitions 1/213 dead transitions. [2024-10-24 19:06:30,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 213 transitions, 824 flow [2024-10-24 19:06:30,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 19:06:30,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-24 19:06:30,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 540 transitions. [2024-10-24 19:06:30,744 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.54 [2024-10-24 19:06:30,744 INFO L175 Difference]: Start difference. First operand has 97 places, 94 transitions, 211 flow. Second operand 8 states and 540 transitions. [2024-10-24 19:06:30,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 213 transitions, 824 flow [2024-10-24 19:06:30,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 213 transitions, 817 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 19:06:30,763 INFO L231 Difference]: Finished difference. Result has 107 places, 103 transitions, 299 flow [2024-10-24 19:06:30,763 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=299, PETRI_PLACES=107, PETRI_TRANSITIONS=103} [2024-10-24 19:06:30,767 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, -12 predicate places. [2024-10-24 19:06:30,768 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 103 transitions, 299 flow [2024-10-24 19:06:30,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 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-10-24 19:06:30,769 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:06:30,769 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:06:30,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-24 19:06:30,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:06:30,970 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-24 19:06:30,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:06:30,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1751356454, now seen corresponding path program 1 times [2024-10-24 19:06:30,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:06:30,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [49746447] [2024-10-24 19:06:30,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:06:30,971 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:06:30,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:06:30,975 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:06:30,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-24 19:06:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:06:31,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-24 19:06:31,124 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:06:31,143 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 5 [2024-10-24 19:06:31,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:06:31,238 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:06:31,238 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:06:31,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [49746447] [2024-10-24 19:06:31,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [49746447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:06:31,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:06:31,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:06:31,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030958108] [2024-10-24 19:06:31,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:06:31,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:06:31,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:06:31,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:06:31,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:06:31,465 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 125 [2024-10-24 19:06:31,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 103 transitions, 299 flow. Second operand has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 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-10-24 19:06:31,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:06:31,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 125 [2024-10-24 19:06:31,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:06:32,877 INFO L124 PetriNetUnfolderBase]: 3897/7584 cut-off events. [2024-10-24 19:06:32,878 INFO L125 PetriNetUnfolderBase]: For 2753/2759 co-relation queries the response was YES. [2024-10-24 19:06:32,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15891 conditions, 7584 events. 3897/7584 cut-off events. For 2753/2759 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 55990 event pairs, 731 based on Foata normal form. 782/7131 useless extension candidates. Maximal degree in co-relation 14428. Up to 3099 conditions per place. [2024-10-24 19:06:32,913 INFO L140 encePairwiseOnDemand]: 117/125 looper letters, 149 selfloop transitions, 10 changer transitions 2/193 dead transitions. [2024-10-24 19:06:32,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 193 transitions, 821 flow [2024-10-24 19:06:32,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 19:06:32,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-24 19:06:32,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 470 transitions. [2024-10-24 19:06:32,915 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5371428571428571 [2024-10-24 19:06:32,915 INFO L175 Difference]: Start difference. First operand has 107 places, 103 transitions, 299 flow. Second operand 7 states and 470 transitions. [2024-10-24 19:06:32,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 193 transitions, 821 flow [2024-10-24 19:06:32,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 193 transitions, 821 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 19:06:32,933 INFO L231 Difference]: Finished difference. Result has 116 places, 105 transitions, 352 flow [2024-10-24 19:06:32,933 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=352, PETRI_PLACES=116, PETRI_TRANSITIONS=105} [2024-10-24 19:06:32,934 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, -3 predicate places. [2024-10-24 19:06:32,934 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 105 transitions, 352 flow [2024-10-24 19:06:32,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 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-10-24 19:06:32,934 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:06:32,935 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:06:32,941 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 (8)] Forceful destruction successful, exit code 0 [2024-10-24 19:06:33,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:06:33,139 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-24 19:06:33,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:06:33,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1802651144, now seen corresponding path program 1 times [2024-10-24 19:06:33,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:06:33,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [526158148] [2024-10-24 19:06:33,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:06:33,140 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:06:33,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:06:33,142 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:06:33,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-24 19:06:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:06:33,265 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 19:06:33,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:06:33,277 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-10-24 19:06:33,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:06:33,326 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:06:33,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:06:33,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [526158148] [2024-10-24 19:06:33,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [526158148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:06:33,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:06:33,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:06:33,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732767728] [2024-10-24 19:06:33,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:06:33,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:06:33,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:06:33,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:06:33,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:06:33,434 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 125 [2024-10-24 19:06:33,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 105 transitions, 352 flow. Second operand has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 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-10-24 19:06:33,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:06:33,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 125 [2024-10-24 19:06:33,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:06:34,504 INFO L124 PetriNetUnfolderBase]: 3438/6716 cut-off events. [2024-10-24 19:06:34,505 INFO L125 PetriNetUnfolderBase]: For 4667/4667 co-relation queries the response was YES. [2024-10-24 19:06:34,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15048 conditions, 6716 events. 3438/6716 cut-off events. For 4667/4667 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 48851 event pairs, 191 based on Foata normal form. 0/5871 useless extension candidates. Maximal degree in co-relation 13724. Up to 1941 conditions per place. [2024-10-24 19:06:34,529 INFO L140 encePairwiseOnDemand]: 113/125 looper letters, 158 selfloop transitions, 17 changer transitions 0/207 dead transitions. [2024-10-24 19:06:34,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 207 transitions, 1043 flow [2024-10-24 19:06:34,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 19:06:34,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-24 19:06:34,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 522 transitions. [2024-10-24 19:06:34,532 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.522 [2024-10-24 19:06:34,532 INFO L175 Difference]: Start difference. First operand has 116 places, 105 transitions, 352 flow. Second operand 8 states and 522 transitions. [2024-10-24 19:06:34,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 207 transitions, 1043 flow [2024-10-24 19:06:34,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 207 transitions, 1013 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-24 19:06:34,543 INFO L231 Difference]: Finished difference. Result has 122 places, 114 transitions, 455 flow [2024-10-24 19:06:34,543 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=455, PETRI_PLACES=122, PETRI_TRANSITIONS=114} [2024-10-24 19:06:34,544 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, 3 predicate places. [2024-10-24 19:06:34,544 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 114 transitions, 455 flow [2024-10-24 19:06:34,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 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-10-24 19:06:34,545 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:06:34,545 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:06:34,553 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 (9)] Forceful destruction successful, exit code 0 [2024-10-24 19:06:34,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:06:34,746 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-24 19:06:34,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:06:34,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1802651145, now seen corresponding path program 1 times [2024-10-24 19:06:34,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:06:34,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [149728739] [2024-10-24 19:06:34,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:06:34,747 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:06:34,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:06:34,748 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:06:34,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-24 19:06:34,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:06:34,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-24 19:06:34,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:06:34,882 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 5 [2024-10-24 19:06:34,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:06:34,958 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:06:34,958 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:06:34,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [149728739] [2024-10-24 19:06:34,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [149728739] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:06:34,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:06:34,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:06:34,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083240387] [2024-10-24 19:06:34,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:06:34,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:06:34,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:06:34,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:06:34,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:06:35,095 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 125 [2024-10-24 19:06:35,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 114 transitions, 455 flow. Second operand has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 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-10-24 19:06:35,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:06:35,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 125 [2024-10-24 19:06:35,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:06:35,931 INFO L124 PetriNetUnfolderBase]: 2519/5013 cut-off events. [2024-10-24 19:06:35,931 INFO L125 PetriNetUnfolderBase]: For 4918/4934 co-relation queries the response was YES. [2024-10-24 19:06:35,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12437 conditions, 5013 events. 2519/5013 cut-off events. For 4918/4934 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 34622 event pairs, 342 based on Foata normal form. 536/5407 useless extension candidates. Maximal degree in co-relation 11357. Up to 2291 conditions per place. [2024-10-24 19:06:35,953 INFO L140 encePairwiseOnDemand]: 117/125 looper letters, 143 selfloop transitions, 14 changer transitions 1/190 dead transitions. [2024-10-24 19:06:35,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 190 transitions, 1021 flow [2024-10-24 19:06:35,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 19:06:35,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-24 19:06:35,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 453 transitions. [2024-10-24 19:06:35,955 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5177142857142857 [2024-10-24 19:06:35,955 INFO L175 Difference]: Start difference. First operand has 122 places, 114 transitions, 455 flow. Second operand 7 states and 453 transitions. [2024-10-24 19:06:35,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 190 transitions, 1021 flow [2024-10-24 19:06:35,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 190 transitions, 1018 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 19:06:35,967 INFO L231 Difference]: Finished difference. Result has 130 places, 117 transitions, 526 flow [2024-10-24 19:06:35,967 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=526, PETRI_PLACES=130, PETRI_TRANSITIONS=117} [2024-10-24 19:06:35,968 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, 11 predicate places. [2024-10-24 19:06:35,968 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 117 transitions, 526 flow [2024-10-24 19:06:35,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 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-10-24 19:06:35,968 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:06:35,968 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:06:35,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-24 19:06:36,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:06:36,169 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-24 19:06:36,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:06:36,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1800086855, now seen corresponding path program 1 times [2024-10-24 19:06:36,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:06:36,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [475134430] [2024-10-24 19:06:36,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:06:36,170 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:06:36,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:06:36,171 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:06:36,172 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 (11)] Waiting until timeout for monitored process [2024-10-24 19:06:36,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:06:36,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 19:06:36,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:06:36,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 19:06:36,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 19:06:36,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 19:06:36,344 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 19:06:36,345 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 19:06:36,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2024-10-24 19:06:36,413 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 19:06:36,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 93 treesize of output 53 [2024-10-24 19:06:36,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:06:36,428 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:06:36,429 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:06:36,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [475134430] [2024-10-24 19:06:36,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [475134430] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:06:36,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:06:36,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:06:36,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476972920] [2024-10-24 19:06:36,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:06:36,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:06:36,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:06:36,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:06:36,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:06:36,549 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 125 [2024-10-24 19:06:36,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 117 transitions, 526 flow. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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-10-24 19:06:36,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:06:36,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 125 [2024-10-24 19:06:36,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:06:37,311 INFO L124 PetriNetUnfolderBase]: 3195/5713 cut-off events. [2024-10-24 19:06:37,311 INFO L125 PetriNetUnfolderBase]: For 9379/9394 co-relation queries the response was YES. [2024-10-24 19:06:37,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15686 conditions, 5713 events. 3195/5713 cut-off events. For 9379/9394 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 36763 event pairs, 2013 based on Foata normal form. 0/5488 useless extension candidates. Maximal degree in co-relation 14391. Up to 4479 conditions per place. [2024-10-24 19:06:37,335 INFO L140 encePairwiseOnDemand]: 117/125 looper letters, 99 selfloop transitions, 10 changer transitions 0/138 dead transitions. [2024-10-24 19:06:37,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 138 transitions, 846 flow [2024-10-24 19:06:37,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:06:37,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:06:37,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 207 transitions. [2024-10-24 19:06:37,337 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.552 [2024-10-24 19:06:37,337 INFO L175 Difference]: Start difference. First operand has 130 places, 117 transitions, 526 flow. Second operand 3 states and 207 transitions. [2024-10-24 19:06:37,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 138 transitions, 846 flow [2024-10-24 19:06:37,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 138 transitions, 819 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-24 19:06:37,348 INFO L231 Difference]: Finished difference. Result has 129 places, 125 transitions, 623 flow [2024-10-24 19:06:37,349 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=623, PETRI_PLACES=129, PETRI_TRANSITIONS=125} [2024-10-24 19:06:37,349 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, 10 predicate places. [2024-10-24 19:06:37,349 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 125 transitions, 623 flow [2024-10-24 19:06:37,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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-10-24 19:06:37,349 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:06:37,349 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:06:37,356 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 (11)] Forceful destruction successful, exit code 0 [2024-10-24 19:06:37,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:06:37,550 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-24 19:06:37,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:06:37,551 INFO L85 PathProgramCache]: Analyzing trace with hash -31881743, now seen corresponding path program 1 times [2024-10-24 19:06:37,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:06:37,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1894987152] [2024-10-24 19:06:37,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:06:37,551 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:06:37,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:06:37,552 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:06:37,553 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 (12)] Waiting until timeout for monitored process [2024-10-24 19:06:37,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:06:37,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 19:06:37,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:06:37,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 19:06:37,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 19:06:37,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 19:06:37,743 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 19:06:37,744 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 19:06:37,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2024-10-24 19:06:37,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:06:37,793 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:06:37,793 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:06:37,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1894987152] [2024-10-24 19:06:37,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1894987152] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:06:37,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:06:37,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:06:37,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226819044] [2024-10-24 19:06:37,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:06:37,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:06:37,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:06:37,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:06:37,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:06:37,918 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 125 [2024-10-24 19:06:37,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 125 transitions, 623 flow. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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-10-24 19:06:37,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:06:37,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 125 [2024-10-24 19:06:37,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:06:38,824 INFO L124 PetriNetUnfolderBase]: 3553/6316 cut-off events. [2024-10-24 19:06:38,824 INFO L125 PetriNetUnfolderBase]: For 12246/12261 co-relation queries the response was YES. [2024-10-24 19:06:38,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19128 conditions, 6316 events. 3553/6316 cut-off events. For 12246/12261 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 40942 event pairs, 2263 based on Foata normal form. 0/6171 useless extension candidates. Maximal degree in co-relation 17758. Up to 4911 conditions per place. [2024-10-24 19:06:38,851 INFO L140 encePairwiseOnDemand]: 117/125 looper letters, 102 selfloop transitions, 17 changer transitions 0/149 dead transitions. [2024-10-24 19:06:38,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 149 transitions, 1007 flow [2024-10-24 19:06:38,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:06:38,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:06:38,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 208 transitions. [2024-10-24 19:06:38,853 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5546666666666666 [2024-10-24 19:06:38,854 INFO L175 Difference]: Start difference. First operand has 129 places, 125 transitions, 623 flow. Second operand 3 states and 208 transitions. [2024-10-24 19:06:38,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 149 transitions, 1007 flow [2024-10-24 19:06:38,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 149 transitions, 977 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 19:06:38,896 INFO L231 Difference]: Finished difference. Result has 131 places, 137 transitions, 795 flow [2024-10-24 19:06:38,897 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=795, PETRI_PLACES=131, PETRI_TRANSITIONS=137} [2024-10-24 19:06:38,898 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, 12 predicate places. [2024-10-24 19:06:38,898 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 137 transitions, 795 flow [2024-10-24 19:06:38,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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-10-24 19:06:38,898 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:06:38,898 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:06:38,907 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 (12)] Ended with exit code 0 [2024-10-24 19:06:39,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:06:39,099 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-24 19:06:39,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:06:39,100 INFO L85 PathProgramCache]: Analyzing trace with hash 663373826, now seen corresponding path program 1 times [2024-10-24 19:06:39,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:06:39,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [527799161] [2024-10-24 19:06:39,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:06:39,100 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:06:39,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:06:39,101 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:06:39,102 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 (13)] Waiting until timeout for monitored process [2024-10-24 19:06:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:06:39,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 19:06:39,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:06:39,281 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 19:06:39,281 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 19:06:39,281 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 19:06:39,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2024-10-24 19:06:39,318 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 19:06:39,319 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 19:06:39,319 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 19:06:39,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 19:06:39,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 73 treesize of output 93 [2024-10-24 19:06:39,422 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 19:06:39,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 161 treesize of output 65 [2024-10-24 19:06:39,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:06:39,441 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:06:39,441 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:06:39,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [527799161] [2024-10-24 19:06:39,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [527799161] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:06:39,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:06:39,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 19:06:39,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649582710] [2024-10-24 19:06:39,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:06:39,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:06:39,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:06:39,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:06:39,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:06:39,564 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 125 [2024-10-24 19:06:39,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 137 transitions, 795 flow. Second operand has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 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-10-24 19:06:39,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:06:39,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 125 [2024-10-24 19:06:39,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:06:41,782 INFO L124 PetriNetUnfolderBase]: 4175/7507 cut-off events. [2024-10-24 19:06:41,782 INFO L125 PetriNetUnfolderBase]: For 18778/18787 co-relation queries the response was YES. [2024-10-24 19:06:41,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24195 conditions, 7507 events. 4175/7507 cut-off events. For 18778/18787 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 51370 event pairs, 2412 based on Foata normal form. 242/7597 useless extension candidates. Maximal degree in co-relation 22460. Up to 5826 conditions per place. [2024-10-24 19:06:41,822 INFO L140 encePairwiseOnDemand]: 113/125 looper letters, 148 selfloop transitions, 27 changer transitions 0/204 dead transitions. [2024-10-24 19:06:41,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 204 transitions, 1495 flow [2024-10-24 19:06:41,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 19:06:41,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 19:06:41,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 377 transitions. [2024-10-24 19:06:41,824 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5026666666666667 [2024-10-24 19:06:41,824 INFO L175 Difference]: Start difference. First operand has 131 places, 137 transitions, 795 flow. Second operand 6 states and 377 transitions. [2024-10-24 19:06:41,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 204 transitions, 1495 flow [2024-10-24 19:06:41,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 204 transitions, 1461 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 19:06:41,872 INFO L231 Difference]: Finished difference. Result has 138 places, 164 transitions, 1094 flow [2024-10-24 19:06:41,873 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1094, PETRI_PLACES=138, PETRI_TRANSITIONS=164} [2024-10-24 19:06:41,873 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, 19 predicate places. [2024-10-24 19:06:41,873 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 164 transitions, 1094 flow [2024-10-24 19:06:41,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 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-10-24 19:06:41,874 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:06:41,874 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:06:41,881 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 (13)] Forceful destruction successful, exit code 0 [2024-10-24 19:06:42,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:06:42,075 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-24 19:06:42,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:06:42,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1026180641, now seen corresponding path program 1 times [2024-10-24 19:06:42,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:06:42,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2067953693] [2024-10-24 19:06:42,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:06:42,076 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:06:42,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:06:42,077 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:06:42,078 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 (14)] Waiting until timeout for monitored process [2024-10-24 19:06:42,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 19:06:42,320 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 19:06:42,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 19:06:42,448 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-24 19:06:42,449 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 19:06:42,449 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (54 of 55 remaining) [2024-10-24 19:06:42,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 55 remaining) [2024-10-24 19:06:42,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 55 remaining) [2024-10-24 19:06:42,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (51 of 55 remaining) [2024-10-24 19:06:42,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 55 remaining) [2024-10-24 19:06:42,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 55 remaining) [2024-10-24 19:06:42,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 55 remaining) [2024-10-24 19:06:42,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 55 remaining) [2024-10-24 19:06:42,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 55 remaining) [2024-10-24 19:06:42,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 55 remaining) [2024-10-24 19:06:42,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 55 remaining) [2024-10-24 19:06:42,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 55 remaining) [2024-10-24 19:06:42,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 55 remaining) [2024-10-24 19:06:42,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 55 remaining) [2024-10-24 19:06:42,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 55 remaining) [2024-10-24 19:06:42,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 55 remaining) [2024-10-24 19:06:42,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 55 remaining) [2024-10-24 19:06:42,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 55 remaining) [2024-10-24 19:06:42,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 55 remaining) [2024-10-24 19:06:42,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 55 remaining) [2024-10-24 19:06:42,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 55 remaining) [2024-10-24 19:06:42,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 55 remaining) [2024-10-24 19:06:42,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 55 remaining) [2024-10-24 19:06:42,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 55 remaining) [2024-10-24 19:06:42,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 55 remaining) [2024-10-24 19:06:42,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 55 remaining) [2024-10-24 19:06:42,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (28 of 55 remaining) [2024-10-24 19:06:42,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 55 remaining) [2024-10-24 19:06:42,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 55 remaining) [2024-10-24 19:06:42,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (25 of 55 remaining) [2024-10-24 19:06:42,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 55 remaining) [2024-10-24 19:06:42,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 55 remaining) [2024-10-24 19:06:42,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (22 of 55 remaining) [2024-10-24 19:06:42,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK (21 of 55 remaining) [2024-10-24 19:06:42,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK (20 of 55 remaining) [2024-10-24 19:06:42,454 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 55 remaining) [2024-10-24 19:06:42,454 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 55 remaining) [2024-10-24 19:06:42,454 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 55 remaining) [2024-10-24 19:06:42,454 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 55 remaining) [2024-10-24 19:06:42,454 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 55 remaining) [2024-10-24 19:06:42,454 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 55 remaining) [2024-10-24 19:06:42,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 55 remaining) [2024-10-24 19:06:42,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 55 remaining) [2024-10-24 19:06:42,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 55 remaining) [2024-10-24 19:06:42,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 55 remaining) [2024-10-24 19:06:42,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 55 remaining) [2024-10-24 19:06:42,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 55 remaining) [2024-10-24 19:06:42,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 55 remaining) [2024-10-24 19:06:42,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 55 remaining) [2024-10-24 19:06:42,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 55 remaining) [2024-10-24 19:06:42,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 55 remaining) [2024-10-24 19:06:42,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 55 remaining) [2024-10-24 19:06:42,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 55 remaining) [2024-10-24 19:06:42,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 55 remaining) [2024-10-24 19:06:42,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 55 remaining) [2024-10-24 19:06:42,468 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 (14)] Forceful destruction successful, exit code 0 [2024-10-24 19:06:42,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:06:42,657 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:06:42,689 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-24 19:06:42,690 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 19:06:42,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 07:06:42 BasicIcfg [2024-10-24 19:06:42,694 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 19:06:42,695 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 19:06:42,695 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 19:06:42,695 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 19:06:42,696 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:06:18" (3/4) ... [2024-10-24 19:06:42,697 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 19:06:42,699 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 19:06:42,700 INFO L158 Benchmark]: Toolchain (without parser) took 26515.67ms. Allocated memory was 92.3MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 60.9MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-10-24 19:06:42,700 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 60.8MB. Free memory was 41.3MB in the beginning and 41.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 19:06:42,701 INFO L158 Benchmark]: CACSL2BoogieTranslator took 797.94ms. Allocated memory is still 92.3MB. Free memory was 60.7MB in the beginning and 61.5MB in the end (delta: -794.5kB). Peak memory consumption was 28.9MB. Max. memory is 16.1GB. [2024-10-24 19:06:42,701 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.06ms. Allocated memory is still 92.3MB. Free memory was 61.5MB in the beginning and 58.5MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 19:06:42,701 INFO L158 Benchmark]: Boogie Preprocessor took 84.49ms. Allocated memory is still 92.3MB. Free memory was 58.5MB in the beginning and 53.1MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 19:06:42,702 INFO L158 Benchmark]: RCFGBuilder took 1171.33ms. Allocated memory was 92.3MB in the beginning and 123.7MB in the end (delta: 31.5MB). Free memory was 53.1MB in the beginning and 76.2MB in the end (delta: -23.1MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. [2024-10-24 19:06:42,702 INFO L158 Benchmark]: TraceAbstraction took 24368.56ms. Allocated memory was 123.7MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 75.4MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-10-24 19:06:42,702 INFO L158 Benchmark]: Witness Printer took 4.69ms. Allocated memory is still 2.7GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 19:06:42,704 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.13ms. Allocated memory is still 60.8MB. Free memory was 41.3MB in the beginning and 41.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 797.94ms. Allocated memory is still 92.3MB. Free memory was 60.7MB in the beginning and 61.5MB in the end (delta: -794.5kB). Peak memory consumption was 28.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.06ms. Allocated memory is still 92.3MB. Free memory was 61.5MB in the beginning and 58.5MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.49ms. Allocated memory is still 92.3MB. Free memory was 58.5MB in the beginning and 53.1MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1171.33ms. Allocated memory was 92.3MB in the beginning and 123.7MB in the end (delta: 31.5MB). Free memory was 53.1MB in the beginning and 76.2MB in the end (delta: -23.1MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. * TraceAbstraction took 24368.56ms. Allocated memory was 123.7MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 75.4MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 4.69ms. Allocated memory is still 2.7GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of large string literal at line 3883, overapproximation of memtrack at line 3883. Possible FailurePath: [L3888] 0 pthread_t t1,t2; [L3962] CALL, EXPR 0 my_drv_init() [L3956] 0 return 0; [L3962] RET, EXPR 0 my_drv_init() [L3962] 0 int ret = my_drv_init(); [L3963] COND TRUE 0 ret==0 [L3964] 0 int probe_ret; [L3965] 0 struct my_data data; [L3966] CALL 0 my_drv_probe(&data) [L3919] 0 struct device *d = &data->dev; [L3923] 0 data->shared.a = 0 VAL [t1=0, t2=0] [L3924] 0 data->shared.b = 0 [L3925] 0 int res = __VERIFIER_nondet_int(); [L3926] COND FALSE 0 !(\read(res)) [L3929] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [\old(arg)={3:24}, \old(data)={3:0}, d={3:24}, data={3:0}, res=0, t1=0, t2=0] [L3902] 1 struct device *dev = (struct device*)arg; [L3903] 1 struct my_data *data; [L3904] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L3904] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3930] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [\old(arg)={3:24}, \old(data)={3:0}, arg={3:24}, d={3:24}, data={3:0}, data={3:0}, dev={3:24}, res=0, t1=0, t2=1] [L3933] 0 data->shared.a = 3 VAL [\old(arg)={3:24}, arg={3:24}, data={3:0}, dev={3:24}, t1=0, t2=1] [L3907] 1 data->shared.a = 1 VAL [\old(arg)={3:24}, arg={3:24}, data={3:0}, dev={3:24}, t1=0, t2=1] [L3936] 0 data->shared.b = 3 VAL [\old(arg)={3:24}, arg={3:24}, data={3:0}, dev={3:24}, t1=0, t2=1] [L3939] EXPR 0 data->shared.a [L3939] CALL 0 ldv_assert(data->shared.a==3) [L3887] COND TRUE 0 !expression [L3887] CALL 0 reach_error() [L3883] 0 (0) ? (void) (0) : __assert_fail ("0", "../sv-benchmarks/c/ldv-races/race-2_3-container_of.c", 13, __extension__ __PRETTY_FUNCTION__) [L3883] 0 __assert_fail ("0", "../sv-benchmarks/c/ldv-races/race-2_3-container_of.c", 13, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={3:24}, arg={3:24}, data={3:0}, dev={3:24}, t1=0, t2=1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 3961]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 3930]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 3929]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 132 locations, 55 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 24.2s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 18.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1467 SdHoareTripleChecker+Valid, 7.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1189 mSDsluCounter, 26 SdHoareTripleChecker+Invalid, 6.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2930 IncrementalHoareTripleChecker+Invalid, 2991 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 7 mSDtfsCounter, 2930 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1094occurred in iteration=12, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 127 NumberOfCodeBlocks, 127 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 99 ConstructedInterpolants, 0 QuantifiedInterpolants, 747 SizeOfPredicates, 58 NumberOfNonLiveVariables, 1107 ConjunctsInSsa, 113 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 19:06:42,744 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: UNKNOWN: Overapproximated counterexample