./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_91-arrayloop2_racefree.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/goblint-regression/28-race_reach_91-arrayloop2_racefree.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', 'ac583c9331a2ad916f4c22969f16915d9226d22c75c23a992e6ef02ec672d4b3'] 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/goblint-regression/28-race_reach_91-arrayloop2_racefree.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 ac583c9331a2ad916f4c22969f16915d9226d22c75c23a992e6ef02ec672d4b3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 19:27:02,722 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 19:27:02,803 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:27:02,811 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 19:27:02,812 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 19:27:02,838 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 19:27:02,840 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 19:27:02,840 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 19:27:02,840 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 19:27:02,841 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 19:27:02,842 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 19:27:02,842 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 19:27:02,842 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 19:27:02,842 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 19:27:02,843 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 19:27:02,843 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 19:27:02,843 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 19:27:02,843 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 19:27:02,843 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 19:27:02,844 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 19:27:02,844 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 19:27:02,844 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 19:27:02,844 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 19:27:02,844 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 19:27:02,844 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 19:27:02,844 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 19:27:02,844 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 19:27:02,845 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 19:27:02,845 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 19:27:02,845 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 19:27:02,845 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 19:27:02,845 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 19:27:02,845 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 19:27:02,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:27:02,846 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 19:27:02,846 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 19:27:02,846 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 19:27:02,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 19:27:02,846 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 19:27:02,847 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 19:27:02,847 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 19:27:02,847 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 19:27:02,847 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 -> ac583c9331a2ad916f4c22969f16915d9226d22c75c23a992e6ef02ec672d4b3 [2024-11-07 19:27:03,151 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 19:27:03,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 19:27:03,167 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 19:27:03,168 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 19:27:03,168 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 19:27:03,170 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_91-arrayloop2_racefree.i [2024-11-07 19:27:04,467 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 19:27:04,833 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 19:27:04,835 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_91-arrayloop2_racefree.i [2024-11-07 19:27:04,856 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c670db5d7/4f5defb3f1924e80a470e5bbe9d66ad1/FLAGb9fe029c1 [2024-11-07 19:27:04,875 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c670db5d7/4f5defb3f1924e80a470e5bbe9d66ad1 [2024-11-07 19:27:04,877 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 19:27:04,879 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 19:27:04,881 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 19:27:04,881 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 19:27:04,885 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 19:27:04,886 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:27:04" (1/1) ... [2024-11-07 19:27:04,889 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79212436 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:27:04, skipping insertion in model container [2024-11-07 19:27:04,889 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:27:04" (1/1) ... [2024-11-07 19:27:04,930 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 19:27:05,263 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-07 19:27:05,263 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-07 19:27:05,263 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-07 19:27:05,264 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-07 19:27:05,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:27:05,319 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:27:05,319 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@70f676b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:27:05, skipping insertion in model container [2024-11-07 19:27:05,320 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 19:27:05,320 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-07 19:27:05,321 INFO L158 Benchmark]: Toolchain (without parser) took 442.28ms. Allocated memory is still 100.7MB. Free memory was 74.5MB in the beginning and 57.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 19:27:05,322 INFO L158 Benchmark]: CDTParser took 0.92ms. Allocated memory is still 83.9MB. Free memory is still 48.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:27:05,322 INFO L158 Benchmark]: CACSL2BoogieTranslator took 438.69ms. Allocated memory is still 100.7MB. Free memory was 74.3MB in the beginning and 57.7MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 19:27:05,323 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.92ms. Allocated memory is still 83.9MB. Free memory is still 48.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 438.69ms. Allocated memory is still 100.7MB. Free memory was 74.3MB in the beginning and 57.7MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1044]: 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/goblint-regression/28-race_reach_91-arrayloop2_racefree.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 ac583c9331a2ad916f4c22969f16915d9226d22c75c23a992e6ef02ec672d4b3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 19:27:07,278 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 19:27:07,377 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:27:07,386 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 19:27:07,387 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 19:27:07,416 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 19:27:07,418 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 19:27:07,418 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 19:27:07,418 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 19:27:07,419 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 19:27:07,419 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 19:27:07,419 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 19:27:07,420 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 19:27:07,420 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 19:27:07,420 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 19:27:07,421 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 19:27:07,421 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 19:27:07,421 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 19:27:07,421 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 19:27:07,421 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 19:27:07,421 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 19:27:07,421 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 19:27:07,422 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 19:27:07,422 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 19:27:07,422 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 19:27:07,422 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 19:27:07,422 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 19:27:07,422 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 19:27:07,422 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 19:27:07,422 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 19:27:07,423 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 19:27:07,423 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 19:27:07,423 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 19:27:07,423 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 19:27:07,423 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 19:27:07,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:27:07,424 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 19:27:07,424 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 19:27:07,424 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 19:27:07,424 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 19:27:07,424 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 19:27:07,424 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 19:27:07,424 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 19:27:07,424 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 19:27:07,424 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 -> ac583c9331a2ad916f4c22969f16915d9226d22c75c23a992e6ef02ec672d4b3 [2024-11-07 19:27:07,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 19:27:07,707 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 19:27:07,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 19:27:07,711 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 19:27:07,711 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 19:27:07,712 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_91-arrayloop2_racefree.i [2024-11-07 19:27:09,034 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 19:27:09,340 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 19:27:09,341 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_91-arrayloop2_racefree.i [2024-11-07 19:27:09,363 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ae4b07a66/cc3779a54f9247c5ab855890d674ca1e/FLAGdbb7687ea [2024-11-07 19:27:09,605 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ae4b07a66/cc3779a54f9247c5ab855890d674ca1e [2024-11-07 19:27:09,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 19:27:09,608 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 19:27:09,609 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 19:27:09,609 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 19:27:09,612 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 19:27:09,613 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:27:09" (1/1) ... [2024-11-07 19:27:09,613 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26ce990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:27:09, skipping insertion in model container [2024-11-07 19:27:09,614 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:27:09" (1/1) ... [2024-11-07 19:27:09,646 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 19:27:09,966 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-07 19:27:09,966 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-07 19:27:09,966 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-07 19:27:09,967 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-07 19:27:09,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:27:10,030 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-07 19:27:10,041 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 19:27:10,073 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-07 19:27:10,073 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-07 19:27:10,074 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-07 19:27:10,074 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-07 19:27:10,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:27:10,113 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 19:27:10,163 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-07 19:27:10,163 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-07 19:27:10,163 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-07 19:27:10,163 WARN L1674 CHandler]: Possible shadowing of function new [2024-11-07 19:27:10,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:27:10,252 INFO L204 MainTranslator]: Completed translation [2024-11-07 19:27:10,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:27:10 WrapperNode [2024-11-07 19:27:10,254 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 19:27:10,255 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 19:27:10,255 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 19:27:10,255 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 19:27:10,260 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:27:10" (1/1) ... [2024-11-07 19:27:10,278 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:27:10" (1/1) ... [2024-11-07 19:27:10,302 INFO L138 Inliner]: procedures = 283, calls = 120, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 264 [2024-11-07 19:27:10,302 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 19:27:10,303 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 19:27:10,303 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 19:27:10,303 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 19:27:10,316 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:27:10" (1/1) ... [2024-11-07 19:27:10,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:27:10" (1/1) ... [2024-11-07 19:27:10,321 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:27:10" (1/1) ... [2024-11-07 19:27:10,340 INFO L175 MemorySlicer]: Split 96 memory accesses to 4 slices as follows [2, 87, 5, 2]. 91 percent of accesses are in the largest equivalence class. The 77 initializations are split as follows [2, 70, 5, 0]. The 12 writes are split as follows [0, 11, 0, 1]. [2024-11-07 19:27:10,340 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:27:10" (1/1) ... [2024-11-07 19:27:10,341 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:27:10" (1/1) ... [2024-11-07 19:27:10,356 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:27:10" (1/1) ... [2024-11-07 19:27:10,359 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:27:10" (1/1) ... [2024-11-07 19:27:10,363 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:27:10" (1/1) ... [2024-11-07 19:27:10,365 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:27:10" (1/1) ... [2024-11-07 19:27:10,371 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 19:27:10,379 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 19:27:10,379 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 19:27:10,379 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 19:27:10,380 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:27:10" (1/1) ... [2024-11-07 19:27:10,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:27:10,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:27:10,412 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:27:10,414 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:27:10,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-07 19:27:10,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-07 19:27:10,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-07 19:27:10,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-07 19:27:10,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-07 19:27:10,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 19:27:10,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 19:27:10,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-07 19:27:10,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-07 19:27:10,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 19:27:10,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-07 19:27:10,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-07 19:27:10,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-07 19:27:10,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-07 19:27:10,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-07 19:27:10,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-07 19:27:10,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-07 19:27:10,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-07 19:27:10,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 19:27:10,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 19:27:10,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-07 19:27:10,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-07 19:27:10,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-07 19:27:10,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-07 19:27:10,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-07 19:27:10,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-07 19:27:10,437 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-07 19:27:10,438 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-07 19:27:10,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 19:27:10,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 19:27:10,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 19:27:10,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 19:27:10,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-07 19:27:10,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-07 19:27:10,439 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-07 19:27:10,439 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-07 19:27:10,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 19:27:10,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 19:27:10,441 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:27:10,609 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 19:27:10,611 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 19:27:11,366 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 19:27:11,367 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 19:27:12,731 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 19:27:12,731 INFO L316 CfgBuilder]: Removed 16 assume(true) statements. [2024-11-07 19:27:12,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:27:12 BoogieIcfgContainer [2024-11-07 19:27:12,731 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 19:27:12,734 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 19:27:12,735 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 19:27:12,739 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 19:27:12,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:27:09" (1/3) ... [2024-11-07 19:27:12,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e033c39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:27:12, skipping insertion in model container [2024-11-07 19:27:12,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:27:10" (2/3) ... [2024-11-07 19:27:12,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e033c39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:27:12, skipping insertion in model container [2024-11-07 19:27:12,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:27:12" (3/3) ... [2024-11-07 19:27:12,742 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_91-arrayloop2_racefree.i [2024-11-07 19:27:12,756 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 19:27:12,758 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 40 error locations. [2024-11-07 19:27:12,758 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 19:27:12,853 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-07 19:27:12,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 121 transitions, 249 flow [2024-11-07 19:27:12,942 INFO L124 PetriNetUnfolderBase]: 18/133 cut-off events. [2024-11-07 19:27:12,945 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-07 19:27:12,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 133 events. 18/133 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 494 event pairs, 0 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 82. Up to 4 conditions per place. [2024-11-07 19:27:12,949 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 121 transitions, 249 flow [2024-11-07 19:27:12,953 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 121 transitions, 249 flow [2024-11-07 19:27:12,963 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 19:27:12,977 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;@27af8c22, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 19:27:12,978 INFO L334 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2024-11-07 19:27:12,988 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 19:27:12,989 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-07 19:27:12,989 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:27:12,990 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:27:12,990 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-07 19:27:12,991 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-07 19:27:12,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:27:12,995 INFO L85 PathProgramCache]: Analyzing trace with hash 698246, now seen corresponding path program 1 times [2024-11-07 19:27:13,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:27:13,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [881433039] [2024-11-07 19:27:13,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:27:13,010 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:27:13,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:27:13,014 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:27:13,015 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:27:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:27:13,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 19:27:13,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:27:13,269 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:27:13,269 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:27:13,270 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:27:13,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [881433039] [2024-11-07 19:27:13,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [881433039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:27:13,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:27:13,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:27:13,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737575562] [2024-11-07 19:27:13,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:27:13,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:27:13,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:27:13,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:27:13,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:27:13,565 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 121 [2024-11-07 19:27:13,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 121 transitions, 249 flow. Second operand has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 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:27:13,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:27:13,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 121 [2024-11-07 19:27:13,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:27:14,045 INFO L124 PetriNetUnfolderBase]: 125/457 cut-off events. [2024-11-07 19:27:14,045 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-07 19:27:14,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 733 conditions, 457 events. 125/457 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2343 event pairs, 64 based on Foata normal form. 53/430 useless extension candidates. Maximal degree in co-relation 659. Up to 174 conditions per place. [2024-11-07 19:27:14,054 INFO L140 encePairwiseOnDemand]: 102/121 looper letters, 63 selfloop transitions, 4 changer transitions 0/129 dead transitions. [2024-11-07 19:27:14,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 129 transitions, 399 flow [2024-11-07 19:27:14,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:27:14,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:27:14,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 342 transitions. [2024-11-07 19:27:14,072 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7066115702479339 [2024-11-07 19:27:14,074 INFO L175 Difference]: Start difference. First operand has 106 places, 121 transitions, 249 flow. Second operand 4 states and 342 transitions. [2024-11-07 19:27:14,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 129 transitions, 399 flow [2024-11-07 19:27:14,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 129 transitions, 399 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 19:27:14,085 INFO L231 Difference]: Finished difference. Result has 107 places, 106 transitions, 233 flow [2024-11-07 19:27:14,087 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=233, PETRI_PLACES=107, PETRI_TRANSITIONS=106} [2024-11-07 19:27:14,092 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 1 predicate places. [2024-11-07 19:27:14,092 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 106 transitions, 233 flow [2024-11-07 19:27:14,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 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:27:14,093 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:27:14,093 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-07 19:27:14,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 19:27:14,294 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:27:14,294 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-07 19:27:14,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:27:14,295 INFO L85 PathProgramCache]: Analyzing trace with hash 698247, now seen corresponding path program 1 times [2024-11-07 19:27:14,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:27:14,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1324691978] [2024-11-07 19:27:14,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:27:14,298 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:27:14,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:27:14,301 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:27:14,302 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:27:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:27:14,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 19:27:14,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:27:14,519 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:27:14,519 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:27:14,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:27:14,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1324691978] [2024-11-07 19:27:14,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1324691978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:27:14,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:27:14,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:27:14,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149479118] [2024-11-07 19:27:14,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:27:14,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:27:14,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:27:14,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:27:14,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:27:14,820 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 121 [2024-11-07 19:27:14,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 106 transitions, 233 flow. Second operand has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 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:27:14,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:27:14,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 121 [2024-11-07 19:27:14,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:27:15,196 INFO L124 PetriNetUnfolderBase]: 127/504 cut-off events. [2024-11-07 19:27:15,196 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-11-07 19:27:15,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 840 conditions, 504 events. 127/504 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2568 event pairs, 105 based on Foata normal form. 3/421 useless extension candidates. Maximal degree in co-relation 744. Up to 271 conditions per place. [2024-11-07 19:27:15,200 INFO L140 encePairwiseOnDemand]: 113/121 looper letters, 44 selfloop transitions, 5 changer transitions 0/110 dead transitions. [2024-11-07 19:27:15,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 110 transitions, 345 flow [2024-11-07 19:27:15,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:27:15,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:27:15,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 304 transitions. [2024-11-07 19:27:15,205 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.628099173553719 [2024-11-07 19:27:15,205 INFO L175 Difference]: Start difference. First operand has 107 places, 106 transitions, 233 flow. Second operand 4 states and 304 transitions. [2024-11-07 19:27:15,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 110 transitions, 345 flow [2024-11-07 19:27:15,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 110 transitions, 333 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-07 19:27:15,212 INFO L231 Difference]: Finished difference. Result has 109 places, 110 transitions, 266 flow [2024-11-07 19:27:15,213 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=266, PETRI_PLACES=109, PETRI_TRANSITIONS=110} [2024-11-07 19:27:15,214 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 3 predicate places. [2024-11-07 19:27:15,214 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 110 transitions, 266 flow [2024-11-07 19:27:15,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 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:27:15,214 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:27:15,215 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-07 19:27:15,220 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:27:15,415 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:27:15,415 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-07 19:27:15,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:27:15,416 INFO L85 PathProgramCache]: Analyzing trace with hash -672734423, now seen corresponding path program 1 times [2024-11-07 19:27:15,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:27:15,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [131875666] [2024-11-07 19:27:15,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:27:15,417 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:27:15,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:27:15,419 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:27:15,420 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:27:15,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:27:15,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 19:27:15,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:27:15,616 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:27:15,622 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:27:15,623 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:27:15,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:27:15,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [131875666] [2024-11-07 19:27:15,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [131875666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:27:15,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:27:15,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:27:15,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806744877] [2024-11-07 19:27:15,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:27:15,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:27:15,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:27:15,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:27:15,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:27:15,723 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 121 [2024-11-07 19:27:15,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 110 transitions, 266 flow. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:27:15,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:27:15,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 121 [2024-11-07 19:27:15,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:27:15,992 INFO L124 PetriNetUnfolderBase]: 127/503 cut-off events. [2024-11-07 19:27:15,992 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-07 19:27:15,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 825 conditions, 503 events. 127/503 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2560 event pairs, 105 based on Foata normal form. 0/416 useless extension candidates. Maximal degree in co-relation 792. Up to 267 conditions per place. [2024-11-07 19:27:15,998 INFO L140 encePairwiseOnDemand]: 118/121 looper letters, 42 selfloop transitions, 3 changer transitions 0/109 dead transitions. [2024-11-07 19:27:15,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 109 transitions, 354 flow [2024-11-07 19:27:15,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:27:15,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:27:16,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 240 transitions. [2024-11-07 19:27:16,000 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6611570247933884 [2024-11-07 19:27:16,000 INFO L175 Difference]: Start difference. First operand has 109 places, 110 transitions, 266 flow. Second operand 3 states and 240 transitions. [2024-11-07 19:27:16,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 109 transitions, 354 flow [2024-11-07 19:27:16,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 109 transitions, 351 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:27:16,004 INFO L231 Difference]: Finished difference. Result has 109 places, 109 transitions, 267 flow [2024-11-07 19:27:16,004 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=267, PETRI_PLACES=109, PETRI_TRANSITIONS=109} [2024-11-07 19:27:16,005 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 3 predicate places. [2024-11-07 19:27:16,005 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 109 transitions, 267 flow [2024-11-07 19:27:16,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:27:16,005 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:27:16,005 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-07 19:27:16,011 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:27:16,206 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:27:16,207 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-07 19:27:16,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:27:16,207 INFO L85 PathProgramCache]: Analyzing trace with hash -672734422, now seen corresponding path program 1 times [2024-11-07 19:27:16,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:27:16,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1079501779] [2024-11-07 19:27:16,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:27:16,208 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:27:16,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:27:16,211 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:27:16,213 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:27:16,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:27:16,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 19:27:16,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:27:16,388 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:27:16,397 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:27:16,397 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:27:16,398 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:27:16,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1079501779] [2024-11-07 19:27:16,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1079501779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:27:16,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:27:16,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:27:16,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555147614] [2024-11-07 19:27:16,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:27:16,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:27:16,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:27:16,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:27:16,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:27:16,541 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 121 [2024-11-07 19:27:16,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 109 transitions, 267 flow. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:27:16,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:27:16,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 121 [2024-11-07 19:27:16,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:27:16,824 INFO L124 PetriNetUnfolderBase]: 127/502 cut-off events. [2024-11-07 19:27:16,824 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-11-07 19:27:16,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 825 conditions, 502 events. 127/502 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2553 event pairs, 105 based on Foata normal form. 0/417 useless extension candidates. Maximal degree in co-relation 791. Up to 267 conditions per place. [2024-11-07 19:27:16,831 INFO L140 encePairwiseOnDemand]: 118/121 looper letters, 42 selfloop transitions, 3 changer transitions 0/108 dead transitions. [2024-11-07 19:27:16,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 108 transitions, 355 flow [2024-11-07 19:27:16,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:27:16,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:27:16,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 240 transitions. [2024-11-07 19:27:16,836 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6611570247933884 [2024-11-07 19:27:16,836 INFO L175 Difference]: Start difference. First operand has 109 places, 109 transitions, 267 flow. Second operand 3 states and 240 transitions. [2024-11-07 19:27:16,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 108 transitions, 355 flow [2024-11-07 19:27:16,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 108 transitions, 349 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:27:16,839 INFO L231 Difference]: Finished difference. Result has 108 places, 108 transitions, 265 flow [2024-11-07 19:27:16,841 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=265, PETRI_PLACES=108, PETRI_TRANSITIONS=108} [2024-11-07 19:27:16,842 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 2 predicate places. [2024-11-07 19:27:16,842 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 108 transitions, 265 flow [2024-11-07 19:27:16,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:27:16,842 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:27:16,843 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:27:16,849 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:27:17,044 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:27:17,044 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-07 19:27:17,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:27:17,045 INFO L85 PathProgramCache]: Analyzing trace with hash 620070097, now seen corresponding path program 1 times [2024-11-07 19:27:17,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:27:17,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1335982468] [2024-11-07 19:27:17,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:27:17,046 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:27:17,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:27:17,049 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:27:17,073 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:27:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:27:17,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 19:27:17,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:27:17,271 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:27:17,305 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:27:17,305 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:27:17,306 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:27:17,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1335982468] [2024-11-07 19:27:17,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1335982468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:27:17,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:27:17,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:27:17,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139662320] [2024-11-07 19:27:17,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:27:17,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:27:17,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:27:17,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:27:17,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:27:17,518 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 121 [2024-11-07 19:27:17,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 108 transitions, 265 flow. Second operand has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 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:27:17,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:27:17,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 121 [2024-11-07 19:27:17,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:27:17,844 INFO L124 PetriNetUnfolderBase]: 127/500 cut-off events. [2024-11-07 19:27:17,844 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-07 19:27:17,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 825 conditions, 500 events. 127/500 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2545 event pairs, 105 based on Foata normal form. 2/419 useless extension candidates. Maximal degree in co-relation 789. Up to 269 conditions per place. [2024-11-07 19:27:17,847 INFO L140 encePairwiseOnDemand]: 116/121 looper letters, 43 selfloop transitions, 4 changer transitions 0/106 dead transitions. [2024-11-07 19:27:17,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 106 transitions, 355 flow [2024-11-07 19:27:17,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:27:17,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:27:17,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 293 transitions. [2024-11-07 19:27:17,850 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6053719008264463 [2024-11-07 19:27:17,850 INFO L175 Difference]: Start difference. First operand has 108 places, 108 transitions, 265 flow. Second operand 4 states and 293 transitions. [2024-11-07 19:27:17,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 106 transitions, 355 flow [2024-11-07 19:27:17,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 106 transitions, 349 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:27:17,852 INFO L231 Difference]: Finished difference. Result has 107 places, 106 transitions, 263 flow [2024-11-07 19:27:17,854 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=263, PETRI_PLACES=107, PETRI_TRANSITIONS=106} [2024-11-07 19:27:17,855 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 1 predicate places. [2024-11-07 19:27:17,855 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 106 transitions, 263 flow [2024-11-07 19:27:17,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 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:27:17,855 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:27:17,855 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:27:17,863 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 (6)] Forceful destruction successful, exit code 0 [2024-11-07 19:27:18,056 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:27:18,057 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-07 19:27:18,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:27:18,058 INFO L85 PathProgramCache]: Analyzing trace with hash 620070096, now seen corresponding path program 1 times [2024-11-07 19:27:18,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:27:18,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [509157301] [2024-11-07 19:27:18,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:27:18,059 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:27:18,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:27:18,061 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:27:18,063 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:27:18,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:27:18,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 19:27:18,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:27:18,248 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:27:18,264 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:27:18,264 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:27:18,264 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:27:18,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [509157301] [2024-11-07 19:27:18,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [509157301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:27:18,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:27:18,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:27:18,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350279351] [2024-11-07 19:27:18,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:27:18,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:27:18,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:27:18,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:27:18,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:27:18,408 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 121 [2024-11-07 19:27:18,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 106 transitions, 263 flow. Second operand has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 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:27:18,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:27:18,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 121 [2024-11-07 19:27:18,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:27:18,722 INFO L124 PetriNetUnfolderBase]: 127/498 cut-off events. [2024-11-07 19:27:18,723 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-07 19:27:18,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 825 conditions, 498 events. 127/498 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2534 event pairs, 105 based on Foata normal form. 1/417 useless extension candidates. Maximal degree in co-relation 790. Up to 267 conditions per place. [2024-11-07 19:27:18,726 INFO L140 encePairwiseOnDemand]: 114/121 looper letters, 40 selfloop transitions, 7 changer transitions 0/104 dead transitions. [2024-11-07 19:27:18,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 104 transitions, 353 flow [2024-11-07 19:27:18,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:27:18,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:27:18,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 345 transitions. [2024-11-07 19:27:18,727 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5702479338842975 [2024-11-07 19:27:18,727 INFO L175 Difference]: Start difference. First operand has 107 places, 106 transitions, 263 flow. Second operand 5 states and 345 transitions. [2024-11-07 19:27:18,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 104 transitions, 353 flow [2024-11-07 19:27:18,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 104 transitions, 345 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-07 19:27:18,732 INFO L231 Difference]: Finished difference. Result has 106 places, 104 transitions, 265 flow [2024-11-07 19:27:18,733 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=265, PETRI_PLACES=106, PETRI_TRANSITIONS=104} [2024-11-07 19:27:18,733 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 0 predicate places. [2024-11-07 19:27:18,734 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 104 transitions, 265 flow [2024-11-07 19:27:18,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 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:27:18,734 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:27:18,735 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-07 19:27:18,740 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:27:18,935 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:27:18,935 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-07 19:27:18,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:27:18,936 INFO L85 PathProgramCache]: Analyzing trace with hash 620071633, now seen corresponding path program 1 times [2024-11-07 19:27:18,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:27:18,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1076360667] [2024-11-07 19:27:18,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:27:18,937 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:27:18,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:27:18,939 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:27:18,940 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:27:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:27:19,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 19:27:19,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:27:19,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:27:19,077 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:27:19,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:27:19,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1076360667] [2024-11-07 19:27:19,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1076360667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:27:19,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:27:19,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:27:19,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103057487] [2024-11-07 19:27:19,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:27:19,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:27:19,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:27:19,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:27:19,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:27:19,079 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 121 [2024-11-07 19:27:19,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 104 transitions, 265 flow. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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:27:19,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:27:19,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 121 [2024-11-07 19:27:19,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:27:19,328 INFO L124 PetriNetUnfolderBase]: 126/516 cut-off events. [2024-11-07 19:27:19,329 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-07 19:27:19,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 851 conditions, 516 events. 126/516 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2560 event pairs, 105 based on Foata normal form. 2/428 useless extension candidates. Maximal degree in co-relation 817. Up to 267 conditions per place. [2024-11-07 19:27:19,332 INFO L140 encePairwiseOnDemand]: 118/121 looper letters, 46 selfloop transitions, 3 changer transitions 0/108 dead transitions. [2024-11-07 19:27:19,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 108 transitions, 377 flow [2024-11-07 19:27:19,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:27:19,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:27:19,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2024-11-07 19:27:19,333 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6831955922865014 [2024-11-07 19:27:19,333 INFO L175 Difference]: Start difference. First operand has 106 places, 104 transitions, 265 flow. Second operand 3 states and 248 transitions. [2024-11-07 19:27:19,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 108 transitions, 377 flow [2024-11-07 19:27:19,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 108 transitions, 357 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-07 19:27:19,336 INFO L231 Difference]: Finished difference. Result has 105 places, 104 transitions, 262 flow [2024-11-07 19:27:19,336 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=262, PETRI_PLACES=105, PETRI_TRANSITIONS=104} [2024-11-07 19:27:19,337 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, -1 predicate places. [2024-11-07 19:27:19,337 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 104 transitions, 262 flow [2024-11-07 19:27:19,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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:27:19,337 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:27:19,337 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:27:19,342 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:27:19,538 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:27:19,538 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-07 19:27:19,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:27:19,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1113068960, now seen corresponding path program 1 times [2024-11-07 19:27:19,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:27:19,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [339814102] [2024-11-07 19:27:19,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:27:19,539 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:27:19,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:27:19,542 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:27:19,544 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:27:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:27:20,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 19:27:20,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:27:20,086 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-07 19:27:20,086 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:27:20,126 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:27:20,127 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:27:20,127 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:27:20,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [339814102] [2024-11-07 19:27:20,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [339814102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:27:20,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:27:20,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:27:20,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887348673] [2024-11-07 19:27:20,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:27:20,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:27:20,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:27:20,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:27:20,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:27:20,297 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 121 [2024-11-07 19:27:20,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 104 transitions, 262 flow. Second operand has 4 states, 4 states have (on average 65.75) internal successors, (263), 4 states have internal predecessors, (263), 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:27:20,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:27:20,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 121 [2024-11-07 19:27:20,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:27:20,597 INFO L124 PetriNetUnfolderBase]: 125/470 cut-off events. [2024-11-07 19:27:20,597 INFO L125 PetriNetUnfolderBase]: For 31/32 co-relation queries the response was YES. [2024-11-07 19:27:20,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 470 events. 125/470 cut-off events. For 31/32 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2295 event pairs, 64 based on Foata normal form. 3/396 useless extension candidates. Maximal degree in co-relation 771. Up to 177 conditions per place. [2024-11-07 19:27:20,600 INFO L140 encePairwiseOnDemand]: 115/121 looper letters, 64 selfloop transitions, 5 changer transitions 0/125 dead transitions. [2024-11-07 19:27:20,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 125 transitions, 442 flow [2024-11-07 19:27:20,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:27:20,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:27:20,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 323 transitions. [2024-11-07 19:27:20,603 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6673553719008265 [2024-11-07 19:27:20,603 INFO L175 Difference]: Start difference. First operand has 105 places, 104 transitions, 262 flow. Second operand 4 states and 323 transitions. [2024-11-07 19:27:20,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 125 transitions, 442 flow [2024-11-07 19:27:20,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 125 transitions, 439 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:27:20,609 INFO L231 Difference]: Finished difference. Result has 105 places, 102 transitions, 265 flow [2024-11-07 19:27:20,609 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=102, 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=4, PETRI_FLOW=265, PETRI_PLACES=105, PETRI_TRANSITIONS=102} [2024-11-07 19:27:20,609 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, -1 predicate places. [2024-11-07 19:27:20,609 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 102 transitions, 265 flow [2024-11-07 19:27:20,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.75) internal successors, (263), 4 states have internal predecessors, (263), 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:27:20,611 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:27:20,611 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:27:20,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-07 19:27:20,811 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:27:20,812 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-07 19:27:20,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:27:20,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1113068959, now seen corresponding path program 1 times [2024-11-07 19:27:20,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:27:20,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [849243098] [2024-11-07 19:27:20,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:27:20,813 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:27:20,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:27:20,815 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:27:20,816 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:27:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:27:21,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-07 19:27:21,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:27:21,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 19:27:21,440 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:27:21,502 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:27:21,502 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:27:21,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:27:21,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [849243098] [2024-11-07 19:27:21,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [849243098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:27:21,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:27:21,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:27:21,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649715491] [2024-11-07 19:27:21,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:27:21,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:27:21,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:27:21,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:27:21,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:27:21,729 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 121 [2024-11-07 19:27:21,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 102 transitions, 265 flow. Second operand has 5 states, 5 states have (on average 65.4) internal successors, (327), 5 states have internal predecessors, (327), 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:27:21,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:27:21,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 121 [2024-11-07 19:27:21,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:27:22,091 INFO L124 PetriNetUnfolderBase]: 128/543 cut-off events. [2024-11-07 19:27:22,091 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2024-11-07 19:27:22,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 927 conditions, 543 events. 128/543 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2835 event pairs, 106 based on Foata normal form. 2/445 useless extension candidates. Maximal degree in co-relation 836. Up to 278 conditions per place. [2024-11-07 19:27:22,096 INFO L140 encePairwiseOnDemand]: 115/121 looper letters, 50 selfloop transitions, 5 changer transitions 0/109 dead transitions. [2024-11-07 19:27:22,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 109 transitions, 405 flow [2024-11-07 19:27:22,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:27:22,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:27:22,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 310 transitions. [2024-11-07 19:27:22,098 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.640495867768595 [2024-11-07 19:27:22,098 INFO L175 Difference]: Start difference. First operand has 105 places, 102 transitions, 265 flow. Second operand 4 states and 310 transitions. [2024-11-07 19:27:22,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 109 transitions, 405 flow [2024-11-07 19:27:22,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 109 transitions, 389 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-07 19:27:22,101 INFO L231 Difference]: Finished difference. Result has 107 places, 106 transitions, 301 flow [2024-11-07 19:27:22,102 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=301, PETRI_PLACES=107, PETRI_TRANSITIONS=106} [2024-11-07 19:27:22,102 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 1 predicate places. [2024-11-07 19:27:22,102 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 106 transitions, 301 flow [2024-11-07 19:27:22,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 65.4) internal successors, (327), 5 states have internal predecessors, (327), 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:27:22,102 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:27:22,102 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:27:22,110 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 (10)] Forceful destruction successful, exit code 0 [2024-11-07 19:27:22,303 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:27:22,303 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-07 19:27:22,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:27:22,304 INFO L85 PathProgramCache]: Analyzing trace with hash -145398612, now seen corresponding path program 1 times [2024-11-07 19:27:22,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:27:22,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1068241459] [2024-11-07 19:27:22,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:27:22,304 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:27:22,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:27:22,306 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:27:22,307 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:27:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:27:22,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-07 19:27:22,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:27:22,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-07 19:27:23,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 28 treesize of output 27 [2024-11-07 19:27:23,076 INFO L349 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2024-11-07 19:27:23,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 16 [2024-11-07 19:27:23,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 32 treesize of output 25 [2024-11-07 19:27:23,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 32 treesize of output 25 [2024-11-07 19:27:23,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 18 [2024-11-07 19:27:23,291 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:27:23,291 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:27:23,292 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:27:23,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1068241459] [2024-11-07 19:27:23,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1068241459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:27:23,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:27:23,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 19:27:23,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951093227] [2024-11-07 19:27:23,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:27:23,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 19:27:23,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:27:23,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 19:27:23,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-07 19:27:24,309 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 121 [2024-11-07 19:27:24,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 106 transitions, 301 flow. Second operand has 10 states, 10 states have (on average 56.0) internal successors, (560), 10 states have internal predecessors, (560), 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:27:24,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:27:24,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 121 [2024-11-07 19:27:24,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:27:25,102 INFO L124 PetriNetUnfolderBase]: 126/498 cut-off events. [2024-11-07 19:27:25,102 INFO L125 PetriNetUnfolderBase]: For 24/25 co-relation queries the response was YES. [2024-11-07 19:27:25,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 888 conditions, 498 events. 126/498 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2564 event pairs, 64 based on Foata normal form. 1/424 useless extension candidates. Maximal degree in co-relation 796. Up to 189 conditions per place. [2024-11-07 19:27:25,106 INFO L140 encePairwiseOnDemand]: 109/121 looper letters, 72 selfloop transitions, 16 changer transitions 0/138 dead transitions. [2024-11-07 19:27:25,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 138 transitions, 549 flow [2024-11-07 19:27:25,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 19:27:25,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-07 19:27:25,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 686 transitions. [2024-11-07 19:27:25,109 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5154019534184824 [2024-11-07 19:27:25,109 INFO L175 Difference]: Start difference. First operand has 107 places, 106 transitions, 301 flow. Second operand 11 states and 686 transitions. [2024-11-07 19:27:25,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 138 transitions, 549 flow [2024-11-07 19:27:25,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 138 transitions, 547 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:27:25,112 INFO L231 Difference]: Finished difference. Result has 121 places, 112 transitions, 380 flow [2024-11-07 19:27:25,112 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=380, PETRI_PLACES=121, PETRI_TRANSITIONS=112} [2024-11-07 19:27:25,113 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 15 predicate places. [2024-11-07 19:27:25,113 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 112 transitions, 380 flow [2024-11-07 19:27:25,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 56.0) internal successors, (560), 10 states have internal predecessors, (560), 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:27:25,114 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:27:25,114 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:27:25,122 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 (11)] Ended with exit code 0 [2024-11-07 19:27:25,314 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:27:25,315 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-07 19:27:25,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:27:25,315 INFO L85 PathProgramCache]: Analyzing trace with hash -145398611, now seen corresponding path program 1 times [2024-11-07 19:27:25,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:27:25,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1783443938] [2024-11-07 19:27:25,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:27:25,316 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:27:25,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:27:25,317 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:27:25,319 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:27:25,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:27:25,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-07 19:27:25,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:27:25,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-07 19:27:26,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-07 19:27:26,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 18 [2024-11-07 19:27:26,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 18 [2024-11-07 19:27:26,179 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 19:27:26,180 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:27:26,189 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:27:26,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 16 [2024-11-07 19:27:26,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 16 [2024-11-07 19:27:26,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 16 [2024-11-07 19:27:26,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 16 [2024-11-07 19:27:26,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 16 [2024-11-07 19:27:26,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 16 [2024-11-07 19:27:26,436 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:27:26,436 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:27:26,436 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:27:26,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1783443938] [2024-11-07 19:27:26,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1783443938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:27:26,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:27:26,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 19:27:26,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891973861] [2024-11-07 19:27:26,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:27:26,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 19:27:26,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:27:26,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 19:27:26,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-07 19:27:27,400 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 121 [2024-11-07 19:27:27,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 112 transitions, 380 flow. Second operand has 10 states, 10 states have (on average 50.0) internal successors, (500), 10 states have internal predecessors, (500), 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:27:27,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:27:27,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 121 [2024-11-07 19:27:27,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:27:28,156 INFO L124 PetriNetUnfolderBase]: 128/540 cut-off events. [2024-11-07 19:27:28,156 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2024-11-07 19:27:28,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1005 conditions, 540 events. 128/540 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2788 event pairs, 106 based on Foata normal form. 1/460 useless extension candidates. Maximal degree in co-relation 868. Up to 291 conditions per place. [2024-11-07 19:27:28,159 INFO L140 encePairwiseOnDemand]: 109/121 looper letters, 70 selfloop transitions, 11 changer transitions 0/127 dead transitions. [2024-11-07 19:27:28,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 127 transitions, 595 flow [2024-11-07 19:27:28,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 19:27:28,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-07 19:27:28,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 615 transitions. [2024-11-07 19:27:28,162 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.46205860255447034 [2024-11-07 19:27:28,162 INFO L175 Difference]: Start difference. First operand has 121 places, 112 transitions, 380 flow. Second operand 11 states and 615 transitions. [2024-11-07 19:27:28,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 127 transitions, 595 flow [2024-11-07 19:27:28,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 127 transitions, 575 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-07 19:27:28,165 INFO L231 Difference]: Finished difference. Result has 130 places, 116 transitions, 421 flow [2024-11-07 19:27:28,166 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=421, PETRI_PLACES=130, PETRI_TRANSITIONS=116} [2024-11-07 19:27:28,166 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 24 predicate places. [2024-11-07 19:27:28,166 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 116 transitions, 421 flow [2024-11-07 19:27:28,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 50.0) internal successors, (500), 10 states have internal predecessors, (500), 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:27:28,168 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:27:28,168 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:27:28,175 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:27:28,368 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:27:28,368 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-07 19:27:28,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:27:28,369 INFO L85 PathProgramCache]: Analyzing trace with hash -212389002, now seen corresponding path program 1 times [2024-11-07 19:27:28,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:27:28,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [457223074] [2024-11-07 19:27:28,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:27:28,369 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:27:28,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:27:28,371 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:27:28,372 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:27:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:27:28,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 19:27:28,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:27:28,529 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:27:28,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:27:28,565 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:27:28,565 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:27:28,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [457223074] [2024-11-07 19:27:28,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [457223074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:27:28,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:27:28,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:27:28,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065189341] [2024-11-07 19:27:28,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:27:28,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:27:28,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:27:28,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:27:28,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:27:28,697 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 121 [2024-11-07 19:27:28,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 116 transitions, 421 flow. Second operand has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 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:27:28,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:27:28,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 121 [2024-11-07 19:27:28,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:27:28,919 INFO L124 PetriNetUnfolderBase]: 127/531 cut-off events. [2024-11-07 19:27:28,919 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2024-11-07 19:27:28,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 960 conditions, 531 events. 127/531 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2733 event pairs, 105 based on Foata normal form. 8/455 useless extension candidates. Maximal degree in co-relation 843. Up to 268 conditions per place. [2024-11-07 19:27:28,922 INFO L140 encePairwiseOnDemand]: 116/121 looper letters, 45 selfloop transitions, 11 changer transitions 0/114 dead transitions. [2024-11-07 19:27:28,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 114 transitions, 529 flow [2024-11-07 19:27:28,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:27:28,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:27:28,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 299 transitions. [2024-11-07 19:27:28,924 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6177685950413223 [2024-11-07 19:27:28,924 INFO L175 Difference]: Start difference. First operand has 130 places, 116 transitions, 421 flow. Second operand 4 states and 299 transitions. [2024-11-07 19:27:28,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 114 transitions, 529 flow [2024-11-07 19:27:28,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 114 transitions, 525 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:27:28,927 INFO L231 Difference]: Finished difference. Result has 129 places, 114 transitions, 435 flow [2024-11-07 19:27:28,927 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=435, PETRI_PLACES=129, PETRI_TRANSITIONS=114} [2024-11-07 19:27:28,929 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 23 predicate places. [2024-11-07 19:27:28,929 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 114 transitions, 435 flow [2024-11-07 19:27:28,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 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:27:28,930 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:27:28,930 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:27:28,937 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 (13)] Forceful destruction successful, exit code 0 [2024-11-07 19:27:29,130 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:27:29,130 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-07 19:27:29,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:27:29,131 INFO L85 PathProgramCache]: Analyzing trace with hash -212389003, now seen corresponding path program 1 times [2024-11-07 19:27:29,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:27:29,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1496751503] [2024-11-07 19:27:29,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:27:29,131 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:27:29,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:27:29,134 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:27:29,136 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:27:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:27:29,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 19:27:29,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:27:29,298 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:27:29,315 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:27:29,315 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:27:29,315 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:27:29,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1496751503] [2024-11-07 19:27:29,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1496751503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:27:29,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:27:29,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:27:29,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442734684] [2024-11-07 19:27:29,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:27:29,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:27:29,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:27:29,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:27:29,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:27:29,485 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 121 [2024-11-07 19:27:29,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 114 transitions, 435 flow. Second operand has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 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:27:29,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:27:29,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 121 [2024-11-07 19:27:29,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:27:29,669 INFO L124 PetriNetUnfolderBase]: 127/523 cut-off events. [2024-11-07 19:27:29,669 INFO L125 PetriNetUnfolderBase]: For 111/111 co-relation queries the response was YES. [2024-11-07 19:27:29,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 970 conditions, 523 events. 127/523 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2684 event pairs, 105 based on Foata normal form. 0/447 useless extension candidates. Maximal degree in co-relation 847. Up to 268 conditions per place. [2024-11-07 19:27:29,672 INFO L140 encePairwiseOnDemand]: 116/121 looper letters, 47 selfloop transitions, 11 changer transitions 0/112 dead transitions. [2024-11-07 19:27:29,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 112 transitions, 547 flow [2024-11-07 19:27:29,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:27:29,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:27:29,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 293 transitions. [2024-11-07 19:27:29,674 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6053719008264463 [2024-11-07 19:27:29,674 INFO L175 Difference]: Start difference. First operand has 129 places, 114 transitions, 435 flow. Second operand 4 states and 293 transitions. [2024-11-07 19:27:29,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 112 transitions, 547 flow [2024-11-07 19:27:29,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 112 transitions, 525 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-07 19:27:29,677 INFO L231 Difference]: Finished difference. Result has 127 places, 112 transitions, 431 flow [2024-11-07 19:27:29,677 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=431, PETRI_PLACES=127, PETRI_TRANSITIONS=112} [2024-11-07 19:27:29,678 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 21 predicate places. [2024-11-07 19:27:29,678 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 112 transitions, 431 flow [2024-11-07 19:27:29,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 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:27:29,679 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:27:29,679 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:27:29,685 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 (14)] Forceful destruction successful, exit code 0 [2024-11-07 19:27:29,879 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:27:29,880 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-07 19:27:29,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:27:29,884 INFO L85 PathProgramCache]: Analyzing trace with hash -2119831121, now seen corresponding path program 1 times [2024-11-07 19:27:29,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:27:29,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [19492009] [2024-11-07 19:27:29,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:27:29,885 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:27:29,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:27:29,892 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:27:29,895 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:27:30,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:27:30,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 19:27:30,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:27:30,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:27:30,118 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:27:30,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:27:30,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:27:30,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [19492009] [2024-11-07 19:27:30,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [19492009] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 19:27:30,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 19:27:30,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-07 19:27:30,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114856322] [2024-11-07 19:27:30,141 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 19:27:30,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:27:30,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:27:30,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:27:30,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:27:30,141 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 121 [2024-11-07 19:27:30,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 112 transitions, 431 flow. Second operand has 6 states, 6 states have (on average 69.83333333333333) internal successors, (419), 6 states have internal predecessors, (419), 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:27:30,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:27:30,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 121 [2024-11-07 19:27:30,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:27:30,404 INFO L124 PetriNetUnfolderBase]: 127/573 cut-off events. [2024-11-07 19:27:30,404 INFO L125 PetriNetUnfolderBase]: For 202/202 co-relation queries the response was YES. [2024-11-07 19:27:30,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1104 conditions, 573 events. 127/573 cut-off events. For 202/202 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2780 event pairs, 105 based on Foata normal form. 6/499 useless extension candidates. Maximal degree in co-relation 912. Up to 264 conditions per place. [2024-11-07 19:27:30,407 INFO L140 encePairwiseOnDemand]: 117/121 looper letters, 60 selfloop transitions, 11 changer transitions 0/127 dead transitions. [2024-11-07 19:27:30,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 127 transitions, 685 flow [2024-11-07 19:27:30,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:27:30,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 19:27:30,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 462 transitions. [2024-11-07 19:27:30,409 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2024-11-07 19:27:30,409 INFO L175 Difference]: Start difference. First operand has 127 places, 112 transitions, 431 flow. Second operand 6 states and 462 transitions. [2024-11-07 19:27:30,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 127 transitions, 685 flow [2024-11-07 19:27:30,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 127 transitions, 641 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-07 19:27:30,413 INFO L231 Difference]: Finished difference. Result has 133 places, 117 transitions, 497 flow [2024-11-07 19:27:30,413 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=497, PETRI_PLACES=133, PETRI_TRANSITIONS=117} [2024-11-07 19:27:30,414 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 27 predicate places. [2024-11-07 19:27:30,414 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 117 transitions, 497 flow [2024-11-07 19:27:30,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.83333333333333) internal successors, (419), 6 states have internal predecessors, (419), 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:27:30,414 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:27:30,414 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:27:30,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-07 19:27:30,614 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:27:30,616 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-07 19:27:30,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:27:30,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1265117454, now seen corresponding path program 1 times [2024-11-07 19:27:30,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:27:30,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1622926803] [2024-11-07 19:27:30,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:27:30,617 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:27:30,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:27:30,620 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:27:30,622 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:27:31,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:27:31,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-07 19:27:31,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:27:31,482 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:27:31,574 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 23 treesize of output 1 [2024-11-07 19:27:31,623 INFO L349 Elim1Store]: treesize reduction 86, result has 31.2 percent of original size [2024-11-07 19:27:31,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 59 [2024-11-07 19:27:31,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 36 treesize of output 29 [2024-11-07 19:27:31,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 36 treesize of output 29 [2024-11-07 19:27:31,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 21 [2024-11-07 19:27:31,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 treesize of output 15 [2024-11-07 19:27:31,887 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:27:31,887 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:27:31,936 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_574 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_574) |c_~#c~0.base|) (bvadd |c_~#c~0.offset| (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|))))))) is different from false [2024-11-07 19:27:32,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 19:27:32,100 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2024-11-07 19:27:32,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 19:27:32,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 52 treesize of output 55 [2024-11-07 19:27:32,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2024-11-07 19:27:59,084 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-07 19:27:59,085 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:27:59,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1622926803] [2024-11-07 19:27:59,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1622926803] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 19:27:59,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 19:27:59,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2024-11-07 19:27:59,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382754917] [2024-11-07 19:27:59,085 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 19:27:59,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-07 19:27:59,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:27:59,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-07 19:27:59,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=211, Unknown=16, NotChecked=30, Total=306 [2024-11-07 19:27:59,749 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 121 [2024-11-07 19:27:59,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 117 transitions, 497 flow. Second operand has 18 states, 18 states have (on average 29.88888888888889) internal successors, (538), 18 states have internal predecessors, (538), 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:27:59,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:27:59,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 121 [2024-11-07 19:27:59,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:28:01,567 INFO L124 PetriNetUnfolderBase]: 329/1030 cut-off events. [2024-11-07 19:28:01,568 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2024-11-07 19:28:01,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2029 conditions, 1030 events. 329/1030 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5972 event pairs, 292 based on Foata normal form. 0/805 useless extension candidates. Maximal degree in co-relation 1805. Up to 671 conditions per place. [2024-11-07 19:28:01,575 INFO L140 encePairwiseOnDemand]: 113/121 looper letters, 69 selfloop transitions, 25 changer transitions 0/122 dead transitions. [2024-11-07 19:28:01,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 122 transitions, 699 flow [2024-11-07 19:28:01,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 19:28:01,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-07 19:28:01,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 414 transitions. [2024-11-07 19:28:01,579 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.28512396694214875 [2024-11-07 19:28:01,579 INFO L175 Difference]: Start difference. First operand has 133 places, 117 transitions, 497 flow. Second operand 12 states and 414 transitions. [2024-11-07 19:28:01,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 122 transitions, 699 flow [2024-11-07 19:28:01,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 122 transitions, 681 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-11-07 19:28:01,585 INFO L231 Difference]: Finished difference. Result has 142 places, 116 transitions, 525 flow [2024-11-07 19:28:01,585 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=525, PETRI_PLACES=142, PETRI_TRANSITIONS=116} [2024-11-07 19:28:01,586 INFO L277 CegarLoopForPetriNet]: 106 programPoint places, 36 predicate places. [2024-11-07 19:28:01,586 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 116 transitions, 525 flow [2024-11-07 19:28:01,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 29.88888888888889) internal successors, (538), 18 states have internal predecessors, (538), 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:28:01,587 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:28:01,587 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:28:01,613 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:28:01,787 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:28:01,788 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2024-11-07 19:28:01,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:28:01,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1265117455, now seen corresponding path program 1 times [2024-11-07 19:28:01,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:28:01,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [41496363] [2024-11-07 19:28:01,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:28:01,789 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:28:01,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:28:01,791 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:28:01,792 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:28:02,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:28:02,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-07 19:28:02,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:28:02,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 5 [2024-11-07 19:28:02,783 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 23 treesize of output 1 [2024-11-07 19:28:02,791 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 15 treesize of output 11 [2024-11-07 19:28:02,824 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 19:28:02,824 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:28:02,841 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2024-11-07 19:28:02,841 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 1 case distinctions, treesize of input 20 treesize of output 22 [2024-11-07 19:28:02,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 22 treesize of output 17 [2024-11-07 19:28:02,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 15 [2024-11-07 19:28:02,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 22 treesize of output 17 [2024-11-07 19:28:02,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 15 [2024-11-07 19:28:02,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 13 [2024-11-07 19:28:02,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-07 19:28:03,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2024-11-07 19:28:03,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-11-07 19:28:03,047 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:28:03,047 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:28:03,148 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_~#c~0.offset| (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|)))) (and (forall ((v_ArrVal_680 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_680) |c_~#c~0.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_681 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_680) |c_~#c~0.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_681) |c_~#c~0.base|) .cse1)))))) is different from false [2024-11-07 19:28:03,495 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 19:28:03,495 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 49 [2024-11-07 19:28:03,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 19:28:03,504 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2024-11-07 19:28:03,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 19:28:03,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 74 treesize of output 77 [2024-11-07 19:28:03,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 19:28:03,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 118 treesize of output 113 [2024-11-07 19:28:03,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2024-11-07 19:28:03,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2024-11-07 19:28:03,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 19:28:03,929 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 38 [2024-11-07 19:28:03,951 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 19:28:03,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 60 treesize of output 55 [2024-11-07 19:28:03,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-07 19:28:19,685 WARN L286 SmtUtils]: Spent 14.05s on a formula simplification that was a NOOP. DAG size: 895 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-07 19:28:19,685 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 19:28:19,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 19 select indices, 19 select index equivalence classes, 0 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 171 case distinctions, treesize of input 390 treesize of output 2062