./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-races/race-2_4-container_of.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 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_4-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', '2872c384167f2e3876e0fc6c6cdca366b47c7b8757c341fcf44d3890af023ea5'] 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_4-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 2872c384167f2e3876e0fc6c6cdca366b47c7b8757c341fcf44d3890af023ea5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 19:21:00,206 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 19:21:00,303 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:21:00,310 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 19:21:00,311 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 19:21:00,341 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 19:21:00,341 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 19:21:00,342 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 19:21:00,342 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 19:21:00,342 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 19:21:00,342 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 19:21:00,342 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 19:21:00,342 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 19:21:00,343 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 19:21:00,343 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 19:21:00,344 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 19:21:00,344 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 19:21:00,344 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 19:21:00,344 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 19:21:00,344 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 19:21:00,344 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 19:21:00,344 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 19:21:00,344 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 19:21:00,344 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 19:21:00,344 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 19:21:00,344 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 19:21:00,344 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 19:21:00,345 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 19:21:00,345 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 19:21:00,345 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 19:21:00,345 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 19:21:00,345 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 19:21:00,345 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 19:21:00,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:21:00,345 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 19:21:00,346 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 19:21:00,346 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 19:21:00,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 19:21:00,346 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 19:21:00,346 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 19:21:00,346 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 19:21:00,346 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 19:21:00,346 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 -> 2872c384167f2e3876e0fc6c6cdca366b47c7b8757c341fcf44d3890af023ea5 [2024-11-07 19:21:00,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 19:21:00,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 19:21:00,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 19:21:00,646 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 19:21:00,646 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 19:21:00,647 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-2_4-container_of.i [2024-11-07 19:21:01,955 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 19:21:02,314 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 19:21:02,315 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_4-container_of.i [2024-11-07 19:21:02,353 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/77ce2c615/afc3d4810e554caeaf13006152535337/FLAG5911fd91f [2024-11-07 19:21:02,527 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/77ce2c615/afc3d4810e554caeaf13006152535337 [2024-11-07 19:21:02,529 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 19:21:02,531 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 19:21:02,533 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 19:21:02,533 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 19:21:02,537 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 19:21:02,538 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:21:02" (1/1) ... [2024-11-07 19:21:02,539 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fa33202 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:02, skipping insertion in model container [2024-11-07 19:21:02,539 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:21:02" (1/1) ... [2024-11-07 19:21:02,590 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 19:21:02,873 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:21:02,886 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:21:02,893 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:21:02,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:21:02,923 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:21:02,923 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5042d382 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:02, skipping insertion in model container [2024-11-07 19:21:02,924 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 19:21:02,924 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-07 19:21:02,926 INFO L158 Benchmark]: Toolchain (without parser) took 393.96ms. Allocated memory is still 117.4MB. Free memory was 88.9MB in the beginning and 71.3MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 19:21:02,926 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 117.4MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:21:02,927 INFO L158 Benchmark]: CACSL2BoogieTranslator took 391.31ms. Allocated memory is still 117.4MB. Free memory was 88.7MB in the beginning and 71.3MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 19:21:02,927 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.29ms. Allocated memory is still 117.4MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 391.31ms. Allocated memory is still 117.4MB. Free memory was 88.7MB in the beginning and 71.3MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 3904]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_4-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 2872c384167f2e3876e0fc6c6cdca366b47c7b8757c341fcf44d3890af023ea5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 19:21:04,894 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 19:21:05,003 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:21:05,012 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 19:21:05,013 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 19:21:05,038 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 19:21:05,039 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 19:21:05,039 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 19:21:05,040 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 19:21:05,040 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 19:21:05,040 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 19:21:05,040 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 19:21:05,041 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 19:21:05,041 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 19:21:05,041 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 19:21:05,041 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 19:21:05,041 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 19:21:05,041 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 19:21:05,041 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 19:21:05,041 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 19:21:05,041 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 19:21:05,041 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 19:21:05,042 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 19:21:05,042 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 19:21:05,042 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 19:21:05,042 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 19:21:05,042 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 19:21:05,042 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 19:21:05,042 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 19:21:05,042 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 19:21:05,042 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 19:21:05,042 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 19:21:05,042 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 19:21:05,042 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 19:21:05,042 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 19:21:05,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:21:05,043 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 19:21:05,043 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 19:21:05,043 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 19:21:05,045 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 19:21:05,045 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 19:21:05,045 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 19:21:05,045 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 19:21:05,045 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 19:21:05,045 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 -> 2872c384167f2e3876e0fc6c6cdca366b47c7b8757c341fcf44d3890af023ea5 [2024-11-07 19:21:05,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 19:21:05,350 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 19:21:05,352 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 19:21:05,353 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 19:21:05,354 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 19:21:05,355 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-2_4-container_of.i [2024-11-07 19:21:06,746 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 19:21:07,108 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 19:21:07,110 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_4-container_of.i [2024-11-07 19:21:07,147 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0e5aa0070/e102d18d95e64d66971eb352f99d8374/FLAG00caf2fbd [2024-11-07 19:21:07,165 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0e5aa0070/e102d18d95e64d66971eb352f99d8374 [2024-11-07 19:21:07,167 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 19:21:07,168 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 19:21:07,169 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 19:21:07,170 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 19:21:07,173 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 19:21:07,174 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:21:07" (1/1) ... [2024-11-07 19:21:07,175 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73a58310 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:07, skipping insertion in model container [2024-11-07 19:21:07,175 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:21:07" (1/1) ... [2024-11-07 19:21:07,236 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 19:21:07,638 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:21:07,651 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:21:07,661 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:21:07,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:21:07,687 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-07 19:21:07,705 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 19:21:07,747 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:21:07,751 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:21:07,753 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:21:07,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:21:07,762 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 19:21:07,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:21:07,890 INFO L204 MainTranslator]: Completed translation [2024-11-07 19:21:07,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:07 WrapperNode [2024-11-07 19:21:07,892 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 19:21:07,893 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 19:21:07,893 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 19:21:07,893 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 19:21:07,900 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:21:07" (1/1) ... [2024-11-07 19:21:07,927 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:21:07" (1/1) ... [2024-11-07 19:21:07,947 INFO L138 Inliner]: procedures = 251, calls = 56, calls flagged for inlining = 13, calls inlined = 18, statements flattened = 152 [2024-11-07 19:21:07,948 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 19:21:07,948 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 19:21:07,948 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 19:21:07,948 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 19:21:07,956 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:07" (1/1) ... [2024-11-07 19:21:07,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:07" (1/1) ... [2024-11-07 19:21:07,960 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:07" (1/1) ... [2024-11-07 19:21:07,984 INFO L175 MemorySlicer]: Split 19 memory accesses to 3 slices as follows [2, 15, 2]. 79 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 10 writes are split as follows [0, 8, 2]. [2024-11-07 19:21:07,984 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:07" (1/1) ... [2024-11-07 19:21:07,984 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:07" (1/1) ... [2024-11-07 19:21:08,005 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:07" (1/1) ... [2024-11-07 19:21:08,008 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:07" (1/1) ... [2024-11-07 19:21:08,012 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:07" (1/1) ... [2024-11-07 19:21:08,014 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:07" (1/1) ... [2024-11-07 19:21:08,022 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 19:21:08,025 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 19:21:08,025 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 19:21:08,025 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 19:21:08,026 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:07" (1/1) ... [2024-11-07 19:21:08,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:21:08,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:21:08,073 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:21:08,077 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:21:08,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-07 19:21:08,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-07 19:21:08,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-07 19:21:08,100 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2024-11-07 19:21:08,100 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2024-11-07 19:21:08,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-07 19:21:08,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-07 19:21:08,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 19:21:08,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-07 19:21:08,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-07 19:21:08,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-07 19:21:08,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 19:21:08,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 19:21:08,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-07 19:21:08,101 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-07 19:21:08,101 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-07 19:21:08,101 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-07 19:21:08,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 19:21:08,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 19:21:08,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 19:21:08,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-07 19:21:08,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 19:21:08,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 19:21:08,105 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:21:08,419 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 19:21:08,421 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 19:21:08,967 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 19:21:08,967 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 19:21:09,168 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 19:21:09,169 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 19:21:09,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:21:09 BoogieIcfgContainer [2024-11-07 19:21:09,169 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 19:21:09,172 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 19:21:09,172 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 19:21:09,176 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 19:21:09,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:21:07" (1/3) ... [2024-11-07 19:21:09,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@715e2aa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:21:09, skipping insertion in model container [2024-11-07 19:21:09,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:07" (2/3) ... [2024-11-07 19:21:09,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@715e2aa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:21:09, skipping insertion in model container [2024-11-07 19:21:09,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:21:09" (3/3) ... [2024-11-07 19:21:09,179 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_4-container_of.i [2024-11-07 19:21:09,192 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 19:21:09,192 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2024-11-07 19:21:09,193 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 19:21:09,264 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-07 19:21:09,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 124 transitions, 262 flow [2024-11-07 19:21:09,369 INFO L124 PetriNetUnfolderBase]: 14/171 cut-off events. [2024-11-07 19:21:09,372 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-07 19:21:09,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 171 events. 14/171 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 694 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 83. Up to 4 conditions per place. [2024-11-07 19:21:09,377 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 124 transitions, 262 flow [2024-11-07 19:21:09,384 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 122 transitions, 256 flow [2024-11-07 19:21:09,395 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 19:21:09,407 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;@71676aa4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 19:21:09,408 INFO L334 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2024-11-07 19:21:09,412 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 19:21:09,412 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-07 19:21:09,412 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:21:09,412 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:09,413 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-07 19:21:09,413 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-07 19:21:09,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:09,417 INFO L85 PathProgramCache]: Analyzing trace with hash 563048, now seen corresponding path program 1 times [2024-11-07 19:21:09,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:09,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [699071797] [2024-11-07 19:21:09,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:09,428 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:09,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:09,431 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:21:09,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 (2)] Waiting until timeout for monitored process [2024-11-07 19:21:09,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:09,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 19:21:09,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:09,623 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:09,639 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:09,639 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:09,640 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:09,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [699071797] [2024-11-07 19:21:09,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [699071797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:09,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:09,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:21:09,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419470988] [2024-11-07 19:21:09,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:09,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:21:09,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:09,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:21:09,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:21:09,762 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 124 [2024-11-07 19:21:09,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 122 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:09,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:09,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 124 [2024-11-07 19:21:09,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:12,082 INFO L124 PetriNetUnfolderBase]: 9323/18312 cut-off events. [2024-11-07 19:21:12,082 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-11-07 19:21:12,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32872 conditions, 18312 events. 9323/18312 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 1065. Compared 177600 event pairs, 559 based on Foata normal form. 792/11540 useless extension candidates. Maximal degree in co-relation 32603. Up to 13528 conditions per place. [2024-11-07 19:21:12,225 INFO L140 encePairwiseOnDemand]: 112/124 looper letters, 94 selfloop transitions, 2 changer transitions 0/134 dead transitions. [2024-11-07 19:21:12,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 134 transitions, 472 flow [2024-11-07 19:21:12,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:21:12,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:21:12,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 226 transitions. [2024-11-07 19:21:12,239 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6075268817204301 [2024-11-07 19:21:12,240 INFO L175 Difference]: Start difference. First operand has 118 places, 122 transitions, 256 flow. Second operand 3 states and 226 transitions. [2024-11-07 19:21:12,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 134 transitions, 472 flow [2024-11-07 19:21:12,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 134 transitions, 464 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-07 19:21:12,257 INFO L231 Difference]: Finished difference. Result has 110 places, 108 transitions, 224 flow [2024-11-07 19:21:12,259 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=110, PETRI_TRANSITIONS=108} [2024-11-07 19:21:12,263 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -8 predicate places. [2024-11-07 19:21:12,263 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 108 transitions, 224 flow [2024-11-07 19:21:12,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:12,264 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:12,264 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-07 19:21:12,271 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 (2)] Forceful destruction successful, exit code 0 [2024-11-07 19:21:12,468 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:21:12,469 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-07 19:21:12,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:12,470 INFO L85 PathProgramCache]: Analyzing trace with hash 563049, now seen corresponding path program 1 times [2024-11-07 19:21:12,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:12,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [775237262] [2024-11-07 19:21:12,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:12,470 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,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:12,473 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:21:12,474 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:21:12,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:12,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 19:21:12,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:12,590 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:12,600 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,600 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:12,601 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:12,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [775237262] [2024-11-07 19:21:12,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [775237262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:12,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:12,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:21:12,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738236089] [2024-11-07 19:21:12,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:12,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:21:12,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:12,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:21:12,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:21:12,690 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 124 [2024-11-07 19:21:12,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 108 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:12,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:12,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 124 [2024-11-07 19:21:12,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:14,532 INFO L124 PetriNetUnfolderBase]: 9323/18310 cut-off events. [2024-11-07 19:21:14,533 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2024-11-07 19:21:14,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33036 conditions, 18310 events. 9323/18310 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 1065. Compared 177732 event pairs, 559 based on Foata normal form. 1/10747 useless extension candidates. Maximal degree in co-relation 1995. Up to 13528 conditions per place. [2024-11-07 19:21:14,635 INFO L140 encePairwiseOnDemand]: 120/124 looper letters, 93 selfloop transitions, 2 changer transitions 0/132 dead transitions. [2024-11-07 19:21:14,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 132 transitions, 462 flow [2024-11-07 19:21:14,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:21:14,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:21:14,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 220 transitions. [2024-11-07 19:21:14,642 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5913978494623656 [2024-11-07 19:21:14,642 INFO L175 Difference]: Start difference. First operand has 110 places, 108 transitions, 224 flow. Second operand 3 states and 220 transitions. [2024-11-07 19:21:14,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 132 transitions, 462 flow [2024-11-07 19:21:14,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 132 transitions, 458 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:21:14,648 INFO L231 Difference]: Finished difference. Result has 108 places, 106 transitions, 220 flow [2024-11-07 19:21:14,649 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=108, PETRI_TRANSITIONS=106} [2024-11-07 19:21:14,650 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -10 predicate places. [2024-11-07 19:21:14,650 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 106 transitions, 220 flow [2024-11-07 19:21:14,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:14,650 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:14,651 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-07 19:21:14,656 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:21:14,854 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:21:14,855 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-07 19:21:14,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:14,856 INFO L85 PathProgramCache]: Analyzing trace with hash 17452875, now seen corresponding path program 1 times [2024-11-07 19:21:14,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:14,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [625054068] [2024-11-07 19:21:14,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:14,857 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,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:14,862 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:21:14,864 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:21:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:14,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 19:21:14,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:14,948 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,948 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:14,948 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:14,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [625054068] [2024-11-07 19:21:14,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [625054068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:14,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:14,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:21:14,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245899573] [2024-11-07 19:21:14,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:14,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:21:14,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:14,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:21:14,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:21:14,950 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 124 [2024-11-07 19:21:14,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 106 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:14,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:14,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 124 [2024-11-07 19:21:14,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:16,262 INFO L124 PetriNetUnfolderBase]: 9322/15614 cut-off events. [2024-11-07 19:21:16,263 INFO L125 PetriNetUnfolderBase]: For 186/186 co-relation queries the response was YES. [2024-11-07 19:21:16,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30340 conditions, 15614 events. 9322/15614 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 834. Compared 119285 event pairs, 8957 based on Foata normal form. 1/9011 useless extension candidates. Maximal degree in co-relation 16169. Up to 13949 conditions per place. [2024-11-07 19:21:16,338 INFO L140 encePairwiseOnDemand]: 121/124 looper letters, 93 selfloop transitions, 2 changer transitions 0/131 dead transitions. [2024-11-07 19:21:16,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 131 transitions, 460 flow [2024-11-07 19:21:16,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:21:16,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:21:16,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 222 transitions. [2024-11-07 19:21:16,343 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5967741935483871 [2024-11-07 19:21:16,343 INFO L175 Difference]: Start difference. First operand has 108 places, 106 transitions, 220 flow. Second operand 3 states and 222 transitions. [2024-11-07 19:21:16,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 131 transitions, 460 flow [2024-11-07 19:21:16,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 131 transitions, 456 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:21:16,349 INFO L231 Difference]: Finished difference. Result has 108 places, 105 transitions, 218 flow [2024-11-07 19:21:16,349 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=218, PETRI_PLACES=108, PETRI_TRANSITIONS=105} [2024-11-07 19:21:16,350 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -10 predicate places. [2024-11-07 19:21:16,351 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 105 transitions, 218 flow [2024-11-07 19:21:16,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:16,351 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:16,351 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:16,356 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:21:16,552 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:21:16,552 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-07 19:21:16,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:16,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1118249543, now seen corresponding path program 1 times [2024-11-07 19:21:16,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:16,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1830678734] [2024-11-07 19:21:16,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:16,555 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:16,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:16,558 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:21:16,560 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:21:16,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:16,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 19:21:16,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:16,714 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:16,714 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:16,714 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:16,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1830678734] [2024-11-07 19:21:16,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1830678734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:16,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:16,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:21:16,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607778806] [2024-11-07 19:21:16,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:16,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:21:16,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:16,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:21:16,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:21:16,720 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 124 [2024-11-07 19:21:16,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 105 transitions, 218 flow. Second operand has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:16,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:16,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 124 [2024-11-07 19:21:16,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:18,122 INFO L124 PetriNetUnfolderBase]: 9321/16372 cut-off events. [2024-11-07 19:21:18,122 INFO L125 PetriNetUnfolderBase]: For 199/199 co-relation queries the response was YES. [2024-11-07 19:21:18,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31092 conditions, 16372 events. 9321/16372 cut-off events. For 199/199 co-relation queries the response was YES. Maximal size of possible extension queue 857. Compared 131897 event pairs, 9321 based on Foata normal form. 1/9713 useless extension candidates. Maximal degree in co-relation 29764. Up to 14494 conditions per place. [2024-11-07 19:21:18,200 INFO L140 encePairwiseOnDemand]: 120/124 looper letters, 74 selfloop transitions, 3 changer transitions 1/114 dead transitions. [2024-11-07 19:21:18,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 114 transitions, 394 flow [2024-11-07 19:21:18,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:21:18,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:21:18,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 251 transitions. [2024-11-07 19:21:18,202 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5060483870967742 [2024-11-07 19:21:18,202 INFO L175 Difference]: Start difference. First operand has 108 places, 105 transitions, 218 flow. Second operand 4 states and 251 transitions. [2024-11-07 19:21:18,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 114 transitions, 394 flow [2024-11-07 19:21:18,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 114 transitions, 388 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:21:18,219 INFO L231 Difference]: Finished difference. Result has 111 places, 107 transitions, 235 flow [2024-11-07 19:21:18,221 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=235, PETRI_PLACES=111, PETRI_TRANSITIONS=107} [2024-11-07 19:21:18,222 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -7 predicate places. [2024-11-07 19:21:18,222 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 107 transitions, 235 flow [2024-11-07 19:21:18,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:18,222 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:18,222 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:18,231 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:21:18,424 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:21:18,424 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-07 19:21:18,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:18,425 INFO L85 PathProgramCache]: Analyzing trace with hash 305997286, now seen corresponding path program 1 times [2024-11-07 19:21:18,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:18,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [269204105] [2024-11-07 19:21:18,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:18,426 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,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:18,428 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:21:18,429 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:21:18,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:18,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 19:21:18,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:18,541 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:18,558 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,559 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:18,559 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:18,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [269204105] [2024-11-07 19:21:18,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [269204105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:18,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:18,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:21:18,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683692896] [2024-11-07 19:21:18,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:18,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:21:18,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:18,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:21:18,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:21:18,606 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 124 [2024-11-07 19:21:18,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 107 transitions, 235 flow. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:18,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:18,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 124 [2024-11-07 19:21:18,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:19,601 INFO L124 PetriNetUnfolderBase]: 10049/16876 cut-off events. [2024-11-07 19:21:19,601 INFO L125 PetriNetUnfolderBase]: For 546/546 co-relation queries the response was YES. [2024-11-07 19:21:19,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33118 conditions, 16876 events. 10049/16876 cut-off events. For 546/546 co-relation queries the response was YES. Maximal size of possible extension queue 882. Compared 129157 event pairs, 9321 based on Foata normal form. 0/10098 useless extension candidates. Maximal degree in co-relation 33071. Up to 14501 conditions per place. [2024-11-07 19:21:19,644 INFO L140 encePairwiseOnDemand]: 115/124 looper letters, 95 selfloop transitions, 5 changer transitions 0/128 dead transitions. [2024-11-07 19:21:19,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 128 transitions, 477 flow [2024-11-07 19:21:19,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:21:19,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:21:19,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 208 transitions. [2024-11-07 19:21:19,645 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5591397849462365 [2024-11-07 19:21:19,645 INFO L175 Difference]: Start difference. First operand has 111 places, 107 transitions, 235 flow. Second operand 3 states and 208 transitions. [2024-11-07 19:21:19,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 128 transitions, 477 flow [2024-11-07 19:21:19,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 128 transitions, 476 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:21:19,654 INFO L231 Difference]: Finished difference. Result has 107 places, 102 transitions, 234 flow [2024-11-07 19:21:19,654 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=107, PETRI_TRANSITIONS=102} [2024-11-07 19:21:19,655 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -11 predicate places. [2024-11-07 19:21:19,655 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 102 transitions, 234 flow [2024-11-07 19:21:19,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:19,656 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:19,656 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:19,662 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:21:19,856 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:21:19,856 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-07 19:21:19,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:19,857 INFO L85 PathProgramCache]: Analyzing trace with hash 305997287, now seen corresponding path program 1 times [2024-11-07 19:21:19,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:19,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [400271970] [2024-11-07 19:21:19,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:19,858 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:19,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:19,860 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:21:19,860 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:21:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:19,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 19:21:19,973 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:19,979 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:20,034 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,034 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:20,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:20,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [400271970] [2024-11-07 19:21:20,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [400271970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:20,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:20,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:21:20,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740781368] [2024-11-07 19:21:20,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:20,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:21:20,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:20,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:21:20,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:21:20,122 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 124 [2024-11-07 19:21:20,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 102 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:20,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:20,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 124 [2024-11-07 19:21:20,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:20,953 INFO L124 PetriNetUnfolderBase]: 9321/15680 cut-off events. [2024-11-07 19:21:20,954 INFO L125 PetriNetUnfolderBase]: For 941/941 co-relation queries the response was YES. [2024-11-07 19:21:20,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31004 conditions, 15680 events. 9321/15680 cut-off events. For 941/941 co-relation queries the response was YES. Maximal size of possible extension queue 819. Compared 121858 event pairs, 3107 based on Foata normal form. 394/9594 useless extension candidates. Maximal degree in co-relation 27898. Up to 9600 conditions per place. [2024-11-07 19:21:21,000 INFO L140 encePairwiseOnDemand]: 117/124 looper letters, 106 selfloop transitions, 4 changer transitions 0/135 dead transitions. [2024-11-07 19:21:21,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 135 transitions, 524 flow [2024-11-07 19:21:21,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:21:21,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:21:21,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 223 transitions. [2024-11-07 19:21:21,002 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5994623655913979 [2024-11-07 19:21:21,002 INFO L175 Difference]: Start difference. First operand has 107 places, 102 transitions, 234 flow. Second operand 3 states and 223 transitions. [2024-11-07 19:21:21,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 135 transitions, 524 flow [2024-11-07 19:21:21,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 135 transitions, 512 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:21:21,017 INFO L231 Difference]: Finished difference. Result has 108 places, 103 transitions, 250 flow [2024-11-07 19:21:21,017 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=250, PETRI_PLACES=108, PETRI_TRANSITIONS=103} [2024-11-07 19:21:21,018 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -10 predicate places. [2024-11-07 19:21:21,018 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 103 transitions, 250 flow [2024-11-07 19:21:21,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:21,019 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:21,019 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:21,025 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 (7)] Ended with exit code 0 [2024-11-07 19:21:21,219 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:21:21,219 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-07 19:21:21,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:21,220 INFO L85 PathProgramCache]: Analyzing trace with hash 976462417, now seen corresponding path program 1 times [2024-11-07 19:21:21,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:21,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1531877053] [2024-11-07 19:21:21,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:21,221 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,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:21,223 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:21:21,226 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:21:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:21,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 19:21:21,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:21,339 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,380 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,380 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:21,380 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:21,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1531877053] [2024-11-07 19:21:21,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1531877053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:21,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:21,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:21:21,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97003296] [2024-11-07 19:21:21,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:21,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:21:21,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:21,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:21:21,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:21:21,483 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 124 [2024-11-07 19:21:21,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 103 transitions, 250 flow. Second operand has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:21,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:21,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 124 [2024-11-07 19:21:21,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:22,828 INFO L124 PetriNetUnfolderBase]: 7623/13756 cut-off events. [2024-11-07 19:21:22,828 INFO L125 PetriNetUnfolderBase]: For 778/778 co-relation queries the response was YES. [2024-11-07 19:21:22,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26853 conditions, 13756 events. 7623/13756 cut-off events. For 778/778 co-relation queries the response was YES. Maximal size of possible extension queue 646. Compared 111293 event pairs, 253 based on Foata normal form. 0/9114 useless extension candidates. Maximal degree in co-relation 9239. Up to 9075 conditions per place. [2024-11-07 19:21:22,877 INFO L140 encePairwiseOnDemand]: 112/124 looper letters, 183 selfloop transitions, 13 changer transitions 0/227 dead transitions. [2024-11-07 19:21:22,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 227 transitions, 903 flow [2024-11-07 19:21:22,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 19:21:22,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 19:21:22,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 547 transitions. [2024-11-07 19:21:22,879 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5514112903225806 [2024-11-07 19:21:22,879 INFO L175 Difference]: Start difference. First operand has 108 places, 103 transitions, 250 flow. Second operand 8 states and 547 transitions. [2024-11-07 19:21:22,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 227 transitions, 903 flow [2024-11-07 19:21:22,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 227 transitions, 895 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-07 19:21:22,908 INFO L231 Difference]: Finished difference. Result has 118 places, 110 transitions, 331 flow [2024-11-07 19:21:22,908 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=331, PETRI_PLACES=118, PETRI_TRANSITIONS=110} [2024-11-07 19:21:22,909 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 0 predicate places. [2024-11-07 19:21:22,909 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 110 transitions, 331 flow [2024-11-07 19:21:22,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:22,909 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:22,909 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:22,916 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 (8)] Forceful destruction successful, exit code 0 [2024-11-07 19:21:23,113 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:23,114 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-07 19:21:23,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:23,114 INFO L85 PathProgramCache]: Analyzing trace with hash 976462418, now seen corresponding path program 1 times [2024-11-07 19:21:23,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:23,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1942338390] [2024-11-07 19:21:23,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:23,115 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,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:23,117 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:23,118 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:23,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:23,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-07 19:21:23,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:23,259 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:23,353 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:23,353 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:23,354 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:23,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1942338390] [2024-11-07 19:21:23,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1942338390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:23,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:23,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:21:23,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680624300] [2024-11-07 19:21:23,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:23,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:21:23,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:23,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:21:23,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:21:23,527 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 124 [2024-11-07 19:21:23,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 110 transitions, 331 flow. Second operand has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:23,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:23,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 124 [2024-11-07 19:21:23,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:24,851 INFO L124 PetriNetUnfolderBase]: 6646/11793 cut-off events. [2024-11-07 19:21:24,851 INFO L125 PetriNetUnfolderBase]: For 4332/4332 co-relation queries the response was YES. [2024-11-07 19:21:24,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25123 conditions, 11793 events. 6646/11793 cut-off events. For 4332/4332 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 91682 event pairs, 845 based on Foata normal form. 524/9135 useless extension candidates. Maximal degree in co-relation 23658. Up to 6594 conditions per place. [2024-11-07 19:21:24,894 INFO L140 encePairwiseOnDemand]: 116/124 looper letters, 151 selfloop transitions, 10 changer transitions 1/193 dead transitions. [2024-11-07 19:21:24,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 193 transitions, 841 flow [2024-11-07 19:21:24,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 19:21:24,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-07 19:21:24,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 464 transitions. [2024-11-07 19:21:24,896 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5345622119815668 [2024-11-07 19:21:24,896 INFO L175 Difference]: Start difference. First operand has 118 places, 110 transitions, 331 flow. Second operand 7 states and 464 transitions. [2024-11-07 19:21:24,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 193 transitions, 841 flow [2024-11-07 19:21:24,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 193 transitions, 834 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-11-07 19:21:24,915 INFO L231 Difference]: Finished difference. Result has 126 places, 112 transitions, 379 flow [2024-11-07 19:21:24,915 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=379, PETRI_PLACES=126, PETRI_TRANSITIONS=112} [2024-11-07 19:21:24,915 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 8 predicate places. [2024-11-07 19:21:24,916 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 112 transitions, 379 flow [2024-11-07 19:21:24,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:24,916 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:24,916 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:24,922 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 (9)] Forceful destruction successful, exit code 0 [2024-11-07 19:21:25,116 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:25,117 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-07 19:21:25,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:25,117 INFO L85 PathProgramCache]: Analyzing trace with hash 244712209, now seen corresponding path program 1 times [2024-11-07 19:21:25,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:25,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1822708665] [2024-11-07 19:21:25,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:25,118 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,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:25,119 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:25,120 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:25,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:25,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 19:21:25,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:25,228 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:25,263 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,263 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:25,263 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:25,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1822708665] [2024-11-07 19:21:25,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1822708665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:25,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:25,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:21:25,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730544281] [2024-11-07 19:21:25,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:25,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:21:25,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:25,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:21:25,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:21:25,369 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 124 [2024-11-07 19:21:25,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 112 transitions, 379 flow. Second operand has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:25,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:25,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 124 [2024-11-07 19:21:25,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:26,518 INFO L124 PetriNetUnfolderBase]: 5575/9967 cut-off events. [2024-11-07 19:21:26,518 INFO L125 PetriNetUnfolderBase]: For 6993/6993 co-relation queries the response was YES. [2024-11-07 19:21:26,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23148 conditions, 9967 events. 5575/9967 cut-off events. For 6993/6993 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 74996 event pairs, 653 based on Foata normal form. 0/7770 useless extension candidates. Maximal degree in co-relation 20966. Up to 6421 conditions per place. [2024-11-07 19:21:26,573 INFO L140 encePairwiseOnDemand]: 112/124 looper letters, 174 selfloop transitions, 17 changer transitions 0/222 dead transitions. [2024-11-07 19:21:26,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 222 transitions, 1126 flow [2024-11-07 19:21:26,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 19:21:26,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 19:21:26,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 530 transitions. [2024-11-07 19:21:26,575 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5342741935483871 [2024-11-07 19:21:26,575 INFO L175 Difference]: Start difference. First operand has 126 places, 112 transitions, 379 flow. Second operand 8 states and 530 transitions. [2024-11-07 19:21:26,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 222 transitions, 1126 flow [2024-11-07 19:21:26,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 222 transitions, 1096 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-07 19:21:26,595 INFO L231 Difference]: Finished difference. Result has 132 places, 121 transitions, 486 flow [2024-11-07 19:21:26,596 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=486, PETRI_PLACES=132, PETRI_TRANSITIONS=121} [2024-11-07 19:21:26,596 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 14 predicate places. [2024-11-07 19:21:26,596 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 121 transitions, 486 flow [2024-11-07 19:21:26,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:26,597 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:26,597 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:26,602 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:26,798 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:26,798 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-07 19:21:26,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:26,798 INFO L85 PathProgramCache]: Analyzing trace with hash 244712210, now seen corresponding path program 1 times [2024-11-07 19:21:26,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:26,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1125546545] [2024-11-07 19:21:26,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:26,799 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,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:26,801 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:26,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 (11)] Waiting until timeout for monitored process [2024-11-07 19:21:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:26,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-07 19:21:26,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:26,930 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:27,010 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:27,010 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:27,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:27,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1125546545] [2024-11-07 19:21:27,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1125546545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:27,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:27,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:21:27,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357543271] [2024-11-07 19:21:27,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:27,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:21:27,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:27,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:21:27,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:21:27,275 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 124 [2024-11-07 19:21:27,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 121 transitions, 486 flow. Second operand has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:27,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:27,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 124 [2024-11-07 19:21:27,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:28,176 INFO L124 PetriNetUnfolderBase]: 4926/8678 cut-off events. [2024-11-07 19:21:28,177 INFO L125 PetriNetUnfolderBase]: For 8054/8056 co-relation queries the response was YES. [2024-11-07 19:21:28,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21879 conditions, 8678 events. 4926/8678 cut-off events. For 8054/8056 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 62594 event pairs, 1266 based on Foata normal form. 378/7832 useless extension candidates. Maximal degree in co-relation 19986. Up to 5127 conditions per place. [2024-11-07 19:21:28,229 INFO L140 encePairwiseOnDemand]: 116/124 looper letters, 145 selfloop transitions, 14 changer transitions 1/191 dead transitions. [2024-11-07 19:21:28,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 191 transitions, 1048 flow [2024-11-07 19:21:28,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 19:21:28,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-07 19:21:28,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 448 transitions. [2024-11-07 19:21:28,232 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5161290322580645 [2024-11-07 19:21:28,232 INFO L175 Difference]: Start difference. First operand has 132 places, 121 transitions, 486 flow. Second operand 7 states and 448 transitions. [2024-11-07 19:21:28,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 191 transitions, 1048 flow [2024-11-07 19:21:28,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 191 transitions, 1045 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:21:28,253 INFO L231 Difference]: Finished difference. Result has 140 places, 124 transitions, 561 flow [2024-11-07 19:21:28,254 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=561, PETRI_PLACES=140, PETRI_TRANSITIONS=124} [2024-11-07 19:21:28,254 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 22 predicate places. [2024-11-07 19:21:28,255 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 124 transitions, 561 flow [2024-11-07 19:21:28,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:28,255 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:28,256 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:28,262 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:28,456 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:28,456 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-07 19:21:28,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:28,457 INFO L85 PathProgramCache]: Analyzing trace with hash 242287941, now seen corresponding path program 1 times [2024-11-07 19:21:28,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:28,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1110071197] [2024-11-07 19:21:28,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:28,457 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:28,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:28,459 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:28,460 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:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:28,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 19:21:28,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:28,618 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:28,661 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-07 19:21:28,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-07 19:21:28,714 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:28,714 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:28,714 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:28,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1110071197] [2024-11-07 19:21:28,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1110071197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:28,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:28,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:21:28,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949926320] [2024-11-07 19:21:28,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:28,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:21:28,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:28,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:21:28,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:21:28,908 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 124 [2024-11-07 19:21:28,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 124 transitions, 561 flow. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:28,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:28,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 124 [2024-11-07 19:21:28,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:30,055 INFO L124 PetriNetUnfolderBase]: 4270/7291 cut-off events. [2024-11-07 19:21:30,055 INFO L125 PetriNetUnfolderBase]: For 10677/10696 co-relation queries the response was YES. [2024-11-07 19:21:30,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20331 conditions, 7291 events. 4270/7291 cut-off events. For 10677/10696 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 48830 event pairs, 2034 based on Foata normal form. 2/6536 useless extension candidates. Maximal degree in co-relation 18406. Up to 3737 conditions per place. [2024-11-07 19:21:30,078 INFO L140 encePairwiseOnDemand]: 115/124 looper letters, 101 selfloop transitions, 13 changer transitions 0/142 dead transitions. [2024-11-07 19:21:30,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 142 transitions, 845 flow [2024-11-07 19:21:30,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:21:30,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:21:30,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 240 transitions. [2024-11-07 19:21:30,079 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4838709677419355 [2024-11-07 19:21:30,079 INFO L175 Difference]: Start difference. First operand has 140 places, 124 transitions, 561 flow. Second operand 4 states and 240 transitions. [2024-11-07 19:21:30,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 142 transitions, 845 flow [2024-11-07 19:21:30,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 142 transitions, 824 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-07 19:21:30,087 INFO L231 Difference]: Finished difference. Result has 134 places, 120 transitions, 558 flow [2024-11-07 19:21:30,088 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=558, PETRI_PLACES=134, PETRI_TRANSITIONS=120} [2024-11-07 19:21:30,088 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 16 predicate places. [2024-11-07 19:21:30,088 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 120 transitions, 558 flow [2024-11-07 19:21:30,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:30,088 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:30,088 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:30,096 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:30,289 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:30,289 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-07 19:21:30,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:30,289 INFO L85 PathProgramCache]: Analyzing trace with hash 242287942, now seen corresponding path program 1 times [2024-11-07 19:21:30,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:30,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2003469058] [2024-11-07 19:21:30,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:30,290 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:30,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:30,292 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:30,293 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:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:30,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-07 19:21:30,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:30,470 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:30,475 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:30,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:30,580 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:30,594 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 19:21:30,595 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:30,608 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:30,608 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:30,609 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:30,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2003469058] [2024-11-07 19:21:30,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2003469058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:30,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:30,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:21:30,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835538001] [2024-11-07 19:21:30,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:30,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:21:30,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:30,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:21:30,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:21:30,732 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 124 [2024-11-07 19:21:30,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 120 transitions, 558 flow. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:30,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:30,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 124 [2024-11-07 19:21:30,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:31,370 INFO L124 PetriNetUnfolderBase]: 3166/5613 cut-off events. [2024-11-07 19:21:31,371 INFO L125 PetriNetUnfolderBase]: For 8582/8601 co-relation queries the response was YES. [2024-11-07 19:21:31,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15814 conditions, 5613 events. 3166/5613 cut-off events. For 8582/8601 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 37474 event pairs, 1578 based on Foata normal form. 2/5332 useless extension candidates. Maximal degree in co-relation 14098. Up to 2373 conditions per place. [2024-11-07 19:21:31,392 INFO L140 encePairwiseOnDemand]: 116/124 looper letters, 109 selfloop transitions, 11 changer transitions 0/144 dead transitions. [2024-11-07 19:21:31,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 144 transitions, 866 flow [2024-11-07 19:21:31,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:21:31,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:21:31,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 231 transitions. [2024-11-07 19:21:31,394 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4657258064516129 [2024-11-07 19:21:31,394 INFO L175 Difference]: Start difference. First operand has 134 places, 120 transitions, 558 flow. Second operand 4 states and 231 transitions. [2024-11-07 19:21:31,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 144 transitions, 866 flow [2024-11-07 19:21:31,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 144 transitions, 840 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-07 19:21:31,408 INFO L231 Difference]: Finished difference. Result has 130 places, 116 transitions, 546 flow [2024-11-07 19:21:31,409 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=546, PETRI_PLACES=130, PETRI_TRANSITIONS=116} [2024-11-07 19:21:31,409 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 12 predicate places. [2024-11-07 19:21:31,409 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 116 transitions, 546 flow [2024-11-07 19:21:31,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:31,410 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:31,410 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:31,417 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:31,613 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:31,614 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-07 19:21:31,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:31,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1770643278, now seen corresponding path program 1 times [2024-11-07 19:21:31,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:31,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1780616309] [2024-11-07 19:21:31,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:31,614 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:31,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:31,616 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:31,617 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:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:31,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 19:21:31,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:31,780 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:31,780 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:31,782 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:31,790 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:31,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 19:21:31,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 93 treesize of output 53 [2024-11-07 19:21:31,892 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 19:21:31,892 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:31,909 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:31,909 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:31,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:31,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1780616309] [2024-11-07 19:21:31,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1780616309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:31,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:31,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:21:31,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448504230] [2024-11-07 19:21:31,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:31,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:21:31,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:31,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:21:31,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:21:32,096 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 124 [2024-11-07 19:21:32,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 116 transitions, 546 flow. Second operand has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:32,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:32,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 124 [2024-11-07 19:21:32,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:33,655 INFO L124 PetriNetUnfolderBase]: 3824/6857 cut-off events. [2024-11-07 19:21:33,655 INFO L125 PetriNetUnfolderBase]: For 10625/10629 co-relation queries the response was YES. [2024-11-07 19:21:33,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18972 conditions, 6857 events. 3824/6857 cut-off events. For 10625/10629 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 48250 event pairs, 2502 based on Foata normal form. 123/6707 useless extension candidates. Maximal degree in co-relation 17047. Up to 5358 conditions per place. [2024-11-07 19:21:33,733 INFO L140 encePairwiseOnDemand]: 115/124 looper letters, 119 selfloop transitions, 18 changer transitions 0/166 dead transitions. [2024-11-07 19:21:33,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 166 transitions, 1032 flow [2024-11-07 19:21:33,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:21:33,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:21:33,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 318 transitions. [2024-11-07 19:21:33,735 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5129032258064516 [2024-11-07 19:21:33,735 INFO L175 Difference]: Start difference. First operand has 130 places, 116 transitions, 546 flow. Second operand 5 states and 318 transitions. [2024-11-07 19:21:33,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 166 transitions, 1032 flow [2024-11-07 19:21:33,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 166 transitions, 1004 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-07 19:21:33,746 INFO L231 Difference]: Finished difference. Result has 134 places, 130 transitions, 692 flow [2024-11-07 19:21:33,746 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=692, PETRI_PLACES=134, PETRI_TRANSITIONS=130} [2024-11-07 19:21:33,746 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 16 predicate places. [2024-11-07 19:21:33,746 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 130 transitions, 692 flow [2024-11-07 19:21:33,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:33,747 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:33,747 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:33,753 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:33,947 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:33,947 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-07 19:21:33,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:33,948 INFO L85 PathProgramCache]: Analyzing trace with hash 910496269, now seen corresponding path program 1 times [2024-11-07 19:21:33,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:33,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [753767613] [2024-11-07 19:21:33,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:33,948 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:33,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:33,950 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:33,952 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:34,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:34,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 19:21:34,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:34,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:34,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:34,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:34,149 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:34,150 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:34,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2024-11-07 19:21:34,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 19:21:34,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 88 treesize of output 63 [2024-11-07 19:21:34,232 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:34,233 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:34,233 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:34,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [753767613] [2024-11-07 19:21:34,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [753767613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:34,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:34,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:21:34,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556707787] [2024-11-07 19:21:34,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:34,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:21:34,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:34,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:21:34,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:21:34,343 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 124 [2024-11-07 19:21:34,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 130 transitions, 692 flow. Second operand has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:34,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:34,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 124 [2024-11-07 19:21:34,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:35,576 INFO L124 PetriNetUnfolderBase]: 5230/8992 cut-off events. [2024-11-07 19:21:35,576 INFO L125 PetriNetUnfolderBase]: For 16546/16550 co-relation queries the response was YES. [2024-11-07 19:21:35,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27920 conditions, 8992 events. 5230/8992 cut-off events. For 16546/16550 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 63723 event pairs, 2456 based on Foata normal form. 2/8516 useless extension candidates. Maximal degree in co-relation 26564. Up to 6340 conditions per place. [2024-11-07 19:21:35,618 INFO L140 encePairwiseOnDemand]: 114/124 looper letters, 139 selfloop transitions, 13 changer transitions 0/180 dead transitions. [2024-11-07 19:21:35,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 180 transitions, 1226 flow [2024-11-07 19:21:35,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:21:35,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:21:35,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 275 transitions. [2024-11-07 19:21:35,620 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5544354838709677 [2024-11-07 19:21:35,620 INFO L175 Difference]: Start difference. First operand has 134 places, 130 transitions, 692 flow. Second operand 4 states and 275 transitions. [2024-11-07 19:21:35,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 180 transitions, 1226 flow [2024-11-07 19:21:35,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 180 transitions, 1226 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 19:21:35,638 INFO L231 Difference]: Finished difference. Result has 140 places, 142 transitions, 842 flow [2024-11-07 19:21:35,638 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=842, PETRI_PLACES=140, PETRI_TRANSITIONS=142} [2024-11-07 19:21:35,638 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 22 predicate places. [2024-11-07 19:21:35,638 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 142 transitions, 842 flow [2024-11-07 19:21:35,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:35,639 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:35,639 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:35,648 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 (15)] Ended with exit code 0 [2024-11-07 19:21:35,839 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:35,840 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-07 19:21:35,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:35,840 INFO L85 PathProgramCache]: Analyzing trace with hash 2064447640, now seen corresponding path program 1 times [2024-11-07 19:21:35,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:35,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1145105171] [2024-11-07 19:21:35,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:35,840 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:35,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:35,842 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:35,843 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:36,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:36,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-07 19:21:36,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:36,021 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:36,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-07 19:21:36,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:36,147 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:36,158 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 19:21:36,158 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:36,171 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:36,171 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:36,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:36,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1145105171] [2024-11-07 19:21:36,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1145105171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:36,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:36,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 19:21:36,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434135098] [2024-11-07 19:21:36,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:36,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:21:36,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:36,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:21:36,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:21:36,483 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 124 [2024-11-07 19:21:36,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 142 transitions, 842 flow. Second operand has 6 states, 6 states have (on average 45.166666666666664) internal successors, (271), 6 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:36,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:36,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 124 [2024-11-07 19:21:36,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:37,702 INFO L124 PetriNetUnfolderBase]: 4508/8367 cut-off events. [2024-11-07 19:21:37,702 INFO L125 PetriNetUnfolderBase]: For 20024/20030 co-relation queries the response was YES. [2024-11-07 19:21:37,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27253 conditions, 8367 events. 4508/8367 cut-off events. For 20024/20030 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 62933 event pairs, 1149 based on Foata normal form. 436/8777 useless extension candidates. Maximal degree in co-relation 25842. Up to 4834 conditions per place. [2024-11-07 19:21:37,737 INFO L140 encePairwiseOnDemand]: 112/124 looper letters, 200 selfloop transitions, 22 changer transitions 0/253 dead transitions. [2024-11-07 19:21:37,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 253 transitions, 1839 flow [2024-11-07 19:21:37,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 19:21:37,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-07 19:21:37,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 557 transitions. [2024-11-07 19:21:37,739 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49910394265232977 [2024-11-07 19:21:37,739 INFO L175 Difference]: Start difference. First operand has 140 places, 142 transitions, 842 flow. Second operand 9 states and 557 transitions. [2024-11-07 19:21:37,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 253 transitions, 1839 flow [2024-11-07 19:21:37,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 253 transitions, 1782 flow, removed 24 selfloop flow, removed 2 redundant places. [2024-11-07 19:21:37,774 INFO L231 Difference]: Finished difference. Result has 144 places, 140 transitions, 844 flow [2024-11-07 19:21:37,775 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=844, PETRI_PLACES=144, PETRI_TRANSITIONS=140} [2024-11-07 19:21:37,776 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 26 predicate places. [2024-11-07 19:21:37,776 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 140 transitions, 844 flow [2024-11-07 19:21:37,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.166666666666664) internal successors, (271), 6 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:37,777 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:37,777 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:37,786 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 (16)] Ended with exit code 0 [2024-11-07 19:21:37,978 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:37,978 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-07 19:21:37,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:37,978 INFO L85 PathProgramCache]: Analyzing trace with hash -649154958, now seen corresponding path program 1 times [2024-11-07 19:21:37,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:37,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [33523625] [2024-11-07 19:21:37,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:37,979 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:37,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:37,981 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:37,982 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:38,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:38,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-07 19:21:38,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:38,137 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:38,140 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:38,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:38,227 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:38,238 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 19:21:38,238 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:38,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:21:38,251 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:38,251 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:38,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [33523625] [2024-11-07 19:21:38,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [33523625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:38,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:38,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 19:21:38,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9736703] [2024-11-07 19:21:38,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:38,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:21:38,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:38,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:21:38,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:21:38,498 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 124 [2024-11-07 19:21:38,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 140 transitions, 844 flow. Second operand has 6 states, 6 states have (on average 45.166666666666664) internal successors, (271), 6 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:38,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:38,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 124 [2024-11-07 19:21:38,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:39,658 INFO L124 PetriNetUnfolderBase]: 4439/8376 cut-off events. [2024-11-07 19:21:39,658 INFO L125 PetriNetUnfolderBase]: For 19895/19899 co-relation queries the response was YES. [2024-11-07 19:21:39,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26957 conditions, 8376 events. 4439/8376 cut-off events. For 19895/19899 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 64740 event pairs, 1146 based on Foata normal form. 328/8684 useless extension candidates. Maximal degree in co-relation 25536. Up to 4020 conditions per place. [2024-11-07 19:21:39,698 INFO L140 encePairwiseOnDemand]: 112/124 looper letters, 204 selfloop transitions, 22 changer transitions 0/257 dead transitions. [2024-11-07 19:21:39,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 257 transitions, 1887 flow [2024-11-07 19:21:39,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 19:21:39,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-07 19:21:39,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 558 transitions. [2024-11-07 19:21:39,700 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-11-07 19:21:39,700 INFO L175 Difference]: Start difference. First operand has 144 places, 140 transitions, 844 flow. Second operand 9 states and 558 transitions. [2024-11-07 19:21:39,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 257 transitions, 1887 flow [2024-11-07 19:21:39,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 257 transitions, 1838 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-07 19:21:39,747 INFO L231 Difference]: Finished difference. Result has 142 places, 138 transitions, 846 flow [2024-11-07 19:21:39,747 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=785, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=846, PETRI_PLACES=142, PETRI_TRANSITIONS=138} [2024-11-07 19:21:39,748 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 24 predicate places. [2024-11-07 19:21:39,748 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 138 transitions, 846 flow [2024-11-07 19:21:39,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.166666666666664) internal successors, (271), 6 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:39,748 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:39,748 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:39,756 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:39,949 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:39,949 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-07 19:21:39,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:39,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1839386097, now seen corresponding path program 1 times [2024-11-07 19:21:39,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:39,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [204624173] [2024-11-07 19:21:39,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:39,950 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:39,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:39,952 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:39,953 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:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:40,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 19:21:40,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:40,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:40,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:40,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:21:40,153 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:40,153 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:40,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2024-11-07 19:21:40,182 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:40,182 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:40,182 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:40,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [204624173] [2024-11-07 19:21:40,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [204624173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:40,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:40,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:21:40,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338418758] [2024-11-07 19:21:40,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:40,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:21:40,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:40,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:21:40,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:21:40,266 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 124 [2024-11-07 19:21:40,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 138 transitions, 846 flow. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:40,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:40,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 124 [2024-11-07 19:21:40,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:41,202 INFO L124 PetriNetUnfolderBase]: 4949/8829 cut-off events. [2024-11-07 19:21:41,202 INFO L125 PetriNetUnfolderBase]: For 21575/21577 co-relation queries the response was YES. [2024-11-07 19:21:41,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29724 conditions, 8829 events. 4949/8829 cut-off events. For 21575/21577 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 64876 event pairs, 3136 based on Foata normal form. 120/8900 useless extension candidates. Maximal degree in co-relation 28304. Up to 7173 conditions per place. [2024-11-07 19:21:41,239 INFO L140 encePairwiseOnDemand]: 116/124 looper letters, 118 selfloop transitions, 18 changer transitions 0/164 dead transitions. [2024-11-07 19:21:41,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 164 transitions, 1269 flow [2024-11-07 19:21:41,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:21:41,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:21:41,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 200 transitions. [2024-11-07 19:21:41,240 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5376344086021505 [2024-11-07 19:21:41,240 INFO L175 Difference]: Start difference. First operand has 142 places, 138 transitions, 846 flow. Second operand 3 states and 200 transitions. [2024-11-07 19:21:41,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 164 transitions, 1269 flow [2024-11-07 19:21:41,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 164 transitions, 1234 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-07 19:21:41,268 INFO L231 Difference]: Finished difference. Result has 140 places, 149 transitions, 1008 flow [2024-11-07 19:21:41,268 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1008, PETRI_PLACES=140, PETRI_TRANSITIONS=149} [2024-11-07 19:21:41,268 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 22 predicate places. [2024-11-07 19:21:41,268 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 149 transitions, 1008 flow [2024-11-07 19:21:41,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:41,268 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:41,269 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:41,276 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 (18)] Ended with exit code 0 [2024-11-07 19:21:41,469 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:41,469 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-07 19:21:41,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:41,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1445718879, now seen corresponding path program 1 times [2024-11-07 19:21:41,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:41,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [806661205] [2024-11-07 19:21:41,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:41,470 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:41,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:41,472 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:41,473 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:41,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:41,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 19:21:41,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:41,645 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:41,645 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:41,646 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 19:21:41,647 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:41,714 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 19:21:41,714 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:41,726 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:41,726 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:41,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:41,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [806661205] [2024-11-07 19:21:41,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [806661205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:41,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:41,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:21:41,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894004093] [2024-11-07 19:21:41,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:41,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:21:41,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:41,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:21:41,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:21:41,840 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 124 [2024-11-07 19:21:41,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 149 transitions, 1008 flow. Second operand has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:41,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:41,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 124 [2024-11-07 19:21:41,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:43,450 INFO L124 PetriNetUnfolderBase]: 5321/9768 cut-off events. [2024-11-07 19:21:43,450 INFO L125 PetriNetUnfolderBase]: For 31406/31408 co-relation queries the response was YES. [2024-11-07 19:21:43,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34805 conditions, 9768 events. 5321/9768 cut-off events. For 31406/31408 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 75509 event pairs, 3101 based on Foata normal form. 177/9900 useless extension candidates. Maximal degree in co-relation 32648. Up to 7480 conditions per place. [2024-11-07 19:21:43,501 INFO L140 encePairwiseOnDemand]: 116/124 looper letters, 146 selfloop transitions, 34 changer transitions 0/209 dead transitions. [2024-11-07 19:21:43,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 209 transitions, 1794 flow [2024-11-07 19:21:43,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:21:43,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:21:43,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 312 transitions. [2024-11-07 19:21:43,502 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5032258064516129 [2024-11-07 19:21:43,502 INFO L175 Difference]: Start difference. First operand has 140 places, 149 transitions, 1008 flow. Second operand 5 states and 312 transitions. [2024-11-07 19:21:43,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 209 transitions, 1794 flow [2024-11-07 19:21:43,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 209 transitions, 1742 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-11-07 19:21:43,584 INFO L231 Difference]: Finished difference. Result has 145 places, 172 transitions, 1365 flow [2024-11-07 19:21:43,585 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=956, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1365, PETRI_PLACES=145, PETRI_TRANSITIONS=172} [2024-11-07 19:21:43,585 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 27 predicate places. [2024-11-07 19:21:43,585 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 172 transitions, 1365 flow [2024-11-07 19:21:43,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:43,585 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:43,585 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:43,593 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 (19)] Ended with exit code 0 [2024-11-07 19:21:43,785 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:43,786 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-07 19:21:43,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:43,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1867513367, now seen corresponding path program 1 times [2024-11-07 19:21:43,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:43,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2143967358] [2024-11-07 19:21:43,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:43,787 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:43,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:43,788 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:43,789 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:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:21:43,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 19:21:43,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:21:44,042 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#data~1#1.base_89| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#data~1#1.base_89|)) (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#data~1#1.base_89| (_ bv0 1))))) is different from true [2024-11-07 19:21:44,049 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:44,051 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:21:44,051 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:21:44,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2143967358] [2024-11-07 19:21:44,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2143967358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:21:44,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:21:44,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:21:44,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313645874] [2024-11-07 19:21:44,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:21:44,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:21:44,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:21:44,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:21:44,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2024-11-07 19:21:44,093 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 124 [2024-11-07 19:21:44,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 172 transitions, 1365 flow. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:44,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:21:44,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 124 [2024-11-07 19:21:44,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:21:45,183 INFO L124 PetriNetUnfolderBase]: 5512/9969 cut-off events. [2024-11-07 19:21:45,183 INFO L125 PetriNetUnfolderBase]: For 41512/41514 co-relation queries the response was YES. [2024-11-07 19:21:45,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38053 conditions, 9969 events. 5512/9969 cut-off events. For 41512/41514 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 75795 event pairs, 2147 based on Foata normal form. 1/9931 useless extension candidates. Maximal degree in co-relation 35710. Up to 3484 conditions per place. [2024-11-07 19:21:45,269 INFO L140 encePairwiseOnDemand]: 98/124 looper letters, 160 selfloop transitions, 40 changer transitions 4/222 dead transitions. [2024-11-07 19:21:45,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 222 transitions, 2065 flow [2024-11-07 19:21:45,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:21:45,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:21:45,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 242 transitions. [2024-11-07 19:21:45,271 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3903225806451613 [2024-11-07 19:21:45,271 INFO L175 Difference]: Start difference. First operand has 145 places, 172 transitions, 1365 flow. Second operand 5 states and 242 transitions. [2024-11-07 19:21:45,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 222 transitions, 2065 flow [2024-11-07 19:21:45,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 222 transitions, 2019 flow, removed 23 selfloop flow, removed 0 redundant places. [2024-11-07 19:21:45,357 INFO L231 Difference]: Finished difference. Result has 152 places, 190 transitions, 1607 flow [2024-11-07 19:21:45,357 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=1319, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1607, PETRI_PLACES=152, PETRI_TRANSITIONS=190} [2024-11-07 19:21:45,357 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 34 predicate places. [2024-11-07 19:21:45,357 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 190 transitions, 1607 flow [2024-11-07 19:21:45,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:21:45,358 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:21:45,358 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:45,366 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 (20)] Forceful destruction successful, exit code 0 [2024-11-07 19:21:45,558 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:45,558 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-07 19:21:45,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:21:45,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1748656589, now seen corresponding path program 1 times [2024-11-07 19:21:45,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:21:45,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1698938451] [2024-11-07 19:21:45,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:21:45,560 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:45,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:21:45,561 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:45,562 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:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:21:45,789 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 19:21:45,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:21:45,934 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-07 19:21:45,935 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 19:21:45,935 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (54 of 55 remaining) [2024-11-07 19:21:45,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 55 remaining) [2024-11-07 19:21:45,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 55 remaining) [2024-11-07 19:21:45,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (51 of 55 remaining) [2024-11-07 19:21:45,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 55 remaining) [2024-11-07 19:21:45,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 55 remaining) [2024-11-07 19:21:45,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 55 remaining) [2024-11-07 19:21:45,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 55 remaining) [2024-11-07 19:21:45,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 55 remaining) [2024-11-07 19:21:45,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 55 remaining) [2024-11-07 19:21:45,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 55 remaining) [2024-11-07 19:21:45,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 55 remaining) [2024-11-07 19:21:45,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 55 remaining) [2024-11-07 19:21:45,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 55 remaining) [2024-11-07 19:21:45,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 55 remaining) [2024-11-07 19:21:45,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 55 remaining) [2024-11-07 19:21:45,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 55 remaining) [2024-11-07 19:21:45,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 55 remaining) [2024-11-07 19:21:45,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 55 remaining) [2024-11-07 19:21:45,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 55 remaining) [2024-11-07 19:21:45,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (34 of 55 remaining) [2024-11-07 19:21:45,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 55 remaining) [2024-11-07 19:21:45,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 55 remaining) [2024-11-07 19:21:45,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 55 remaining) [2024-11-07 19:21:45,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 55 remaining) [2024-11-07 19:21:45,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (29 of 55 remaining) [2024-11-07 19:21:45,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 55 remaining) [2024-11-07 19:21:45,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 55 remaining) [2024-11-07 19:21:45,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 55 remaining) [2024-11-07 19:21:45,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 55 remaining) [2024-11-07 19:21:45,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK (24 of 55 remaining) [2024-11-07 19:21:45,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 55 remaining) [2024-11-07 19:21:45,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 55 remaining) [2024-11-07 19:21:45,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (21 of 55 remaining) [2024-11-07 19:21:45,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK (20 of 55 remaining) [2024-11-07 19:21:45,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 55 remaining) [2024-11-07 19:21:45,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 55 remaining) [2024-11-07 19:21:45,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 55 remaining) [2024-11-07 19:21:45,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 55 remaining) [2024-11-07 19:21:45,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 55 remaining) [2024-11-07 19:21:45,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 55 remaining) [2024-11-07 19:21:45,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 55 remaining) [2024-11-07 19:21:45,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 55 remaining) [2024-11-07 19:21:45,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 55 remaining) [2024-11-07 19:21:45,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 55 remaining) [2024-11-07 19:21:45,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 55 remaining) [2024-11-07 19:21:45,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 55 remaining) [2024-11-07 19:21:45,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 55 remaining) [2024-11-07 19:21:45,943 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 55 remaining) [2024-11-07 19:21:45,943 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 55 remaining) [2024-11-07 19:21:45,943 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 55 remaining) [2024-11-07 19:21:45,943 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 55 remaining) [2024-11-07 19:21:45,943 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 55 remaining) [2024-11-07 19:21:45,943 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 55 remaining) [2024-11-07 19:21:45,943 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 55 remaining) [2024-11-07 19:21:45,952 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:46,144 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:46,144 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:21:46,184 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 19:21:46,184 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 19:21:46,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:21:46 BasicIcfg [2024-11-07 19:21:46,188 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 19:21:46,189 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 19:21:46,189 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 19:21:46,189 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 19:21:46,189 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:21:09" (3/4) ... [2024-11-07 19:21:46,191 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 19:21:46,191 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 19:21:46,192 INFO L158 Benchmark]: Toolchain (without parser) took 39023.92ms. Allocated memory was 83.9MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 57.6MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-07 19:21:46,192 INFO L158 Benchmark]: CDTParser took 2.59ms. Allocated memory is still 83.9MB. Free memory was 65.5MB in the beginning and 65.5MB in the end (delta: 34.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:21:46,193 INFO L158 Benchmark]: CACSL2BoogieTranslator took 723.18ms. Allocated memory is still 83.9MB. Free memory was 57.6MB in the beginning and 51.7MB in the end (delta: 5.9MB). Peak memory consumption was 39.6MB. Max. memory is 16.1GB. [2024-11-07 19:21:46,193 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.75ms. Allocated memory is still 83.9MB. Free memory was 51.7MB in the beginning and 49.0MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 19:21:46,193 INFO L158 Benchmark]: Boogie Preprocessor took 74.27ms. Allocated memory is still 83.9MB. Free memory was 49.0MB in the beginning and 44.6MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:21:46,193 INFO L158 Benchmark]: RCFGBuilder took 1144.52ms. Allocated memory is still 83.9MB. Free memory was 44.6MB in the beginning and 52.0MB in the end (delta: -7.4MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. [2024-11-07 19:21:46,193 INFO L158 Benchmark]: TraceAbstraction took 37016.32ms. Allocated memory was 83.9MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 51.4MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-11-07 19:21:46,194 INFO L158 Benchmark]: Witness Printer took 2.57ms. Allocated memory is still 2.2GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 218.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 19:21:46,195 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.59ms. Allocated memory is still 83.9MB. Free memory was 65.5MB in the beginning and 65.5MB in the end (delta: 34.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 723.18ms. Allocated memory is still 83.9MB. Free memory was 57.6MB in the beginning and 51.7MB in the end (delta: 5.9MB). Peak memory consumption was 39.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.75ms. Allocated memory is still 83.9MB. Free memory was 51.7MB in the beginning and 49.0MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.27ms. Allocated memory is still 83.9MB. Free memory was 49.0MB in the beginning and 44.6MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1144.52ms. Allocated memory is still 83.9MB. Free memory was 44.6MB in the beginning and 52.0MB in the end (delta: -7.4MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. * TraceAbstraction took 37016.32ms. Allocated memory was 83.9MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 51.4MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 2.57ms. Allocated memory is still 2.2GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 218.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of large string literal at line 3883, overapproximation of memtrack at line 3883. Possible FailurePath: [L3888] 0 pthread_t t1,t2; [L3962] CALL, EXPR 0 my_drv_init() [L3956] 0 return 0; [L3962] RET, EXPR 0 my_drv_init() [L3962] 0 int ret = my_drv_init(); [L3963] COND TRUE 0 ret==0 [L3964] 0 int probe_ret; [L3965] 0 struct my_data data; [L3966] CALL, EXPR 0 my_drv_probe(&data) [L3919] 0 struct device *d = &data->dev; [L3923] 0 data->shared.a = 0 VAL [t1=0, t2=0] [L3924] 0 data->shared.b = 0 [L3925] 0 int res = __VERIFIER_nondet_int(); [L3926] COND FALSE 0 !(\read(res)) [L3929] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [\old(arg)={7:24}, \old(data)={7:0}, d={7:24}, data={7:0}, res=0, t1=0, t2=0] [L3902] 1 struct device *dev = (struct device*)arg; [L3903] 1 struct my_data *data; [L3904] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L3904] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3930] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [\old(arg)={7:24}, \old(data)={7:0}, arg={7:24}, d={7:24}, data={7:0}, data={7:0}, dev={7:24}, res=0, t1=0, t2=1] [L3931] 0 return 0; VAL [\old(arg)={7:24}, \old(data)={7:0}, \result=0, arg={7:24}, d={7:24}, data={7:0}, data={7:0}, dev={7:24}, res=0, t1=0, t2=1] [L3966] RET, EXPR 0 my_drv_probe(&data) [L3966] 0 probe_ret = my_drv_probe(&data) [L3967] COND TRUE 0 probe_ret==0 [L3968] CALL 0 my_drv_disconnect(&data) [L3937] 0 void *status; VAL [\old(arg)={7:24}, \old(data)={7:0}, arg={7:24}, data={7:0}, data={7:0}, dev={7:24}, status={3:0}, t1=0, t2=1] [L3940] 0 data->shared.a = 3 VAL [\old(arg)={7:24}, arg={7:24}, data={7:0}, dev={7:24}, t1=0, t2=1] [L3943] 0 data->shared.b = 3 VAL [\old(arg)={7:24}, arg={7:24}, data={7:0}, dev={7:24}, t1=0, t2=1] [L3907] 1 data->shared.a = 1 VAL [\old(arg)={7:24}, arg={7:24}, data={7:0}, dev={7:24}, t1=0, t2=1] [L3946] EXPR 0 data->shared.a [L3946] CALL 0 ldv_assert(data->shared.a==3) [L3887] COND TRUE 0 !expression [L3887] CALL 0 reach_error() [L3883] 0 (0) ? (void) (0) : __assert_fail ("0", "../sv-benchmarks/c/ldv-races/race-2_4-container_of.c", 13, __extension__ __PRETTY_FUNCTION__) [L3883] 0 __assert_fail ("0", "../sv-benchmarks/c/ldv-races/race-2_4-container_of.c", 13, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={7:24}, arg={7:24}, data={7:0}, dev={7:24}, t1=0, t2=1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 3961]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 3930]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 3929]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 131 locations, 55 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 36.9s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 28.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2563 SdHoareTripleChecker+Valid, 11.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2097 mSDsluCounter, 129 SdHoareTripleChecker+Invalid, 10.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 137 IncrementalHoareTripleChecker+Unchecked, 46 mSDsCounter, 104 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5417 IncrementalHoareTripleChecker+Invalid, 5658 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 104 mSolverCounterUnsat, 83 mSDtfsCounter, 5417 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 217 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1607occurred in iteration=19, InterpolantAutomatonStates: 97, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 230 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 193 ConstructedInterpolants, 3 QuantifiedInterpolants, 1770 SizeOfPredicates, 100 NumberOfNonLiveVariables, 1988 ConjunctsInSsa, 196 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 19:21:46,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample