./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-races/race-2_1-container_of.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml', '-i', '../sv-benchmarks/c/ldv-races/race-2_1-container_of.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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) )\nCHECK( init(main()), LTL(G valid-deref) )\nCHECK( init(main()), LTL(G valid-memtrack) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'edceb7bcc6473f68e1454dc7ab02ec33e8dca99fdd725419b9e71852c466530e'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-races/race-2_1-container_of.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 edceb7bcc6473f68e1454dc7ab02ec33e8dca99fdd725419b9e71852c466530e --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 19:20:46,585 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 19:20:46,675 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-07 19:20:46,683 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 19:20:46,683 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 19:20:46,709 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 19:20:46,711 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 19:20:46,711 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 19:20:46,711 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 19:20:46,712 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 19:20:46,712 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 19:20:46,712 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 19:20:46,712 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 19:20:46,713 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 19:20:46,713 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 19:20:46,713 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 19:20:46,713 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 19:20:46,713 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 19:20:46,713 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 19:20:46,713 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 19:20:46,714 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 19:20:46,714 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 19:20:46,714 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 19:20:46,714 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 19:20:46,714 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 19:20:46,715 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 19:20:46,715 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 19:20:46,715 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 19:20:46,715 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 19:20:46,715 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 19:20:46,715 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 19:20:46,715 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 19:20:46,715 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 19:20:46,715 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:20:46,716 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 19:20:46,716 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 19:20:46,716 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 19:20:46,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 19:20:46,716 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 19:20:46,716 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 19:20:46,716 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 19:20:46,716 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 19:20:46,716 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> edceb7bcc6473f68e1454dc7ab02ec33e8dca99fdd725419b9e71852c466530e [2024-11-07 19:20:46,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 19:20:46,970 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 19:20:46,972 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 19:20:46,974 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 19:20:46,974 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 19:20:46,975 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-2_1-container_of.i [2024-11-07 19:20:48,136 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 19:20:48,417 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 19:20:48,419 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_1-container_of.i [2024-11-07 19:20:48,443 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/00273bf40/2b7732fa413045c997d292917c37fa2f/FLAG7df38fac5 [2024-11-07 19:20:48,712 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/00273bf40/2b7732fa413045c997d292917c37fa2f [2024-11-07 19:20:48,714 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 19:20:48,718 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 19:20:48,719 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 19:20:48,719 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 19:20:48,722 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 19:20:48,726 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:20:48" (1/1) ... [2024-11-07 19:20:48,729 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ef301ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:48, skipping insertion in model container [2024-11-07 19:20:48,730 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:20:48" (1/1) ... [2024-11-07 19:20:48,764 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 19:20:49,010 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 19:20:49,017 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 19:20:49,021 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 19:20:49,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:20:49,035 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-07 19:20:49,035 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6f82484b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:49, skipping insertion in model container [2024-11-07 19:20:49,036 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 19:20:49,036 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-07 19:20:49,037 INFO L158 Benchmark]: Toolchain (without parser) took 319.16ms. Allocated memory is still 142.6MB. Free memory was 114.2MB in the beginning and 96.5MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 19:20:49,037 INFO L158 Benchmark]: CDTParser took 0.62ms. Allocated memory is still 117.4MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:20:49,038 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.09ms. Allocated memory is still 142.6MB. Free memory was 114.0MB in the beginning and 96.5MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 19:20:49,038 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.62ms. Allocated memory is still 117.4MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 317.09ms. Allocated memory is still 142.6MB. Free memory was 114.0MB in the beginning and 96.5MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 3902]: 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/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-races/race-2_1-container_of.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 edceb7bcc6473f68e1454dc7ab02ec33e8dca99fdd725419b9e71852c466530e --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 19:20:50,794 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 19:20:50,876 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-07 19:20:50,882 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 19:20:50,886 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 19:20:50,920 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 19:20:50,922 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 19:20:50,922 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 19:20:50,923 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 19:20:50,923 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 19:20:50,923 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 19:20:50,923 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 19:20:50,924 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 19:20:50,924 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 19:20:50,924 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 19:20:50,925 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 19:20:50,925 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 19:20:50,925 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 19:20:50,925 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 19:20:50,925 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 19:20:50,925 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 19:20:50,925 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 19:20:50,925 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 19:20:50,925 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 19:20:50,925 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 19:20:50,926 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 19:20:50,926 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 19:20:50,926 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 19:20:50,926 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 19:20:50,926 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 19:20:50,926 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 19:20:50,926 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 19:20:50,926 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 19:20:50,926 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 19:20:50,926 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 19:20:50,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:20:50,927 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 19:20:50,927 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 19:20:50,927 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 19:20:50,927 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 19:20:50,927 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 19:20:50,927 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 19:20:50,927 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 19:20:50,928 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 19:20:50,928 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> edceb7bcc6473f68e1454dc7ab02ec33e8dca99fdd725419b9e71852c466530e [2024-11-07 19:20:51,271 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 19:20:51,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 19:20:51,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 19:20:51,291 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 19:20:51,291 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 19:20:51,292 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-2_1-container_of.i [2024-11-07 19:20:52,561 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 19:20:52,849 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 19:20:52,850 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_1-container_of.i [2024-11-07 19:20:52,871 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/daf3c6e92/e61e00590544417588369e0cd90ad974/FLAG9a486d134 [2024-11-07 19:20:52,882 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/daf3c6e92/e61e00590544417588369e0cd90ad974 [2024-11-07 19:20:52,884 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 19:20:52,885 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 19:20:52,886 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 19:20:52,886 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 19:20:52,889 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 19:20:52,890 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:20:52" (1/1) ... [2024-11-07 19:20:52,890 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16bca937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:52, skipping insertion in model container [2024-11-07 19:20:52,891 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:20:52" (1/1) ... [2024-11-07 19:20:52,930 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 19:20:53,179 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 19:20:53,191 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 19:20:53,194 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 19:20:53,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:20:53,209 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-07 19:20:53,224 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 19:20:53,254 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 19:20:53,258 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 19:20:53,259 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 19:20:53,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:20:53,264 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 19:20:53,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:20:53,339 INFO L204 MainTranslator]: Completed translation [2024-11-07 19:20:53,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:53 WrapperNode [2024-11-07 19:20:53,340 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 19:20:53,341 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 19:20:53,341 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 19:20:53,341 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 19:20:53,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:53" (1/1) ... [2024-11-07 19:20:53,371 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:53" (1/1) ... [2024-11-07 19:20:53,398 INFO L138 Inliner]: procedures = 249, calls = 40, calls flagged for inlining = 13, calls inlined = 18, statements flattened = 142 [2024-11-07 19:20:53,398 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 19:20:53,399 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 19:20:53,399 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 19:20:53,399 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 19:20:53,406 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:53" (1/1) ... [2024-11-07 19:20:53,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:53" (1/1) ... [2024-11-07 19:20:53,413 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:53" (1/1) ... [2024-11-07 19:20:53,438 INFO L175 MemorySlicer]: Split 17 memory accesses to 3 slices as follows [2, 2, 13]. 76 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 8 writes are split as follows [0, 2, 6]. [2024-11-07 19:20:53,438 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:53" (1/1) ... [2024-11-07 19:20:53,439 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:53" (1/1) ... [2024-11-07 19:20:53,455 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:53" (1/1) ... [2024-11-07 19:20:53,462 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:53" (1/1) ... [2024-11-07 19:20:53,465 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:53" (1/1) ... [2024-11-07 19:20:53,469 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:53" (1/1) ... [2024-11-07 19:20:53,476 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 19:20:53,481 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 19:20:53,481 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 19:20:53,481 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 19:20:53,482 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:53" (1/1) ... [2024-11-07 19:20:53,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:20:53,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:20:53,513 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 19:20:53,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 19:20:53,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-07 19:20:53,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-07 19:20:53,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-07 19:20:53,538 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2024-11-07 19:20:53,538 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2024-11-07 19:20:53,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-07 19:20:53,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 19:20:53,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-07 19:20:53,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-07 19:20:53,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-07 19:20:53,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 19:20:53,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 19:20:53,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-07 19:20:53,539 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-07 19:20:53,539 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-07 19:20:53,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 19:20:53,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 19:20:53,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 19:20:53,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-07 19:20:53,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 19:20:53,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 19:20:53,543 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-07 19:20:53,812 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 19:20:53,813 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 19:20:54,165 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 19:20:54,165 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 19:20:54,232 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 19:20:54,233 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 19:20:54,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:20:54 BoogieIcfgContainer [2024-11-07 19:20:54,233 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 19:20:54,235 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 19:20:54,235 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 19:20:54,238 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 19:20:54,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:20:52" (1/3) ... [2024-11-07 19:20:54,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef49537 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:20:54, skipping insertion in model container [2024-11-07 19:20:54,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:53" (2/3) ... [2024-11-07 19:20:54,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef49537 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:20:54, skipping insertion in model container [2024-11-07 19:20:54,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:20:54" (3/3) ... [2024-11-07 19:20:54,239 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_1-container_of.i [2024-11-07 19:20:54,248 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 19:20:54,249 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2024-11-07 19:20:54,249 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 19:20:54,303 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-07 19:20:54,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 132 transitions, 278 flow [2024-11-07 19:20:54,385 INFO L124 PetriNetUnfolderBase]: 18/165 cut-off events. [2024-11-07 19:20:54,388 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-07 19:20:54,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 165 events. 18/165 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 521 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 86. Up to 4 conditions per place. [2024-11-07 19:20:54,395 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 132 transitions, 278 flow [2024-11-07 19:20:54,402 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 130 transitions, 272 flow [2024-11-07 19:20:54,410 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 19:20:54,418 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;@3512ecb1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 19:20:54,418 INFO L334 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2024-11-07 19:20:54,421 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 19:20:54,421 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-07 19:20:54,421 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:20:54,421 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:54,422 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-07 19:20:54,422 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-07 19:20:54,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:54,425 INFO L85 PathProgramCache]: Analyzing trace with hash 492833, now seen corresponding path program 1 times [2024-11-07 19:20:54,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:20:54,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1874547591] [2024-11-07 19:20:54,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:20:54,433 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:54,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:20:54,435 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:20:54,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 19:20:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:20:54,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 19:20:54,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:20:54,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-07 19:20:54,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:20:54,591 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:20:54,592 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:20:54,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1874547591] [2024-11-07 19:20:54,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1874547591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:54,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:54,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:20:54,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928463557] [2024-11-07 19:20:54,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:54,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:20:54,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:20:54,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:20:54,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:20:54,711 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 132 [2024-11-07 19:20:54,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 130 transitions, 272 flow. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:20:54,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:54,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 132 [2024-11-07 19:20:54,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:55,034 INFO L124 PetriNetUnfolderBase]: 707/2028 cut-off events. [2024-11-07 19:20:55,034 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-07 19:20:55,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3244 conditions, 2028 events. 707/2028 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 15833 event pairs, 95 based on Foata normal form. 156/1875 useless extension candidates. Maximal degree in co-relation 3071. Up to 1002 conditions per place. [2024-11-07 19:20:55,048 INFO L140 encePairwiseOnDemand]: 114/132 looper letters, 54 selfloop transitions, 2 changer transitions 0/118 dead transitions. [2024-11-07 19:20:55,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 118 transitions, 360 flow [2024-11-07 19:20:55,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:20:55,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:20:55,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 264 transitions. [2024-11-07 19:20:55,057 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-07 19:20:55,058 INFO L175 Difference]: Start difference. First operand has 122 places, 130 transitions, 272 flow. Second operand 3 states and 264 transitions. [2024-11-07 19:20:55,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 118 transitions, 360 flow [2024-11-07 19:20:55,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 118 transitions, 352 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-07 19:20:55,064 INFO L231 Difference]: Finished difference. Result has 110 places, 108 transitions, 224 flow [2024-11-07 19:20:55,065 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, 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-11-07 19:20:55,067 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -12 predicate places. [2024-11-07 19:20:55,068 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 108 transitions, 224 flow [2024-11-07 19:20:55,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:20:55,068 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:55,068 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-07 19:20:55,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 19:20:55,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:55,269 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-07 19:20:55,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:55,270 INFO L85 PathProgramCache]: Analyzing trace with hash 492834, now seen corresponding path program 1 times [2024-11-07 19:20:55,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:20:55,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [295530157] [2024-11-07 19:20:55,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:20:55,270 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:55,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:20:55,272 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:20:55,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 19:20:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:20:55,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 19:20:55,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:20:55,358 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-11-07 19:20:55,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:20:55,365 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:20:55,365 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:20:55,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [295530157] [2024-11-07 19:20:55,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [295530157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:55,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:55,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:20:55,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894333477] [2024-11-07 19:20:55,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:55,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:20:55,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:20:55,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:20:55,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:20:55,483 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 132 [2024-11-07 19:20:55,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 108 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:20:55,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:55,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 132 [2024-11-07 19:20:55,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:55,752 INFO L124 PetriNetUnfolderBase]: 707/2024 cut-off events. [2024-11-07 19:20:55,752 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2024-11-07 19:20:55,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3261 conditions, 2024 events. 707/2024 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 15812 event pairs, 95 based on Foata normal form. 2/1717 useless extension candidates. Maximal degree in co-relation 488. Up to 1002 conditions per place. [2024-11-07 19:20:55,762 INFO L140 encePairwiseOnDemand]: 126/132 looper letters, 52 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2024-11-07 19:20:55,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 114 transitions, 344 flow [2024-11-07 19:20:55,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:20:55,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:20:55,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 256 transitions. [2024-11-07 19:20:55,764 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6464646464646465 [2024-11-07 19:20:55,764 INFO L175 Difference]: Start difference. First operand has 110 places, 108 transitions, 224 flow. Second operand 3 states and 256 transitions. [2024-11-07 19:20:55,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 114 transitions, 344 flow [2024-11-07 19:20:55,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 114 transitions, 340 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:20:55,767 INFO L231 Difference]: Finished difference. Result has 106 places, 104 transitions, 216 flow [2024-11-07 19:20:55,767 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=216, PETRI_PLACES=106, PETRI_TRANSITIONS=104} [2024-11-07 19:20:55,767 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -16 predicate places. [2024-11-07 19:20:55,768 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 104 transitions, 216 flow [2024-11-07 19:20:55,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:20:55,768 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:55,768 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-07 19:20:55,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-11-07 19:20:55,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:55,969 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-07 19:20:55,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:55,970 INFO L85 PathProgramCache]: Analyzing trace with hash 15275921, now seen corresponding path program 1 times [2024-11-07 19:20:55,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:20:55,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899536827] [2024-11-07 19:20:55,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:20:55,970 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:55,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:20:55,974 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:20:55,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 19:20:56,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:20:56,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 19:20:56,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:20:56,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:20:56,055 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:20:56,055 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:20:56,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899536827] [2024-11-07 19:20:56,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [899536827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:56,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:56,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:20:56,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739329682] [2024-11-07 19:20:56,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:56,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:20:56,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:20:56,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:20:56,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:20:56,059 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 132 [2024-11-07 19:20:56,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 104 transitions, 216 flow. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:20:56,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:56,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 132 [2024-11-07 19:20:56,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:56,361 INFO L124 PetriNetUnfolderBase]: 706/1707 cut-off events. [2024-11-07 19:20:56,361 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-07 19:20:56,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2944 conditions, 1707 events. 706/1707 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 11757 event pairs, 645 based on Foata normal form. 1/1455 useless extension candidates. Maximal degree in co-relation 1061. Up to 1092 conditions per place. [2024-11-07 19:20:56,369 INFO L140 encePairwiseOnDemand]: 129/132 looper letters, 52 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2024-11-07 19:20:56,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 113 transitions, 342 flow [2024-11-07 19:20:56,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:20:56,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:20:56,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2024-11-07 19:20:56,371 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6616161616161617 [2024-11-07 19:20:56,371 INFO L175 Difference]: Start difference. First operand has 106 places, 104 transitions, 216 flow. Second operand 3 states and 262 transitions. [2024-11-07 19:20:56,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 113 transitions, 342 flow [2024-11-07 19:20:56,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 113 transitions, 338 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:20:56,373 INFO L231 Difference]: Finished difference. Result has 106 places, 103 transitions, 214 flow [2024-11-07 19:20:56,373 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=106, PETRI_TRANSITIONS=103} [2024-11-07 19:20:56,374 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -16 predicate places. [2024-11-07 19:20:56,374 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 103 transitions, 214 flow [2024-11-07 19:20:56,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:20:56,374 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:56,374 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:20:56,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 19:20:56,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:56,579 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-07 19:20:56,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:56,579 INFO L85 PathProgramCache]: Analyzing trace with hash 918000892, now seen corresponding path program 1 times [2024-11-07 19:20:56,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:20:56,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1498364138] [2024-11-07 19:20:56,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:20:56,580 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:56,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:20:56,582 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:20:56,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 19:20:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:20:56,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 19:20:56,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:20:56,706 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:20:56,706 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:20:56,707 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:20:56,710 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-11-07 19:20:56,782 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:20:56,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 19:20:56,821 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 83 treesize of output 73 [2024-11-07 19:20:57,029 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 19:20:57,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 137 treesize of output 53 [2024-11-07 19:20:57,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:20:57,045 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:20:57,045 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:20:57,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1498364138] [2024-11-07 19:20:57,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1498364138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:57,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:57,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 19:20:57,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782295461] [2024-11-07 19:20:57,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:57,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:20:57,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:20:57,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:20:57,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:20:57,310 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 132 [2024-11-07 19:20:57,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 103 transitions, 214 flow. Second operand has 5 states, 5 states have (on average 65.2) internal successors, (326), 5 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:20:57,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:57,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 132 [2024-11-07 19:20:57,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:57,807 INFO L124 PetriNetUnfolderBase]: 1153/2678 cut-off events. [2024-11-07 19:20:57,807 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2024-11-07 19:20:57,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4637 conditions, 2678 events. 1153/2678 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 19494 event pairs, 684 based on Foata normal form. 1/2357 useless extension candidates. Maximal degree in co-relation 4313. Up to 1845 conditions per place. [2024-11-07 19:20:57,819 INFO L140 encePairwiseOnDemand]: 124/132 looper letters, 52 selfloop transitions, 7 changer transitions 0/110 dead transitions. [2024-11-07 19:20:57,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 110 transitions, 347 flow [2024-11-07 19:20:57,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:20:57,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:20:57,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 380 transitions. [2024-11-07 19:20:57,821 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2024-11-07 19:20:57,822 INFO L175 Difference]: Start difference. First operand has 106 places, 103 transitions, 214 flow. Second operand 5 states and 380 transitions. [2024-11-07 19:20:57,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 110 transitions, 347 flow [2024-11-07 19:20:57,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 110 transitions, 343 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:20:57,828 INFO L231 Difference]: Finished difference. Result has 106 places, 103 transitions, 236 flow [2024-11-07 19:20:57,829 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=236, PETRI_PLACES=106, PETRI_TRANSITIONS=103} [2024-11-07 19:20:57,829 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -16 predicate places. [2024-11-07 19:20:57,830 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 103 transitions, 236 flow [2024-11-07 19:20:57,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 65.2) internal successors, (326), 5 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:20:57,830 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:57,830 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:20:57,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-07 19:20:58,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:58,035 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-07 19:20:58,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:58,035 INFO L85 PathProgramCache]: Analyzing trace with hash -2144599793, now seen corresponding path program 1 times [2024-11-07 19:20:58,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:20:58,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [192502424] [2024-11-07 19:20:58,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:20:58,036 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:58,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:20:58,041 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:20:58,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-07 19:20:58,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:20:58,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 19:20:58,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:20:58,167 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:20:58,167 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:20:58,167 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:20:58,169 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-11-07 19:20:58,248 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 19:20:58,248 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 117 treesize of output 45 [2024-11-07 19:20:58,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:20:58,256 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:20:58,256 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:20:58,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [192502424] [2024-11-07 19:20:58,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [192502424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:58,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:58,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:20:58,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208845126] [2024-11-07 19:20:58,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:58,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:20:58,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:20:58,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:20:58,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:20:58,432 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 132 [2024-11-07 19:20:58,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 103 transitions, 236 flow. Second operand has 4 states, 4 states have (on average 66.75) internal successors, (267), 4 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:20:58,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:58,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 132 [2024-11-07 19:20:58,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:58,814 INFO L124 PetriNetUnfolderBase]: 1153/2675 cut-off events. [2024-11-07 19:20:58,814 INFO L125 PetriNetUnfolderBase]: For 221/227 co-relation queries the response was YES. [2024-11-07 19:20:58,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4861 conditions, 2675 events. 1153/2675 cut-off events. For 221/227 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 19524 event pairs, 684 based on Foata normal form. 7/2360 useless extension candidates. Maximal degree in co-relation 1969. Up to 1845 conditions per place. [2024-11-07 19:20:58,825 INFO L140 encePairwiseOnDemand]: 125/132 looper letters, 51 selfloop transitions, 6 changer transitions 0/107 dead transitions. [2024-11-07 19:20:58,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 107 transitions, 359 flow [2024-11-07 19:20:58,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:20:58,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:20:58,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 318 transitions. [2024-11-07 19:20:58,826 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6022727272727273 [2024-11-07 19:20:58,826 INFO L175 Difference]: Start difference. First operand has 106 places, 103 transitions, 236 flow. Second operand 4 states and 318 transitions. [2024-11-07 19:20:58,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 107 transitions, 359 flow [2024-11-07 19:20:58,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 107 transitions, 351 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-07 19:20:58,827 INFO L231 Difference]: Finished difference. Result has 103 places, 100 transitions, 234 flow [2024-11-07 19:20:58,828 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=234, PETRI_PLACES=103, PETRI_TRANSITIONS=100} [2024-11-07 19:20:58,828 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -19 predicate places. [2024-11-07 19:20:58,828 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 100 transitions, 234 flow [2024-11-07 19:20:58,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.75) internal successors, (267), 4 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:20:58,828 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:58,828 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:20:58,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-07 19:20:59,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:59,029 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-07 19:20:59,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:59,030 INFO L85 PathProgramCache]: Analyzing trace with hash -859869638, now seen corresponding path program 1 times [2024-11-07 19:20:59,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:20:59,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [795638714] [2024-11-07 19:20:59,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:20:59,034 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:59,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:20:59,036 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:20:59,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-07 19:20:59,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:20:59,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 19:20:59,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:20:59,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-07 19:20:59,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:20:59,161 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:20:59,162 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:20:59,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [795638714] [2024-11-07 19:20:59,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [795638714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:59,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:59,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:20:59,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524369551] [2024-11-07 19:20:59,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:59,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:20:59,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:20:59,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:20:59,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:20:59,250 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 132 [2024-11-07 19:20:59,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 100 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:20:59,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:59,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 132 [2024-11-07 19:20:59,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:59,496 INFO L124 PetriNetUnfolderBase]: 977/2250 cut-off events. [2024-11-07 19:20:59,496 INFO L125 PetriNetUnfolderBase]: For 75/78 co-relation queries the response was YES. [2024-11-07 19:20:59,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4003 conditions, 2250 events. 977/2250 cut-off events. For 75/78 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 15591 event pairs, 746 based on Foata normal form. 0/2071 useless extension candidates. Maximal degree in co-relation 1940. Up to 1391 conditions per place. [2024-11-07 19:20:59,508 INFO L140 encePairwiseOnDemand]: 123/132 looper letters, 52 selfloop transitions, 4 changer transitions 0/105 dead transitions. [2024-11-07 19:20:59,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 105 transitions, 356 flow [2024-11-07 19:20:59,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:20:59,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:20:59,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 246 transitions. [2024-11-07 19:20:59,510 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6212121212121212 [2024-11-07 19:20:59,511 INFO L175 Difference]: Start difference. First operand has 103 places, 100 transitions, 234 flow. Second operand 3 states and 246 transitions. [2024-11-07 19:20:59,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 105 transitions, 356 flow [2024-11-07 19:20:59,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 105 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:20:59,532 INFO L231 Difference]: Finished difference. Result has 98 places, 95 transitions, 226 flow [2024-11-07 19:20:59,532 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=98, PETRI_TRANSITIONS=95} [2024-11-07 19:20:59,533 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -24 predicate places. [2024-11-07 19:20:59,533 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 95 transitions, 226 flow [2024-11-07 19:20:59,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:20:59,533 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:59,533 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:20:59,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-11-07 19:20:59,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:59,734 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-07 19:20:59,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:59,734 INFO L85 PathProgramCache]: Analyzing trace with hash -859869637, now seen corresponding path program 1 times [2024-11-07 19:20:59,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:20:59,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2129639201] [2024-11-07 19:20:59,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:20:59,735 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:59,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:20:59,739 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:20:59,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-07 19:20:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:20:59,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 19:20:59,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:20:59,845 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-11-07 19:20:59,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:20:59,902 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:20:59,902 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:20:59,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2129639201] [2024-11-07 19:20:59,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2129639201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:59,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:59,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:20:59,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740867886] [2024-11-07 19:20:59,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:59,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:20:59,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:20:59,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:20:59,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:21:00,006 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 132 [2024-11-07 19:21:00,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 95 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:00,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:00,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 132 [2024-11-07 19:21:00,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:00,263 INFO L124 PetriNetUnfolderBase]: 835/1981 cut-off events. [2024-11-07 19:21:00,263 INFO L125 PetriNetUnfolderBase]: For 117/120 co-relation queries the response was YES. [2024-11-07 19:21:00,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3543 conditions, 1981 events. 835/1981 cut-off events. For 117/120 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 13573 event pairs, 538 based on Foata normal form. 86/1876 useless extension candidates. Maximal degree in co-relation 2877. Up to 1012 conditions per place. [2024-11-07 19:21:00,273 INFO L140 encePairwiseOnDemand]: 125/132 looper letters, 63 selfloop transitions, 3 changer transitions 0/112 dead transitions. [2024-11-07 19:21:00,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 112 transitions, 394 flow [2024-11-07 19:21:00,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:21:00,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:21:00,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 261 transitions. [2024-11-07 19:21:00,275 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6590909090909091 [2024-11-07 19:21:00,275 INFO L175 Difference]: Start difference. First operand has 98 places, 95 transitions, 226 flow. Second operand 3 states and 261 transitions. [2024-11-07 19:21:00,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 112 transitions, 394 flow [2024-11-07 19:21:00,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 112 transitions, 384 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:21:00,278 INFO L231 Difference]: Finished difference. Result has 99 places, 96 transitions, 239 flow [2024-11-07 19:21:00,278 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=239, PETRI_PLACES=99, PETRI_TRANSITIONS=96} [2024-11-07 19:21:00,279 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -23 predicate places. [2024-11-07 19:21:00,279 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 96 transitions, 239 flow [2024-11-07 19:21:00,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:00,279 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:00,279 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:00,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-07 19:21:00,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:00,480 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-07 19:21:00,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:00,481 INFO L85 PathProgramCache]: Analyzing trace with hash -797998779, now seen corresponding path program 1 times [2024-11-07 19:21:00,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:00,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1080154849] [2024-11-07 19:21:00,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:00,481 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:00,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:00,483 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:21:00,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-07 19:21:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:00,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 19:21:00,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:00,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-07 19:21:00,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:21:00,627 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:00,627 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:00,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1080154849] [2024-11-07 19:21:00,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1080154849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:00,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:00,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:21:00,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836537125] [2024-11-07 19:21:00,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:00,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:21:00,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:00,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:21:00,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:21:00,924 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 132 [2024-11-07 19:21:00,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 96 transitions, 239 flow. Second operand has 5 states, 5 states have (on average 67.2) internal successors, (336), 5 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:00,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:00,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 132 [2024-11-07 19:21:00,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:01,413 INFO L124 PetriNetUnfolderBase]: 1177/2694 cut-off events. [2024-11-07 19:21:01,413 INFO L125 PetriNetUnfolderBase]: For 237/237 co-relation queries the response was YES. [2024-11-07 19:21:01,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5052 conditions, 2694 events. 1177/2694 cut-off events. For 237/237 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 19116 event pairs, 145 based on Foata normal form. 62/2638 useless extension candidates. Maximal degree in co-relation 3206. Up to 1078 conditions per place. [2024-11-07 19:21:01,422 INFO L140 encePairwiseOnDemand]: 120/132 looper letters, 100 selfloop transitions, 15 changer transitions 1/162 dead transitions. [2024-11-07 19:21:01,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 162 transitions, 628 flow [2024-11-07 19:21:01,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 19:21:01,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 19:21:01,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 640 transitions. [2024-11-07 19:21:01,424 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2024-11-07 19:21:01,424 INFO L175 Difference]: Start difference. First operand has 99 places, 96 transitions, 239 flow. Second operand 8 states and 640 transitions. [2024-11-07 19:21:01,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 162 transitions, 628 flow [2024-11-07 19:21:01,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 162 transitions, 621 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:21:01,431 INFO L231 Difference]: Finished difference. Result has 109 places, 106 transitions, 345 flow [2024-11-07 19:21:01,431 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=345, PETRI_PLACES=109, PETRI_TRANSITIONS=106} [2024-11-07 19:21:01,432 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -13 predicate places. [2024-11-07 19:21:01,432 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 106 transitions, 345 flow [2024-11-07 19:21:01,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.2) internal successors, (336), 5 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:01,433 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:01,433 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:01,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-07 19:21:01,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:01,634 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-07 19:21:01,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:01,634 INFO L85 PathProgramCache]: Analyzing trace with hash -797998778, now seen corresponding path program 1 times [2024-11-07 19:21:01,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:01,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [377891676] [2024-11-07 19:21:01,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:01,635 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:01,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:01,638 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:21:01,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-11-07 19:21:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:01,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-07 19:21:01,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:01,750 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-11-07 19:21:01,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:21:01,826 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:01,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:01,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [377891676] [2024-11-07 19:21:01,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [377891676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:01,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:01,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:21:01,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482988880] [2024-11-07 19:21:01,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:01,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:21:01,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:01,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:21:01,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:21:02,106 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 132 [2024-11-07 19:21:02,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 106 transitions, 345 flow. Second operand has 5 states, 5 states have (on average 69.2) internal successors, (346), 5 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:02,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:02,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 132 [2024-11-07 19:21:02,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:02,766 INFO L124 PetriNetUnfolderBase]: 914/2228 cut-off events. [2024-11-07 19:21:02,770 INFO L125 PetriNetUnfolderBase]: For 1017/1103 co-relation queries the response was YES. [2024-11-07 19:21:02,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4495 conditions, 2228 events. 914/2228 cut-off events. For 1017/1103 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 15825 event pairs, 148 based on Foata normal form. 257/2410 useless extension candidates. Maximal degree in co-relation 4099. Up to 1074 conditions per place. [2024-11-07 19:21:02,787 INFO L140 encePairwiseOnDemand]: 124/132 looper letters, 89 selfloop transitions, 12 changer transitions 2/154 dead transitions. [2024-11-07 19:21:02,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 154 transitions, 659 flow [2024-11-07 19:21:02,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 19:21:02,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-07 19:21:02,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 573 transitions. [2024-11-07 19:21:02,794 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6201298701298701 [2024-11-07 19:21:02,794 INFO L175 Difference]: Start difference. First operand has 109 places, 106 transitions, 345 flow. Second operand 7 states and 573 transitions. [2024-11-07 19:21:02,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 154 transitions, 659 flow [2024-11-07 19:21:02,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 154 transitions, 659 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 19:21:02,805 INFO L231 Difference]: Finished difference. Result has 118 places, 108 transitions, 405 flow [2024-11-07 19:21:02,809 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=405, PETRI_PLACES=118, PETRI_TRANSITIONS=108} [2024-11-07 19:21:02,810 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -4 predicate places. [2024-11-07 19:21:02,810 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 108 transitions, 405 flow [2024-11-07 19:21:02,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.2) internal successors, (346), 5 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:02,810 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:02,810 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:02,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-11-07 19:21:03,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:03,011 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-07 19:21:03,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:03,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1027020276, now seen corresponding path program 1 times [2024-11-07 19:21:03,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:03,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [258811140] [2024-11-07 19:21:03,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:03,012 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:03,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:03,015 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:21:03,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-11-07 19:21:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:03,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 19:21:03,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:03,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-07 19:21:03,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:21:03,227 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:03,227 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:03,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [258811140] [2024-11-07 19:21:03,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [258811140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:03,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:03,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:21:03,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36671590] [2024-11-07 19:21:03,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:03,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:21:03,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:03,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:21:03,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:21:03,441 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 132 [2024-11-07 19:21:03,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 108 transitions, 405 flow. Second operand has 5 states, 5 states have (on average 67.6) internal successors, (338), 5 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:03,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:03,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 132 [2024-11-07 19:21:03,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:03,957 INFO L124 PetriNetUnfolderBase]: 1336/3053 cut-off events. [2024-11-07 19:21:03,957 INFO L125 PetriNetUnfolderBase]: For 2699/2849 co-relation queries the response was YES. [2024-11-07 19:21:03,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6754 conditions, 3053 events. 1336/3053 cut-off events. For 2699/2849 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 22205 event pairs, 340 based on Foata normal form. 98/3084 useless extension candidates. Maximal degree in co-relation 5927. Up to 1093 conditions per place. [2024-11-07 19:21:03,977 INFO L140 encePairwiseOnDemand]: 120/132 looper letters, 111 selfloop transitions, 20 changer transitions 0/179 dead transitions. [2024-11-07 19:21:03,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 179 transitions, 910 flow [2024-11-07 19:21:03,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 19:21:03,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 19:21:03,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 644 transitions. [2024-11-07 19:21:03,979 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6098484848484849 [2024-11-07 19:21:03,982 INFO L175 Difference]: Start difference. First operand has 118 places, 108 transitions, 405 flow. Second operand 8 states and 644 transitions. [2024-11-07 19:21:03,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 179 transitions, 910 flow [2024-11-07 19:21:03,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 179 transitions, 877 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-07 19:21:03,992 INFO L231 Difference]: Finished difference. Result has 124 places, 118 transitions, 535 flow [2024-11-07 19:21:03,993 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=535, PETRI_PLACES=124, PETRI_TRANSITIONS=118} [2024-11-07 19:21:03,997 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, 2 predicate places. [2024-11-07 19:21:03,997 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 118 transitions, 535 flow [2024-11-07 19:21:03,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.6) internal successors, (338), 5 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:03,998 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:03,998 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:04,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-07 19:21:04,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:04,201 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-07 19:21:04,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:04,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1027020275, now seen corresponding path program 1 times [2024-11-07 19:21:04,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:04,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2120029038] [2024-11-07 19:21:04,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:04,202 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:04,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:04,205 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:21:04,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-11-07 19:21:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:04,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-07 19:21:04,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:04,311 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-11-07 19:21:04,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:21:04,404 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:04,404 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:04,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2120029038] [2024-11-07 19:21:04,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2120029038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:04,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:04,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:21:04,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32149782] [2024-11-07 19:21:04,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:04,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:21:04,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:04,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:21:04,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:21:04,691 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 132 [2024-11-07 19:21:04,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 118 transitions, 535 flow. Second operand has 5 states, 5 states have (on average 69.6) internal successors, (348), 5 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:04,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:04,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 132 [2024-11-07 19:21:04,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:05,159 INFO L124 PetriNetUnfolderBase]: 1002/2495 cut-off events. [2024-11-07 19:21:05,159 INFO L125 PetriNetUnfolderBase]: For 3013/3221 co-relation queries the response was YES. [2024-11-07 19:21:05,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5953 conditions, 2495 events. 1002/2495 cut-off events. For 3013/3221 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 18509 event pairs, 160 based on Foata normal form. 330/2784 useless extension candidates. Maximal degree in co-relation 5344. Up to 1228 conditions per place. [2024-11-07 19:21:05,173 INFO L140 encePairwiseOnDemand]: 124/132 looper letters, 98 selfloop transitions, 17 changer transitions 1/169 dead transitions. [2024-11-07 19:21:05,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 169 transitions, 915 flow [2024-11-07 19:21:05,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 19:21:05,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-07 19:21:05,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 575 transitions. [2024-11-07 19:21:05,179 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6222943722943723 [2024-11-07 19:21:05,179 INFO L175 Difference]: Start difference. First operand has 124 places, 118 transitions, 535 flow. Second operand 7 states and 575 transitions. [2024-11-07 19:21:05,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 169 transitions, 915 flow [2024-11-07 19:21:05,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 169 transitions, 912 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:21:05,187 INFO L231 Difference]: Finished difference. Result has 132 places, 121 transitions, 617 flow [2024-11-07 19:21:05,187 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=617, PETRI_PLACES=132, PETRI_TRANSITIONS=121} [2024-11-07 19:21:05,188 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, 10 predicate places. [2024-11-07 19:21:05,188 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 121 transitions, 617 flow [2024-11-07 19:21:05,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.6) internal successors, (348), 5 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:05,189 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:05,189 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:05,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-07 19:21:05,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:05,393 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-07 19:21:05,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:05,393 INFO L85 PathProgramCache]: Analyzing trace with hash -2035896848, now seen corresponding path program 1 times [2024-11-07 19:21:05,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:05,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2142801389] [2024-11-07 19:21:05,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:05,394 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:05,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:05,396 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:21:05,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-11-07 19:21:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:05,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 19:21:05,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:05,561 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:05,561 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:05,562 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:05,563 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-11-07 19:21:05,597 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:05,603 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 19:21:05,603 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 83 treesize of output 73 [2024-11-07 19:21:05,671 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 19:21:05,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 141 treesize of output 57 [2024-11-07 19:21:05,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:21:05,685 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:05,685 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:05,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2142801389] [2024-11-07 19:21:05,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2142801389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:05,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:05,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 19:21:05,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60415474] [2024-11-07 19:21:05,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:05,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:21:05,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:05,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:21:05,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:21:06,115 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 132 [2024-11-07 19:21:06,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 121 transitions, 617 flow. Second operand has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:06,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:06,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 132 [2024-11-07 19:21:06,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:07,968 INFO L124 PetriNetUnfolderBase]: 1837/3732 cut-off events. [2024-11-07 19:21:07,968 INFO L125 PetriNetUnfolderBase]: For 6542/6818 co-relation queries the response was YES. [2024-11-07 19:21:07,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10096 conditions, 3732 events. 1837/3732 cut-off events. For 6542/6818 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 26467 event pairs, 747 based on Foata normal form. 126/3814 useless extension candidates. Maximal degree in co-relation 9222. Up to 2298 conditions per place. [2024-11-07 19:21:07,981 INFO L140 encePairwiseOnDemand]: 122/132 looper letters, 109 selfloop transitions, 23 changer transitions 0/178 dead transitions. [2024-11-07 19:21:07,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 178 transitions, 1123 flow [2024-11-07 19:21:07,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:21:07,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 19:21:07,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 489 transitions. [2024-11-07 19:21:07,983 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6174242424242424 [2024-11-07 19:21:07,983 INFO L175 Difference]: Start difference. First operand has 132 places, 121 transitions, 617 flow. Second operand 6 states and 489 transitions. [2024-11-07 19:21:07,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 178 transitions, 1123 flow [2024-11-07 19:21:07,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 178 transitions, 1095 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-07 19:21:07,992 INFO L231 Difference]: Finished difference. Result has 136 places, 144 transitions, 823 flow [2024-11-07 19:21:07,992 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=823, PETRI_PLACES=136, PETRI_TRANSITIONS=144} [2024-11-07 19:21:07,994 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, 14 predicate places. [2024-11-07 19:21:07,994 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 144 transitions, 823 flow [2024-11-07 19:21:07,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:07,994 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:07,994 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:08,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)] Ended with exit code 0 [2024-11-07 19:21:08,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:08,195 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-07 19:21:08,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:08,196 INFO L85 PathProgramCache]: Analyzing trace with hash 627256280, now seen corresponding path program 1 times [2024-11-07 19:21:08,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:08,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1445895862] [2024-11-07 19:21:08,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:08,196 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:08,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:08,198 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:21:08,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-11-07 19:21:08,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:08,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-07 19:21:08,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:08,352 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-11-07 19:21:08,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-07 19:21:08,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:08,510 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-11-07 19:21:08,520 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 19:21:08,520 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-11-07 19:21:08,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:21:08,532 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:08,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:08,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1445895862] [2024-11-07 19:21:08,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1445895862] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:08,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:08,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 19:21:08,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217796356] [2024-11-07 19:21:08,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:08,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:21:08,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:08,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:21:08,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:21:09,143 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 132 [2024-11-07 19:21:09,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 144 transitions, 823 flow. Second operand has 6 states, 6 states have (on average 64.66666666666667) internal successors, (388), 6 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:09,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:09,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 132 [2024-11-07 19:21:09,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:09,939 INFO L124 PetriNetUnfolderBase]: 2107/4457 cut-off events. [2024-11-07 19:21:09,940 INFO L125 PetriNetUnfolderBase]: For 8936/9181 co-relation queries the response was YES. [2024-11-07 19:21:09,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13281 conditions, 4457 events. 2107/4457 cut-off events. For 8936/9181 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 33978 event pairs, 424 based on Foata normal form. 71/4436 useless extension candidates. Maximal degree in co-relation 12173. Up to 1805 conditions per place. [2024-11-07 19:21:09,959 INFO L140 encePairwiseOnDemand]: 120/132 looper letters, 146 selfloop transitions, 24 changer transitions 0/220 dead transitions. [2024-11-07 19:21:09,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 220 transitions, 1448 flow [2024-11-07 19:21:09,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 19:21:09,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-07 19:21:09,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 690 transitions. [2024-11-07 19:21:09,962 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5808080808080808 [2024-11-07 19:21:09,962 INFO L175 Difference]: Start difference. First operand has 136 places, 144 transitions, 823 flow. Second operand 9 states and 690 transitions. [2024-11-07 19:21:09,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 220 transitions, 1448 flow [2024-11-07 19:21:09,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 220 transitions, 1419 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-11-07 19:21:09,977 INFO L231 Difference]: Finished difference. Result has 140 places, 142 transitions, 842 flow [2024-11-07 19:21:09,978 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=776, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=842, PETRI_PLACES=140, PETRI_TRANSITIONS=142} [2024-11-07 19:21:09,978 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, 18 predicate places. [2024-11-07 19:21:09,978 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 142 transitions, 842 flow [2024-11-07 19:21:09,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 64.66666666666667) internal successors, (388), 6 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:09,979 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:09,979 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:09,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-11-07 19:21:10,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:10,186 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-07 19:21:10,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:10,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1670382524, now seen corresponding path program 1 times [2024-11-07 19:21:10,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:10,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [817819368] [2024-11-07 19:21:10,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:10,187 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:10,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:10,203 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:21:10,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-11-07 19:21:10,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:10,447 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-07 19:21:10,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:10,462 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-11-07 19:21:10,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-07 19:21:10,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:10,636 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-11-07 19:21:10,649 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 19:21:10,649 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-11-07 19:21:10,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:21:10,663 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:10,663 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:10,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [817819368] [2024-11-07 19:21:10,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [817819368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:10,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:10,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 19:21:10,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593774676] [2024-11-07 19:21:10,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:10,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:21:10,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:10,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:21:10,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:21:11,116 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 132 [2024-11-07 19:21:11,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 142 transitions, 842 flow. Second operand has 6 states, 6 states have (on average 64.66666666666667) internal successors, (388), 6 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:11,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:11,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 132 [2024-11-07 19:21:11,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:12,038 INFO L124 PetriNetUnfolderBase]: 2387/5013 cut-off events. [2024-11-07 19:21:12,038 INFO L125 PetriNetUnfolderBase]: For 11207/11550 co-relation queries the response was YES. [2024-11-07 19:21:12,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14950 conditions, 5013 events. 2387/5013 cut-off events. For 11207/11550 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 39251 event pairs, 738 based on Foata normal form. 92/5031 useless extension candidates. Maximal degree in co-relation 13868. Up to 1812 conditions per place. [2024-11-07 19:21:12,062 INFO L140 encePairwiseOnDemand]: 120/132 looper letters, 151 selfloop transitions, 24 changer transitions 0/223 dead transitions. [2024-11-07 19:21:12,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 223 transitions, 1503 flow [2024-11-07 19:21:12,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 19:21:12,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-07 19:21:12,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 695 transitions. [2024-11-07 19:21:12,064 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.585016835016835 [2024-11-07 19:21:12,064 INFO L175 Difference]: Start difference. First operand has 140 places, 142 transitions, 842 flow. Second operand 9 states and 695 transitions. [2024-11-07 19:21:12,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 223 transitions, 1503 flow [2024-11-07 19:21:12,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 223 transitions, 1445 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-07 19:21:12,083 INFO L231 Difference]: Finished difference. Result has 138 places, 140 transitions, 840 flow [2024-11-07 19:21:12,083 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=840, PETRI_PLACES=138, PETRI_TRANSITIONS=140} [2024-11-07 19:21:12,084 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, 16 predicate places. [2024-11-07 19:21:12,084 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 140 transitions, 840 flow [2024-11-07 19:21:12,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 64.66666666666667) internal successors, (388), 6 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:12,084 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:12,084 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:12,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-11-07 19:21:12,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:12,285 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-07 19:21:12,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:12,286 INFO L85 PathProgramCache]: Analyzing trace with hash 2073608629, now seen corresponding path program 1 times [2024-11-07 19:21:12,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:12,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1974579283] [2024-11-07 19:21:12,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:12,286 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:12,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:12,292 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:21:12,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-11-07 19:21:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:12,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 19:21:12,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:12,483 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:12,483 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:12,484 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:12,485 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-11-07 19:21:12,554 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 19:21:12,554 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-11-07 19:21:12,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:21:12,569 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:12,569 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:12,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1974579283] [2024-11-07 19:21:12,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1974579283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:12,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:12,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:21:12,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9029228] [2024-11-07 19:21:12,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:12,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:21:12,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:12,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:21:12,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:21:12,771 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 132 [2024-11-07 19:21:12,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 140 transitions, 840 flow. Second operand has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:12,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:12,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 132 [2024-11-07 19:21:12,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:13,827 INFO L124 PetriNetUnfolderBase]: 2542/5265 cut-off events. [2024-11-07 19:21:13,827 INFO L125 PetriNetUnfolderBase]: For 16376/16829 co-relation queries the response was YES. [2024-11-07 19:21:13,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16846 conditions, 5265 events. 2542/5265 cut-off events. For 16376/16829 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 41272 event pairs, 1223 based on Foata normal form. 202/5391 useless extension candidates. Maximal degree in co-relation 15396. Up to 3275 conditions per place. [2024-11-07 19:21:13,846 INFO L140 encePairwiseOnDemand]: 124/132 looper letters, 114 selfloop transitions, 35 changer transitions 0/190 dead transitions. [2024-11-07 19:21:13,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 190 transitions, 1454 flow [2024-11-07 19:21:13,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:21:13,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:21:13,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 416 transitions. [2024-11-07 19:21:13,852 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6303030303030303 [2024-11-07 19:21:13,852 INFO L175 Difference]: Start difference. First operand has 138 places, 140 transitions, 840 flow. Second operand 5 states and 416 transitions. [2024-11-07 19:21:13,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 190 transitions, 1454 flow [2024-11-07 19:21:13,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 190 transitions, 1403 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-07 19:21:13,886 INFO L231 Difference]: Finished difference. Result has 139 places, 159 transitions, 1127 flow [2024-11-07 19:21:13,887 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1127, PETRI_PLACES=139, PETRI_TRANSITIONS=159} [2024-11-07 19:21:13,888 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, 17 predicate places. [2024-11-07 19:21:13,888 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 159 transitions, 1127 flow [2024-11-07 19:21:13,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:13,888 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:13,888 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:13,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)] Forceful destruction successful, exit code 0 [2024-11-07 19:21:14,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:14,093 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-07 19:21:14,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:14,094 INFO L85 PathProgramCache]: Analyzing trace with hash -142753304, now seen corresponding path program 1 times [2024-11-07 19:21:14,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:14,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [19794113] [2024-11-07 19:21:14,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:14,098 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:14,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:14,100 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:21:14,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-11-07 19:21:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:14,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 19:21:14,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:14,423 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#data~1#1.base_79| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#data~1#1.base_79|)) (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#data~1#1.base_79| (_ bv0 1)) |c_#valid|))) is different from true [2024-11-07 19:21:14,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:21:14,431 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:14,431 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:14,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [19794113] [2024-11-07 19:21:14,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [19794113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:14,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:14,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:21:14,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243199661] [2024-11-07 19:21:14,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:14,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:21:14,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:14,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:21:14,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2024-11-07 19:21:14,432 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 132 [2024-11-07 19:21:14,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 159 transitions, 1127 flow. Second operand has 5 states, 5 states have (on average 40.6) internal successors, (203), 5 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:14,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:14,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 132 [2024-11-07 19:21:14,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:15,484 INFO L124 PetriNetUnfolderBase]: 4002/7518 cut-off events. [2024-11-07 19:21:15,485 INFO L125 PetriNetUnfolderBase]: For 23709/23713 co-relation queries the response was YES. [2024-11-07 19:21:15,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26836 conditions, 7518 events. 4002/7518 cut-off events. For 23709/23713 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 57345 event pairs, 1765 based on Foata normal form. 1/7496 useless extension candidates. Maximal degree in co-relation 24755. Up to 3488 conditions per place. [2024-11-07 19:21:15,523 INFO L140 encePairwiseOnDemand]: 106/132 looper letters, 145 selfloop transitions, 40 changer transitions 4/209 dead transitions. [2024-11-07 19:21:15,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 209 transitions, 1773 flow [2024-11-07 19:21:15,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:21:15,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:21:15,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 310 transitions. [2024-11-07 19:21:15,524 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4696969696969697 [2024-11-07 19:21:15,524 INFO L175 Difference]: Start difference. First operand has 139 places, 159 transitions, 1127 flow. Second operand 5 states and 310 transitions. [2024-11-07 19:21:15,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 209 transitions, 1773 flow [2024-11-07 19:21:15,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 209 transitions, 1759 flow, removed 7 selfloop flow, removed 0 redundant places. [2024-11-07 19:21:15,590 INFO L231 Difference]: Finished difference. Result has 146 places, 177 transitions, 1407 flow [2024-11-07 19:21:15,590 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=1113, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1407, PETRI_PLACES=146, PETRI_TRANSITIONS=177} [2024-11-07 19:21:15,591 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, 24 predicate places. [2024-11-07 19:21:15,591 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 177 transitions, 1407 flow [2024-11-07 19:21:15,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.6) internal successors, (203), 5 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:15,591 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:15,592 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:15,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-11-07 19:21:15,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:15,793 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-07 19:21:15,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:15,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1370943766, now seen corresponding path program 1 times [2024-11-07 19:21:15,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:15,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1957067598] [2024-11-07 19:21:15,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:15,794 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:15,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:15,796 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:21:15,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-11-07 19:21:15,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:15,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 19:21:15,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:15,962 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-11-07 19:21:15,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:21:15,972 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:15,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:15,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1957067598] [2024-11-07 19:21:15,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1957067598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:15,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:15,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:21:15,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658268294] [2024-11-07 19:21:15,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:15,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:21:15,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:15,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:21:15,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:21:16,078 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 132 [2024-11-07 19:21:16,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 177 transitions, 1407 flow. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:16,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:16,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 132 [2024-11-07 19:21:16,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:16,749 INFO L124 PetriNetUnfolderBase]: 2781/5512 cut-off events. [2024-11-07 19:21:16,750 INFO L125 PetriNetUnfolderBase]: For 26396/26865 co-relation queries the response was YES. [2024-11-07 19:21:16,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22840 conditions, 5512 events. 2781/5512 cut-off events. For 26396/26865 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 42810 event pairs, 1436 based on Foata normal form. 109/5439 useless extension candidates. Maximal degree in co-relation 21319. Up to 3831 conditions per place. [2024-11-07 19:21:16,776 INFO L140 encePairwiseOnDemand]: 128/132 looper letters, 103 selfloop transitions, 5 changer transitions 0/183 dead transitions. [2024-11-07 19:21:16,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 183 transitions, 1663 flow [2024-11-07 19:21:16,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:21:16,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:21:16,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2024-11-07 19:21:16,777 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.648989898989899 [2024-11-07 19:21:16,777 INFO L175 Difference]: Start difference. First operand has 146 places, 177 transitions, 1407 flow. Second operand 3 states and 257 transitions. [2024-11-07 19:21:16,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 183 transitions, 1663 flow [2024-11-07 19:21:16,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 183 transitions, 1575 flow, removed 20 selfloop flow, removed 4 redundant places. [2024-11-07 19:21:16,817 INFO L231 Difference]: Finished difference. Result has 142 places, 175 transitions, 1325 flow [2024-11-07 19:21:16,818 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=1315, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1325, PETRI_PLACES=142, PETRI_TRANSITIONS=175} [2024-11-07 19:21:16,818 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, 20 predicate places. [2024-11-07 19:21:16,818 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 175 transitions, 1325 flow [2024-11-07 19:21:16,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:16,818 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:16,818 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:16,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)] Forceful destruction successful, exit code 0 [2024-11-07 19:21:17,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:17,023 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-07 19:21:17,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:17,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1265102467, now seen corresponding path program 1 times [2024-11-07 19:21:17,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:17,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1703684769] [2024-11-07 19:21:17,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:17,024 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:17,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:17,026 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:21:17,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-11-07 19:21:17,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:17,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 19:21:17,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:17,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-07 19:21:17,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:21:17,177 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:17,177 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:17,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1703684769] [2024-11-07 19:21:17,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1703684769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:17,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:17,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:21:17,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424217834] [2024-11-07 19:21:17,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:17,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:21:17,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:17,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:21:17,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:21:17,275 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 132 [2024-11-07 19:21:17,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 175 transitions, 1325 flow. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:17,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:17,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 132 [2024-11-07 19:21:17,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:17,955 INFO L124 PetriNetUnfolderBase]: 2781/5504 cut-off events. [2024-11-07 19:21:17,956 INFO L125 PetriNetUnfolderBase]: For 23965/24434 co-relation queries the response was YES. [2024-11-07 19:21:17,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22446 conditions, 5504 events. 2781/5504 cut-off events. For 23965/24434 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 42687 event pairs, 1436 based on Foata normal form. 109/5431 useless extension candidates. Maximal degree in co-relation 21823. Up to 3831 conditions per place. [2024-11-07 19:21:17,991 INFO L140 encePairwiseOnDemand]: 128/132 looper letters, 103 selfloop transitions, 5 changer transitions 0/181 dead transitions. [2024-11-07 19:21:17,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 181 transitions, 1581 flow [2024-11-07 19:21:17,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:21:17,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:21:17,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2024-11-07 19:21:17,992 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.648989898989899 [2024-11-07 19:21:17,992 INFO L175 Difference]: Start difference. First operand has 142 places, 175 transitions, 1325 flow. Second operand 3 states and 257 transitions. [2024-11-07 19:21:17,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 181 transitions, 1581 flow [2024-11-07 19:21:18,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 181 transitions, 1571 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:21:18,044 INFO L231 Difference]: Finished difference. Result has 140 places, 173 transitions, 1321 flow [2024-11-07 19:21:18,045 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=1311, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1321, PETRI_PLACES=140, PETRI_TRANSITIONS=173} [2024-11-07 19:21:18,046 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, 18 predicate places. [2024-11-07 19:21:18,046 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 173 transitions, 1321 flow [2024-11-07 19:21:18,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:18,046 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:18,047 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:18,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-11-07 19:21:18,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:18,248 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-07 19:21:18,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:18,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1161263181, now seen corresponding path program 1 times [2024-11-07 19:21:18,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:18,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [263931370] [2024-11-07 19:21:18,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:18,250 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:18,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:18,252 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:21:18,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-11-07 19:21:18,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:18,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 19:21:18,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:18,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:21:18,407 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:18,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:18,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [263931370] [2024-11-07 19:21:18,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [263931370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:18,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:18,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:21:18,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323189342] [2024-11-07 19:21:18,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:18,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:21:18,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:18,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:21:18,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:21:18,409 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 132 [2024-11-07 19:21:18,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 173 transitions, 1321 flow. Second operand has 4 states, 4 states have (on average 73.5) internal successors, (294), 4 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:18,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:18,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 132 [2024-11-07 19:21:18,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:18,590 INFO L124 PetriNetUnfolderBase]: 266/540 cut-off events. [2024-11-07 19:21:18,590 INFO L125 PetriNetUnfolderBase]: For 1911/1976 co-relation queries the response was YES. [2024-11-07 19:21:18,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2175 conditions, 540 events. 266/540 cut-off events. For 1911/1976 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2136 event pairs, 50 based on Foata normal form. 49/569 useless extension candidates. Maximal degree in co-relation 2147. Up to 269 conditions per place. [2024-11-07 19:21:18,592 INFO L140 encePairwiseOnDemand]: 128/132 looper letters, 60 selfloop transitions, 9 changer transitions 0/100 dead transitions. [2024-11-07 19:21:18,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 100 transitions, 670 flow [2024-11-07 19:21:18,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:21:18,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:21:18,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 335 transitions. [2024-11-07 19:21:18,593 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.634469696969697 [2024-11-07 19:21:18,593 INFO L175 Difference]: Start difference. First operand has 140 places, 173 transitions, 1321 flow. Second operand 4 states and 335 transitions. [2024-11-07 19:21:18,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 100 transitions, 670 flow [2024-11-07 19:21:18,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 100 transitions, 490 flow, removed 33 selfloop flow, removed 30 redundant places. [2024-11-07 19:21:18,597 INFO L231 Difference]: Finished difference. Result has 93 places, 82 transitions, 300 flow [2024-11-07 19:21:18,597 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=300, PETRI_PLACES=93, PETRI_TRANSITIONS=82} [2024-11-07 19:21:18,598 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -29 predicate places. [2024-11-07 19:21:18,598 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 82 transitions, 300 flow [2024-11-07 19:21:18,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.5) internal successors, (294), 4 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:18,598 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:18,598 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:18,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)] Ended with exit code 0 [2024-11-07 19:21:18,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:18,799 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-07 19:21:18,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:18,799 INFO L85 PathProgramCache]: Analyzing trace with hash -879674172, now seen corresponding path program 1 times [2024-11-07 19:21:18,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:18,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1499314778] [2024-11-07 19:21:18,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:18,800 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:18,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:18,802 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:21:18,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-11-07 19:21:19,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:19,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-07 19:21:19,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:19,081 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 11 treesize of output 9 [2024-11-07 19:21:19,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:21:19,116 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:19,116 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:19,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1499314778] [2024-11-07 19:21:19,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1499314778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:19,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:19,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 19:21:19,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842593500] [2024-11-07 19:21:19,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:19,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 19:21:19,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:19,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 19:21:19,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 19:21:19,304 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 132 [2024-11-07 19:21:19,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 82 transitions, 300 flow. Second operand has 8 states, 8 states have (on average 73.375) internal successors, (587), 8 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:19,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:19,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 132 [2024-11-07 19:21:19,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:19,870 INFO L124 PetriNetUnfolderBase]: 595/1232 cut-off events. [2024-11-07 19:21:19,870 INFO L125 PetriNetUnfolderBase]: For 1819/1832 co-relation queries the response was YES. [2024-11-07 19:21:19,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3573 conditions, 1232 events. 595/1232 cut-off events. For 1819/1832 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6826 event pairs, 84 based on Foata normal form. 17/1224 useless extension candidates. Maximal degree in co-relation 3561. Up to 384 conditions per place. [2024-11-07 19:21:19,874 INFO L140 encePairwiseOnDemand]: 122/132 looper letters, 106 selfloop transitions, 32 changer transitions 0/169 dead transitions. [2024-11-07 19:21:19,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 169 transitions, 957 flow [2024-11-07 19:21:19,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 19:21:19,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-07 19:21:19,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 889 transitions. [2024-11-07 19:21:19,877 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6122589531680441 [2024-11-07 19:21:19,877 INFO L175 Difference]: Start difference. First operand has 93 places, 82 transitions, 300 flow. Second operand 11 states and 889 transitions. [2024-11-07 19:21:19,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 169 transitions, 957 flow [2024-11-07 19:21:19,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 169 transitions, 909 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-07 19:21:19,881 INFO L231 Difference]: Finished difference. Result has 107 places, 104 transitions, 553 flow [2024-11-07 19:21:19,882 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=553, PETRI_PLACES=107, PETRI_TRANSITIONS=104} [2024-11-07 19:21:19,882 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -15 predicate places. [2024-11-07 19:21:19,882 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 104 transitions, 553 flow [2024-11-07 19:21:19,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 73.375) internal successors, (587), 8 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:19,883 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:19,883 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:19,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-11-07 19:21:20,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:20,088 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-07 19:21:20,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:20,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1430119404, now seen corresponding path program 2 times [2024-11-07 19:21:20,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:20,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [975305039] [2024-11-07 19:21:20,089 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 19:21:20,089 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:20,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:20,096 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:21:20,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (22)] Waiting until timeout for monitored process [2024-11-07 19:21:20,324 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-07 19:21:20,324 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:21:20,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-07 19:21:20,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:20,424 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 11 treesize of output 9 [2024-11-07 19:21:20,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:21:20,453 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:20,453 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:20,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [975305039] [2024-11-07 19:21:20,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [975305039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:20,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:20,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 19:21:20,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377771155] [2024-11-07 19:21:20,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:20,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 19:21:20,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:20,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 19:21:20,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 19:21:20,632 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 132 [2024-11-07 19:21:20,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 104 transitions, 553 flow. Second operand has 8 states, 8 states have (on average 73.375) internal successors, (587), 8 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:20,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:20,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 132 [2024-11-07 19:21:20,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:21,222 INFO L124 PetriNetUnfolderBase]: 664/1366 cut-off events. [2024-11-07 19:21:21,222 INFO L125 PetriNetUnfolderBase]: For 4020/4045 co-relation queries the response was YES. [2024-11-07 19:21:21,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4803 conditions, 1366 events. 664/1366 cut-off events. For 4020/4045 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 7840 event pairs, 38 based on Foata normal form. 29/1374 useless extension candidates. Maximal degree in co-relation 4784. Up to 432 conditions per place. [2024-11-07 19:21:21,227 INFO L140 encePairwiseOnDemand]: 122/132 looper letters, 92 selfloop transitions, 52 changer transitions 0/175 dead transitions. [2024-11-07 19:21:21,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 175 transitions, 1318 flow [2024-11-07 19:21:21,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 19:21:21,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-07 19:21:21,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 936 transitions. [2024-11-07 19:21:21,229 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2024-11-07 19:21:21,232 INFO L175 Difference]: Start difference. First operand has 107 places, 104 transitions, 553 flow. Second operand 12 states and 936 transitions. [2024-11-07 19:21:21,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 175 transitions, 1318 flow [2024-11-07 19:21:21,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 175 transitions, 1262 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-11-07 19:21:21,240 INFO L231 Difference]: Finished difference. Result has 118 places, 127 transitions, 879 flow [2024-11-07 19:21:21,241 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=879, PETRI_PLACES=118, PETRI_TRANSITIONS=127} [2024-11-07 19:21:21,241 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -4 predicate places. [2024-11-07 19:21:21,241 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 127 transitions, 879 flow [2024-11-07 19:21:21,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 73.375) internal successors, (587), 8 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:21,241 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:21,241 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:21,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (22)] Ended with exit code 0 [2024-11-07 19:21:21,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:21,442 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-07 19:21:21,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:21,443 INFO L85 PathProgramCache]: Analyzing trace with hash 959047492, now seen corresponding path program 3 times [2024-11-07 19:21:21,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:21,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [593116301] [2024-11-07 19:21:21,443 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 19:21:21,443 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:21,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:21,445 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:21:21,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (23)] Waiting until timeout for monitored process [2024-11-07 19:21:21,738 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-07 19:21:21,738 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:21:21,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 19:21:21,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:21,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-07 19:21:21,818 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-07 19:21:21,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-07 19:21:21,842 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 16 treesize of output 13 [2024-11-07 19:21:21,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:21:21,844 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:21,844 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:21,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [593116301] [2024-11-07 19:21:21,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [593116301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:21,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:21,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:21:21,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723560047] [2024-11-07 19:21:21,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:21,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:21:21,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:21,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:21:21,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:21:22,020 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 132 [2024-11-07 19:21:22,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 127 transitions, 879 flow. Second operand has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:22,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:22,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 132 [2024-11-07 19:21:22,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:22,242 INFO L124 PetriNetUnfolderBase]: 660/1346 cut-off events. [2024-11-07 19:21:22,243 INFO L125 PetriNetUnfolderBase]: For 5574/5628 co-relation queries the response was YES. [2024-11-07 19:21:22,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5406 conditions, 1346 events. 660/1346 cut-off events. For 5574/5628 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7610 event pairs, 309 based on Foata normal form. 6/1313 useless extension candidates. Maximal degree in co-relation 5383. Up to 772 conditions per place. [2024-11-07 19:21:22,249 INFO L140 encePairwiseOnDemand]: 127/132 looper letters, 107 selfloop transitions, 7 changer transitions 0/142 dead transitions. [2024-11-07 19:21:22,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 142 transitions, 1253 flow [2024-11-07 19:21:22,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:21:22,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:21:22,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 291 transitions. [2024-11-07 19:21:22,250 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5511363636363636 [2024-11-07 19:21:22,250 INFO L175 Difference]: Start difference. First operand has 118 places, 127 transitions, 879 flow. Second operand 4 states and 291 transitions. [2024-11-07 19:21:22,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 142 transitions, 1253 flow [2024-11-07 19:21:22,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 142 transitions, 1161 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-11-07 19:21:22,257 INFO L231 Difference]: Finished difference. Result has 114 places, 126 transitions, 813 flow [2024-11-07 19:21:22,257 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=799, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=813, PETRI_PLACES=114, PETRI_TRANSITIONS=126} [2024-11-07 19:21:22,258 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -8 predicate places. [2024-11-07 19:21:22,258 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 126 transitions, 813 flow [2024-11-07 19:21:22,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:22,258 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:22,258 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:22,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (23)] Forceful destruction successful, exit code 0 [2024-11-07 19:21:22,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:22,463 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-07 19:21:22,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:22,463 INFO L85 PathProgramCache]: Analyzing trace with hash 2143376831, now seen corresponding path program 1 times [2024-11-07 19:21:22,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:22,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [662781153] [2024-11-07 19:21:22,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:22,464 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:22,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:22,466 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:21:22,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (24)] Waiting until timeout for monitored process [2024-11-07 19:21:22,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:22,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-07 19:21:22,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:22,752 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 11 treesize of output 9 [2024-11-07 19:21:22,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:21:22,811 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:22,811 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:22,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [662781153] [2024-11-07 19:21:22,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [662781153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:22,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:22,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 19:21:22,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853209329] [2024-11-07 19:21:22,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:22,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 19:21:22,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:22,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 19:21:22,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 19:21:22,966 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 132 [2024-11-07 19:21:22,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 126 transitions, 813 flow. Second operand has 8 states, 8 states have (on average 73.375) internal successors, (587), 8 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:22,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:22,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 132 [2024-11-07 19:21:22,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:23,644 INFO L124 PetriNetUnfolderBase]: 689/1432 cut-off events. [2024-11-07 19:21:23,644 INFO L125 PetriNetUnfolderBase]: For 4953/4985 co-relation queries the response was YES. [2024-11-07 19:21:23,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5668 conditions, 1432 events. 689/1432 cut-off events. For 4953/4985 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 8393 event pairs, 115 based on Foata normal form. 26/1430 useless extension candidates. Maximal degree in co-relation 5645. Up to 446 conditions per place. [2024-11-07 19:21:23,650 INFO L140 encePairwiseOnDemand]: 122/132 looper letters, 120 selfloop transitions, 58 changer transitions 0/208 dead transitions. [2024-11-07 19:21:23,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 208 transitions, 1727 flow [2024-11-07 19:21:23,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 19:21:23,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-07 19:21:23,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 955 transitions. [2024-11-07 19:21:23,652 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6029040404040404 [2024-11-07 19:21:23,652 INFO L175 Difference]: Start difference. First operand has 114 places, 126 transitions, 813 flow. Second operand 12 states and 955 transitions. [2024-11-07 19:21:23,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 208 transitions, 1727 flow [2024-11-07 19:21:23,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 208 transitions, 1699 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-07 19:21:23,662 INFO L231 Difference]: Finished difference. Result has 127 places, 148 transitions, 1232 flow [2024-11-07 19:21:23,662 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=799, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1232, PETRI_PLACES=127, PETRI_TRANSITIONS=148} [2024-11-07 19:21:23,662 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, 5 predicate places. [2024-11-07 19:21:23,662 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 148 transitions, 1232 flow [2024-11-07 19:21:23,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 73.375) internal successors, (587), 8 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:23,663 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:23,663 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:23,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (24)] Forceful destruction successful, exit code 0 [2024-11-07 19:21:23,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:23,867 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-07 19:21:23,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:23,868 INFO L85 PathProgramCache]: Analyzing trace with hash 746547989, now seen corresponding path program 2 times [2024-11-07 19:21:23,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:23,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [266327757] [2024-11-07 19:21:23,868 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 19:21:23,868 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:23,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:23,929 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:21:23,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (25)] Waiting until timeout for monitored process [2024-11-07 19:21:24,216 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-07 19:21:24,217 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:21:24,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 19:21:24,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:24,231 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-11-07 19:21:24,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-07 19:21:24,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:24,432 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-11-07 19:21:24,446 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 19:21:24,446 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-11-07 19:21:24,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:21:24,465 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:24,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:24,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [266327757] [2024-11-07 19:21:24,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [266327757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:24,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:24,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:21:24,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572227812] [2024-11-07 19:21:24,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:24,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:21:24,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:24,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:21:24,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:21:24,725 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 132 [2024-11-07 19:21:24,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 148 transitions, 1232 flow. Second operand has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:24,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:24,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 132 [2024-11-07 19:21:24,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:25,069 INFO L124 PetriNetUnfolderBase]: 686/1404 cut-off events. [2024-11-07 19:21:25,069 INFO L125 PetriNetUnfolderBase]: For 7281/7314 co-relation queries the response was YES. [2024-11-07 19:21:25,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6175 conditions, 1404 events. 686/1404 cut-off events. For 7281/7314 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 8072 event pairs, 403 based on Foata normal form. 8/1371 useless extension candidates. Maximal degree in co-relation 6147. Up to 1204 conditions per place. [2024-11-07 19:21:25,076 INFO L140 encePairwiseOnDemand]: 122/132 looper letters, 116 selfloop transitions, 4 changer transitions 0/142 dead transitions. [2024-11-07 19:21:25,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 142 transitions, 1460 flow [2024-11-07 19:21:25,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:21:25,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:21:25,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 270 transitions. [2024-11-07 19:21:25,077 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5113636363636364 [2024-11-07 19:21:25,077 INFO L175 Difference]: Start difference. First operand has 127 places, 148 transitions, 1232 flow. Second operand 4 states and 270 transitions. [2024-11-07 19:21:25,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 142 transitions, 1460 flow [2024-11-07 19:21:25,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 142 transitions, 1337 flow, removed 37 selfloop flow, removed 5 redundant places. [2024-11-07 19:21:25,088 INFO L231 Difference]: Finished difference. Result has 119 places, 142 transitions, 1105 flow [2024-11-07 19:21:25,089 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=1097, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1105, PETRI_PLACES=119, PETRI_TRANSITIONS=142} [2024-11-07 19:21:25,089 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -3 predicate places. [2024-11-07 19:21:25,089 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 142 transitions, 1105 flow [2024-11-07 19:21:25,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:25,089 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:25,089 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:25,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (25)] Forceful destruction successful, exit code 0 [2024-11-07 19:21:25,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:25,290 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-07 19:21:25,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:25,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1247570144, now seen corresponding path program 1 times [2024-11-07 19:21:25,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:25,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1193517358] [2024-11-07 19:21:25,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:25,291 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:25,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:25,294 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:21:25,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (26)] Waiting until timeout for monitored process [2024-11-07 19:21:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:25,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-07 19:21:25,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:25,634 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 11 treesize of output 9 [2024-11-07 19:21:25,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:21:25,697 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:25,697 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:25,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1193517358] [2024-11-07 19:21:25,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1193517358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:25,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:25,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 19:21:25,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723438864] [2024-11-07 19:21:25,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:25,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 19:21:25,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:25,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 19:21:25,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 19:21:25,854 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 132 [2024-11-07 19:21:25,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 142 transitions, 1105 flow. Second operand has 8 states, 8 states have (on average 73.625) internal successors, (589), 8 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:25,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:25,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 132 [2024-11-07 19:21:25,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:26,410 INFO L124 PetriNetUnfolderBase]: 629/1316 cut-off events. [2024-11-07 19:21:26,411 INFO L125 PetriNetUnfolderBase]: For 5688/5718 co-relation queries the response was YES. [2024-11-07 19:21:26,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5410 conditions, 1316 events. 629/1316 cut-off events. For 5688/5718 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 7448 event pairs, 119 based on Foata normal form. 32/1326 useless extension candidates. Maximal degree in co-relation 5384. Up to 673 conditions per place. [2024-11-07 19:21:26,416 INFO L140 encePairwiseOnDemand]: 122/132 looper letters, 91 selfloop transitions, 64 changer transitions 0/179 dead transitions. [2024-11-07 19:21:26,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 179 transitions, 1735 flow [2024-11-07 19:21:26,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 19:21:26,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-07 19:21:26,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 786 transitions. [2024-11-07 19:21:26,419 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5954545454545455 [2024-11-07 19:21:26,419 INFO L175 Difference]: Start difference. First operand has 119 places, 142 transitions, 1105 flow. Second operand 10 states and 786 transitions. [2024-11-07 19:21:26,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 179 transitions, 1735 flow [2024-11-07 19:21:26,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 179 transitions, 1727 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-07 19:21:26,433 INFO L231 Difference]: Finished difference. Result has 130 places, 154 transitions, 1494 flow [2024-11-07 19:21:26,434 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=1075, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1494, PETRI_PLACES=130, PETRI_TRANSITIONS=154} [2024-11-07 19:21:26,434 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, 8 predicate places. [2024-11-07 19:21:26,434 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 154 transitions, 1494 flow [2024-11-07 19:21:26,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 73.625) internal successors, (589), 8 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:26,435 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:26,435 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:26,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (26)] Forceful destruction successful, exit code 0 [2024-11-07 19:21:26,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:26,640 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-07 19:21:26,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:26,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1812717456, now seen corresponding path program 2 times [2024-11-07 19:21:26,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:26,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1442608183] [2024-11-07 19:21:26,641 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 19:21:26,641 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:21:26,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:26,642 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:21:26,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (27)] Waiting until timeout for monitored process [2024-11-07 19:21:26,903 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-07 19:21:26,903 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:21:26,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-07 19:21:26,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:27,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:27,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:27,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:27,073 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:27,074 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:27,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2024-11-07 19:21:27,121 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 19:21:27,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 28 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 75 [2024-11-07 19:21:29,679 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 19:21:29,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 123 treesize of output 63 [2024-11-07 19:21:29,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:21:29,700 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:29,700 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:29,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1442608183] [2024-11-07 19:21:29,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1442608183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:29,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:29,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 19:21:29,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655700617] [2024-11-07 19:21:29,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:29,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 19:21:29,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:29,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 19:21:29,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=54, Unknown=1, NotChecked=0, Total=72 [2024-11-07 19:21:31,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 19:21:33,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 19:21:36,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 19:21:38,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 19:21:41,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 19:21:43,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 19:21:45,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 19:21:48,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 19:21:50,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 19:21:52,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 19:21:55,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.52s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 19:21:57,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 19:21:59,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 19:22:02,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 19:22:04,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 19:22:06,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 19:22:08,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 19:22:09,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 19:22:12,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 19:22:15,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 19:22:17,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 19:22:19,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 19:22:21,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 19:22:24,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 19:22:26,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 19:22:28,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 19:22:28,360 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 132 [2024-11-07 19:22:28,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 154 transitions, 1494 flow. Second operand has 9 states, 9 states have (on average 42.111111111111114) internal successors, (379), 9 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:22:28,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:22:28,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 132 [2024-11-07 19:22:28,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:22:32,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]