./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_4-container_of.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d 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_4-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 2872c384167f2e3876e0fc6c6cdca366b47c7b8757c341fcf44d3890af023ea5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:26:12,824 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:26:12,881 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 12:26:12,888 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:26:12,889 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:26:12,909 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:26:12,910 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:26:12,910 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:26:12,911 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:26:12,911 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:26:12,911 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:26:12,911 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:26:12,913 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:26:12,914 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:26:12,914 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:26:12,915 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:26:12,915 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:26:12,915 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:26:12,915 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:26:12,916 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:26:12,916 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:26:12,920 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:26:12,920 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:26:12,920 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:26:12,920 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:26:12,920 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:26:12,921 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:26:12,921 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:26:12,921 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:26:12,921 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:26:12,922 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:26:12,922 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:26:12,922 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:26:12,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:26:12,922 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:26:12,923 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:26:12,923 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 12:26:12,923 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 12:26:12,923 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:26:12,924 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:26:12,924 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:26:12,925 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:26:12,925 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 -> 2872c384167f2e3876e0fc6c6cdca366b47c7b8757c341fcf44d3890af023ea5 [2024-10-13 12:26:13,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:26:13,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:26:13,186 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:26:13,187 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:26:13,187 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:26:13,189 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_4-container_of.i [2024-10-13 12:26:14,452 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:26:14,706 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:26:14,707 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_4-container_of.i [2024-10-13 12:26:14,731 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6412e7eb/86d8e778df3a4334bfae0eee2a56e47d/FLAG3c57cef84 [2024-10-13 12:26:15,034 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6412e7eb/86d8e778df3a4334bfae0eee2a56e47d [2024-10-13 12:26:15,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:26:15,037 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:26:15,047 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:26:15,047 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:26:15,052 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:26:15,053 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:26:15" (1/1) ... [2024-10-13 12:26:15,054 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a209e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:15, skipping insertion in model container [2024-10-13 12:26:15,054 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:26:15" (1/1) ... [2024-10-13 12:26:15,108 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:26:15,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:26:15,587 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-13 12:26:15,588 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5aa5a78a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:15, skipping insertion in model container [2024-10-13 12:26:15,588 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:26:15,589 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-13 12:26:15,590 INFO L158 Benchmark]: Toolchain (without parser) took 552.45ms. Allocated memory is still 159.4MB. Free memory was 89.2MB in the beginning and 124.0MB in the end (delta: -34.8MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2024-10-13 12:26:15,591 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:26:15,592 INFO L158 Benchmark]: CACSL2BoogieTranslator took 541.78ms. Allocated memory is still 159.4MB. Free memory was 88.9MB in the beginning and 124.0MB in the end (delta: -35.1MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2024-10-13 12:26:15,593 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 159.4MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 541.78ms. Allocated memory is still 159.4MB. Free memory was 88.9MB in the beginning and 124.0MB in the end (delta: -35.1MB). Peak memory consumption was 15.3MB. 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_4-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 2872c384167f2e3876e0fc6c6cdca366b47c7b8757c341fcf44d3890af023ea5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:26:17,342 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:26:17,414 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-13 12:26:17,421 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:26:17,421 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:26:17,450 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:26:17,451 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:26:17,454 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:26:17,455 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:26:17,456 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:26:17,456 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:26:17,456 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:26:17,457 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:26:17,457 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:26:17,458 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:26:17,459 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:26:17,459 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:26:17,460 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:26:17,460 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:26:17,460 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:26:17,463 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:26:17,467 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:26:17,468 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:26:17,468 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:26:17,468 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:26:17,468 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 12:26:17,468 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:26:17,468 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 12:26:17,469 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:26:17,469 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:26:17,469 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:26:17,469 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:26:17,469 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:26:17,470 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:26:17,470 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:26:17,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:26:17,470 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:26:17,470 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:26:17,470 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 12:26:17,471 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 12:26:17,471 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:26:17,472 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:26:17,472 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:26:17,472 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:26:17,472 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 12:26:17,472 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 -> 2872c384167f2e3876e0fc6c6cdca366b47c7b8757c341fcf44d3890af023ea5 [2024-10-13 12:26:17,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:26:17,798 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:26:17,801 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:26:17,802 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:26:17,803 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:26:17,805 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_4-container_of.i [2024-10-13 12:26:19,208 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:26:19,447 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:26:19,447 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_4-container_of.i [2024-10-13 12:26:19,485 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68c73fbb4/b32e1bf739ce4989913764df1f22e827/FLAG57a09416c [2024-10-13 12:26:19,789 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68c73fbb4/b32e1bf739ce4989913764df1f22e827 [2024-10-13 12:26:19,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:26:19,792 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:26:19,794 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:26:19,794 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:26:19,800 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:26:19,801 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:26:19" (1/1) ... [2024-10-13 12:26:19,801 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@376a16b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:19, skipping insertion in model container [2024-10-13 12:26:19,801 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:26:19" (1/1) ... [2024-10-13 12:26:19,870 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:26:20,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:26:20,250 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-13 12:26:20,269 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:26:20,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:26:20,319 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:26:20,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:26:20,445 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:26:20,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:20 WrapperNode [2024-10-13 12:26:20,446 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:26:20,447 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:26:20,447 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:26:20,447 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:26:20,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:20" (1/1) ... [2024-10-13 12:26:20,487 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:20" (1/1) ... [2024-10-13 12:26:20,518 INFO L138 Inliner]: procedures = 251, calls = 56, calls flagged for inlining = 13, calls inlined = 18, statements flattened = 152 [2024-10-13 12:26:20,520 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:26:20,521 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:26:20,521 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:26:20,521 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:26:20,530 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:20" (1/1) ... [2024-10-13 12:26:20,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:20" (1/1) ... [2024-10-13 12:26:20,536 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:20" (1/1) ... [2024-10-13 12:26:20,566 INFO L175 MemorySlicer]: Split 19 memory accesses to 3 slices as follows [2, 15, 2]. 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, 8, 2]. [2024-10-13 12:26:20,567 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:20" (1/1) ... [2024-10-13 12:26:20,568 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:20" (1/1) ... [2024-10-13 12:26:20,595 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:20" (1/1) ... [2024-10-13 12:26:20,602 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:20" (1/1) ... [2024-10-13 12:26:20,609 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:20" (1/1) ... [2024-10-13 12:26:20,611 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:20" (1/1) ... [2024-10-13 12:26:20,616 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:26:20,620 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:26:20,624 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:26:20,624 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:26:20,625 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:20" (1/1) ... [2024-10-13 12:26:20,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:26:20,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:26:20,652 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-13 12:26:20,654 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-13 12:26:20,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 12:26:20,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 12:26:20,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-13 12:26:20,688 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2024-10-13 12:26:20,688 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2024-10-13 12:26:20,688 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-13 12:26:20,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 12:26:20,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 12:26:20,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 12:26:20,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 12:26:20,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-13 12:26:20,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 12:26:20,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 12:26:20,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-13 12:26:20,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-13 12:26:20,689 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-13 12:26:20,689 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-13 12:26:20,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:26:20,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 12:26:20,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 12:26:20,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 12:26:20,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:26:20,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:26:20,691 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 12:26:20,958 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:26:20,961 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:26:21,473 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 12:26:21,473 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:26:21,619 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:26:21,619 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 12:26:21,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:26:21 BoogieIcfgContainer [2024-10-13 12:26:21,620 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:26:21,623 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:26:21,623 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:26:21,626 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:26:21,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:26:19" (1/3) ... [2024-10-13 12:26:21,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2081c986 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:26:21, skipping insertion in model container [2024-10-13 12:26:21,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:20" (2/3) ... [2024-10-13 12:26:21,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2081c986 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:26:21, skipping insertion in model container [2024-10-13 12:26:21,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:26:21" (3/3) ... [2024-10-13 12:26:21,630 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_4-container_of.i [2024-10-13 12:26:21,643 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:26:21,643 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2024-10-13 12:26:21,643 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 12:26:21,705 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-13 12:26:21,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 124 transitions, 262 flow [2024-10-13 12:26:21,800 INFO L124 PetriNetUnfolderBase]: 14/171 cut-off events. [2024-10-13 12:26:21,800 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 12:26:21,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 171 events. 14/171 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 694 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 83. Up to 4 conditions per place. [2024-10-13 12:26:21,807 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 124 transitions, 262 flow [2024-10-13 12:26:21,815 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 122 transitions, 256 flow [2024-10-13 12:26:21,824 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:26:21,829 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;@2c57e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:26:21,829 INFO L334 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2024-10-13 12:26:21,833 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:26:21,833 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-10-13 12:26:21,833 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:26:21,834 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:26:21,834 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-13 12:26:21,835 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-13 12:26:21,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:26:21,839 INFO L85 PathProgramCache]: Analyzing trace with hash 563048, now seen corresponding path program 1 times [2024-10-13 12:26:21,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:26:21,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1397222343] [2024-10-13 12:26:21,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:26:21,851 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-13 12:26:21,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:26:21,854 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-13 12:26:21,855 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-13 12:26:21,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:26:21,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:26:21,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:26:22,026 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-13 12:26:22,038 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-13 12:26:22,039 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:26:22,040 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:26:22,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1397222343] [2024-10-13 12:26:22,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1397222343] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:26:22,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:26:22,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:26:22,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682034792] [2024-10-13 12:26:22,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:26:22,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:26:22,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:26:22,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:26:22,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:26:22,198 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 124 [2024-10-13 12:26:22,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 122 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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-13 12:26:22,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:26:22,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 124 [2024-10-13 12:26:22,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:26:24,182 INFO L124 PetriNetUnfolderBase]: 9323/18312 cut-off events. [2024-10-13 12:26:24,182 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-10-13 12:26:24,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32872 conditions, 18312 events. 9323/18312 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 1065. Compared 177600 event pairs, 559 based on Foata normal form. 792/11540 useless extension candidates. Maximal degree in co-relation 32603. Up to 13528 conditions per place. [2024-10-13 12:26:24,304 INFO L140 encePairwiseOnDemand]: 112/124 looper letters, 94 selfloop transitions, 2 changer transitions 0/134 dead transitions. [2024-10-13 12:26:24,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 134 transitions, 472 flow [2024-10-13 12:26:24,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:26:24,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:26:24,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 226 transitions. [2024-10-13 12:26:24,317 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6075268817204301 [2024-10-13 12:26:24,318 INFO L175 Difference]: Start difference. First operand has 118 places, 122 transitions, 256 flow. Second operand 3 states and 226 transitions. [2024-10-13 12:26:24,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 134 transitions, 472 flow [2024-10-13 12:26:24,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 134 transitions, 464 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-13 12:26:24,330 INFO L231 Difference]: Finished difference. Result has 110 places, 108 transitions, 224 flow [2024-10-13 12:26:24,332 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=110, PETRI_TRANSITIONS=108} [2024-10-13 12:26:24,336 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -8 predicate places. [2024-10-13 12:26:24,336 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 108 transitions, 224 flow [2024-10-13 12:26:24,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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-13 12:26:24,337 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:26:24,337 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-13 12:26:24,344 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 (2)] Forceful destruction successful, exit code 0 [2024-10-13 12:26:24,538 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-13 12:26:24,538 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-13 12:26:24,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:26:24,539 INFO L85 PathProgramCache]: Analyzing trace with hash 563049, now seen corresponding path program 1 times [2024-10-13 12:26:24,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:26:24,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [66959875] [2024-10-13 12:26:24,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:26:24,540 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-13 12:26:24,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:26:24,541 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-13 12:26:24,543 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-13 12:26:24,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:26:24,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 12:26:24,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:26:24,650 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-13 12:26:24,659 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-13 12:26:24,659 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:26:24,659 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:26:24,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [66959875] [2024-10-13 12:26:24,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [66959875] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:26:24,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:26:24,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:26:24,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060922660] [2024-10-13 12:26:24,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:26:24,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:26:24,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:26:24,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:26:24,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:26:24,727 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 124 [2024-10-13 12:26:24,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 108 transitions, 224 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-13 12:26:24,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:26:24,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 124 [2024-10-13 12:26:24,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:26:26,402 INFO L124 PetriNetUnfolderBase]: 9323/18310 cut-off events. [2024-10-13 12:26:26,403 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2024-10-13 12:26:26,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33036 conditions, 18310 events. 9323/18310 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 1065. Compared 177732 event pairs, 559 based on Foata normal form. 1/10747 useless extension candidates. Maximal degree in co-relation 1995. Up to 13528 conditions per place. [2024-10-13 12:26:26,487 INFO L140 encePairwiseOnDemand]: 120/124 looper letters, 93 selfloop transitions, 2 changer transitions 0/132 dead transitions. [2024-10-13 12:26:26,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 132 transitions, 462 flow [2024-10-13 12:26:26,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:26:26,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:26:26,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 220 transitions. [2024-10-13 12:26:26,490 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5913978494623656 [2024-10-13 12:26:26,490 INFO L175 Difference]: Start difference. First operand has 110 places, 108 transitions, 224 flow. Second operand 3 states and 220 transitions. [2024-10-13 12:26:26,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 132 transitions, 462 flow [2024-10-13 12:26:26,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 132 transitions, 458 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:26:26,497 INFO L231 Difference]: Finished difference. Result has 108 places, 106 transitions, 220 flow [2024-10-13 12:26:26,498 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=108, PETRI_TRANSITIONS=106} [2024-10-13 12:26:26,498 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -10 predicate places. [2024-10-13 12:26:26,499 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 106 transitions, 220 flow [2024-10-13 12:26:26,499 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-13 12:26:26,499 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:26:26,499 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-13 12:26:26,509 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 (3)] Ended with exit code 0 [2024-10-13 12:26:26,700 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-13 12:26:26,701 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-13 12:26:26,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:26:26,701 INFO L85 PathProgramCache]: Analyzing trace with hash 17452875, now seen corresponding path program 1 times [2024-10-13 12:26:26,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:26:26,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1892930551] [2024-10-13 12:26:26,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:26:26,702 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-13 12:26:26,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:26:26,705 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-13 12:26:26,706 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-13 12:26:26,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:26:26,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:26:26,792 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:26:26,798 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-13 12:26:26,798 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:26:26,799 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:26:26,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1892930551] [2024-10-13 12:26:26,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1892930551] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:26:26,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:26:26,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:26:26,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631424935] [2024-10-13 12:26:26,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:26:26,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:26:26,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:26:26,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:26:26,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:26:26,800 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 124 [2024-10-13 12:26:26,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 106 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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-13 12:26:26,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:26:26,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 124 [2024-10-13 12:26:26,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:26:28,117 INFO L124 PetriNetUnfolderBase]: 9322/15614 cut-off events. [2024-10-13 12:26:28,118 INFO L125 PetriNetUnfolderBase]: For 186/186 co-relation queries the response was YES. [2024-10-13 12:26:28,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30340 conditions, 15614 events. 9322/15614 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 834. Compared 119285 event pairs, 8957 based on Foata normal form. 1/9011 useless extension candidates. Maximal degree in co-relation 16169. Up to 13949 conditions per place. [2024-10-13 12:26:28,206 INFO L140 encePairwiseOnDemand]: 121/124 looper letters, 93 selfloop transitions, 2 changer transitions 0/131 dead transitions. [2024-10-13 12:26:28,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 131 transitions, 460 flow [2024-10-13 12:26:28,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:26:28,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:26:28,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 222 transitions. [2024-10-13 12:26:28,211 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5967741935483871 [2024-10-13 12:26:28,211 INFO L175 Difference]: Start difference. First operand has 108 places, 106 transitions, 220 flow. Second operand 3 states and 222 transitions. [2024-10-13 12:26:28,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 131 transitions, 460 flow [2024-10-13 12:26:28,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 131 transitions, 456 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:26:28,215 INFO L231 Difference]: Finished difference. Result has 108 places, 105 transitions, 218 flow [2024-10-13 12:26:28,216 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=106, 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=108, PETRI_TRANSITIONS=105} [2024-10-13 12:26:28,217 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -10 predicate places. [2024-10-13 12:26:28,217 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 105 transitions, 218 flow [2024-10-13 12:26:28,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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-13 12:26:28,218 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:26:28,218 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:26:28,224 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-13 12:26:28,419 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-13 12:26:28,419 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-13 12:26:28,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:26:28,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1118249543, now seen corresponding path program 1 times [2024-10-13 12:26:28,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:26:28,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1729565001] [2024-10-13 12:26:28,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:26:28,421 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-13 12:26:28,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:26:28,424 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-13 12:26:28,425 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-13 12:26:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:26:28,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:26:28,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:26:28,565 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-13 12:26:28,566 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:26:28,566 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:26:28,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1729565001] [2024-10-13 12:26:28,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1729565001] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:26:28,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:26:28,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:26:28,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963601028] [2024-10-13 12:26:28,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:26:28,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:26:28,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:26:28,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:26:28,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:26:28,571 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 124 [2024-10-13 12:26:28,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 105 transitions, 218 flow. Second operand has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 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-13 12:26:28,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:26:28,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 124 [2024-10-13 12:26:28,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:26:29,858 INFO L124 PetriNetUnfolderBase]: 9321/16372 cut-off events. [2024-10-13 12:26:29,859 INFO L125 PetriNetUnfolderBase]: For 199/199 co-relation queries the response was YES. [2024-10-13 12:26:29,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31092 conditions, 16372 events. 9321/16372 cut-off events. For 199/199 co-relation queries the response was YES. Maximal size of possible extension queue 857. Compared 131897 event pairs, 9321 based on Foata normal form. 1/9713 useless extension candidates. Maximal degree in co-relation 29764. Up to 14494 conditions per place. [2024-10-13 12:26:29,943 INFO L140 encePairwiseOnDemand]: 120/124 looper letters, 74 selfloop transitions, 3 changer transitions 1/114 dead transitions. [2024-10-13 12:26:29,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 114 transitions, 394 flow [2024-10-13 12:26:29,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:26:29,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:26:29,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 251 transitions. [2024-10-13 12:26:29,945 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5060483870967742 [2024-10-13 12:26:29,945 INFO L175 Difference]: Start difference. First operand has 108 places, 105 transitions, 218 flow. Second operand 4 states and 251 transitions. [2024-10-13 12:26:29,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 114 transitions, 394 flow [2024-10-13 12:26:29,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 114 transitions, 388 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:26:29,959 INFO L231 Difference]: Finished difference. Result has 111 places, 107 transitions, 235 flow [2024-10-13 12:26:29,960 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=235, PETRI_PLACES=111, PETRI_TRANSITIONS=107} [2024-10-13 12:26:29,960 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -7 predicate places. [2024-10-13 12:26:29,961 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 107 transitions, 235 flow [2024-10-13 12:26:29,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 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-13 12:26:29,961 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:26:29,961 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:26:29,968 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-13 12:26:30,161 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-13 12:26:30,162 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-13 12:26:30,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:26:30,163 INFO L85 PathProgramCache]: Analyzing trace with hash 305997286, now seen corresponding path program 1 times [2024-10-13 12:26:30,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:26:30,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1401953278] [2024-10-13 12:26:30,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:26:30,164 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-13 12:26:30,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:26:30,166 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-13 12:26:30,167 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-13 12:26:30,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:26:30,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:26:30,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:26:30,263 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-13 12:26:30,278 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-13 12:26:30,278 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:26:30,278 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:26:30,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1401953278] [2024-10-13 12:26:30,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1401953278] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:26:30,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:26:30,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:26:30,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079360153] [2024-10-13 12:26:30,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:26:30,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:26:30,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:26:30,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:26:30,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:26:30,327 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 124 [2024-10-13 12:26:30,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 107 transitions, 235 flow. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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-13 12:26:30,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:26:30,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 124 [2024-10-13 12:26:30,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:26:31,955 INFO L124 PetriNetUnfolderBase]: 10049/16876 cut-off events. [2024-10-13 12:26:31,956 INFO L125 PetriNetUnfolderBase]: For 546/546 co-relation queries the response was YES. [2024-10-13 12:26:31,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33118 conditions, 16876 events. 10049/16876 cut-off events. For 546/546 co-relation queries the response was YES. Maximal size of possible extension queue 882. Compared 129157 event pairs, 9321 based on Foata normal form. 0/10098 useless extension candidates. Maximal degree in co-relation 33071. Up to 14501 conditions per place. [2024-10-13 12:26:32,024 INFO L140 encePairwiseOnDemand]: 115/124 looper letters, 95 selfloop transitions, 5 changer transitions 0/128 dead transitions. [2024-10-13 12:26:32,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 128 transitions, 477 flow [2024-10-13 12:26:32,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:26:32,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:26:32,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 208 transitions. [2024-10-13 12:26:32,026 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5591397849462365 [2024-10-13 12:26:32,026 INFO L175 Difference]: Start difference. First operand has 111 places, 107 transitions, 235 flow. Second operand 3 states and 208 transitions. [2024-10-13 12:26:32,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 128 transitions, 477 flow [2024-10-13 12:26:32,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 128 transitions, 476 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:26:32,036 INFO L231 Difference]: Finished difference. Result has 107 places, 102 transitions, 234 flow [2024-10-13 12:26:32,037 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=107, PETRI_TRANSITIONS=102} [2024-10-13 12:26:32,037 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -11 predicate places. [2024-10-13 12:26:32,037 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 102 transitions, 234 flow [2024-10-13 12:26:32,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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-13 12:26:32,038 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:26:32,038 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:26:32,044 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-13 12:26:32,238 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-13 12:26:32,239 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-13 12:26:32,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:26:32,239 INFO L85 PathProgramCache]: Analyzing trace with hash 305997287, now seen corresponding path program 1 times [2024-10-13 12:26:32,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:26:32,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1769747959] [2024-10-13 12:26:32,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:26:32,240 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-13 12:26:32,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:26:32,243 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-13 12:26:32,244 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-13 12:26:32,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:26:32,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:26:32,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:26:32,348 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-13 12:26:32,396 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-13 12:26:32,397 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:26:32,397 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:26:32,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1769747959] [2024-10-13 12:26:32,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1769747959] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:26:32,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:26:32,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:26:32,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460113137] [2024-10-13 12:26:32,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:26:32,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:26:32,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:26:32,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:26:32,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:26:32,452 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 124 [2024-10-13 12:26:32,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 102 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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-13 12:26:32,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:26:32,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 124 [2024-10-13 12:26:32,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:26:33,444 INFO L124 PetriNetUnfolderBase]: 9321/15680 cut-off events. [2024-10-13 12:26:33,444 INFO L125 PetriNetUnfolderBase]: For 941/941 co-relation queries the response was YES. [2024-10-13 12:26:33,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31004 conditions, 15680 events. 9321/15680 cut-off events. For 941/941 co-relation queries the response was YES. Maximal size of possible extension queue 819. Compared 121858 event pairs, 3107 based on Foata normal form. 394/9594 useless extension candidates. Maximal degree in co-relation 27898. Up to 9600 conditions per place. [2024-10-13 12:26:33,510 INFO L140 encePairwiseOnDemand]: 117/124 looper letters, 106 selfloop transitions, 4 changer transitions 0/135 dead transitions. [2024-10-13 12:26:33,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 135 transitions, 524 flow [2024-10-13 12:26:33,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:26:33,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:26:33,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 223 transitions. [2024-10-13 12:26:33,511 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5994623655913979 [2024-10-13 12:26:33,511 INFO L175 Difference]: Start difference. First operand has 107 places, 102 transitions, 234 flow. Second operand 3 states and 223 transitions. [2024-10-13 12:26:33,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 135 transitions, 524 flow [2024-10-13 12:26:33,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 135 transitions, 512 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:26:33,525 INFO L231 Difference]: Finished difference. Result has 108 places, 103 transitions, 250 flow [2024-10-13 12:26:33,525 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=250, PETRI_PLACES=108, PETRI_TRANSITIONS=103} [2024-10-13 12:26:33,526 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -10 predicate places. [2024-10-13 12:26:33,526 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 103 transitions, 250 flow [2024-10-13 12:26:33,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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-13 12:26:33,526 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:26:33,526 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:26:33,532 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 (7)] Forceful destruction successful, exit code 0 [2024-10-13 12:26:33,726 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-13 12:26:33,727 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-13 12:26:33,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:26:33,727 INFO L85 PathProgramCache]: Analyzing trace with hash 976462417, now seen corresponding path program 1 times [2024-10-13 12:26:33,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:26:33,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2016827110] [2024-10-13 12:26:33,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:26:33,728 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-13 12:26:33,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:26:33,731 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-13 12:26:33,732 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-13 12:26:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:26:33,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 12:26:33,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:26:33,840 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-13 12:26:33,879 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-13 12:26:33,879 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:26:33,880 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:26:33,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2016827110] [2024-10-13 12:26:33,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2016827110] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:26:33,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:26:33,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:26:33,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716532931] [2024-10-13 12:26:33,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:26:33,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:26:33,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:26:33,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:26:33,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:26:33,995 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 124 [2024-10-13 12:26:33,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 103 transitions, 250 flow. Second operand has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 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-13 12:26:33,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:26:33,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 124 [2024-10-13 12:26:33,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:26:35,202 INFO L124 PetriNetUnfolderBase]: 7623/13756 cut-off events. [2024-10-13 12:26:35,202 INFO L125 PetriNetUnfolderBase]: For 778/778 co-relation queries the response was YES. [2024-10-13 12:26:35,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26853 conditions, 13756 events. 7623/13756 cut-off events. For 778/778 co-relation queries the response was YES. Maximal size of possible extension queue 646. Compared 111293 event pairs, 253 based on Foata normal form. 0/9114 useless extension candidates. Maximal degree in co-relation 9239. Up to 9075 conditions per place. [2024-10-13 12:26:35,270 INFO L140 encePairwiseOnDemand]: 112/124 looper letters, 183 selfloop transitions, 13 changer transitions 0/227 dead transitions. [2024-10-13 12:26:35,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 227 transitions, 903 flow [2024-10-13 12:26:35,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 12:26:35,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-13 12:26:35,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 547 transitions. [2024-10-13 12:26:35,272 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5514112903225806 [2024-10-13 12:26:35,272 INFO L175 Difference]: Start difference. First operand has 108 places, 103 transitions, 250 flow. Second operand 8 states and 547 transitions. [2024-10-13 12:26:35,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 227 transitions, 903 flow [2024-10-13 12:26:35,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 227 transitions, 895 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-10-13 12:26:35,298 INFO L231 Difference]: Finished difference. Result has 118 places, 110 transitions, 331 flow [2024-10-13 12:26:35,298 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=331, PETRI_PLACES=118, PETRI_TRANSITIONS=110} [2024-10-13 12:26:35,299 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 0 predicate places. [2024-10-13 12:26:35,299 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 110 transitions, 331 flow [2024-10-13 12:26:35,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 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-13 12:26:35,300 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:26:35,300 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:26:35,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-13 12:26:35,500 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-13 12:26:35,501 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-13 12:26:35,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:26:35,502 INFO L85 PathProgramCache]: Analyzing trace with hash 976462418, now seen corresponding path program 1 times [2024-10-13 12:26:35,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:26:35,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2006693780] [2024-10-13 12:26:35,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:26:35,503 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-13 12:26:35,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:26:35,504 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-13 12:26:35,505 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-13 12:26:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:26:35,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 12:26:35,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:26:35,610 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-13 12:26:35,672 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-13 12:26:35,673 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:26:35,673 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:26:35,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2006693780] [2024-10-13 12:26:35,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2006693780] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:26:35,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:26:35,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:26:35,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9669162] [2024-10-13 12:26:35,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:26:35,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:26:35,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:26:35,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:26:35,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:26:35,798 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 124 [2024-10-13 12:26:35,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 110 transitions, 331 flow. Second operand has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 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-13 12:26:35,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:26:35,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 124 [2024-10-13 12:26:35,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:26:37,264 INFO L124 PetriNetUnfolderBase]: 6646/11793 cut-off events. [2024-10-13 12:26:37,265 INFO L125 PetriNetUnfolderBase]: For 4332/4332 co-relation queries the response was YES. [2024-10-13 12:26:37,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25123 conditions, 11793 events. 6646/11793 cut-off events. For 4332/4332 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 91682 event pairs, 845 based on Foata normal form. 524/9135 useless extension candidates. Maximal degree in co-relation 23658. Up to 6594 conditions per place. [2024-10-13 12:26:37,329 INFO L140 encePairwiseOnDemand]: 116/124 looper letters, 151 selfloop transitions, 10 changer transitions 1/193 dead transitions. [2024-10-13 12:26:37,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 193 transitions, 841 flow [2024-10-13 12:26:37,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 12:26:37,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-13 12:26:37,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 464 transitions. [2024-10-13 12:26:37,331 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5345622119815668 [2024-10-13 12:26:37,331 INFO L175 Difference]: Start difference. First operand has 118 places, 110 transitions, 331 flow. Second operand 7 states and 464 transitions. [2024-10-13 12:26:37,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 193 transitions, 841 flow [2024-10-13 12:26:37,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 193 transitions, 834 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-10-13 12:26:37,350 INFO L231 Difference]: Finished difference. Result has 126 places, 112 transitions, 379 flow [2024-10-13 12:26:37,350 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=379, PETRI_PLACES=126, PETRI_TRANSITIONS=112} [2024-10-13 12:26:37,351 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 8 predicate places. [2024-10-13 12:26:37,351 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 112 transitions, 379 flow [2024-10-13 12:26:37,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 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-13 12:26:37,351 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:26:37,351 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:26:37,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-13 12:26:37,551 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-13 12:26:37,552 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-13 12:26:37,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:26:37,553 INFO L85 PathProgramCache]: Analyzing trace with hash 244712209, now seen corresponding path program 1 times [2024-10-13 12:26:37,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:26:37,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1017001715] [2024-10-13 12:26:37,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:26:37,554 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-13 12:26:37,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:26:37,555 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-13 12:26:37,556 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-13 12:26:37,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:26:37,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 12:26:37,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:26:37,670 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-13 12:26:37,704 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-13 12:26:37,705 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:26:37,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:26:37,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1017001715] [2024-10-13 12:26:37,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1017001715] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:26:37,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:26:37,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:26:37,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722249142] [2024-10-13 12:26:37,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:26:37,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:26:37,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:26:37,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:26:37,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:26:37,804 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 124 [2024-10-13 12:26:37,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 112 transitions, 379 flow. Second operand has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 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-13 12:26:37,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:26:37,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 124 [2024-10-13 12:26:37,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:26:39,436 INFO L124 PetriNetUnfolderBase]: 5575/9967 cut-off events. [2024-10-13 12:26:39,436 INFO L125 PetriNetUnfolderBase]: For 6993/6993 co-relation queries the response was YES. [2024-10-13 12:26:39,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23148 conditions, 9967 events. 5575/9967 cut-off events. For 6993/6993 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 74996 event pairs, 653 based on Foata normal form. 0/7770 useless extension candidates. Maximal degree in co-relation 20966. Up to 6421 conditions per place. [2024-10-13 12:26:39,497 INFO L140 encePairwiseOnDemand]: 112/124 looper letters, 174 selfloop transitions, 17 changer transitions 0/222 dead transitions. [2024-10-13 12:26:39,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 222 transitions, 1126 flow [2024-10-13 12:26:39,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 12:26:39,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-13 12:26:39,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 530 transitions. [2024-10-13 12:26:39,499 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5342741935483871 [2024-10-13 12:26:39,499 INFO L175 Difference]: Start difference. First operand has 126 places, 112 transitions, 379 flow. Second operand 8 states and 530 transitions. [2024-10-13 12:26:39,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 222 transitions, 1126 flow [2024-10-13 12:26:39,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 222 transitions, 1096 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-13 12:26:39,519 INFO L231 Difference]: Finished difference. Result has 132 places, 121 transitions, 486 flow [2024-10-13 12:26:39,519 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=486, PETRI_PLACES=132, PETRI_TRANSITIONS=121} [2024-10-13 12:26:39,519 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 14 predicate places. [2024-10-13 12:26:39,519 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 121 transitions, 486 flow [2024-10-13 12:26:39,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 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-13 12:26:39,520 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:26:39,520 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:26:39,527 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-13 12:26:39,720 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-13 12:26:39,721 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-13 12:26:39,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:26:39,721 INFO L85 PathProgramCache]: Analyzing trace with hash 244712210, now seen corresponding path program 1 times [2024-10-13 12:26:39,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:26:39,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1387711144] [2024-10-13 12:26:39,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:26:39,722 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-13 12:26:39,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:26:39,723 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-13 12:26:39,724 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-13 12:26:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:26:39,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 12:26:39,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:26:39,857 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-13 12:26:39,933 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-13 12:26:39,934 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:26:39,934 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:26:39,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1387711144] [2024-10-13 12:26:39,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1387711144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:26:39,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:26:39,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:26:39,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116380151] [2024-10-13 12:26:39,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:26:39,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:26:39,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:26:39,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:26:39,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:26:40,128 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 124 [2024-10-13 12:26:40,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 121 transitions, 486 flow. Second operand has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 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-13 12:26:40,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:26:40,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 124 [2024-10-13 12:26:40,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:26:41,528 INFO L124 PetriNetUnfolderBase]: 4926/8678 cut-off events. [2024-10-13 12:26:41,528 INFO L125 PetriNetUnfolderBase]: For 8054/8056 co-relation queries the response was YES. [2024-10-13 12:26:41,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21879 conditions, 8678 events. 4926/8678 cut-off events. For 8054/8056 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 62594 event pairs, 1266 based on Foata normal form. 378/7832 useless extension candidates. Maximal degree in co-relation 19986. Up to 5127 conditions per place. [2024-10-13 12:26:41,581 INFO L140 encePairwiseOnDemand]: 116/124 looper letters, 145 selfloop transitions, 14 changer transitions 1/191 dead transitions. [2024-10-13 12:26:41,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 191 transitions, 1048 flow [2024-10-13 12:26:41,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 12:26:41,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-13 12:26:41,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 448 transitions. [2024-10-13 12:26:41,584 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5161290322580645 [2024-10-13 12:26:41,584 INFO L175 Difference]: Start difference. First operand has 132 places, 121 transitions, 486 flow. Second operand 7 states and 448 transitions. [2024-10-13 12:26:41,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 191 transitions, 1048 flow [2024-10-13 12:26:41,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 191 transitions, 1045 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:26:41,604 INFO L231 Difference]: Finished difference. Result has 140 places, 124 transitions, 561 flow [2024-10-13 12:26:41,604 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=561, PETRI_PLACES=140, PETRI_TRANSITIONS=124} [2024-10-13 12:26:41,604 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 22 predicate places. [2024-10-13 12:26:41,605 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 124 transitions, 561 flow [2024-10-13 12:26:41,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 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-13 12:26:41,605 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:26:41,605 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:26:41,616 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 (11)] Ended with exit code 0 [2024-10-13 12:26:41,805 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-13 12:26:41,806 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-13 12:26:41,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:26:41,806 INFO L85 PathProgramCache]: Analyzing trace with hash 242287941, now seen corresponding path program 1 times [2024-10-13 12:26:41,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:26:41,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [725082054] [2024-10-13 12:26:41,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:26:41,807 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-13 12:26:41,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:26:41,808 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-13 12:26:41,809 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-13 12:26:41,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:26:41,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 12:26:41,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:26:41,953 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-13 12:26:41,997 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-13 12:26:41,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-10-13 12:26:42,039 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-13 12:26:42,039 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:26:42,039 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:26:42,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [725082054] [2024-10-13 12:26:42,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [725082054] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:26:42,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:26:42,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:26:42,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82623508] [2024-10-13 12:26:42,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:26:42,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:26:42,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:26:42,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:26:42,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:26:42,197 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 124 [2024-10-13 12:26:42,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 124 transitions, 561 flow. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 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-13 12:26:42,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:26:42,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 124 [2024-10-13 12:26:42,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:26:43,692 INFO L124 PetriNetUnfolderBase]: 4270/7291 cut-off events. [2024-10-13 12:26:43,693 INFO L125 PetriNetUnfolderBase]: For 10677/10696 co-relation queries the response was YES. [2024-10-13 12:26:43,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20331 conditions, 7291 events. 4270/7291 cut-off events. For 10677/10696 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 48830 event pairs, 2034 based on Foata normal form. 2/6536 useless extension candidates. Maximal degree in co-relation 18406. Up to 3737 conditions per place. [2024-10-13 12:26:43,730 INFO L140 encePairwiseOnDemand]: 115/124 looper letters, 101 selfloop transitions, 13 changer transitions 0/142 dead transitions. [2024-10-13 12:26:43,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 142 transitions, 845 flow [2024-10-13 12:26:43,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:26:43,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:26:43,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 240 transitions. [2024-10-13 12:26:43,731 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4838709677419355 [2024-10-13 12:26:43,731 INFO L175 Difference]: Start difference. First operand has 140 places, 124 transitions, 561 flow. Second operand 4 states and 240 transitions. [2024-10-13 12:26:43,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 142 transitions, 845 flow [2024-10-13 12:26:43,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 142 transitions, 824 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-13 12:26:43,743 INFO L231 Difference]: Finished difference. Result has 134 places, 120 transitions, 558 flow [2024-10-13 12:26:43,743 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=558, PETRI_PLACES=134, PETRI_TRANSITIONS=120} [2024-10-13 12:26:43,744 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 16 predicate places. [2024-10-13 12:26:43,744 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 120 transitions, 558 flow [2024-10-13 12:26:43,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 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-13 12:26:43,744 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:26:43,744 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:26:43,750 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 (12)] Forceful destruction successful, exit code 0 [2024-10-13 12:26:43,944 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-13 12:26:43,945 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-13 12:26:43,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:26:43,945 INFO L85 PathProgramCache]: Analyzing trace with hash 242287942, now seen corresponding path program 1 times [2024-10-13 12:26:43,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:26:43,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1184645281] [2024-10-13 12:26:43,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:26:43,946 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:26:43,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:26:43,947 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-13 12:26:43,947 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-13 12:26:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:26:44,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 12:26:44,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:26:44,088 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-13 12:26:44,092 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-13 12:26:44,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 12:26:44,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 12:26:44,184 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 12:26:44,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-13 12:26:44,198 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-13 12:26:44,198 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:26:44,198 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:26:44,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1184645281] [2024-10-13 12:26:44,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1184645281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:26:44,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:26:44,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:26:44,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391424813] [2024-10-13 12:26:44,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:26:44,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:26:44,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:26:44,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:26:44,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:26:44,281 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 124 [2024-10-13 12:26:44,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 120 transitions, 558 flow. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 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-13 12:26:44,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:26:44,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 124 [2024-10-13 12:26:44,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:26:44,997 INFO L124 PetriNetUnfolderBase]: 3166/5613 cut-off events. [2024-10-13 12:26:44,997 INFO L125 PetriNetUnfolderBase]: For 8582/8601 co-relation queries the response was YES. [2024-10-13 12:26:45,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15814 conditions, 5613 events. 3166/5613 cut-off events. For 8582/8601 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 37474 event pairs, 1578 based on Foata normal form. 2/5332 useless extension candidates. Maximal degree in co-relation 14098. Up to 2373 conditions per place. [2024-10-13 12:26:45,020 INFO L140 encePairwiseOnDemand]: 116/124 looper letters, 109 selfloop transitions, 11 changer transitions 0/144 dead transitions. [2024-10-13 12:26:45,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 144 transitions, 866 flow [2024-10-13 12:26:45,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:26:45,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:26:45,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 231 transitions. [2024-10-13 12:26:45,021 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4657258064516129 [2024-10-13 12:26:45,021 INFO L175 Difference]: Start difference. First operand has 134 places, 120 transitions, 558 flow. Second operand 4 states and 231 transitions. [2024-10-13 12:26:45,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 144 transitions, 866 flow [2024-10-13 12:26:45,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 144 transitions, 840 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-13 12:26:45,031 INFO L231 Difference]: Finished difference. Result has 130 places, 116 transitions, 546 flow [2024-10-13 12:26:45,031 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=546, PETRI_PLACES=130, PETRI_TRANSITIONS=116} [2024-10-13 12:26:45,032 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 12 predicate places. [2024-10-13 12:26:45,032 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 116 transitions, 546 flow [2024-10-13 12:26:45,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 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-13 12:26:45,032 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:26:45,033 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:26:45,039 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-13 12:26:45,233 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-13 12:26:45,233 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-13 12:26:45,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:26:45,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1770643278, now seen corresponding path program 1 times [2024-10-13 12:26:45,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:26:45,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [364493609] [2024-10-13 12:26:45,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:26:45,234 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-13 12:26:45,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:26:45,235 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-13 12:26:45,236 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-13 12:26:45,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:26:45,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 12:26:45,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:26:45,400 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 12:26:45,401 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 12:26:45,402 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 12:26:45,408 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-13 12:26:45,455 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 12:26:45,455 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-13 12:26:45,494 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 12:26:45,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 121 treesize of output 49 [2024-10-13 12:26:45,505 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-13 12:26:45,506 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:26:45,506 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:26:45,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [364493609] [2024-10-13 12:26:45,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [364493609] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:26:45,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:26:45,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:26:45,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223572486] [2024-10-13 12:26:45,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:26:45,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:26:45,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:26:45,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:26:45,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:26:45,641 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 124 [2024-10-13 12:26:45,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 116 transitions, 546 flow. Second operand has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 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-13 12:26:45,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:26:45,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 124 [2024-10-13 12:26:45,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:26:47,195 INFO L124 PetriNetUnfolderBase]: 3824/6857 cut-off events. [2024-10-13 12:26:47,196 INFO L125 PetriNetUnfolderBase]: For 10625/10629 co-relation queries the response was YES. [2024-10-13 12:26:47,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18972 conditions, 6857 events. 3824/6857 cut-off events. For 10625/10629 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 48250 event pairs, 2502 based on Foata normal form. 123/6707 useless extension candidates. Maximal degree in co-relation 17047. Up to 5358 conditions per place. [2024-10-13 12:26:47,235 INFO L140 encePairwiseOnDemand]: 115/124 looper letters, 119 selfloop transitions, 18 changer transitions 0/166 dead transitions. [2024-10-13 12:26:47,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 166 transitions, 1032 flow [2024-10-13 12:26:47,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:26:47,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:26:47,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 318 transitions. [2024-10-13 12:26:47,237 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5129032258064516 [2024-10-13 12:26:47,237 INFO L175 Difference]: Start difference. First operand has 130 places, 116 transitions, 546 flow. Second operand 5 states and 318 transitions. [2024-10-13 12:26:47,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 166 transitions, 1032 flow [2024-10-13 12:26:47,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 166 transitions, 1004 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-13 12:26:47,252 INFO L231 Difference]: Finished difference. Result has 134 places, 130 transitions, 692 flow [2024-10-13 12:26:47,252 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=692, PETRI_PLACES=134, PETRI_TRANSITIONS=130} [2024-10-13 12:26:47,252 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 16 predicate places. [2024-10-13 12:26:47,253 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 130 transitions, 692 flow [2024-10-13 12:26:47,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 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-13 12:26:47,253 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:26:47,253 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:26:47,264 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 (14)] Ended with exit code 0 [2024-10-13 12:26:47,453 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-13 12:26:47,454 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-13 12:26:47,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:26:47,454 INFO L85 PathProgramCache]: Analyzing trace with hash 910496269, now seen corresponding path program 1 times [2024-10-13 12:26:47,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:26:47,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [809384796] [2024-10-13 12:26:47,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:26:47,455 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-13 12:26:47,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:26:47,457 INFO L229 MonitoredProcess]: Starting monitored process 15 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-13 12:26:47,457 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 (15)] Waiting until timeout for monitored process [2024-10-13 12:26:47,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:26:47,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 12:26:47,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:26:47,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 12:26:47,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 12:26:47,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 12:26:47,649 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 12:26:47,650 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 12:26:47,652 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-13 12:26:47,696 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 12:26:47,696 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 88 treesize of output 63 [2024-10-13 12:26:47,727 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-13 12:26:47,728 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:26:47,728 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:26:47,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [809384796] [2024-10-13 12:26:47,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [809384796] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:26:47,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:26:47,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:26:47,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470797036] [2024-10-13 12:26:47,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:26:47,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:26:47,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:26:47,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:26:47,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:26:47,835 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 124 [2024-10-13 12:26:47,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 130 transitions, 692 flow. Second operand has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 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-13 12:26:47,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:26:47,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 124 [2024-10-13 12:26:47,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:26:49,256 INFO L124 PetriNetUnfolderBase]: 5230/8992 cut-off events. [2024-10-13 12:26:49,257 INFO L125 PetriNetUnfolderBase]: For 16546/16550 co-relation queries the response was YES. [2024-10-13 12:26:49,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27920 conditions, 8992 events. 5230/8992 cut-off events. For 16546/16550 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 63723 event pairs, 2456 based on Foata normal form. 2/8516 useless extension candidates. Maximal degree in co-relation 26564. Up to 6340 conditions per place. [2024-10-13 12:26:49,317 INFO L140 encePairwiseOnDemand]: 114/124 looper letters, 139 selfloop transitions, 13 changer transitions 0/180 dead transitions. [2024-10-13 12:26:49,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 180 transitions, 1226 flow [2024-10-13 12:26:49,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:26:49,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:26:49,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 275 transitions. [2024-10-13 12:26:49,319 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5544354838709677 [2024-10-13 12:26:49,320 INFO L175 Difference]: Start difference. First operand has 134 places, 130 transitions, 692 flow. Second operand 4 states and 275 transitions. [2024-10-13 12:26:49,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 180 transitions, 1226 flow [2024-10-13 12:26:49,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 180 transitions, 1226 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 12:26:49,344 INFO L231 Difference]: Finished difference. Result has 140 places, 142 transitions, 842 flow [2024-10-13 12:26:49,344 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=842, PETRI_PLACES=140, PETRI_TRANSITIONS=142} [2024-10-13 12:26:49,345 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 22 predicate places. [2024-10-13 12:26:49,345 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 142 transitions, 842 flow [2024-10-13 12:26:49,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 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-13 12:26:49,345 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:26:49,345 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:26:49,358 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 (15)] Forceful destruction successful, exit code 0 [2024-10-13 12:26:49,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-13 12:26:49,546 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-13 12:26:49,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:26:49,546 INFO L85 PathProgramCache]: Analyzing trace with hash 2064447640, now seen corresponding path program 1 times [2024-10-13 12:26:49,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:26:49,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [697517515] [2024-10-13 12:26:49,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:26:49,547 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-13 12:26:49,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:26:49,548 INFO L229 MonitoredProcess]: Starting monitored process 16 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-13 12:26:49,549 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 (16)] Waiting until timeout for monitored process [2024-10-13 12:26:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:26:49,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-13 12:26:49,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:26:49,707 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-13 12:26:49,712 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-13 12:26:49,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 12:26:49,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 12:26:49,826 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 12:26:49,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-13 12:26:49,841 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-13 12:26:49,842 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:26:49,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:26:49,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [697517515] [2024-10-13 12:26:49,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [697517515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:26:49,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:26:49,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 12:26:49,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050530306] [2024-10-13 12:26:49,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:26:49,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:26:49,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:26:49,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:26:49,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:26:50,135 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 124 [2024-10-13 12:26:50,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 142 transitions, 842 flow. Second operand has 6 states, 6 states have (on average 45.166666666666664) internal successors, (271), 6 states have internal predecessors, (271), 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-13 12:26:50,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:26:50,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 124 [2024-10-13 12:26:50,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:26:51,419 INFO L124 PetriNetUnfolderBase]: 4508/8367 cut-off events. [2024-10-13 12:26:51,419 INFO L125 PetriNetUnfolderBase]: For 20024/20030 co-relation queries the response was YES. [2024-10-13 12:26:51,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27253 conditions, 8367 events. 4508/8367 cut-off events. For 20024/20030 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 62933 event pairs, 1149 based on Foata normal form. 436/8777 useless extension candidates. Maximal degree in co-relation 25842. Up to 4834 conditions per place. [2024-10-13 12:26:51,470 INFO L140 encePairwiseOnDemand]: 112/124 looper letters, 200 selfloop transitions, 22 changer transitions 0/253 dead transitions. [2024-10-13 12:26:51,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 253 transitions, 1839 flow [2024-10-13 12:26:51,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 12:26:51,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-13 12:26:51,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 557 transitions. [2024-10-13 12:26:51,472 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49910394265232977 [2024-10-13 12:26:51,472 INFO L175 Difference]: Start difference. First operand has 140 places, 142 transitions, 842 flow. Second operand 9 states and 557 transitions. [2024-10-13 12:26:51,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 253 transitions, 1839 flow [2024-10-13 12:26:51,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 253 transitions, 1782 flow, removed 24 selfloop flow, removed 2 redundant places. [2024-10-13 12:26:51,508 INFO L231 Difference]: Finished difference. Result has 144 places, 140 transitions, 844 flow [2024-10-13 12:26:51,508 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=844, PETRI_PLACES=144, PETRI_TRANSITIONS=140} [2024-10-13 12:26:51,508 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 26 predicate places. [2024-10-13 12:26:51,508 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 140 transitions, 844 flow [2024-10-13 12:26:51,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.166666666666664) internal successors, (271), 6 states have internal predecessors, (271), 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-13 12:26:51,509 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:26:51,509 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:26:51,516 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 (16)] Ended with exit code 0 [2024-10-13 12:26:51,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-13 12:26:51,710 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-13 12:26:51,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:26:51,710 INFO L85 PathProgramCache]: Analyzing trace with hash -649154958, now seen corresponding path program 1 times [2024-10-13 12:26:51,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:26:51,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1898529544] [2024-10-13 12:26:51,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:26:51,711 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-13 12:26:51,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:26:51,712 INFO L229 MonitoredProcess]: Starting monitored process 17 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-13 12:26:51,713 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 (17)] Waiting until timeout for monitored process [2024-10-13 12:26:51,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:26:51,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-13 12:26:51,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:26:51,862 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-13 12:26:51,866 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-13 12:26:51,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 12:26:51,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 12:26:51,981 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 12:26:51,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-13 12:26:52,006 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-13 12:26:52,006 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:26:52,007 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:26:52,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1898529544] [2024-10-13 12:26:52,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1898529544] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:26:52,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:26:52,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 12:26:52,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430017268] [2024-10-13 12:26:52,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:26:52,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:26:52,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:26:52,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:26:52,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:26:52,260 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 124 [2024-10-13 12:26:52,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 140 transitions, 844 flow. Second operand has 6 states, 6 states have (on average 45.166666666666664) internal successors, (271), 6 states have internal predecessors, (271), 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-13 12:26:52,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:26:52,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 124 [2024-10-13 12:26:52,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:26:53,551 INFO L124 PetriNetUnfolderBase]: 4439/8376 cut-off events. [2024-10-13 12:26:53,551 INFO L125 PetriNetUnfolderBase]: For 19895/19899 co-relation queries the response was YES. [2024-10-13 12:26:53,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26957 conditions, 8376 events. 4439/8376 cut-off events. For 19895/19899 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 64740 event pairs, 1146 based on Foata normal form. 328/8684 useless extension candidates. Maximal degree in co-relation 25536. Up to 4020 conditions per place. [2024-10-13 12:26:53,590 INFO L140 encePairwiseOnDemand]: 112/124 looper letters, 204 selfloop transitions, 22 changer transitions 0/257 dead transitions. [2024-10-13 12:26:53,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 257 transitions, 1887 flow [2024-10-13 12:26:53,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 12:26:53,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-13 12:26:53,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 558 transitions. [2024-10-13 12:26:53,592 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-10-13 12:26:53,592 INFO L175 Difference]: Start difference. First operand has 144 places, 140 transitions, 844 flow. Second operand 9 states and 558 transitions. [2024-10-13 12:26:53,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 257 transitions, 1887 flow [2024-10-13 12:26:53,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 257 transitions, 1838 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-10-13 12:26:53,632 INFO L231 Difference]: Finished difference. Result has 142 places, 138 transitions, 846 flow [2024-10-13 12:26:53,633 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=785, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=846, PETRI_PLACES=142, PETRI_TRANSITIONS=138} [2024-10-13 12:26:53,633 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 24 predicate places. [2024-10-13 12:26:53,633 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 138 transitions, 846 flow [2024-10-13 12:26:53,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.166666666666664) internal successors, (271), 6 states have internal predecessors, (271), 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-13 12:26:53,633 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:26:53,633 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:26:53,640 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 (17)] Ended with exit code 0 [2024-10-13 12:26:53,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-13 12:26:53,834 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-13 12:26:53,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:26:53,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1839386097, now seen corresponding path program 1 times [2024-10-13 12:26:53,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:26:53,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [926170417] [2024-10-13 12:26:53,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:26:53,835 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-13 12:26:53,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:26:53,836 INFO L229 MonitoredProcess]: Starting monitored process 18 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-13 12:26:53,837 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 (18)] Waiting until timeout for monitored process [2024-10-13 12:26:54,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:26:54,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 12:26:54,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:26:54,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 12:26:54,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 12:26:54,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 12:26:54,031 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 12:26:54,037 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 12:26:54,039 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-13 12:26:54,066 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-13 12:26:54,066 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:26:54,067 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:26:54,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [926170417] [2024-10-13 12:26:54,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [926170417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:26:54,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:26:54,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:26:54,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361009466] [2024-10-13 12:26:54,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:26:54,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:26:54,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:26:54,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:26:54,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:26:54,151 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 124 [2024-10-13 12:26:54,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 138 transitions, 846 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-13 12:26:54,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:26:54,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 124 [2024-10-13 12:26:54,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:26:55,224 INFO L124 PetriNetUnfolderBase]: 4949/8829 cut-off events. [2024-10-13 12:26:55,225 INFO L125 PetriNetUnfolderBase]: For 21575/21577 co-relation queries the response was YES. [2024-10-13 12:26:55,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29724 conditions, 8829 events. 4949/8829 cut-off events. For 21575/21577 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 64876 event pairs, 3136 based on Foata normal form. 120/8900 useless extension candidates. Maximal degree in co-relation 28304. Up to 7173 conditions per place. [2024-10-13 12:26:55,277 INFO L140 encePairwiseOnDemand]: 116/124 looper letters, 118 selfloop transitions, 18 changer transitions 0/164 dead transitions. [2024-10-13 12:26:55,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 164 transitions, 1269 flow [2024-10-13 12:26:55,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:26:55,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:26:55,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 200 transitions. [2024-10-13 12:26:55,278 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5376344086021505 [2024-10-13 12:26:55,279 INFO L175 Difference]: Start difference. First operand has 142 places, 138 transitions, 846 flow. Second operand 3 states and 200 transitions. [2024-10-13 12:26:55,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 164 transitions, 1269 flow [2024-10-13 12:26:55,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 164 transitions, 1234 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-13 12:26:55,315 INFO L231 Difference]: Finished difference. Result has 140 places, 149 transitions, 1008 flow [2024-10-13 12:26:55,316 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1008, PETRI_PLACES=140, PETRI_TRANSITIONS=149} [2024-10-13 12:26:55,316 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 22 predicate places. [2024-10-13 12:26:55,316 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 149 transitions, 1008 flow [2024-10-13 12:26:55,316 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-13 12:26:55,316 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:26:55,317 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:26:55,324 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 (18)] Ended with exit code 0 [2024-10-13 12:26:55,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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-13 12:26:55,517 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-13 12:26:55,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:26:55,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1445718879, now seen corresponding path program 1 times [2024-10-13 12:26:55,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:26:55,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [145132262] [2024-10-13 12:26:55,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:26:55,518 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-13 12:26:55,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:26:55,520 INFO L229 MonitoredProcess]: Starting monitored process 19 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-13 12:26:55,520 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 (19)] Waiting until timeout for monitored process [2024-10-13 12:26:55,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:26:55,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 12:26:55,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:26:55,684 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 12:26:55,685 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 12:26:55,685 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 12:26:55,686 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-13 12:26:55,749 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 12:26:55,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 121 treesize of output 49 [2024-10-13 12:26:55,759 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-13 12:26:55,760 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:26:55,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:26:55,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [145132262] [2024-10-13 12:26:55,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [145132262] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:26:55,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:26:55,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:26:55,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156547588] [2024-10-13 12:26:55,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:26:55,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:26:55,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:26:55,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:26:55,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:26:55,869 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 124 [2024-10-13 12:26:55,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 149 transitions, 1008 flow. Second operand has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 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-13 12:26:55,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:26:55,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 124 [2024-10-13 12:26:55,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:26:57,624 INFO L124 PetriNetUnfolderBase]: 5321/9768 cut-off events. [2024-10-13 12:26:57,624 INFO L125 PetriNetUnfolderBase]: For 31406/31408 co-relation queries the response was YES. [2024-10-13 12:26:57,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34805 conditions, 9768 events. 5321/9768 cut-off events. For 31406/31408 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 75509 event pairs, 3101 based on Foata normal form. 177/9900 useless extension candidates. Maximal degree in co-relation 32648. Up to 7480 conditions per place. [2024-10-13 12:26:57,699 INFO L140 encePairwiseOnDemand]: 116/124 looper letters, 146 selfloop transitions, 34 changer transitions 0/209 dead transitions. [2024-10-13 12:26:57,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 209 transitions, 1794 flow [2024-10-13 12:26:57,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:26:57,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:26:57,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 312 transitions. [2024-10-13 12:26:57,701 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5032258064516129 [2024-10-13 12:26:57,701 INFO L175 Difference]: Start difference. First operand has 140 places, 149 transitions, 1008 flow. Second operand 5 states and 312 transitions. [2024-10-13 12:26:57,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 209 transitions, 1794 flow [2024-10-13 12:26:57,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 209 transitions, 1742 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-10-13 12:26:57,814 INFO L231 Difference]: Finished difference. Result has 145 places, 172 transitions, 1365 flow [2024-10-13 12:26:57,815 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=956, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1365, PETRI_PLACES=145, PETRI_TRANSITIONS=172} [2024-10-13 12:26:57,815 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 27 predicate places. [2024-10-13 12:26:57,815 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 172 transitions, 1365 flow [2024-10-13 12:26:57,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 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-13 12:26:57,815 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:26:57,815 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:26:57,824 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 (19)] Forceful destruction successful, exit code 0 [2024-10-13 12:26:58,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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-13 12:26:58,016 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-13 12:26:58,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:26:58,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1867513367, now seen corresponding path program 1 times [2024-10-13 12:26:58,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:26:58,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [357454401] [2024-10-13 12:26:58,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:26:58,017 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-13 12:26:58,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:26:58,018 INFO L229 MonitoredProcess]: Starting monitored process 20 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-13 12:26:58,019 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 (20)] Waiting until timeout for monitored process [2024-10-13 12:26:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:26:58,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 12:26:58,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:26:58,260 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#data~1#1.base_89| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#data~1#1.base_89|)) (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#data~1#1.base_89| (_ bv0 1))))) is different from true [2024-10-13 12:26:58,268 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-13 12:26:58,268 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:26:58,268 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:26:58,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [357454401] [2024-10-13 12:26:58,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [357454401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:26:58,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:26:58,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:26:58,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135550003] [2024-10-13 12:26:58,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:26:58,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:26:58,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:26:58,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:26:58,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2024-10-13 12:26:58,304 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 124 [2024-10-13 12:26:58,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 172 transitions, 1365 flow. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 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-13 12:26:58,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:26:58,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 124 [2024-10-13 12:26:58,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:26:59,579 INFO L124 PetriNetUnfolderBase]: 5512/9969 cut-off events. [2024-10-13 12:26:59,579 INFO L125 PetriNetUnfolderBase]: For 41512/41514 co-relation queries the response was YES. [2024-10-13 12:26:59,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38053 conditions, 9969 events. 5512/9969 cut-off events. For 41512/41514 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 75795 event pairs, 2147 based on Foata normal form. 1/9931 useless extension candidates. Maximal degree in co-relation 35710. Up to 3484 conditions per place. [2024-10-13 12:26:59,656 INFO L140 encePairwiseOnDemand]: 98/124 looper letters, 160 selfloop transitions, 40 changer transitions 4/222 dead transitions. [2024-10-13 12:26:59,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 222 transitions, 2065 flow [2024-10-13 12:26:59,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:26:59,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:26:59,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 242 transitions. [2024-10-13 12:26:59,658 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3903225806451613 [2024-10-13 12:26:59,658 INFO L175 Difference]: Start difference. First operand has 145 places, 172 transitions, 1365 flow. Second operand 5 states and 242 transitions. [2024-10-13 12:26:59,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 222 transitions, 2065 flow [2024-10-13 12:26:59,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 222 transitions, 2019 flow, removed 23 selfloop flow, removed 0 redundant places. [2024-10-13 12:26:59,774 INFO L231 Difference]: Finished difference. Result has 152 places, 190 transitions, 1607 flow [2024-10-13 12:26:59,775 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=1319, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1607, PETRI_PLACES=152, PETRI_TRANSITIONS=190} [2024-10-13 12:26:59,775 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 34 predicate places. [2024-10-13 12:26:59,775 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 190 transitions, 1607 flow [2024-10-13 12:26:59,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 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-13 12:26:59,775 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:26:59,775 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:26:59,784 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 (20)] Forceful destruction successful, exit code 0 [2024-10-13 12:26:59,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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-13 12:26:59,976 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-13 12:26:59,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:26:59,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1748656589, now seen corresponding path program 1 times [2024-10-13 12:26:59,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:26:59,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1431773994] [2024-10-13 12:26:59,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:26:59,977 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-13 12:26:59,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:26:59,979 INFO L229 MonitoredProcess]: Starting monitored process 21 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-13 12:26:59,980 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 (21)] Waiting until timeout for monitored process [2024-10-13 12:27:00,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:27:00,209 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 12:27:00,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:27:00,360 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-13 12:27:00,360 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 12:27:00,361 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (54 of 55 remaining) [2024-10-13 12:27:00,363 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 55 remaining) [2024-10-13 12:27:00,363 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 55 remaining) [2024-10-13 12:27:00,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (51 of 55 remaining) [2024-10-13 12:27:00,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 55 remaining) [2024-10-13 12:27:00,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 55 remaining) [2024-10-13 12:27:00,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 55 remaining) [2024-10-13 12:27:00,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 55 remaining) [2024-10-13 12:27:00,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 55 remaining) [2024-10-13 12:27:00,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 55 remaining) [2024-10-13 12:27:00,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 55 remaining) [2024-10-13 12:27:00,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 55 remaining) [2024-10-13 12:27:00,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 55 remaining) [2024-10-13 12:27:00,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 55 remaining) [2024-10-13 12:27:00,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 55 remaining) [2024-10-13 12:27:00,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 55 remaining) [2024-10-13 12:27:00,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 55 remaining) [2024-10-13 12:27:00,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 55 remaining) [2024-10-13 12:27:00,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 55 remaining) [2024-10-13 12:27:00,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 55 remaining) [2024-10-13 12:27:00,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (34 of 55 remaining) [2024-10-13 12:27:00,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 55 remaining) [2024-10-13 12:27:00,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 55 remaining) [2024-10-13 12:27:00,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 55 remaining) [2024-10-13 12:27:00,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 55 remaining) [2024-10-13 12:27:00,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (29 of 55 remaining) [2024-10-13 12:27:00,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 55 remaining) [2024-10-13 12:27:00,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 55 remaining) [2024-10-13 12:27:00,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 55 remaining) [2024-10-13 12:27:00,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 55 remaining) [2024-10-13 12:27:00,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK (24 of 55 remaining) [2024-10-13 12:27:00,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 55 remaining) [2024-10-13 12:27:00,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 55 remaining) [2024-10-13 12:27:00,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (21 of 55 remaining) [2024-10-13 12:27:00,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK (20 of 55 remaining) [2024-10-13 12:27:00,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 55 remaining) [2024-10-13 12:27:00,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 55 remaining) [2024-10-13 12:27:00,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 55 remaining) [2024-10-13 12:27:00,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 55 remaining) [2024-10-13 12:27:00,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 55 remaining) [2024-10-13 12:27:00,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 55 remaining) [2024-10-13 12:27:00,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 55 remaining) [2024-10-13 12:27:00,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 55 remaining) [2024-10-13 12:27:00,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 55 remaining) [2024-10-13 12:27:00,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 55 remaining) [2024-10-13 12:27:00,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 55 remaining) [2024-10-13 12:27:00,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 55 remaining) [2024-10-13 12:27:00,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 55 remaining) [2024-10-13 12:27:00,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 55 remaining) [2024-10-13 12:27:00,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 55 remaining) [2024-10-13 12:27:00,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 55 remaining) [2024-10-13 12:27:00,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 55 remaining) [2024-10-13 12:27:00,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 55 remaining) [2024-10-13 12:27:00,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 55 remaining) [2024-10-13 12:27:00,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 55 remaining) [2024-10-13 12:27:00,376 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 (21)] Ended with exit code 0 [2024-10-13 12:27:00,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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-13 12:27:00,570 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:27:00,606 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 12:27:00,606 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 12:27:00,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:27:00 BasicIcfg [2024-10-13 12:27:00,610 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 12:27:00,611 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 12:27:00,611 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 12:27:00,611 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 12:27:00,611 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:26:21" (3/4) ... [2024-10-13 12:27:00,612 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 12:27:00,613 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 12:27:00,614 INFO L158 Benchmark]: Toolchain (without parser) took 40821.43ms. Allocated memory was 71.3MB in the beginning and 5.3GB in the end (delta: 5.2GB). Free memory was 50.9MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 3.3GB. Max. memory is 16.1GB. [2024-10-13 12:27:00,614 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 71.3MB. Free memory is still 51.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:27:00,614 INFO L158 Benchmark]: CACSL2BoogieTranslator took 651.90ms. Allocated memory was 71.3MB in the beginning and 117.4MB in the end (delta: 46.1MB). Free memory was 50.9MB in the beginning and 65.0MB in the end (delta: -14.0MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. [2024-10-13 12:27:00,615 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.23ms. Allocated memory is still 117.4MB. Free memory was 65.0MB in the beginning and 62.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 12:27:00,616 INFO L158 Benchmark]: Boogie Preprocessor took 95.79ms. Allocated memory is still 117.4MB. Free memory was 62.2MB in the beginning and 88.7MB in the end (delta: -26.5MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. [2024-10-13 12:27:00,616 INFO L158 Benchmark]: RCFGBuilder took 999.22ms. Allocated memory is still 117.4MB. Free memory was 88.7MB in the beginning and 50.8MB in the end (delta: 38.0MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. [2024-10-13 12:27:00,616 INFO L158 Benchmark]: TraceAbstraction took 38987.11ms. Allocated memory was 117.4MB in the beginning and 5.3GB in the end (delta: 5.1GB). Free memory was 50.8MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 3.2GB. Max. memory is 16.1GB. [2024-10-13 12:27:00,618 INFO L158 Benchmark]: Witness Printer took 2.77ms. Allocated memory is still 5.3GB. Free memory is still 2.0GB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:27:00,619 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.16ms. Allocated memory is still 71.3MB. Free memory is still 51.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 651.90ms. Allocated memory was 71.3MB in the beginning and 117.4MB in the end (delta: 46.1MB). Free memory was 50.9MB in the beginning and 65.0MB in the end (delta: -14.0MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.23ms. Allocated memory is still 117.4MB. Free memory was 65.0MB in the beginning and 62.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 95.79ms. Allocated memory is still 117.4MB. Free memory was 62.2MB in the beginning and 88.7MB in the end (delta: -26.5MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. * RCFGBuilder took 999.22ms. Allocated memory is still 117.4MB. Free memory was 88.7MB in the beginning and 50.8MB in the end (delta: 38.0MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. * TraceAbstraction took 38987.11ms. Allocated memory was 117.4MB in the beginning and 5.3GB in the end (delta: 5.1GB). Free memory was 50.8MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 3.2GB. Max. memory is 16.1GB. * Witness Printer took 2.77ms. Allocated memory is still 5.3GB. Free memory is still 2.0GB. 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, EXPR 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)={7:24}, \old(data)={7:0}, d={7:24}, data={7: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)={7:24}, \old(data)={7:0}, arg={7:24}, d={7:24}, data={7:0}, data={7:0}, dev={7:24}, res=0, t1=0, t2=1] [L3931] 0 return 0; VAL [\old(arg)={7:24}, \old(data)={7:0}, \result=0, arg={7:24}, d={7:24}, data={7:0}, data={7:0}, dev={7:24}, res=0, t1=0, t2=1] [L3966] RET, EXPR 0 my_drv_probe(&data) [L3966] 0 probe_ret = my_drv_probe(&data) [L3967] COND TRUE 0 probe_ret==0 [L3968] CALL 0 my_drv_disconnect(&data) [L3937] 0 void *status; VAL [\old(arg)={7:24}, \old(data)={7:0}, arg={7:24}, data={7:0}, data={7:0}, dev={7:24}, status={3:0}, t1=0, t2=1] [L3940] 0 data->shared.a = 3 VAL [\old(arg)={7:24}, arg={7:24}, data={7:0}, dev={7:24}, t1=0, t2=1] [L3943] 0 data->shared.b = 3 VAL [\old(arg)={7:24}, arg={7:24}, data={7:0}, dev={7:24}, t1=0, t2=1] [L3907] 1 data->shared.a = 1 VAL [\old(arg)={7:24}, arg={7:24}, data={7:0}, dev={7:24}, t1=0, t2=1] [L3946] EXPR 0 data->shared.a [L3946] 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_4-container_of.c", 13, __extension__ __PRETTY_FUNCTION__) [L3883] 0 __assert_fail ("0", "../sv-benchmarks/c/ldv-races/race-2_4-container_of.c", 13, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={7:24}, arg={7:24}, data={7:0}, dev={7: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: 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: -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: -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: 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, 131 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: 38.8s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 30.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2563 SdHoareTripleChecker+Valid, 10.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2097 mSDsluCounter, 129 SdHoareTripleChecker+Invalid, 9.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 137 IncrementalHoareTripleChecker+Unchecked, 46 mSDsCounter, 104 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5417 IncrementalHoareTripleChecker+Invalid, 5658 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 104 mSolverCounterUnsat, 83 mSDtfsCounter, 5417 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 217 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1607occurred in iteration=19, InterpolantAutomatonStates: 97, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 230 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 193 ConstructedInterpolants, 3 QuantifiedInterpolants, 1770 SizeOfPredicates, 100 NumberOfNonLiveVariables, 1988 ConjunctsInSsa, 196 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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-13 12:27:00,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample