./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 39e987e3198040ef6af9e29359b0ab7bee89306d1945f6e4e7a9286ebbe2a705 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:44:45,508 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:44:45,595 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 12:44:45,600 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:44:45,604 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:44:45,631 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:44:45,632 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:44:45,632 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:44:45,633 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:44:45,635 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:44:45,636 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:44:45,636 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:44:45,637 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:44:45,640 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:44:45,642 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:44:45,642 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:44:45,642 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:44:45,643 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:44:45,643 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:44:45,643 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:44:45,643 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:44:45,644 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:44:45,644 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:44:45,644 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:44:45,644 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:44:45,645 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:44:45,645 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:44:45,645 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:44:45,645 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:44:45,646 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:44:45,646 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:44:45,646 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:44:45,646 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:44:45,646 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:44:45,647 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:44:45,647 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:44:45,649 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 12:44:45,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 12:44:45,649 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:44:45,650 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:44:45,650 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:44:45,651 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:44:45,651 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 39e987e3198040ef6af9e29359b0ab7bee89306d1945f6e4e7a9286ebbe2a705 [2024-10-13 12:44:45,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:44:45,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:44:45,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:44:45,947 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:44:45,947 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:44:45,948 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c [2024-10-13 12:44:47,394 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:44:47,587 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:44:47,587 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c [2024-10-13 12:44:47,602 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3b54273a/5639ea527d304bd493d996f5ed250612/FLAGdea09e24a [2024-10-13 12:44:47,620 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3b54273a/5639ea527d304bd493d996f5ed250612 [2024-10-13 12:44:47,623 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:44:47,625 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:44:47,628 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:44:47,628 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:44:47,634 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:44:47,634 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:44:47" (1/1) ... [2024-10-13 12:44:47,635 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@334e930c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:47, skipping insertion in model container [2024-10-13 12:44:47,636 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:44:47" (1/1) ... [2024-10-13 12:44:47,664 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:44:47,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:44:47,896 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-13 12:44:47,897 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@348acb09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:47, skipping insertion in model container [2024-10-13 12:44:47,897 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:44:47,898 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-13 12:44:47,899 INFO L158 Benchmark]: Toolchain (without parser) took 274.17ms. Allocated memory is still 159.4MB. Free memory was 102.9MB in the beginning and 91.6MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 12:44:47,900 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 120.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:44:47,901 INFO L158 Benchmark]: CACSL2BoogieTranslator took 269.53ms. Allocated memory is still 159.4MB. Free memory was 102.5MB in the beginning and 91.6MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 12:44:47,902 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 120.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 269.53ms. Allocated memory is still 159.4MB. Free memory was 102.5MB in the beginning and 91.6MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 101]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 39e987e3198040ef6af9e29359b0ab7bee89306d1945f6e4e7a9286ebbe2a705 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:44:49,950 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:44:50,030 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-13 12:44:50,037 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:44:50,038 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:44:50,073 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:44:50,073 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:44:50,074 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:44:50,075 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:44:50,076 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:44:50,076 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:44:50,076 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:44:50,077 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:44:50,077 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:44:50,078 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:44:50,079 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:44:50,079 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:44:50,079 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:44:50,080 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:44:50,080 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:44:50,080 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:44:50,081 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:44:50,082 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:44:50,082 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:44:50,082 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:44:50,083 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 12:44:50,083 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:44:50,083 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 12:44:50,083 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:44:50,084 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:44:50,084 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:44:50,084 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:44:50,084 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:44:50,084 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:44:50,085 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:44:50,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:44:50,085 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:44:50,086 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:44:50,086 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 12:44:50,086 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 12:44:50,086 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:44:50,088 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:44:50,088 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:44:50,088 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:44:50,088 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 12:44:50,089 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 39e987e3198040ef6af9e29359b0ab7bee89306d1945f6e4e7a9286ebbe2a705 [2024-10-13 12:44:50,450 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:44:50,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:44:50,475 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:44:50,476 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:44:50,477 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:44:50,480 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c [2024-10-13 12:44:52,080 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:44:52,288 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:44:52,290 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c [2024-10-13 12:44:52,298 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d0833e7b/2a45cc73a5da4e178ff078e0949953e8/FLAG48aa54b39 [2024-10-13 12:44:52,310 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d0833e7b/2a45cc73a5da4e178ff078e0949953e8 [2024-10-13 12:44:52,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:44:52,313 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:44:52,315 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:44:52,315 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:44:52,320 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:44:52,321 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:44:52" (1/1) ... [2024-10-13 12:44:52,321 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49377021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:52, skipping insertion in model container [2024-10-13 12:44:52,322 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:44:52" (1/1) ... [2024-10-13 12:44:52,347 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:44:52,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:44:52,599 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-13 12:44:52,605 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:44:52,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:44:52,647 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:44:52,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:44:52,717 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:44:52,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:52 WrapperNode [2024-10-13 12:44:52,718 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:44:52,720 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:44:52,720 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:44:52,720 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:44:52,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:52" (1/1) ... [2024-10-13 12:44:52,740 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:52" (1/1) ... [2024-10-13 12:44:52,763 INFO L138 Inliner]: procedures = 25, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 89 [2024-10-13 12:44:52,764 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:44:52,765 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:44:52,765 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:44:52,766 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:44:52,776 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:52" (1/1) ... [2024-10-13 12:44:52,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:52" (1/1) ... [2024-10-13 12:44:52,784 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:52" (1/1) ... [2024-10-13 12:44:52,809 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-10-13 12:44:52,811 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:52" (1/1) ... [2024-10-13 12:44:52,811 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:52" (1/1) ... [2024-10-13 12:44:52,826 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:52" (1/1) ... [2024-10-13 12:44:52,830 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:52" (1/1) ... [2024-10-13 12:44:52,835 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:52" (1/1) ... [2024-10-13 12:44:52,837 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:52" (1/1) ... [2024-10-13 12:44:52,840 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:44:52,845 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:44:52,845 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:44:52,845 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:44:52,846 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:52" (1/1) ... [2024-10-13 12:44:52,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:44:52,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:44:52,880 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 12:44:52,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 12:44:52,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:44:52,921 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-13 12:44:52,921 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-13 12:44:52,922 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-13 12:44:52,922 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-13 12:44:52,922 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-13 12:44:52,922 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-13 12:44:52,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 12:44:52,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 12:44:52,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 12:44:52,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 12:44:52,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 12:44:52,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:44:52,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:44:52,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 12:44:52,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 12:44:52,926 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 12:44:53,047 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:44:53,052 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:44:53,539 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 12:44:53,540 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:44:53,738 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:44:53,738 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-13 12:44:53,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:44:53 BoogieIcfgContainer [2024-10-13 12:44:53,739 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:44:53,742 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:44:53,742 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:44:53,745 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:44:53,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:44:52" (1/3) ... [2024-10-13 12:44:53,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4531024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:44:53, skipping insertion in model container [2024-10-13 12:44:53,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:52" (2/3) ... [2024-10-13 12:44:53,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4531024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:44:53, skipping insertion in model container [2024-10-13 12:44:53,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:44:53" (3/3) ... [2024-10-13 12:44:53,750 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-sorted.wvr.c [2024-10-13 12:44:53,766 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:44:53,766 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-10-13 12:44:53,766 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 12:44:53,844 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-13 12:44:53,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 59 transitions, 139 flow [2024-10-13 12:44:53,920 INFO L124 PetriNetUnfolderBase]: 7/56 cut-off events. [2024-10-13 12:44:53,922 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-13 12:44:53,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 56 events. 7/56 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 145 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2024-10-13 12:44:53,926 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 59 transitions, 139 flow [2024-10-13 12:44:53,931 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 55 transitions, 128 flow [2024-10-13 12:44:53,945 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:44:53,953 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;@1422fa36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:44:53,953 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2024-10-13 12:44:53,957 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:44:53,957 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-10-13 12:44:53,957 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:44:53,958 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:44:53,958 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-13 12:44:53,959 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-13 12:44:53,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:44:53,964 INFO L85 PathProgramCache]: Analyzing trace with hash 452661, now seen corresponding path program 1 times [2024-10-13 12:44:53,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:44:53,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1550998365] [2024-10-13 12:44:53,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:44:53,977 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:44:53,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:44:53,980 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:44:53,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 12:44:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:44:54,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:44:54,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:44:54,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 12:44:54,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:44:54,142 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:44:54,143 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:44:54,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1550998365] [2024-10-13 12:44:54,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1550998365] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:44:54,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:44:54,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:44:54,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669711562] [2024-10-13 12:44:54,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:44:54,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:44:54,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:44:54,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:44:54,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:44:54,243 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 59 [2024-10-13 12:44:54,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 55 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:44:54,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:44:54,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 59 [2024-10-13 12:44:54,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:44:54,628 INFO L124 PetriNetUnfolderBase]: 785/1534 cut-off events. [2024-10-13 12:44:54,629 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2024-10-13 12:44:54,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2678 conditions, 1534 events. 785/1534 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 9351 event pairs, 464 based on Foata normal form. 1/1061 useless extension candidates. Maximal degree in co-relation 2447. Up to 1061 conditions per place. [2024-10-13 12:44:54,650 INFO L140 encePairwiseOnDemand]: 55/59 looper letters, 27 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2024-10-13 12:44:54,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 52 transitions, 180 flow [2024-10-13 12:44:54,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:44:54,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:44:54,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2024-10-13 12:44:54,665 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.632768361581921 [2024-10-13 12:44:54,667 INFO L175 Difference]: Start difference. First operand has 58 places, 55 transitions, 128 flow. Second operand 3 states and 112 transitions. [2024-10-13 12:44:54,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 52 transitions, 180 flow [2024-10-13 12:44:54,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 52 transitions, 168 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-13 12:44:54,678 INFO L231 Difference]: Finished difference. Result has 51 places, 52 transitions, 114 flow [2024-10-13 12:44:54,681 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=51, PETRI_TRANSITIONS=52} [2024-10-13 12:44:54,686 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, -7 predicate places. [2024-10-13 12:44:54,686 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 52 transitions, 114 flow [2024-10-13 12:44:54,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:44:54,687 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:44:54,687 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-13 12:44:54,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 12:44:54,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:44:54,891 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-13 12:44:54,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:44:54,892 INFO L85 PathProgramCache]: Analyzing trace with hash 452662, now seen corresponding path program 1 times [2024-10-13 12:44:54,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:44:54,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1200591643] [2024-10-13 12:44:54,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:44:54,893 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:44:54,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:44:54,896 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:44:54,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 12:44:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:44:54,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 12:44:54,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:44:54,965 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 8 treesize of output 7 [2024-10-13 12:44:55,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:44:55,050 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:44:55,050 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:44:55,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1200591643] [2024-10-13 12:44:55,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1200591643] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:44:55,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:44:55,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:44:55,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866187089] [2024-10-13 12:44:55,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:44:55,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:44:55,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:44:55,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:44:55,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:44:55,199 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 59 [2024-10-13 12:44:55,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 52 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:44:55,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:44:55,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 59 [2024-10-13 12:44:55,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:44:55,527 INFO L124 PetriNetUnfolderBase]: 786/1537 cut-off events. [2024-10-13 12:44:55,528 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-10-13 12:44:55,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2635 conditions, 1537 events. 786/1537 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 9355 event pairs, 464 based on Foata normal form. 0/1063 useless extension candidates. Maximal degree in co-relation 2613. Up to 1066 conditions per place. [2024-10-13 12:44:55,537 INFO L140 encePairwiseOnDemand]: 54/59 looper letters, 29 selfloop transitions, 4 changer transitions 0/55 dead transitions. [2024-10-13 12:44:55,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 55 transitions, 188 flow [2024-10-13 12:44:55,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:44:55,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:44:55,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2024-10-13 12:44:55,540 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6016949152542372 [2024-10-13 12:44:55,540 INFO L175 Difference]: Start difference. First operand has 51 places, 52 transitions, 114 flow. Second operand 4 states and 142 transitions. [2024-10-13 12:44:55,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 55 transitions, 188 flow [2024-10-13 12:44:55,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 55 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:44:55,543 INFO L231 Difference]: Finished difference. Result has 54 places, 55 transitions, 137 flow [2024-10-13 12:44:55,545 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=54, PETRI_TRANSITIONS=55} [2024-10-13 12:44:55,546 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2024-10-13 12:44:55,546 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 55 transitions, 137 flow [2024-10-13 12:44:55,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:44:55,547 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:44:55,547 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2024-10-13 12:44:55,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 12:44:55,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:44:55,748 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-13 12:44:55,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:44:55,749 INFO L85 PathProgramCache]: Analyzing trace with hash 435022628, now seen corresponding path program 1 times [2024-10-13 12:44:55,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:44:55,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1040424476] [2024-10-13 12:44:55,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:44:55,750 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:44:55,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:44:55,752 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:44:55,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 12:44:55,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:44:55,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 12:44:55,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:44:55,843 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 8 treesize of output 7 [2024-10-13 12:44:55,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:44:55,991 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:44:56,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:44:56,267 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:44:56,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1040424476] [2024-10-13 12:44:56,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1040424476] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:44:56,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:44:56,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-10-13 12:44:56,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254553228] [2024-10-13 12:44:56,267 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:44:56,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 12:44:56,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:44:56,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 12:44:56,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-13 12:44:56,925 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 59 [2024-10-13 12:44:56,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 55 transitions, 137 flow. Second operand has 10 states, 10 states have (on average 28.0) internal successors, (280), 10 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:44:56,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:44:56,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 59 [2024-10-13 12:44:56,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:44:57,584 INFO L124 PetriNetUnfolderBase]: 789/1546 cut-off events. [2024-10-13 12:44:57,584 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-10-13 12:44:57,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2672 conditions, 1546 events. 789/1546 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 9419 event pairs, 464 based on Foata normal form. 0/1068 useless extension candidates. Maximal degree in co-relation 2620. Up to 1069 conditions per place. [2024-10-13 12:44:57,595 INFO L140 encePairwiseOnDemand]: 54/59 looper letters, 29 selfloop transitions, 13 changer transitions 0/64 dead transitions. [2024-10-13 12:44:57,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 64 transitions, 257 flow [2024-10-13 12:44:57,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 12:44:57,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-13 12:44:57,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 315 transitions. [2024-10-13 12:44:57,601 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5338983050847458 [2024-10-13 12:44:57,601 INFO L175 Difference]: Start difference. First operand has 54 places, 55 transitions, 137 flow. Second operand 10 states and 315 transitions. [2024-10-13 12:44:57,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 64 transitions, 257 flow [2024-10-13 12:44:57,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 64 transitions, 254 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:44:57,606 INFO L231 Difference]: Finished difference. Result has 65 places, 64 transitions, 214 flow [2024-10-13 12:44:57,606 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=214, PETRI_PLACES=65, PETRI_TRANSITIONS=64} [2024-10-13 12:44:57,608 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 7 predicate places. [2024-10-13 12:44:57,608 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 64 transitions, 214 flow [2024-10-13 12:44:57,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 28.0) internal successors, (280), 10 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:44:57,608 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:44:57,609 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:44:57,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-13 12:44:57,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:44:57,809 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-13 12:44:57,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:44:57,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1528129076, now seen corresponding path program 1 times [2024-10-13 12:44:57,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:44:57,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1841634213] [2024-10-13 12:44:57,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:44:57,811 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:44:57,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:44:57,815 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:44:57,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 12:44:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:44:57,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:44:57,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:44:57,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 12:44:57,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:44:57,887 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:44:57,887 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:44:57,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1841634213] [2024-10-13 12:44:57,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1841634213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:44:57,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:44:57,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:44:57,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879118002] [2024-10-13 12:44:57,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:44:57,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:44:57,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:44:57,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:44:57,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:44:57,948 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 59 [2024-10-13 12:44:57,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 64 transitions, 214 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:44:57,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:44:57,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 59 [2024-10-13 12:44:57,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:44:58,257 INFO L124 PetriNetUnfolderBase]: 1358/2162 cut-off events. [2024-10-13 12:44:58,257 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-10-13 12:44:58,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4099 conditions, 2162 events. 1358/2162 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 10761 event pairs, 878 based on Foata normal form. 0/1826 useless extension candidates. Maximal degree in co-relation 4065. Up to 1841 conditions per place. [2024-10-13 12:44:58,270 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 38 selfloop transitions, 6 changer transitions 0/58 dead transitions. [2024-10-13 12:44:58,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 58 transitions, 290 flow [2024-10-13 12:44:58,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:44:58,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:44:58,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2024-10-13 12:44:58,272 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4661016949152542 [2024-10-13 12:44:58,272 INFO L175 Difference]: Start difference. First operand has 65 places, 64 transitions, 214 flow. Second operand 4 states and 110 transitions. [2024-10-13 12:44:58,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 58 transitions, 290 flow [2024-10-13 12:44:58,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 58 transitions, 260 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-10-13 12:44:58,275 INFO L231 Difference]: Finished difference. Result has 59 places, 58 transitions, 184 flow [2024-10-13 12:44:58,275 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=184, PETRI_PLACES=59, PETRI_TRANSITIONS=58} [2024-10-13 12:44:58,275 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 1 predicate places. [2024-10-13 12:44:58,276 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 58 transitions, 184 flow [2024-10-13 12:44:58,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:44:58,276 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:44:58,276 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:44:58,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 12:44:58,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:44:58,477 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-13 12:44:58,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:44:58,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1528129077, now seen corresponding path program 1 times [2024-10-13 12:44:58,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:44:58,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1867764655] [2024-10-13 12:44:58,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:44:58,479 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:44:58,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:44:58,480 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:44:58,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 12:44:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:44:58,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 12:44:58,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:44:58,551 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 8 treesize of output 7 [2024-10-13 12:44:58,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:44:58,693 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:44:58,694 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:44:58,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1867764655] [2024-10-13 12:44:58,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1867764655] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:44:58,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:44:58,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:44:58,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833878739] [2024-10-13 12:44:58,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:44:58,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:44:58,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:44:58,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:44:58,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:44:59,014 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2024-10-13 12:44:59,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 58 transitions, 184 flow. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:44:59,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:44:59,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2024-10-13 12:44:59,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:44:59,545 INFO L124 PetriNetUnfolderBase]: 1527/2650 cut-off events. [2024-10-13 12:44:59,545 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-10-13 12:44:59,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4773 conditions, 2650 events. 1527/2650 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 15600 event pairs, 657 based on Foata normal form. 62/2094 useless extension candidates. Maximal degree in co-relation 4742. Up to 1514 conditions per place. [2024-10-13 12:44:59,561 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 67 selfloop transitions, 10 changer transitions 0/92 dead transitions. [2024-10-13 12:44:59,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 92 transitions, 410 flow [2024-10-13 12:44:59,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:44:59,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 12:44:59,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 223 transitions. [2024-10-13 12:44:59,564 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6299435028248588 [2024-10-13 12:44:59,564 INFO L175 Difference]: Start difference. First operand has 59 places, 58 transitions, 184 flow. Second operand 6 states and 223 transitions. [2024-10-13 12:44:59,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 92 transitions, 410 flow [2024-10-13 12:44:59,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 92 transitions, 403 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:44:59,568 INFO L231 Difference]: Finished difference. Result has 64 places, 61 transitions, 218 flow [2024-10-13 12:44:59,569 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=218, PETRI_PLACES=64, PETRI_TRANSITIONS=61} [2024-10-13 12:44:59,569 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places. [2024-10-13 12:44:59,569 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 61 transitions, 218 flow [2024-10-13 12:44:59,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:44:59,570 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:44:59,570 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:44:59,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-13 12:44:59,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:44:59,771 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-13 12:44:59,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:44:59,772 INFO L85 PathProgramCache]: Analyzing trace with hash -481317404, now seen corresponding path program 1 times [2024-10-13 12:44:59,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:44:59,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [734001515] [2024-10-13 12:44:59,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:44:59,773 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:44:59,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:44:59,774 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:44:59,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-13 12:44:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:44:59,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 12:44:59,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:44:59,838 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 8 treesize of output 7 [2024-10-13 12:45:00,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:45:00,017 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:45:00,018 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:45:00,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [734001515] [2024-10-13 12:45:00,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [734001515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:45:00,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:45:00,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:45:00,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695210217] [2024-10-13 12:45:00,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:45:00,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:45:00,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:45:00,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:45:00,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:45:00,263 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 59 [2024-10-13 12:45:00,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 61 transitions, 218 flow. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:00,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:45:00,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 59 [2024-10-13 12:45:00,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:45:00,833 INFO L124 PetriNetUnfolderBase]: 2296/4015 cut-off events. [2024-10-13 12:45:00,833 INFO L125 PetriNetUnfolderBase]: For 987/1089 co-relation queries the response was YES. [2024-10-13 12:45:00,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8198 conditions, 4015 events. 2296/4015 cut-off events. For 987/1089 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 26060 event pairs, 889 based on Foata normal form. 101/3374 useless extension candidates. Maximal degree in co-relation 8164. Up to 2115 conditions per place. [2024-10-13 12:45:00,857 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 57 selfloop transitions, 9 changer transitions 0/82 dead transitions. [2024-10-13 12:45:00,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 82 transitions, 413 flow [2024-10-13 12:45:00,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:45:00,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:45:00,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 184 transitions. [2024-10-13 12:45:00,859 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6237288135593221 [2024-10-13 12:45:00,859 INFO L175 Difference]: Start difference. First operand has 64 places, 61 transitions, 218 flow. Second operand 5 states and 184 transitions. [2024-10-13 12:45:00,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 82 transitions, 413 flow [2024-10-13 12:45:00,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 82 transitions, 395 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-13 12:45:00,863 INFO L231 Difference]: Finished difference. Result has 66 places, 63 transitions, 234 flow [2024-10-13 12:45:00,863 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=234, PETRI_PLACES=66, PETRI_TRANSITIONS=63} [2024-10-13 12:45:00,864 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 8 predicate places. [2024-10-13 12:45:00,864 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 234 flow [2024-10-13 12:45:00,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:00,865 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:45:00,865 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:45:00,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-13 12:45:01,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:01,066 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-13 12:45:01,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:45:01,067 INFO L85 PathProgramCache]: Analyzing trace with hash 2136367798, now seen corresponding path program 1 times [2024-10-13 12:45:01,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:45:01,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1112095368] [2024-10-13 12:45:01,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:45:01,068 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:01,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:45:01,071 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:45:01,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-13 12:45:01,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:45:01,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:45:01,130 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:45:01,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:45:01,147 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:45:01,147 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:45:01,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1112095368] [2024-10-13 12:45:01,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1112095368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:45:01,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:45:01,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:45:01,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721317351] [2024-10-13 12:45:01,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:45:01,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:45:01,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:45:01,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:45:01,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:45:01,152 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2024-10-13 12:45:01,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 234 flow. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:01,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:45:01,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2024-10-13 12:45:01,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:45:01,782 INFO L124 PetriNetUnfolderBase]: 3244/5134 cut-off events. [2024-10-13 12:45:01,782 INFO L125 PetriNetUnfolderBase]: For 1658/1764 co-relation queries the response was YES. [2024-10-13 12:45:01,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11824 conditions, 5134 events. 3244/5134 cut-off events. For 1658/1764 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 30100 event pairs, 715 based on Foata normal form. 0/4504 useless extension candidates. Maximal degree in co-relation 11789. Up to 1880 conditions per place. [2024-10-13 12:45:01,853 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 95 selfloop transitions, 10 changer transitions 0/120 dead transitions. [2024-10-13 12:45:01,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 120 transitions, 606 flow [2024-10-13 12:45:01,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:45:01,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:45:01,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 216 transitions. [2024-10-13 12:45:01,856 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7322033898305085 [2024-10-13 12:45:01,856 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 234 flow. Second operand 5 states and 216 transitions. [2024-10-13 12:45:01,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 120 transitions, 606 flow [2024-10-13 12:45:01,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 120 transitions, 582 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-13 12:45:01,864 INFO L231 Difference]: Finished difference. Result has 69 places, 65 transitions, 257 flow [2024-10-13 12:45:01,864 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=257, PETRI_PLACES=69, PETRI_TRANSITIONS=65} [2024-10-13 12:45:01,866 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 11 predicate places. [2024-10-13 12:45:01,866 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 65 transitions, 257 flow [2024-10-13 12:45:01,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:01,866 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:45:01,867 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:45:01,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-13 12:45:02,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:02,068 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-13 12:45:02,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:45:02,068 INFO L85 PathProgramCache]: Analyzing trace with hash -2035937222, now seen corresponding path program 1 times [2024-10-13 12:45:02,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:45:02,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [152136495] [2024-10-13 12:45:02,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:45:02,069 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:02,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:45:02,071 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:45:02,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-13 12:45:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:45:02,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 12:45:02,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:45:02,144 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 8 treesize of output 7 [2024-10-13 12:45:02,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:45:02,368 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:45:02,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:45:02,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [152136495] [2024-10-13 12:45:02,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [152136495] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:45:02,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:45:02,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:45:02,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685222166] [2024-10-13 12:45:02,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:45:02,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:45:02,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:45:02,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:45:02,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:45:02,524 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 59 [2024-10-13 12:45:02,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 65 transitions, 257 flow. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:02,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:45:02,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 59 [2024-10-13 12:45:02,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:45:03,535 INFO L124 PetriNetUnfolderBase]: 4818/7799 cut-off events. [2024-10-13 12:45:03,535 INFO L125 PetriNetUnfolderBase]: For 4366/4478 co-relation queries the response was YES. [2024-10-13 12:45:03,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18302 conditions, 7799 events. 4818/7799 cut-off events. For 4366/4478 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 48067 event pairs, 3137 based on Foata normal form. 204/7298 useless extension candidates. Maximal degree in co-relation 18265. Up to 5667 conditions per place. [2024-10-13 12:45:03,579 INFO L140 encePairwiseOnDemand]: 50/59 looper letters, 79 selfloop transitions, 6 changer transitions 0/100 dead transitions. [2024-10-13 12:45:03,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 100 transitions, 537 flow [2024-10-13 12:45:03,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:45:03,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:45:03,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 201 transitions. [2024-10-13 12:45:03,581 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6813559322033899 [2024-10-13 12:45:03,581 INFO L175 Difference]: Start difference. First operand has 69 places, 65 transitions, 257 flow. Second operand 5 states and 201 transitions. [2024-10-13 12:45:03,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 100 transitions, 537 flow [2024-10-13 12:45:03,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 100 transitions, 537 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 12:45:03,588 INFO L231 Difference]: Finished difference. Result has 75 places, 68 transitions, 306 flow [2024-10-13 12:45:03,589 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=306, PETRI_PLACES=75, PETRI_TRANSITIONS=68} [2024-10-13 12:45:03,589 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 17 predicate places. [2024-10-13 12:45:03,589 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 68 transitions, 306 flow [2024-10-13 12:45:03,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:03,590 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:45:03,590 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:45:03,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-10-13 12:45:03,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:03,793 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-13 12:45:03,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:45:03,794 INFO L85 PathProgramCache]: Analyzing trace with hash 531280281, now seen corresponding path program 1 times [2024-10-13 12:45:03,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:45:03,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [499171814] [2024-10-13 12:45:03,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:45:03,794 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:03,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:45:03,797 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:45:03,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-13 12:45:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:45:03,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 12:45:03,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:45:03,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:45:03,872 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:45:03,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:45:03,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [499171814] [2024-10-13 12:45:03,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [499171814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:45:03,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:45:03,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:45:03,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316540593] [2024-10-13 12:45:03,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:45:03,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:45:03,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:45:03,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:45:03,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:45:03,881 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 59 [2024-10-13 12:45:03,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 68 transitions, 306 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:03,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:45:03,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 59 [2024-10-13 12:45:03,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:45:04,506 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([474] L56-6-->L55-6: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_12 (bvadd (_ bv1 32) v_thread2Thread1of1ForFork2_~i~1_11)) (= (ite (= (_ bv0 32) (ite |v_thread2Thread1of1ForFork2_#t~short7_7| (_ bv1 32) (_ bv0 32))) (_ bv0 8) (_ bv1 8)) v_~sorted2~0_18)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11, thread2Thread1of1ForFork2_#t~short7=|v_thread2Thread1of1ForFork2_#t~short7_7|} OutVars{thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_1|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_12, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_3|, thread2Thread1of1ForFork2_#t~post8=|v_thread2Thread1of1ForFork2_#t~post8_1|, ~sorted2~0=v_~sorted2~0_18} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, thread2Thread1of1ForFork2_#t~post8, thread2Thread1of1ForFork2_#t~short7, ~sorted2~0][38], [Black: 123#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~size#1|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (exists ((v_subst_2 (_ BitVec 32))) (and (bvslt (_ bv1 32) v_subst_2) (= (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (bvmul (_ bv4 32) v_subst_2)) (bvule v_subst_2 (_ bv1073741823 32)))) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32))), Black: 109#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))), Black: 127#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (or (and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)))), 18#L86-4true, 88#true, 243#(and |thread1Thread1of1ForFork1_#t~short3| (= ~sorted1~0 (_ bv1 8))), 246#true, 52#L63-6true, 40#L55-6true, Black: 203#(and (= ~A~0.offset (_ bv0 32)) (exists ((~N~0 (_ BitVec 32))) (and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (bvslt (_ bv0 32) ~N~0))) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 169#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32))), 140#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| ~A~0.base))), Black: 211#true, Black: 268#(and (= ~A~0.offset (_ bv0 32)) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ BitVec 32))) (and (bvule |v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|) (select |#length| ~A~0.base)) (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|)))) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 85#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~size#1|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (exists ((v_subst_1 (_ BitVec 32))) (and (bvule v_subst_1 (_ bv1073741823 32)) (= (bvmul (_ bv4 32) v_subst_1) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvslt (_ bv0 32) v_subst_1))) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32))), Black: 255#(and (= ~A~0.offset (_ bv0 32)) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ BitVec 32))) (and (bvule |v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|) (select |#length| ~A~0.base)) (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|))))), 280#true, 178#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (exists ((v_subst_3 (_ BitVec 32))) (and (= (select |#length| ~A~0.base) (bvmul (_ bv4 32) v_subst_3)) (bvslt (_ bv0 32) (bvadd v_subst_3 (_ bv4294967295 32))) (bvule v_subst_3 (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32))), 55#L48-3true]) [2024-10-13 12:45:04,507 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-10-13 12:45:04,507 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-10-13 12:45:04,507 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-13 12:45:04,507 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-10-13 12:45:04,527 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([474] L56-6-->L55-6: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_12 (bvadd (_ bv1 32) v_thread2Thread1of1ForFork2_~i~1_11)) (= (ite (= (_ bv0 32) (ite |v_thread2Thread1of1ForFork2_#t~short7_7| (_ bv1 32) (_ bv0 32))) (_ bv0 8) (_ bv1 8)) v_~sorted2~0_18)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11, thread2Thread1of1ForFork2_#t~short7=|v_thread2Thread1of1ForFork2_#t~short7_7|} OutVars{thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_1|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_12, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_3|, thread2Thread1of1ForFork2_#t~post8=|v_thread2Thread1of1ForFork2_#t~post8_1|, ~sorted2~0=v_~sorted2~0_18} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, thread2Thread1of1ForFork2_#t~post8, thread2Thread1of1ForFork2_#t~short7, ~sorted2~0][38], [Black: 123#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~size#1|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (exists ((v_subst_2 (_ BitVec 32))) (and (bvslt (_ bv1 32) v_subst_2) (= (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (bvmul (_ bv4 32) v_subst_2)) (bvule v_subst_2 (_ bv1073741823 32)))) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32))), Black: 109#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))), Black: 127#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (or (and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)))), 88#true, 243#(and |thread1Thread1of1ForFork1_#t~short3| (= ~sorted1~0 (_ bv1 8))), 43#L87true, 246#true, 52#L63-6true, 40#L55-6true, Black: 203#(and (= ~A~0.offset (_ bv0 32)) (exists ((~N~0 (_ BitVec 32))) (and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (bvslt (_ bv0 32) ~N~0))) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 169#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32))), 140#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| ~A~0.base))), Black: 211#true, Black: 268#(and (= ~A~0.offset (_ bv0 32)) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ BitVec 32))) (and (bvule |v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|) (select |#length| ~A~0.base)) (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|)))) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 85#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~size#1|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (exists ((v_subst_1 (_ BitVec 32))) (and (bvule v_subst_1 (_ bv1073741823 32)) (= (bvmul (_ bv4 32) v_subst_1) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvslt (_ bv0 32) v_subst_1))) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32))), Black: 255#(and (= ~A~0.offset (_ bv0 32)) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ BitVec 32))) (and (bvule |v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|) (select |#length| ~A~0.base)) (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|))))), 280#true, 55#L48-3true, 178#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (exists ((v_subst_3 (_ BitVec 32))) (and (= (select |#length| ~A~0.base) (bvmul (_ bv4 32) v_subst_3)) (bvslt (_ bv0 32) (bvadd v_subst_3 (_ bv4294967295 32))) (bvule v_subst_3 (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)))]) [2024-10-13 12:45:04,527 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-10-13 12:45:04,527 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-13 12:45:04,527 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-13 12:45:04,527 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-13 12:45:04,528 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([474] L56-6-->L55-6: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_12 (bvadd (_ bv1 32) v_thread2Thread1of1ForFork2_~i~1_11)) (= (ite (= (_ bv0 32) (ite |v_thread2Thread1of1ForFork2_#t~short7_7| (_ bv1 32) (_ bv0 32))) (_ bv0 8) (_ bv1 8)) v_~sorted2~0_18)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11, thread2Thread1of1ForFork2_#t~short7=|v_thread2Thread1of1ForFork2_#t~short7_7|} OutVars{thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_1|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_12, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_3|, thread2Thread1of1ForFork2_#t~post8=|v_thread2Thread1of1ForFork2_#t~post8_1|, ~sorted2~0=v_~sorted2~0_18} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, thread2Thread1of1ForFork2_#t~post8, thread2Thread1of1ForFork2_#t~short7, ~sorted2~0][38], [Black: 123#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~size#1|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (exists ((v_subst_2 (_ BitVec 32))) (and (bvslt (_ bv1 32) v_subst_2) (= (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (bvmul (_ bv4 32) v_subst_2)) (bvule v_subst_2 (_ bv1073741823 32)))) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32))), Black: 109#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))), Black: 127#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (or (and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)))), 18#L86-4true, 88#true, 243#(and |thread1Thread1of1ForFork1_#t~short3| (= ~sorted1~0 (_ bv1 8))), 36#L64-1true, 246#true, 40#L55-6true, Black: 203#(and (= ~A~0.offset (_ bv0 32)) (exists ((~N~0 (_ BitVec 32))) (and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (bvslt (_ bv0 32) ~N~0))) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 169#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32))), 140#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| ~A~0.base))), Black: 211#true, Black: 268#(and (= ~A~0.offset (_ bv0 32)) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ BitVec 32))) (and (bvule |v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|) (select |#length| ~A~0.base)) (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|)))) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 85#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~size#1|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (exists ((v_subst_1 (_ BitVec 32))) (and (bvule v_subst_1 (_ bv1073741823 32)) (= (bvmul (_ bv4 32) v_subst_1) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvslt (_ bv0 32) v_subst_1))) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32))), Black: 255#(and (= ~A~0.offset (_ bv0 32)) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ BitVec 32))) (and (bvule |v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|) (select |#length| ~A~0.base)) (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|))))), 280#true, 178#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (exists ((v_subst_3 (_ BitVec 32))) (and (= (select |#length| ~A~0.base) (bvmul (_ bv4 32) v_subst_3)) (bvslt (_ bv0 32) (bvadd v_subst_3 (_ bv4294967295 32))) (bvule v_subst_3 (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32))), 55#L48-3true]) [2024-10-13 12:45:04,528 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-10-13 12:45:04,528 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-13 12:45:04,528 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-13 12:45:04,528 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-13 12:45:04,529 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([474] L56-6-->L55-6: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_12 (bvadd (_ bv1 32) v_thread2Thread1of1ForFork2_~i~1_11)) (= (ite (= (_ bv0 32) (ite |v_thread2Thread1of1ForFork2_#t~short7_7| (_ bv1 32) (_ bv0 32))) (_ bv0 8) (_ bv1 8)) v_~sorted2~0_18)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11, thread2Thread1of1ForFork2_#t~short7=|v_thread2Thread1of1ForFork2_#t~short7_7|} OutVars{thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_1|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_12, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_3|, thread2Thread1of1ForFork2_#t~post8=|v_thread2Thread1of1ForFork2_#t~post8_1|, ~sorted2~0=v_~sorted2~0_18} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, thread2Thread1of1ForFork2_#t~post8, thread2Thread1of1ForFork2_#t~short7, ~sorted2~0][38], [Black: 123#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~size#1|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (exists ((v_subst_2 (_ BitVec 32))) (and (bvslt (_ bv1 32) v_subst_2) (= (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (bvmul (_ bv4 32) v_subst_2)) (bvule v_subst_2 (_ bv1073741823 32)))) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32))), Black: 109#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))), Black: 127#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (or (and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)))), 18#L86-4true, 88#true, 243#(and |thread1Thread1of1ForFork1_#t~short3| (= ~sorted1~0 (_ bv1 8))), 246#true, 10#thread3EXITtrue, 40#L55-6true, Black: 203#(and (= ~A~0.offset (_ bv0 32)) (exists ((~N~0 (_ BitVec 32))) (and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (bvslt (_ bv0 32) ~N~0))) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 169#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32))), 140#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| ~A~0.base))), Black: 211#true, Black: 85#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~size#1|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (exists ((v_subst_1 (_ BitVec 32))) (and (bvule v_subst_1 (_ bv1073741823 32)) (= (bvmul (_ bv4 32) v_subst_1) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvslt (_ bv0 32) v_subst_1))) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32))), Black: 268#(and (= ~A~0.offset (_ bv0 32)) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ BitVec 32))) (and (bvule |v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|) (select |#length| ~A~0.base)) (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|)))) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 255#(and (= ~A~0.offset (_ bv0 32)) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ BitVec 32))) (and (bvule |v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|) (select |#length| ~A~0.base)) (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|))))), 280#true, 178#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (exists ((v_subst_3 (_ BitVec 32))) (and (= (select |#length| ~A~0.base) (bvmul (_ bv4 32) v_subst_3)) (bvslt (_ bv0 32) (bvadd v_subst_3 (_ bv4294967295 32))) (bvule v_subst_3 (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32))), 55#L48-3true]) [2024-10-13 12:45:04,529 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-10-13 12:45:04,529 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-13 12:45:04,529 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-13 12:45:04,529 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-13 12:45:04,543 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([474] L56-6-->L55-6: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_12 (bvadd (_ bv1 32) v_thread2Thread1of1ForFork2_~i~1_11)) (= (ite (= (_ bv0 32) (ite |v_thread2Thread1of1ForFork2_#t~short7_7| (_ bv1 32) (_ bv0 32))) (_ bv0 8) (_ bv1 8)) v_~sorted2~0_18)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11, thread2Thread1of1ForFork2_#t~short7=|v_thread2Thread1of1ForFork2_#t~short7_7|} OutVars{thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_1|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_12, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_3|, thread2Thread1of1ForFork2_#t~post8=|v_thread2Thread1of1ForFork2_#t~post8_1|, ~sorted2~0=v_~sorted2~0_18} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, thread2Thread1of1ForFork2_#t~post8, thread2Thread1of1ForFork2_#t~short7, ~sorted2~0][38], [Black: 123#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~size#1|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (exists ((v_subst_2 (_ BitVec 32))) (and (bvslt (_ bv1 32) v_subst_2) (= (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (bvmul (_ bv4 32) v_subst_2)) (bvule v_subst_2 (_ bv1073741823 32)))) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32))), Black: 109#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))), Black: 127#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (or (and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)))), 88#true, 243#(and |thread1Thread1of1ForFork1_#t~short3| (= ~sorted1~0 (_ bv1 8))), 36#L64-1true, 43#L87true, 246#true, 40#L55-6true, Black: 203#(and (= ~A~0.offset (_ bv0 32)) (exists ((~N~0 (_ BitVec 32))) (and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (bvslt (_ bv0 32) ~N~0))) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 169#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32))), 140#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| ~A~0.base))), Black: 211#true, Black: 85#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~size#1|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (exists ((v_subst_1 (_ BitVec 32))) (and (bvule v_subst_1 (_ bv1073741823 32)) (= (bvmul (_ bv4 32) v_subst_1) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvslt (_ bv0 32) v_subst_1))) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32))), Black: 268#(and (= ~A~0.offset (_ bv0 32)) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ BitVec 32))) (and (bvule |v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|) (select |#length| ~A~0.base)) (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|)))) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 255#(and (= ~A~0.offset (_ bv0 32)) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ BitVec 32))) (and (bvule |v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|) (select |#length| ~A~0.base)) (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|))))), 280#true, 55#L48-3true, 178#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (exists ((v_subst_3 (_ BitVec 32))) (and (= (select |#length| ~A~0.base) (bvmul (_ bv4 32) v_subst_3)) (bvslt (_ bv0 32) (bvadd v_subst_3 (_ bv4294967295 32))) (bvule v_subst_3 (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)))]) [2024-10-13 12:45:04,543 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-10-13 12:45:04,543 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-13 12:45:04,543 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-13 12:45:04,543 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-13 12:45:04,543 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([474] L56-6-->L55-6: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_12 (bvadd (_ bv1 32) v_thread2Thread1of1ForFork2_~i~1_11)) (= (ite (= (_ bv0 32) (ite |v_thread2Thread1of1ForFork2_#t~short7_7| (_ bv1 32) (_ bv0 32))) (_ bv0 8) (_ bv1 8)) v_~sorted2~0_18)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11, thread2Thread1of1ForFork2_#t~short7=|v_thread2Thread1of1ForFork2_#t~short7_7|} OutVars{thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_1|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_12, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_3|, thread2Thread1of1ForFork2_#t~post8=|v_thread2Thread1of1ForFork2_#t~post8_1|, ~sorted2~0=v_~sorted2~0_18} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, thread2Thread1of1ForFork2_#t~post8, thread2Thread1of1ForFork2_#t~short7, ~sorted2~0][38], [Black: 123#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~size#1|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (exists ((v_subst_2 (_ BitVec 32))) (and (bvslt (_ bv1 32) v_subst_2) (= (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (bvmul (_ bv4 32) v_subst_2)) (bvule v_subst_2 (_ bv1073741823 32)))) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32))), Black: 109#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))), Black: 127#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (or (and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)))), 88#true, 243#(and |thread1Thread1of1ForFork1_#t~short3| (= ~sorted1~0 (_ bv1 8))), 43#L87true, 246#true, 10#thread3EXITtrue, 40#L55-6true, Black: 203#(and (= ~A~0.offset (_ bv0 32)) (exists ((~N~0 (_ BitVec 32))) (and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (bvslt (_ bv0 32) ~N~0))) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 169#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32))), 140#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| ~A~0.base))), Black: 211#true, Black: 85#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~size#1|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (exists ((v_subst_1 (_ BitVec 32))) (and (bvule v_subst_1 (_ bv1073741823 32)) (= (bvmul (_ bv4 32) v_subst_1) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvslt (_ bv0 32) v_subst_1))) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32))), Black: 268#(and (= ~A~0.offset (_ bv0 32)) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ BitVec 32))) (and (bvule |v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|) (select |#length| ~A~0.base)) (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|)))) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 255#(and (= ~A~0.offset (_ bv0 32)) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ BitVec 32))) (and (bvule |v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|) (select |#length| ~A~0.base)) (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|))))), 280#true, 55#L48-3true, 178#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (exists ((v_subst_3 (_ BitVec 32))) (and (= (select |#length| ~A~0.base) (bvmul (_ bv4 32) v_subst_3)) (bvslt (_ bv0 32) (bvadd v_subst_3 (_ bv4294967295 32))) (bvule v_subst_3 (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)))]) [2024-10-13 12:45:04,544 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-10-13 12:45:04,544 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-13 12:45:04,544 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-13 12:45:04,544 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-13 12:45:04,564 INFO L124 PetriNetUnfolderBase]: 3179/5463 cut-off events. [2024-10-13 12:45:04,564 INFO L125 PetriNetUnfolderBase]: For 4428/4707 co-relation queries the response was YES. [2024-10-13 12:45:04,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13786 conditions, 5463 events. 3179/5463 cut-off events. For 4428/4707 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 36022 event pairs, 2038 based on Foata normal form. 1/4702 useless extension candidates. Maximal degree in co-relation 13759. Up to 3993 conditions per place. [2024-10-13 12:45:04,598 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 44 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2024-10-13 12:45:04,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 64 transitions, 363 flow [2024-10-13 12:45:04,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:45:04,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:45:04,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2024-10-13 12:45:04,599 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.655367231638418 [2024-10-13 12:45:04,599 INFO L175 Difference]: Start difference. First operand has 75 places, 68 transitions, 306 flow. Second operand 3 states and 116 transitions. [2024-10-13 12:45:04,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 64 transitions, 363 flow [2024-10-13 12:45:04,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 64 transitions, 359 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:45:04,604 INFO L231 Difference]: Finished difference. Result has 73 places, 64 transitions, 271 flow [2024-10-13 12:45:04,605 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=271, PETRI_PLACES=73, PETRI_TRANSITIONS=64} [2024-10-13 12:45:04,605 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 15 predicate places. [2024-10-13 12:45:04,605 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 64 transitions, 271 flow [2024-10-13 12:45:04,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:04,606 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:45:04,606 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2024-10-13 12:45:04,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-13 12:45:04,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:04,807 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-13 12:45:04,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:45:04,807 INFO L85 PathProgramCache]: Analyzing trace with hash 418930414, now seen corresponding path program 2 times [2024-10-13 12:45:04,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:45:04,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1810921577] [2024-10-13 12:45:04,808 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 12:45:04,808 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:04,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:45:04,811 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:45:04,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-13 12:45:04,876 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 12:45:04,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:45:04,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 12:45:04,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:45:04,894 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 8 treesize of output 7 [2024-10-13 12:45:05,115 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:45:05,116 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:45:05,695 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:45:05,696 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:45:05,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1810921577] [2024-10-13 12:45:05,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1810921577] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:45:05,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:45:05,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2024-10-13 12:45:05,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304020363] [2024-10-13 12:45:05,696 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:45:05,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 12:45:05,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:45:05,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 12:45:05,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-10-13 12:45:06,594 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 59 [2024-10-13 12:45:06,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 64 transitions, 271 flow. Second operand has 14 states, 14 states have (on average 28.571428571428573) internal successors, (400), 14 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:06,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:45:06,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 59 [2024-10-13 12:45:06,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:45:09,002 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([474] L56-6-->L55-6: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_12 (bvadd (_ bv1 32) v_thread2Thread1of1ForFork2_~i~1_11)) (= (ite (= (_ bv0 32) (ite |v_thread2Thread1of1ForFork2_#t~short7_7| (_ bv1 32) (_ bv0 32))) (_ bv0 8) (_ bv1 8)) v_~sorted2~0_18)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11, thread2Thread1of1ForFork2_#t~short7=|v_thread2Thread1of1ForFork2_#t~short7_7|} OutVars{thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_1|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_12, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_3|, thread2Thread1of1ForFork2_#t~post8=|v_thread2Thread1of1ForFork2_#t~post8_1|, ~sorted2~0=v_~sorted2~0_18} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, thread2Thread1of1ForFork2_#t~post8, thread2Thread1of1ForFork2_#t~short7, ~sorted2~0][37], [Black: 123#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~size#1|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (exists ((v_subst_2 (_ BitVec 32))) (and (bvslt (_ bv1 32) v_subst_2) (= (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (bvmul (_ bv4 32) v_subst_2)) (bvule v_subst_2 (_ bv1073741823 32)))) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32))), Black: 109#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))), Black: 127#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (or (and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)))), 18#L86-4true, 88#true, 243#(and |thread1Thread1of1ForFork1_#t~short3| (= ~sorted1~0 (_ bv1 8))), 52#L63-6true, 40#L55-6true, Black: 203#(and (= ~A~0.offset (_ bv0 32)) (exists ((~N~0 (_ BitVec 32))) (and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (bvslt (_ bv0 32) ~N~0))) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 169#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32))), 140#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| ~A~0.base))), Black: 211#true, Black: 85#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~size#1|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (exists ((v_subst_1 (_ BitVec 32))) (and (bvule v_subst_1 (_ bv1073741823 32)) (= (bvmul (_ bv4 32) v_subst_1) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvslt (_ bv0 32) v_subst_1))) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32))), Black: 268#(and (= ~A~0.offset (_ bv0 32)) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ BitVec 32))) (and (bvule |v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|) (select |#length| ~A~0.base)) (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|)))) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 255#(and (= ~A~0.offset (_ bv0 32)) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ BitVec 32))) (and (bvule |v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|) (select |#length| ~A~0.base)) (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|))))), 280#true, 313#true, 55#L48-3true, 178#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (exists ((v_subst_3 (_ BitVec 32))) (and (= (select |#length| ~A~0.base) (bvmul (_ bv4 32) v_subst_3)) (bvslt (_ bv0 32) (bvadd v_subst_3 (_ bv4294967295 32))) (bvule v_subst_3 (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)))]) [2024-10-13 12:45:09,002 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-10-13 12:45:09,002 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-10-13 12:45:09,002 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-10-13 12:45:09,003 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-13 12:45:09,027 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([474] L56-6-->L55-6: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_12 (bvadd (_ bv1 32) v_thread2Thread1of1ForFork2_~i~1_11)) (= (ite (= (_ bv0 32) (ite |v_thread2Thread1of1ForFork2_#t~short7_7| (_ bv1 32) (_ bv0 32))) (_ bv0 8) (_ bv1 8)) v_~sorted2~0_18)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11, thread2Thread1of1ForFork2_#t~short7=|v_thread2Thread1of1ForFork2_#t~short7_7|} OutVars{thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_1|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_12, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_3|, thread2Thread1of1ForFork2_#t~post8=|v_thread2Thread1of1ForFork2_#t~post8_1|, ~sorted2~0=v_~sorted2~0_18} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, thread2Thread1of1ForFork2_#t~post8, thread2Thread1of1ForFork2_#t~short7, ~sorted2~0][37], [Black: 123#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~size#1|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (exists ((v_subst_2 (_ BitVec 32))) (and (bvslt (_ bv1 32) v_subst_2) (= (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (bvmul (_ bv4 32) v_subst_2)) (bvule v_subst_2 (_ bv1073741823 32)))) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32))), Black: 109#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))), Black: 127#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (or (and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)))), 88#true, 243#(and |thread1Thread1of1ForFork1_#t~short3| (= ~sorted1~0 (_ bv1 8))), 43#L87true, 52#L63-6true, 40#L55-6true, Black: 203#(and (= ~A~0.offset (_ bv0 32)) (exists ((~N~0 (_ BitVec 32))) (and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (bvslt (_ bv0 32) ~N~0))) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 169#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32))), 140#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| ~A~0.base))), Black: 211#true, Black: 268#(and (= ~A~0.offset (_ bv0 32)) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ BitVec 32))) (and (bvule |v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|) (select |#length| ~A~0.base)) (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|)))) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 85#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~size#1|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (exists ((v_subst_1 (_ BitVec 32))) (and (bvule v_subst_1 (_ bv1073741823 32)) (= (bvmul (_ bv4 32) v_subst_1) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvslt (_ bv0 32) v_subst_1))) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32))), Black: 255#(and (= ~A~0.offset (_ bv0 32)) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ BitVec 32))) (and (bvule |v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|) (select |#length| ~A~0.base)) (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|))))), 280#true, 313#true, 55#L48-3true, 178#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (exists ((v_subst_3 (_ BitVec 32))) (and (= (select |#length| ~A~0.base) (bvmul (_ bv4 32) v_subst_3)) (bvslt (_ bv0 32) (bvadd v_subst_3 (_ bv4294967295 32))) (bvule v_subst_3 (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)))]) [2024-10-13 12:45:09,027 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-10-13 12:45:09,027 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-13 12:45:09,027 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-13 12:45:09,027 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-13 12:45:09,028 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([474] L56-6-->L55-6: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_12 (bvadd (_ bv1 32) v_thread2Thread1of1ForFork2_~i~1_11)) (= (ite (= (_ bv0 32) (ite |v_thread2Thread1of1ForFork2_#t~short7_7| (_ bv1 32) (_ bv0 32))) (_ bv0 8) (_ bv1 8)) v_~sorted2~0_18)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11, thread2Thread1of1ForFork2_#t~short7=|v_thread2Thread1of1ForFork2_#t~short7_7|} OutVars{thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_1|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_12, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_3|, thread2Thread1of1ForFork2_#t~post8=|v_thread2Thread1of1ForFork2_#t~post8_1|, ~sorted2~0=v_~sorted2~0_18} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, thread2Thread1of1ForFork2_#t~post8, thread2Thread1of1ForFork2_#t~short7, ~sorted2~0][37], [Black: 123#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~size#1|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (exists ((v_subst_2 (_ BitVec 32))) (and (bvslt (_ bv1 32) v_subst_2) (= (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (bvmul (_ bv4 32) v_subst_2)) (bvule v_subst_2 (_ bv1073741823 32)))) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32))), Black: 109#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))), Black: 127#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (or (and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)))), 18#L86-4true, 88#true, 243#(and |thread1Thread1of1ForFork1_#t~short3| (= ~sorted1~0 (_ bv1 8))), 36#L64-1true, 40#L55-6true, Black: 203#(and (= ~A~0.offset (_ bv0 32)) (exists ((~N~0 (_ BitVec 32))) (and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (bvslt (_ bv0 32) ~N~0))) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 169#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32))), 140#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| ~A~0.base))), Black: 211#true, Black: 85#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~size#1|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (exists ((v_subst_1 (_ BitVec 32))) (and (bvule v_subst_1 (_ bv1073741823 32)) (= (bvmul (_ bv4 32) v_subst_1) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvslt (_ bv0 32) v_subst_1))) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32))), Black: 268#(and (= ~A~0.offset (_ bv0 32)) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ BitVec 32))) (and (bvule |v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|) (select |#length| ~A~0.base)) (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|)))) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 255#(and (= ~A~0.offset (_ bv0 32)) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ BitVec 32))) (and (bvule |v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|) (select |#length| ~A~0.base)) (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|))))), 280#true, 313#true, 55#L48-3true, 178#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (exists ((v_subst_3 (_ BitVec 32))) (and (= (select |#length| ~A~0.base) (bvmul (_ bv4 32) v_subst_3)) (bvslt (_ bv0 32) (bvadd v_subst_3 (_ bv4294967295 32))) (bvule v_subst_3 (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)))]) [2024-10-13 12:45:09,028 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-10-13 12:45:09,029 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-13 12:45:09,029 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-13 12:45:09,029 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-13 12:45:09,030 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([474] L56-6-->L55-6: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_12 (bvadd (_ bv1 32) v_thread2Thread1of1ForFork2_~i~1_11)) (= (ite (= (_ bv0 32) (ite |v_thread2Thread1of1ForFork2_#t~short7_7| (_ bv1 32) (_ bv0 32))) (_ bv0 8) (_ bv1 8)) v_~sorted2~0_18)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11, thread2Thread1of1ForFork2_#t~short7=|v_thread2Thread1of1ForFork2_#t~short7_7|} OutVars{thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_1|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_12, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_3|, thread2Thread1of1ForFork2_#t~post8=|v_thread2Thread1of1ForFork2_#t~post8_1|, ~sorted2~0=v_~sorted2~0_18} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, thread2Thread1of1ForFork2_#t~post8, thread2Thread1of1ForFork2_#t~short7, ~sorted2~0][37], [Black: 123#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~size#1|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (exists ((v_subst_2 (_ BitVec 32))) (and (bvslt (_ bv1 32) v_subst_2) (= (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (bvmul (_ bv4 32) v_subst_2)) (bvule v_subst_2 (_ bv1073741823 32)))) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32))), Black: 109#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))), Black: 127#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (or (and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)))), 18#L86-4true, 88#true, 243#(and |thread1Thread1of1ForFork1_#t~short3| (= ~sorted1~0 (_ bv1 8))), 10#thread3EXITtrue, 40#L55-6true, Black: 203#(and (= ~A~0.offset (_ bv0 32)) (exists ((~N~0 (_ BitVec 32))) (and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (bvslt (_ bv0 32) ~N~0))) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 169#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32))), 140#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| ~A~0.base))), Black: 211#true, Black: 85#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~size#1|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (exists ((v_subst_1 (_ BitVec 32))) (and (bvule v_subst_1 (_ bv1073741823 32)) (= (bvmul (_ bv4 32) v_subst_1) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvslt (_ bv0 32) v_subst_1))) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32))), Black: 268#(and (= ~A~0.offset (_ bv0 32)) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ BitVec 32))) (and (bvule |v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|) (select |#length| ~A~0.base)) (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|)))) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 255#(and (= ~A~0.offset (_ bv0 32)) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ BitVec 32))) (and (bvule |v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|) (select |#length| ~A~0.base)) (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|))))), 280#true, 313#true, 55#L48-3true, 178#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (exists ((v_subst_3 (_ BitVec 32))) (and (= (select |#length| ~A~0.base) (bvmul (_ bv4 32) v_subst_3)) (bvslt (_ bv0 32) (bvadd v_subst_3 (_ bv4294967295 32))) (bvule v_subst_3 (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)))]) [2024-10-13 12:45:09,030 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-10-13 12:45:09,031 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-13 12:45:09,031 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-13 12:45:09,031 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-13 12:45:09,049 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([474] L56-6-->L55-6: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_12 (bvadd (_ bv1 32) v_thread2Thread1of1ForFork2_~i~1_11)) (= (ite (= (_ bv0 32) (ite |v_thread2Thread1of1ForFork2_#t~short7_7| (_ bv1 32) (_ bv0 32))) (_ bv0 8) (_ bv1 8)) v_~sorted2~0_18)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11, thread2Thread1of1ForFork2_#t~short7=|v_thread2Thread1of1ForFork2_#t~short7_7|} OutVars{thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_1|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_12, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_3|, thread2Thread1of1ForFork2_#t~post8=|v_thread2Thread1of1ForFork2_#t~post8_1|, ~sorted2~0=v_~sorted2~0_18} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, thread2Thread1of1ForFork2_#t~post8, thread2Thread1of1ForFork2_#t~short7, ~sorted2~0][37], [Black: 123#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~size#1|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (exists ((v_subst_2 (_ BitVec 32))) (and (bvslt (_ bv1 32) v_subst_2) (= (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (bvmul (_ bv4 32) v_subst_2)) (bvule v_subst_2 (_ bv1073741823 32)))) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32))), Black: 109#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))), Black: 127#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (or (and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)))), 88#true, 243#(and |thread1Thread1of1ForFork1_#t~short3| (= ~sorted1~0 (_ bv1 8))), 43#L87true, 36#L64-1true, 40#L55-6true, Black: 203#(and (= ~A~0.offset (_ bv0 32)) (exists ((~N~0 (_ BitVec 32))) (and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (bvslt (_ bv0 32) ~N~0))) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 169#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32))), 140#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| ~A~0.base))), Black: 211#true, Black: 85#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~size#1|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (exists ((v_subst_1 (_ BitVec 32))) (and (bvule v_subst_1 (_ bv1073741823 32)) (= (bvmul (_ bv4 32) v_subst_1) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvslt (_ bv0 32) v_subst_1))) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32))), Black: 268#(and (= ~A~0.offset (_ bv0 32)) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ BitVec 32))) (and (bvule |v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|) (select |#length| ~A~0.base)) (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|)))) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 255#(and (= ~A~0.offset (_ bv0 32)) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ BitVec 32))) (and (bvule |v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|) (select |#length| ~A~0.base)) (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|))))), 280#true, 313#true, 55#L48-3true, 178#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (exists ((v_subst_3 (_ BitVec 32))) (and (= (select |#length| ~A~0.base) (bvmul (_ bv4 32) v_subst_3)) (bvslt (_ bv0 32) (bvadd v_subst_3 (_ bv4294967295 32))) (bvule v_subst_3 (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)))]) [2024-10-13 12:45:09,050 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-10-13 12:45:09,050 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-13 12:45:09,050 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-13 12:45:09,050 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-13 12:45:09,051 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([474] L56-6-->L55-6: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_12 (bvadd (_ bv1 32) v_thread2Thread1of1ForFork2_~i~1_11)) (= (ite (= (_ bv0 32) (ite |v_thread2Thread1of1ForFork2_#t~short7_7| (_ bv1 32) (_ bv0 32))) (_ bv0 8) (_ bv1 8)) v_~sorted2~0_18)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11, thread2Thread1of1ForFork2_#t~short7=|v_thread2Thread1of1ForFork2_#t~short7_7|} OutVars{thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_1|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_12, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_3|, thread2Thread1of1ForFork2_#t~post8=|v_thread2Thread1of1ForFork2_#t~post8_1|, ~sorted2~0=v_~sorted2~0_18} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, thread2Thread1of1ForFork2_#t~post8, thread2Thread1of1ForFork2_#t~short7, ~sorted2~0][37], [Black: 123#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~size#1|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (exists ((v_subst_2 (_ BitVec 32))) (and (bvslt (_ bv1 32) v_subst_2) (= (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (bvmul (_ bv4 32) v_subst_2)) (bvule v_subst_2 (_ bv1073741823 32)))) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32))), Black: 109#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))), Black: 127#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (or (and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)))), 88#true, 243#(and |thread1Thread1of1ForFork1_#t~short3| (= ~sorted1~0 (_ bv1 8))), 43#L87true, 10#thread3EXITtrue, 40#L55-6true, Black: 203#(and (= ~A~0.offset (_ bv0 32)) (exists ((~N~0 (_ BitVec 32))) (and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (bvslt (_ bv0 32) ~N~0))) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 169#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32))), 140#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| ~A~0.base))), Black: 211#true, Black: 85#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~size#1|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (exists ((v_subst_1 (_ BitVec 32))) (and (bvule v_subst_1 (_ bv1073741823 32)) (= (bvmul (_ bv4 32) v_subst_1) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvslt (_ bv0 32) v_subst_1))) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32))), Black: 268#(and (= ~A~0.offset (_ bv0 32)) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ BitVec 32))) (and (bvule |v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|) (select |#length| ~A~0.base)) (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|)))) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 255#(and (= ~A~0.offset (_ bv0 32)) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ BitVec 32))) (and (bvule |v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|) (select |#length| ~A~0.base)) (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|))))), 280#true, 313#true, 55#L48-3true, 178#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (exists ((v_subst_3 (_ BitVec 32))) (and (= (select |#length| ~A~0.base) (bvmul (_ bv4 32) v_subst_3)) (bvslt (_ bv0 32) (bvadd v_subst_3 (_ bv4294967295 32))) (bvule v_subst_3 (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32)))]) [2024-10-13 12:45:09,051 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-10-13 12:45:09,051 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-13 12:45:09,051 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-13 12:45:09,051 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-13 12:45:09,173 INFO L124 PetriNetUnfolderBase]: 3185/5481 cut-off events. [2024-10-13 12:45:09,173 INFO L125 PetriNetUnfolderBase]: For 4463/4742 co-relation queries the response was YES. [2024-10-13 12:45:09,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13865 conditions, 5481 events. 3185/5481 cut-off events. For 4463/4742 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 36220 event pairs, 2038 based on Foata normal form. 6/4725 useless extension candidates. Maximal degree in co-relation 13838. Up to 3994 conditions per place. [2024-10-13 12:45:09,206 INFO L140 encePairwiseOnDemand]: 54/59 looper letters, 35 selfloop transitions, 30 changer transitions 0/82 dead transitions. [2024-10-13 12:45:09,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 82 transitions, 509 flow [2024-10-13 12:45:09,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-13 12:45:09,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-10-13 12:45:09,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 659 transitions. [2024-10-13 12:45:09,211 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5077041602465331 [2024-10-13 12:45:09,211 INFO L175 Difference]: Start difference. First operand has 73 places, 64 transitions, 271 flow. Second operand 22 states and 659 transitions. [2024-10-13 12:45:09,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 82 transitions, 509 flow [2024-10-13 12:45:09,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 82 transitions, 505 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:45:09,218 INFO L231 Difference]: Finished difference. Result has 98 places, 82 transitions, 465 flow [2024-10-13 12:45:09,219 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=465, PETRI_PLACES=98, PETRI_TRANSITIONS=82} [2024-10-13 12:45:09,220 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 40 predicate places. [2024-10-13 12:45:09,220 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 82 transitions, 465 flow [2024-10-13 12:45:09,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 28.571428571428573) internal successors, (400), 14 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:09,220 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:45:09,221 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:45:09,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-13 12:45:09,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:09,422 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-13 12:45:09,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:45:09,422 INFO L85 PathProgramCache]: Analyzing trace with hash 546342284, now seen corresponding path program 1 times [2024-10-13 12:45:09,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:45:09,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1334171871] [2024-10-13 12:45:09,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:45:09,423 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:09,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:45:09,426 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:45:09,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-13 12:45:09,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:45:09,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-13 12:45:09,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:45:09,499 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 8 treesize of output 7 [2024-10-13 12:45:09,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 12:45:09,735 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:45:09,735 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:45:09,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1334171871] [2024-10-13 12:45:09,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1334171871] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:45:09,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:45:09,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:45:09,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633140878] [2024-10-13 12:45:09,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:45:09,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:45:09,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:45:09,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:45:09,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:45:10,039 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2024-10-13 12:45:10,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 82 transitions, 465 flow. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:10,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:45:10,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2024-10-13 12:45:10,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:45:10,783 INFO L124 PetriNetUnfolderBase]: 3666/6147 cut-off events. [2024-10-13 12:45:10,783 INFO L125 PetriNetUnfolderBase]: For 4645/4841 co-relation queries the response was YES. [2024-10-13 12:45:10,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15412 conditions, 6147 events. 3666/6147 cut-off events. For 4645/4841 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 38791 event pairs, 1749 based on Foata normal form. 28/5198 useless extension candidates. Maximal degree in co-relation 15354. Up to 3469 conditions per place. [2024-10-13 12:45:10,820 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 89 selfloop transitions, 15 changer transitions 0/120 dead transitions. [2024-10-13 12:45:10,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 120 transitions, 809 flow [2024-10-13 12:45:10,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:45:10,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 12:45:10,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 220 transitions. [2024-10-13 12:45:10,823 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6214689265536724 [2024-10-13 12:45:10,823 INFO L175 Difference]: Start difference. First operand has 98 places, 82 transitions, 465 flow. Second operand 6 states and 220 transitions. [2024-10-13 12:45:10,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 120 transitions, 809 flow [2024-10-13 12:45:10,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 120 transitions, 731 flow, removed 27 selfloop flow, removed 9 redundant places. [2024-10-13 12:45:10,833 INFO L231 Difference]: Finished difference. Result has 96 places, 83 transitions, 428 flow [2024-10-13 12:45:10,833 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=428, PETRI_PLACES=96, PETRI_TRANSITIONS=83} [2024-10-13 12:45:10,834 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 38 predicate places. [2024-10-13 12:45:10,834 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 83 transitions, 428 flow [2024-10-13 12:45:10,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:10,835 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:45:10,835 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:45:10,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-13 12:45:11,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:11,038 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-13 12:45:11,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:45:11,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1022433657, now seen corresponding path program 1 times [2024-10-13 12:45:11,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:45:11,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [510173814] [2024-10-13 12:45:11,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:45:11,040 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:11,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:45:11,041 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:45:11,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-13 12:45:11,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:45:11,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 12:45:11,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:45:11,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:45:11,212 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:45:11,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:45:11,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:45:11,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [510173814] [2024-10-13 12:45:11,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [510173814] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:45:11,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:45:11,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-10-13 12:45:11,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689506155] [2024-10-13 12:45:11,340 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:45:11,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 12:45:11,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:45:11,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 12:45:11,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-13 12:45:11,428 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 59 [2024-10-13 12:45:11,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 83 transitions, 428 flow. Second operand has 10 states, 10 states have (on average 30.2) internal successors, (302), 10 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:11,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:45:11,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 59 [2024-10-13 12:45:11,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:45:12,440 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([474] L56-6-->L55-6: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_12 (bvadd (_ bv1 32) v_thread2Thread1of1ForFork2_~i~1_11)) (= (ite (= (_ bv0 32) (ite |v_thread2Thread1of1ForFork2_#t~short7_7| (_ bv1 32) (_ bv0 32))) (_ bv0 8) (_ bv1 8)) v_~sorted2~0_18)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_11, thread2Thread1of1ForFork2_#t~short7=|v_thread2Thread1of1ForFork2_#t~short7_7|} OutVars{thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_1|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_12, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_3|, thread2Thread1of1ForFork2_#t~post8=|v_thread2Thread1of1ForFork2_#t~post8_1|, ~sorted2~0=v_~sorted2~0_18} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, thread2Thread1of1ForFork2_#t~post8, thread2Thread1of1ForFork2_#t~short7, ~sorted2~0][73], [Black: 123#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~size#1|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (exists ((v_subst_2 (_ BitVec 32))) (and (bvslt (_ bv1 32) v_subst_2) (= (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (bvmul (_ bv4 32) v_subst_2)) (bvule v_subst_2 (_ bv1073741823 32)))) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32))), Black: 109#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))), Black: 127#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (or (and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)))), Black: 447#(and (bvsge ~M~0 (_ bv0 32)) (exists ((~N~0 (_ BitVec 32))) (and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (bvslt ~M~0 ~N~0))) (= ~A~0.offset (_ bv0 32)) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 459#(and (bvsge ~M~0 (_ bv0 32)) (exists ((~N~0 (_ BitVec 32))) (and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (bvslt ~M~0 ~N~0))) (exists ((v_subst_5 (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (bvslt v_subst_5 ~N~0) (bvslt (_ bv0 32) v_subst_5))) (= ~A~0.offset (_ bv0 32)) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), 211#true, Black: 203#(and (= ~A~0.offset (_ bv0 32)) (exists ((~N~0 (_ BitVec 32))) (and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (bvslt (_ bv0 32) ~N~0))) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 85#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~size#1|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (exists ((v_subst_1 (_ BitVec 32))) (and (bvule v_subst_1 (_ bv1073741823 32)) (= (bvmul (_ bv4 32) v_subst_1) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvslt (_ bv0 32) v_subst_1))) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32))), Black: 268#(and (= ~A~0.offset (_ bv0 32)) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ BitVec 32))) (and (bvule |v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|) (select |#length| ~A~0.base)) (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|)))) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 255#(and (= ~A~0.offset (_ bv0 32)) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ BitVec 32))) (and (bvule |v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|) (select |#length| ~A~0.base)) (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|))))), Black: 408#(and (or (and (bvule (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|))) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (or (and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)))), Black: 396#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (exists ((v_subst_4 (_ BitVec 32))) (and (bvule v_subst_4 (_ bv1073741823 32)) (bvslt (_ bv4 32) v_subst_4) (= (bvmul (_ bv4 32) v_subst_4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~size#1|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32))), Black: 400#(and (or (and (bvule (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (and (bvule (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv16 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (not (bvule (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (or (and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (and (bvule (bvadd (_ bv16 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv20 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (bvule (bvadd (_ bv20 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (not (bvule (bvadd (_ bv16 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))))), Black: 404#(and (or (and (bvule (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (and (bvule (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv16 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (not (bvule (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (or (and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)))), Black: 412#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (or (and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)))), Black: 354#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))), 9#L87-1true, 462#true, 6#L64-3true, 434#(and (bvsge ~M~0 (_ bv0 32)) (exists ((~N~0 (_ BitVec 32))) (and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (bvslt ~M~0 ~N~0))) (= ~A~0.offset (_ bv0 32))), 40#L55-6true, 140#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| ~A~0.base))), Black: 169#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32))), Black: 178#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (exists ((v_subst_3 (_ BitVec 32))) (and (= (select |#length| ~A~0.base) (bvmul (_ bv4 32) v_subst_3)) (bvslt (_ bv0 32) (bvadd v_subst_3 (_ bv4294967295 32))) (bvule v_subst_3 (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32))), Black: 243#(and |thread1Thread1of1ForFork1_#t~short3| (= ~sorted1~0 (_ bv1 8))), 313#true]) [2024-10-13 12:45:12,440 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-10-13 12:45:12,440 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-13 12:45:12,440 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-13 12:45:12,440 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-13 12:45:12,470 INFO L124 PetriNetUnfolderBase]: 4759/8343 cut-off events. [2024-10-13 12:45:12,470 INFO L125 PetriNetUnfolderBase]: For 11781/12114 co-relation queries the response was YES. [2024-10-13 12:45:12,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23516 conditions, 8343 events. 4759/8343 cut-off events. For 11781/12114 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 59186 event pairs, 2599 based on Foata normal form. 0/7427 useless extension candidates. Maximal degree in co-relation 23467. Up to 3826 conditions per place. [2024-10-13 12:45:12,507 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 90 selfloop transitions, 24 changer transitions 0/132 dead transitions. [2024-10-13 12:45:12,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 132 transitions, 880 flow [2024-10-13 12:45:12,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 12:45:12,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-13 12:45:12,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 266 transitions. [2024-10-13 12:45:12,509 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6440677966101694 [2024-10-13 12:45:12,509 INFO L175 Difference]: Start difference. First operand has 96 places, 83 transitions, 428 flow. Second operand 7 states and 266 transitions. [2024-10-13 12:45:12,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 132 transitions, 880 flow [2024-10-13 12:45:12,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 132 transitions, 840 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-13 12:45:12,520 INFO L231 Difference]: Finished difference. Result has 100 places, 85 transitions, 463 flow [2024-10-13 12:45:12,520 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=463, PETRI_PLACES=100, PETRI_TRANSITIONS=85} [2024-10-13 12:45:12,521 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 42 predicate places. [2024-10-13 12:45:12,522 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 85 transitions, 463 flow [2024-10-13 12:45:12,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 30.2) internal successors, (302), 10 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:12,523 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:45:12,523 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:45:12,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-13 12:45:12,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:12,724 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-13 12:45:12,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:45:12,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1829403539, now seen corresponding path program 1 times [2024-10-13 12:45:12,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:45:12,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [506290697] [2024-10-13 12:45:12,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:45:12,724 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:12,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:45:12,726 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:45:12,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-13 12:45:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:45:12,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 12:45:12,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:45:12,878 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 12:45:12,878 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:45:12,956 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 11 treesize of output 9 [2024-10-13 12:45:13,038 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 12:45:13,038 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:45:13,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [506290697] [2024-10-13 12:45:13,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [506290697] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:45:13,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:45:13,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2024-10-13 12:45:13,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152138933] [2024-10-13 12:45:13,039 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:45:13,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 12:45:13,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:45:13,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 12:45:13,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-10-13 12:45:13,475 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 59 [2024-10-13 12:45:13,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 85 transitions, 463 flow. Second operand has 12 states, 12 states have (on average 25.0) internal successors, (300), 12 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:13,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:45:13,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 59 [2024-10-13 12:45:13,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:45:16,599 INFO L124 PetriNetUnfolderBase]: 19147/28764 cut-off events. [2024-10-13 12:45:16,599 INFO L125 PetriNetUnfolderBase]: For 32040/32510 co-relation queries the response was YES. [2024-10-13 12:45:16,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87812 conditions, 28764 events. 19147/28764 cut-off events. For 32040/32510 co-relation queries the response was YES. Maximal size of possible extension queue 800. Compared 188932 event pairs, 2312 based on Foata normal form. 672/27414 useless extension candidates. Maximal degree in co-relation 87759. Up to 6540 conditions per place. [2024-10-13 12:45:17,028 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 261 selfloop transitions, 36 changer transitions 0/310 dead transitions. [2024-10-13 12:45:17,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 310 transitions, 2021 flow [2024-10-13 12:45:17,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 12:45:17,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-13 12:45:17,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 520 transitions. [2024-10-13 12:45:17,034 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6779661016949152 [2024-10-13 12:45:17,034 INFO L175 Difference]: Start difference. First operand has 100 places, 85 transitions, 463 flow. Second operand 13 states and 520 transitions. [2024-10-13 12:45:17,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 310 transitions, 2021 flow [2024-10-13 12:45:17,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 310 transitions, 2016 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:45:17,106 INFO L231 Difference]: Finished difference. Result has 116 places, 105 transitions, 688 flow [2024-10-13 12:45:17,106 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=688, PETRI_PLACES=116, PETRI_TRANSITIONS=105} [2024-10-13 12:45:17,107 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 58 predicate places. [2024-10-13 12:45:17,108 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 105 transitions, 688 flow [2024-10-13 12:45:17,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 25.0) internal successors, (300), 12 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:17,109 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:45:17,109 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:45:17,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-13 12:45:17,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:17,309 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-13 12:45:17,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:45:17,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1049944069, now seen corresponding path program 1 times [2024-10-13 12:45:17,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:45:17,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [752290031] [2024-10-13 12:45:17,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:45:17,311 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:17,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:45:17,314 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:45:17,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-13 12:45:17,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:45:17,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:45:17,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:45:17,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 12:45:17,396 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:45:17,396 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:45:17,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [752290031] [2024-10-13 12:45:17,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [752290031] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:45:17,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:45:17,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:45:17,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602459015] [2024-10-13 12:45:17,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:45:17,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:45:17,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:45:17,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:45:17,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:45:17,402 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2024-10-13 12:45:17,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 105 transitions, 688 flow. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:17,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:45:17,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2024-10-13 12:45:17,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:45:20,064 INFO L124 PetriNetUnfolderBase]: 16039/25814 cut-off events. [2024-10-13 12:45:20,064 INFO L125 PetriNetUnfolderBase]: For 53990/54992 co-relation queries the response was YES. [2024-10-13 12:45:20,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87500 conditions, 25814 events. 16039/25814 cut-off events. For 53990/54992 co-relation queries the response was YES. Maximal size of possible extension queue 761. Compared 185995 event pairs, 3935 based on Foata normal form. 150/24200 useless extension candidates. Maximal degree in co-relation 87441. Up to 8531 conditions per place. [2024-10-13 12:45:20,262 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 175 selfloop transitions, 17 changer transitions 0/213 dead transitions. [2024-10-13 12:45:20,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 213 transitions, 1727 flow [2024-10-13 12:45:20,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:45:20,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:45:20,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 212 transitions. [2024-10-13 12:45:20,263 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7186440677966102 [2024-10-13 12:45:20,263 INFO L175 Difference]: Start difference. First operand has 116 places, 105 transitions, 688 flow. Second operand 5 states and 212 transitions. [2024-10-13 12:45:20,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 213 transitions, 1727 flow [2024-10-13 12:45:20,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 213 transitions, 1669 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-10-13 12:45:20,338 INFO L231 Difference]: Finished difference. Result has 118 places, 108 transitions, 723 flow [2024-10-13 12:45:20,339 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=657, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=723, PETRI_PLACES=118, PETRI_TRANSITIONS=108} [2024-10-13 12:45:20,339 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 60 predicate places. [2024-10-13 12:45:20,339 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 108 transitions, 723 flow [2024-10-13 12:45:20,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:20,339 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:45:20,340 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:45:20,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-10-13 12:45:20,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:20,541 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-13 12:45:20,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:45:20,541 INFO L85 PathProgramCache]: Analyzing trace with hash 507090933, now seen corresponding path program 2 times [2024-10-13 12:45:20,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:45:20,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1146711480] [2024-10-13 12:45:20,542 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 12:45:20,542 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:20,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:45:20,543 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:45:20,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-13 12:45:20,602 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 12:45:20,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:45:20,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-13 12:45:20,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:45:20,617 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 8 treesize of output 7 [2024-10-13 12:45:20,873 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 12:45:20,873 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:45:20,873 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:45:20,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1146711480] [2024-10-13 12:45:20,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1146711480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:45:20,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:45:20,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:45:20,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635543048] [2024-10-13 12:45:20,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:45:20,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:45:20,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:45:20,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:45:20,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:45:21,151 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2024-10-13 12:45:21,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 108 transitions, 723 flow. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:21,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:45:21,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2024-10-13 12:45:21,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:45:23,757 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L64-2-->L64-3: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread3Thread1of1ForFork0_~i~2_7))) (let ((.cse0 (bvadd v_~A~0.offset_9 .cse3)) (.cse1 (bvadd v_~A~0.offset_9 (_ bv4 32) .cse3))) (and (bvule .cse0 .cse1) (= (_ bv0 1) (bvadd (_ bv1 1) (select |v_#valid_9| v_~A~0.base_13))) (= |v_thread3Thread1of1ForFork0_#t~mem9_1| (let ((.cse2 (select |v_#memory_int#1_5| v_~A~0.base_13))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_9 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~A~0.offset_9 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~A~0.offset_9 (_ bv1 32) .cse3))) (select .cse2 .cse0)))) (bvule (_ bv0 32) .cse0) (bvule .cse1 (select |v_#length_9| v_~A~0.base_13))))) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_9, #valid=|v_#valid_9|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_7, #length=|v_#length_9|, #memory_int#1=|v_#memory_int#1_5|} OutVars{~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_9, #valid=|v_#valid_9|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_7, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_1|, #length=|v_#length_9|, #memory_int#1=|v_#memory_int#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem9][76], [Black: 123#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~size#1|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (exists ((v_subst_2 (_ BitVec 32))) (and (bvslt (_ bv1 32) v_subst_2) (= (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (bvmul (_ bv4 32) v_subst_2)) (bvule v_subst_2 (_ bv1073741823 32)))) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32))), Black: 109#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))), Black: 127#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (or (and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)))), 18#L86-4true, 229#|thread1Thread1of1ForFork1_#t~short3|, Black: 570#(and (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32))), 459#(and (bvsge ~M~0 (_ bv0 32)) (exists ((~N~0 (_ BitVec 32))) (and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (bvslt ~M~0 ~N~0))) (exists ((v_subst_5 (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (bvslt v_subst_5 ~N~0) (bvslt (_ bv0 32) v_subst_5))) (= ~A~0.offset (_ bv0 32)) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 447#(and (bvsge ~M~0 (_ bv0 32)) (exists ((~N~0 (_ BitVec 32))) (and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (bvslt ~M~0 ~N~0))) (= ~A~0.offset (_ bv0 32)) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 587#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (= ~A~0.offset (_ bv0 32)) (bvule (_ bv8 32) (select |#length| ~A~0.base))), Black: 651#(and (= ~A~0.offset (_ bv0 32)) (bvule (bvmul thread1Thread1of1ForFork1_~i~0 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork1_~i~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork1_~i~0 (_ bv4 32))) (select |#length| ~A~0.base))), Black: 643#(and (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork1_~i~0 (_ bv4 32))) (bvadd (_ bv8 32) (bvmul thread1Thread1of1ForFork1_~i~0 (_ bv4 32)))) (= ~A~0.offset (_ bv0 32))), Black: 563#(= ~A~0.offset (_ bv0 32)), Black: 268#(and (= ~A~0.offset (_ bv0 32)) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ BitVec 32))) (and (bvule |v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|) (select |#length| ~A~0.base)) (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|)))) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 85#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~size#1|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (exists ((v_subst_1 (_ BitVec 32))) (and (bvule v_subst_1 (_ bv1073741823 32)) (= (bvmul (_ bv4 32) v_subst_1) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvslt (_ bv0 32) v_subst_1))) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32))), Black: 255#(and (= ~A~0.offset (_ bv0 32)) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ BitVec 32))) (and (bvule |v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|) (select |#length| ~A~0.base)) (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|))))), 647#(and (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork1_~i~0 (_ bv4 32))) (bvadd (_ bv8 32) (bvmul thread1Thread1of1ForFork1_~i~0 (_ bv4 32)))) (= ~A~0.offset (_ bv0 32)) (bvule (bvmul thread1Thread1of1ForFork1_~i~0 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork1_~i~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork1_~i~0 (_ bv4 32))) (select |#length| ~A~0.base))), Black: 408#(and (or (and (bvule (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|))) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (or (and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)))), Black: 396#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (exists ((v_subst_4 (_ BitVec 32))) (and (bvule v_subst_4 (_ bv1073741823 32)) (bvslt (_ bv4 32) v_subst_4) (= (bvmul (_ bv4 32) v_subst_4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~size#1|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32))), Black: 400#(and (or (and (bvule (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (and (bvule (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv16 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (not (bvule (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (or (and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (and (bvule (bvadd (_ bv16 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv20 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (bvule (bvadd (_ bv20 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (not (bvule (bvadd (_ bv16 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))))), Black: 404#(and (or (and (bvule (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (and (bvule (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv16 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (not (bvule (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (or (and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)))), Black: 412#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (or (and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)))), Black: 354#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))), Black: 545#(and (bvslt ~M~0 ~N~0) (bvsge ~M~0 (_ bv0 32)) (bvsge thread3Thread1of1ForFork0_~i~2 (_ bv0 32)) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt (_ bv1 32) ~N~0))), 26#L56-3true, Black: 478#(and (bvslt ~M~0 ~N~0) (bvsge ~M~0 (_ bv0 32)) (not (bvslt (_ bv1 32) ~N~0))), 756#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (bvslt ~M~0 ~N~0) (bvsge ~M~0 (_ bv0 32)) (exists ((v_subst_6 (_ BitVec 32))) (and (= (select |#length| ~A~0.base) (bvmul (_ bv4 32) v_subst_6)) (bvslt thread3Thread1of1ForFork0_~i~2 (bvadd v_subst_6 (_ bv4294967295 32))) (bvule v_subst_6 (_ bv1073741823 32)))) (bvsge thread3Thread1of1ForFork0_~i~2 (_ bv0 32)) (= ~A~0.offset (_ bv0 32))), 462#true, 6#L64-3true, 702#(and |thread2Thread1of1ForFork2_#t~short7| (= ~sorted2~0 (_ bv1 8))), 140#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| ~A~0.base))), Black: 169#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32))), Black: 178#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (exists ((v_subst_3 (_ BitVec 32))) (and (= (select |#length| ~A~0.base) (bvmul (_ bv4 32) v_subst_3)) (bvslt (_ bv0 32) (bvadd v_subst_3 (_ bv4294967295 32))) (bvule v_subst_3 (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32))), Black: 211#true, Black: 243#(and |thread1Thread1of1ForFork1_#t~short3| (= ~sorted1~0 (_ bv1 8))), 313#true, Black: 658#true, 55#L48-3true]) [2024-10-13 12:45:23,758 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-10-13 12:45:23,758 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-13 12:45:23,758 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-13 12:45:23,758 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-13 12:45:23,781 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L64-2-->L64-3: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread3Thread1of1ForFork0_~i~2_7))) (let ((.cse0 (bvadd v_~A~0.offset_9 .cse3)) (.cse1 (bvadd v_~A~0.offset_9 (_ bv4 32) .cse3))) (and (bvule .cse0 .cse1) (= (_ bv0 1) (bvadd (_ bv1 1) (select |v_#valid_9| v_~A~0.base_13))) (= |v_thread3Thread1of1ForFork0_#t~mem9_1| (let ((.cse2 (select |v_#memory_int#1_5| v_~A~0.base_13))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_9 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~A~0.offset_9 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~A~0.offset_9 (_ bv1 32) .cse3))) (select .cse2 .cse0)))) (bvule (_ bv0 32) .cse0) (bvule .cse1 (select |v_#length_9| v_~A~0.base_13))))) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_9, #valid=|v_#valid_9|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_7, #length=|v_#length_9|, #memory_int#1=|v_#memory_int#1_5|} OutVars{~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_9, #valid=|v_#valid_9|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_7, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_1|, #length=|v_#length_9|, #memory_int#1=|v_#memory_int#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem9][76], [Black: 123#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~size#1|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (exists ((v_subst_2 (_ BitVec 32))) (and (bvslt (_ bv1 32) v_subst_2) (= (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (bvmul (_ bv4 32) v_subst_2)) (bvule v_subst_2 (_ bv1073741823 32)))) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32))), Black: 109#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))), Black: 127#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (or (and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)))), 229#|thread1Thread1of1ForFork1_#t~short3|, Black: 570#(and (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32))), 459#(and (bvsge ~M~0 (_ bv0 32)) (exists ((~N~0 (_ BitVec 32))) (and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (bvslt ~M~0 ~N~0))) (exists ((v_subst_5 (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (bvslt v_subst_5 ~N~0) (bvslt (_ bv0 32) v_subst_5))) (= ~A~0.offset (_ bv0 32)) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 447#(and (bvsge ~M~0 (_ bv0 32)) (exists ((~N~0 (_ BitVec 32))) (and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (bvslt ~M~0 ~N~0))) (= ~A~0.offset (_ bv0 32)) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 587#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (= ~A~0.offset (_ bv0 32)) (bvule (_ bv8 32) (select |#length| ~A~0.base))), Black: 651#(and (= ~A~0.offset (_ bv0 32)) (bvule (bvmul thread1Thread1of1ForFork1_~i~0 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork1_~i~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork1_~i~0 (_ bv4 32))) (select |#length| ~A~0.base))), Black: 643#(and (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork1_~i~0 (_ bv4 32))) (bvadd (_ bv8 32) (bvmul thread1Thread1of1ForFork1_~i~0 (_ bv4 32)))) (= ~A~0.offset (_ bv0 32))), Black: 563#(= ~A~0.offset (_ bv0 32)), Black: 85#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~size#1|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (exists ((v_subst_1 (_ BitVec 32))) (and (bvule v_subst_1 (_ bv1073741823 32)) (= (bvmul (_ bv4 32) v_subst_1) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvslt (_ bv0 32) v_subst_1))) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32))), Black: 268#(and (= ~A~0.offset (_ bv0 32)) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ BitVec 32))) (and (bvule |v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|) (select |#length| ~A~0.base)) (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|)))) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 255#(and (= ~A~0.offset (_ bv0 32)) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ BitVec 32))) (and (bvule |v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|) (select |#length| ~A~0.base)) (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|))))), 647#(and (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork1_~i~0 (_ bv4 32))) (bvadd (_ bv8 32) (bvmul thread1Thread1of1ForFork1_~i~0 (_ bv4 32)))) (= ~A~0.offset (_ bv0 32)) (bvule (bvmul thread1Thread1of1ForFork1_~i~0 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork1_~i~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork1_~i~0 (_ bv4 32))) (select |#length| ~A~0.base))), Black: 408#(and (or (and (bvule (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|))) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (or (and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)))), Black: 396#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (exists ((v_subst_4 (_ BitVec 32))) (and (bvule v_subst_4 (_ bv1073741823 32)) (bvslt (_ bv4 32) v_subst_4) (= (bvmul (_ bv4 32) v_subst_4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~size#1|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32))), Black: 400#(and (or (and (bvule (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (and (bvule (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv16 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (not (bvule (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (or (and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (and (bvule (bvadd (_ bv16 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv20 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (bvule (bvadd (_ bv20 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (not (bvule (bvadd (_ bv16 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))))), Black: 404#(and (or (and (bvule (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (and (bvule (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv16 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (not (bvule (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (or (and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)))), Black: 412#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (or (and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)))), Black: 354#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))), Black: 545#(and (bvslt ~M~0 ~N~0) (bvsge ~M~0 (_ bv0 32)) (bvsge thread3Thread1of1ForFork0_~i~2 (_ bv0 32)) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt (_ bv1 32) ~N~0))), 26#L56-3true, Black: 478#(and (bvslt ~M~0 ~N~0) (bvsge ~M~0 (_ bv0 32)) (not (bvslt (_ bv1 32) ~N~0))), 756#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (bvslt ~M~0 ~N~0) (bvsge ~M~0 (_ bv0 32)) (exists ((v_subst_6 (_ BitVec 32))) (and (= (select |#length| ~A~0.base) (bvmul (_ bv4 32) v_subst_6)) (bvslt thread3Thread1of1ForFork0_~i~2 (bvadd v_subst_6 (_ bv4294967295 32))) (bvule v_subst_6 (_ bv1073741823 32)))) (bvsge thread3Thread1of1ForFork0_~i~2 (_ bv0 32)) (= ~A~0.offset (_ bv0 32))), 462#true, 6#L64-3true, 43#L87true, 702#(and |thread2Thread1of1ForFork2_#t~short7| (= ~sorted2~0 (_ bv1 8))), 140#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| ~A~0.base))), Black: 169#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32))), Black: 178#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (exists ((v_subst_3 (_ BitVec 32))) (and (= (select |#length| ~A~0.base) (bvmul (_ bv4 32) v_subst_3)) (bvslt (_ bv0 32) (bvadd v_subst_3 (_ bv4294967295 32))) (bvule v_subst_3 (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32))), Black: 211#true, Black: 243#(and |thread1Thread1of1ForFork1_#t~short3| (= ~sorted1~0 (_ bv1 8))), 313#true, Black: 658#true, 55#L48-3true]) [2024-10-13 12:45:23,781 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-10-13 12:45:23,781 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-13 12:45:23,781 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-13 12:45:23,781 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-13 12:45:23,850 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L64-2-->L64-3: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread3Thread1of1ForFork0_~i~2_7))) (let ((.cse0 (bvadd v_~A~0.offset_9 .cse3)) (.cse1 (bvadd v_~A~0.offset_9 (_ bv4 32) .cse3))) (and (bvule .cse0 .cse1) (= (_ bv0 1) (bvadd (_ bv1 1) (select |v_#valid_9| v_~A~0.base_13))) (= |v_thread3Thread1of1ForFork0_#t~mem9_1| (let ((.cse2 (select |v_#memory_int#1_5| v_~A~0.base_13))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_9 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~A~0.offset_9 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~A~0.offset_9 (_ bv1 32) .cse3))) (select .cse2 .cse0)))) (bvule (_ bv0 32) .cse0) (bvule .cse1 (select |v_#length_9| v_~A~0.base_13))))) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_9, #valid=|v_#valid_9|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_7, #length=|v_#length_9|, #memory_int#1=|v_#memory_int#1_5|} OutVars{~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_9, #valid=|v_#valid_9|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_7, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_1|, #length=|v_#length_9|, #memory_int#1=|v_#memory_int#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem9][76], [Black: 123#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~size#1|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (exists ((v_subst_2 (_ BitVec 32))) (and (bvslt (_ bv1 32) v_subst_2) (= (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (bvmul (_ bv4 32) v_subst_2)) (bvule v_subst_2 (_ bv1073741823 32)))) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32))), Black: 109#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))), Black: 127#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (or (and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)))), 18#L86-4true, 229#|thread1Thread1of1ForFork1_#t~short3|, Black: 570#(and (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32))), 459#(and (bvsge ~M~0 (_ bv0 32)) (exists ((~N~0 (_ BitVec 32))) (and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (bvslt ~M~0 ~N~0))) (exists ((v_subst_5 (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (bvslt v_subst_5 ~N~0) (bvslt (_ bv0 32) v_subst_5))) (= ~A~0.offset (_ bv0 32)) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 447#(and (bvsge ~M~0 (_ bv0 32)) (exists ((~N~0 (_ BitVec 32))) (and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (bvslt ~M~0 ~N~0))) (= ~A~0.offset (_ bv0 32)) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 587#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (= ~A~0.offset (_ bv0 32)) (bvule (_ bv8 32) (select |#length| ~A~0.base))), Black: 647#(and (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork1_~i~0 (_ bv4 32))) (bvadd (_ bv8 32) (bvmul thread1Thread1of1ForFork1_~i~0 (_ bv4 32)))) (= ~A~0.offset (_ bv0 32)) (bvule (bvmul thread1Thread1of1ForFork1_~i~0 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork1_~i~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork1_~i~0 (_ bv4 32))) (select |#length| ~A~0.base))), Black: 643#(and (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork1_~i~0 (_ bv4 32))) (bvadd (_ bv8 32) (bvmul thread1Thread1of1ForFork1_~i~0 (_ bv4 32)))) (= ~A~0.offset (_ bv0 32))), Black: 563#(= ~A~0.offset (_ bv0 32)), Black: 268#(and (= ~A~0.offset (_ bv0 32)) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ BitVec 32))) (and (bvule |v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|) (select |#length| ~A~0.base)) (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|)))) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 85#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~size#1|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (exists ((v_subst_1 (_ BitVec 32))) (and (bvule v_subst_1 (_ bv1073741823 32)) (= (bvmul (_ bv4 32) v_subst_1) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvslt (_ bv0 32) v_subst_1))) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32))), Black: 255#(and (= ~A~0.offset (_ bv0 32)) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ BitVec 32))) (and (bvule |v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|) (select |#length| ~A~0.base)) (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|))))), Black: 408#(and (or (and (bvule (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|))) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (or (and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)))), Black: 396#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (exists ((v_subst_4 (_ BitVec 32))) (and (bvule v_subst_4 (_ bv1073741823 32)) (bvslt (_ bv4 32) v_subst_4) (= (bvmul (_ bv4 32) v_subst_4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~size#1|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32))), Black: 400#(and (or (and (bvule (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (and (bvule (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv16 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (not (bvule (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (or (and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (and (bvule (bvadd (_ bv16 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv20 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (bvule (bvadd (_ bv20 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (not (bvule (bvadd (_ bv16 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))))), Black: 404#(and (or (and (bvule (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (and (bvule (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv16 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (not (bvule (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (or (and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)))), Black: 412#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (or (and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)))), Black: 354#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))), Black: 545#(and (bvslt ~M~0 ~N~0) (bvsge ~M~0 (_ bv0 32)) (bvsge thread3Thread1of1ForFork0_~i~2 (_ bv0 32)) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt (_ bv1 32) ~N~0))), 26#L56-3true, Black: 478#(and (bvslt ~M~0 ~N~0) (bvsge ~M~0 (_ bv0 32)) (not (bvslt (_ bv1 32) ~N~0))), 756#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (bvslt ~M~0 ~N~0) (bvsge ~M~0 (_ bv0 32)) (exists ((v_subst_6 (_ BitVec 32))) (and (= (select |#length| ~A~0.base) (bvmul (_ bv4 32) v_subst_6)) (bvslt thread3Thread1of1ForFork0_~i~2 (bvadd v_subst_6 (_ bv4294967295 32))) (bvule v_subst_6 (_ bv1073741823 32)))) (bvsge thread3Thread1of1ForFork0_~i~2 (_ bv0 32)) (= ~A~0.offset (_ bv0 32))), 462#true, 651#(and (= ~A~0.offset (_ bv0 32)) (bvule (bvmul thread1Thread1of1ForFork1_~i~0 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork1_~i~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork1_~i~0 (_ bv4 32))) (select |#length| ~A~0.base))), 6#L64-3true, 702#(and |thread2Thread1of1ForFork2_#t~short7| (= ~sorted2~0 (_ bv1 8))), Black: 169#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32))), 140#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| ~A~0.base))), Black: 211#true, Black: 178#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (exists ((v_subst_3 (_ BitVec 32))) (and (= (select |#length| ~A~0.base) (bvmul (_ bv4 32) v_subst_3)) (bvslt (_ bv0 32) (bvadd v_subst_3 (_ bv4294967295 32))) (bvule v_subst_3 (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32))), Black: 243#(and |thread1Thread1of1ForFork1_#t~short3| (= ~sorted1~0 (_ bv1 8))), 313#true, 55#L48-3true, Black: 658#true]) [2024-10-13 12:45:23,850 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-10-13 12:45:23,850 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-13 12:45:23,850 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-13 12:45:23,851 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-13 12:45:23,857 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L64-2-->L64-3: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread3Thread1of1ForFork0_~i~2_7))) (let ((.cse0 (bvadd v_~A~0.offset_9 .cse3)) (.cse1 (bvadd v_~A~0.offset_9 (_ bv4 32) .cse3))) (and (bvule .cse0 .cse1) (= (_ bv0 1) (bvadd (_ bv1 1) (select |v_#valid_9| v_~A~0.base_13))) (= |v_thread3Thread1of1ForFork0_#t~mem9_1| (let ((.cse2 (select |v_#memory_int#1_5| v_~A~0.base_13))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_9 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~A~0.offset_9 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~A~0.offset_9 (_ bv1 32) .cse3))) (select .cse2 .cse0)))) (bvule (_ bv0 32) .cse0) (bvule .cse1 (select |v_#length_9| v_~A~0.base_13))))) InVars {~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_9, #valid=|v_#valid_9|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_7, #length=|v_#length_9|, #memory_int#1=|v_#memory_int#1_5|} OutVars{~A~0.base=v_~A~0.base_13, ~A~0.offset=v_~A~0.offset_9, #valid=|v_#valid_9|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_7, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_1|, #length=|v_#length_9|, #memory_int#1=|v_#memory_int#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem9][76], [Black: 123#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~size#1|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (exists ((v_subst_2 (_ BitVec 32))) (and (bvslt (_ bv1 32) v_subst_2) (= (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (bvmul (_ bv4 32) v_subst_2)) (bvule v_subst_2 (_ bv1073741823 32)))) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32))), Black: 109#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))), Black: 127#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (or (and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)))), 229#|thread1Thread1of1ForFork1_#t~short3|, 459#(and (bvsge ~M~0 (_ bv0 32)) (exists ((~N~0 (_ BitVec 32))) (and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (bvslt ~M~0 ~N~0))) (exists ((v_subst_5 (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (bvslt v_subst_5 ~N~0) (bvslt (_ bv0 32) v_subst_5))) (= ~A~0.offset (_ bv0 32)) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 447#(and (bvsge ~M~0 (_ bv0 32)) (exists ((~N~0 (_ BitVec 32))) (and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (bvslt ~M~0 ~N~0))) (= ~A~0.offset (_ bv0 32)) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 570#(and (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32))), Black: 587#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (= ~A~0.offset (_ bv0 32)) (bvule (_ bv8 32) (select |#length| ~A~0.base))), Black: 647#(and (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork1_~i~0 (_ bv4 32))) (bvadd (_ bv8 32) (bvmul thread1Thread1of1ForFork1_~i~0 (_ bv4 32)))) (= ~A~0.offset (_ bv0 32)) (bvule (bvmul thread1Thread1of1ForFork1_~i~0 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork1_~i~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork1_~i~0 (_ bv4 32))) (select |#length| ~A~0.base))), Black: 643#(and (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork1_~i~0 (_ bv4 32))) (bvadd (_ bv8 32) (bvmul thread1Thread1of1ForFork1_~i~0 (_ bv4 32)))) (= ~A~0.offset (_ bv0 32))), Black: 563#(= ~A~0.offset (_ bv0 32)), Black: 85#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~size#1|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (exists ((v_subst_1 (_ BitVec 32))) (and (bvule v_subst_1 (_ bv1073741823 32)) (= (bvmul (_ bv4 32) v_subst_1) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvslt (_ bv0 32) v_subst_1))) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32))), Black: 268#(and (= ~A~0.offset (_ bv0 32)) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ BitVec 32))) (and (bvule |v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|) (select |#length| ~A~0.base)) (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|)))) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 255#(and (= ~A~0.offset (_ bv0 32)) (exists ((|v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ BitVec 32))) (and (bvule |v_ULTIMATE.start_create_fresh_int_array_~size#1_55| (_ bv1073741823 32)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|) (select |#length| ~A~0.base)) (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_int_array_~size#1_55|))))), Black: 408#(and (or (and (bvule (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|))) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (or (and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)))), Black: 396#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) (exists ((v_subst_4 (_ BitVec 32))) (and (bvule v_subst_4 (_ bv1073741823 32)) (bvslt (_ bv4 32) v_subst_4) (= (bvmul (_ bv4 32) v_subst_4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (= (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~size#1|) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32))), Black: 400#(and (or (and (bvule (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (and (bvule (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv16 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (not (bvule (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (or (and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (and (bvule (bvadd (_ bv16 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv20 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (bvule (bvadd (_ bv20 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (not (bvule (bvadd (_ bv16 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))))), Black: 404#(and (or (and (bvule (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (and (bvule (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv16 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (not (bvule (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (or (and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)))), Black: 412#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (or (and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|) |ULTIMATE.start_create_fresh_int_array_~size#1|)))), Black: 545#(and (bvslt ~M~0 ~N~0) (bvsge ~M~0 (_ bv0 32)) (bvsge thread3Thread1of1ForFork0_~i~2 (_ bv0 32)) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt (_ bv1 32) ~N~0))), Black: 354#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (bvule (bvadd |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_int_array_~i~3#1|)))), 26#L56-3true, Black: 478#(and (bvslt ~M~0 ~N~0) (bvsge ~M~0 (_ bv0 32)) (not (bvslt (_ bv1 32) ~N~0))), 756#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (bvslt ~M~0 ~N~0) (bvsge ~M~0 (_ bv0 32)) (exists ((v_subst_6 (_ BitVec 32))) (and (= (select |#length| ~A~0.base) (bvmul (_ bv4 32) v_subst_6)) (bvslt thread3Thread1of1ForFork0_~i~2 (bvadd v_subst_6 (_ bv4294967295 32))) (bvule v_subst_6 (_ bv1073741823 32)))) (bvsge thread3Thread1of1ForFork0_~i~2 (_ bv0 32)) (= ~A~0.offset (_ bv0 32))), 462#true, 651#(and (= ~A~0.offset (_ bv0 32)) (bvule (bvmul thread1Thread1of1ForFork1_~i~0 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork1_~i~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork1_~i~0 (_ bv4 32))) (select |#length| ~A~0.base))), 6#L64-3true, 43#L87true, 702#(and |thread2Thread1of1ForFork2_#t~short7| (= ~sorted2~0 (_ bv1 8))), 140#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| ~A~0.base))), Black: 169#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32))), Black: 178#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (exists ((v_subst_3 (_ BitVec 32))) (and (= (select |#length| ~A~0.base) (bvmul (_ bv4 32) v_subst_3)) (bvslt (_ bv0 32) (bvadd v_subst_3 (_ bv4294967295 32))) (bvule v_subst_3 (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv0 32))), Black: 211#true, Black: 243#(and |thread1Thread1of1ForFork1_#t~short3| (= ~sorted1~0 (_ bv1 8))), 313#true, 55#L48-3true, Black: 658#true]) [2024-10-13 12:45:23,858 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-10-13 12:45:23,858 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-13 12:45:23,858 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-13 12:45:23,858 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-10-13 12:45:23,974 INFO L124 PetriNetUnfolderBase]: 12599/20909 cut-off events. [2024-10-13 12:45:23,974 INFO L125 PetriNetUnfolderBase]: For 48997/50482 co-relation queries the response was YES. [2024-10-13 12:45:24,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73355 conditions, 20909 events. 12599/20909 cut-off events. For 48997/50482 co-relation queries the response was YES. Maximal size of possible extension queue 684. Compared 154424 event pairs, 4370 based on Foata normal form. 994/20422 useless extension candidates. Maximal degree in co-relation 73296. Up to 8199 conditions per place. [2024-10-13 12:45:24,105 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 139 selfloop transitions, 17 changer transitions 0/178 dead transitions. [2024-10-13 12:45:24,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 178 transitions, 1513 flow [2024-10-13 12:45:24,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:45:24,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 12:45:24,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 213 transitions. [2024-10-13 12:45:24,106 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6016949152542372 [2024-10-13 12:45:24,106 INFO L175 Difference]: Start difference. First operand has 118 places, 108 transitions, 723 flow. Second operand 6 states and 213 transitions. [2024-10-13 12:45:24,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 178 transitions, 1513 flow [2024-10-13 12:45:24,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 178 transitions, 1513 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 12:45:24,163 INFO L231 Difference]: Finished difference. Result has 121 places, 106 transitions, 753 flow [2024-10-13 12:45:24,163 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=719, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=753, PETRI_PLACES=121, PETRI_TRANSITIONS=106} [2024-10-13 12:45:24,164 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 63 predicate places. [2024-10-13 12:45:24,164 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 106 transitions, 753 flow [2024-10-13 12:45:24,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:24,164 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:45:24,164 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:45:24,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-10-13 12:45:24,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:24,365 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-13 12:45:24,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:45:24,365 INFO L85 PathProgramCache]: Analyzing trace with hash -876934459, now seen corresponding path program 1 times [2024-10-13 12:45:24,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:45:24,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [803310733] [2024-10-13 12:45:24,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:45:24,366 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:24,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:45:24,367 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:45:24,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-13 12:45:24,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:45:24,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 12:45:24,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:45:24,432 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 8 treesize of output 7 [2024-10-13 12:45:24,588 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:45:24,588 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:45:25,131 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:45:25,132 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:45:25,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [803310733] [2024-10-13 12:45:25,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [803310733] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:45:25,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:45:25,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2024-10-13 12:45:25,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076586801] [2024-10-13 12:45:25,132 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:45:25,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 12:45:25,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:45:25,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 12:45:25,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-13 12:45:26,807 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 59 [2024-10-13 12:45:26,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 106 transitions, 753 flow. Second operand has 12 states, 12 states have (on average 27.166666666666668) internal successors, (326), 12 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:26,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:45:26,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 59 [2024-10-13 12:45:26,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:45:29,692 INFO L124 PetriNetUnfolderBase]: 11886/18776 cut-off events. [2024-10-13 12:45:29,693 INFO L125 PetriNetUnfolderBase]: For 50546/51860 co-relation queries the response was YES. [2024-10-13 12:45:29,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70165 conditions, 18776 events. 11886/18776 cut-off events. For 50546/51860 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 124220 event pairs, 6474 based on Foata normal form. 109/17690 useless extension candidates. Maximal degree in co-relation 70103. Up to 12470 conditions per place. [2024-10-13 12:45:29,806 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 120 selfloop transitions, 32 changer transitions 0/168 dead transitions. [2024-10-13 12:45:29,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 168 transitions, 1393 flow [2024-10-13 12:45:29,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 12:45:29,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-13 12:45:29,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 287 transitions. [2024-10-13 12:45:29,809 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6080508474576272 [2024-10-13 12:45:29,809 INFO L175 Difference]: Start difference. First operand has 121 places, 106 transitions, 753 flow. Second operand 8 states and 287 transitions. [2024-10-13 12:45:29,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 168 transitions, 1393 flow [2024-10-13 12:45:29,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 168 transitions, 1347 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-13 12:45:29,885 INFO L231 Difference]: Finished difference. Result has 125 places, 109 transitions, 819 flow [2024-10-13 12:45:29,886 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=719, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=819, PETRI_PLACES=125, PETRI_TRANSITIONS=109} [2024-10-13 12:45:29,886 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 67 predicate places. [2024-10-13 12:45:29,886 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 109 transitions, 819 flow [2024-10-13 12:45:29,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 27.166666666666668) internal successors, (326), 12 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:29,886 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:45:29,887 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:45:29,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-10-13 12:45:30,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:30,087 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-13 12:45:30,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:45:30,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1285061974, now seen corresponding path program 1 times [2024-10-13 12:45:30,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:45:30,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [233293127] [2024-10-13 12:45:30,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:45:30,088 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:30,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:45:30,091 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:45:30,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-13 12:45:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:45:30,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 12:45:30,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:45:30,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 12:45:30,234 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:45:30,311 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 11 treesize of output 9 [2024-10-13 12:45:30,401 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 12:45:30,401 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:45:30,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [233293127] [2024-10-13 12:45:30,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [233293127] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:45:30,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:45:30,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2024-10-13 12:45:30,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947224587] [2024-10-13 12:45:30,401 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:45:30,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 12:45:30,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:45:30,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 12:45:30,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-10-13 12:45:31,036 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 59 [2024-10-13 12:45:31,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 109 transitions, 819 flow. Second operand has 12 states, 12 states have (on average 25.333333333333332) internal successors, (304), 12 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:31,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:45:31,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 59 [2024-10-13 12:45:31,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:45:37,954 INFO L124 PetriNetUnfolderBase]: 36754/54246 cut-off events. [2024-10-13 12:45:37,954 INFO L125 PetriNetUnfolderBase]: For 145746/147098 co-relation queries the response was YES. [2024-10-13 12:45:38,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198847 conditions, 54246 events. 36754/54246 cut-off events. For 145746/147098 co-relation queries the response was YES. Maximal size of possible extension queue 1101. Compared 363857 event pairs, 4598 based on Foata normal form. 1221/53902 useless extension candidates. Maximal degree in co-relation 198782. Up to 11991 conditions per place. [2024-10-13 12:45:38,526 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 467 selfloop transitions, 51 changer transitions 0/530 dead transitions. [2024-10-13 12:45:38,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 530 transitions, 4904 flow [2024-10-13 12:45:38,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 12:45:38,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-13 12:45:38,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 511 transitions. [2024-10-13 12:45:38,530 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.666232073011734 [2024-10-13 12:45:38,530 INFO L175 Difference]: Start difference. First operand has 125 places, 109 transitions, 819 flow. Second operand 13 states and 511 transitions. [2024-10-13 12:45:38,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 530 transitions, 4904 flow [2024-10-13 12:45:38,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 530 transitions, 4791 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-13 12:45:38,879 INFO L231 Difference]: Finished difference. Result has 138 places, 142 transitions, 1208 flow [2024-10-13 12:45:38,879 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1208, PETRI_PLACES=138, PETRI_TRANSITIONS=142} [2024-10-13 12:45:38,880 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 80 predicate places. [2024-10-13 12:45:38,880 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 142 transitions, 1208 flow [2024-10-13 12:45:38,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 25.333333333333332) internal successors, (304), 12 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:38,880 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:45:38,880 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:45:38,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-10-13 12:45:39,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:39,081 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-13 12:45:39,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:45:39,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1182215116, now seen corresponding path program 1 times [2024-10-13 12:45:39,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:45:39,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1003392373] [2024-10-13 12:45:39,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:45:39,082 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:39,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:45:39,084 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:45:39,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-13 12:45:39,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:45:39,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 12:45:39,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:45:39,159 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 8 treesize of output 7 [2024-10-13 12:45:39,388 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:45:39,388 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:45:39,954 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:45:39,954 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:45:39,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1003392373] [2024-10-13 12:45:39,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1003392373] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:45:39,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:45:39,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2024-10-13 12:45:39,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489473981] [2024-10-13 12:45:39,955 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:45:39,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 12:45:39,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:45:39,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 12:45:39,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-13 12:45:41,282 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 59 [2024-10-13 12:45:41,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 142 transitions, 1208 flow. Second operand has 12 states, 12 states have (on average 27.5) internal successors, (330), 12 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:41,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:45:41,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 59 [2024-10-13 12:45:41,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:45:47,201 INFO L124 PetriNetUnfolderBase]: 28782/44374 cut-off events. [2024-10-13 12:45:47,201 INFO L125 PetriNetUnfolderBase]: For 172923/176079 co-relation queries the response was YES. [2024-10-13 12:45:47,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180221 conditions, 44374 events. 28782/44374 cut-off events. For 172923/176079 co-relation queries the response was YES. Maximal size of possible extension queue 1041. Compared 311888 event pairs, 14812 based on Foata normal form. 340/42477 useless extension candidates. Maximal degree in co-relation 180151. Up to 31608 conditions per place. [2024-10-13 12:45:47,712 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 134 selfloop transitions, 35 changer transitions 8/201 dead transitions. [2024-10-13 12:45:47,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 201 transitions, 1942 flow [2024-10-13 12:45:47,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 12:45:47,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-13 12:45:47,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 281 transitions. [2024-10-13 12:45:47,715 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5953389830508474 [2024-10-13 12:45:47,715 INFO L175 Difference]: Start difference. First operand has 138 places, 142 transitions, 1208 flow. Second operand 8 states and 281 transitions. [2024-10-13 12:45:47,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 201 transitions, 1942 flow [2024-10-13 12:45:48,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 201 transitions, 1852 flow, removed 30 selfloop flow, removed 4 redundant places. [2024-10-13 12:45:48,328 INFO L231 Difference]: Finished difference. Result has 143 places, 143 transitions, 1220 flow [2024-10-13 12:45:48,329 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1130, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1220, PETRI_PLACES=143, PETRI_TRANSITIONS=143} [2024-10-13 12:45:48,329 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 85 predicate places. [2024-10-13 12:45:48,329 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 143 transitions, 1220 flow [2024-10-13 12:45:48,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 27.5) internal successors, (330), 12 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:48,329 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:45:48,329 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:45:48,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-10-13 12:45:48,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:48,530 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-13 12:45:48,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:45:48,530 INFO L85 PathProgramCache]: Analyzing trace with hash 117381299, now seen corresponding path program 2 times [2024-10-13 12:45:48,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:45:48,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [147079681] [2024-10-13 12:45:48,531 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 12:45:48,531 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:48,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:45:48,532 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:45:48,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-10-13 12:45:48,598 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 12:45:48,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:45:48,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 12:45:48,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:45:48,608 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 8 treesize of output 7 [2024-10-13 12:45:48,841 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 12:45:48,841 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:45:49,439 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 12:45:49,439 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:45:49,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [147079681] [2024-10-13 12:45:49,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [147079681] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:45:49,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:45:49,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 13 [2024-10-13 12:45:49,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78244647] [2024-10-13 12:45:49,440 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:45:49,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 12:45:49,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:45:49,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 12:45:49,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2024-10-13 12:45:50,686 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2024-10-13 12:45:50,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 143 transitions, 1220 flow. Second operand has 15 states, 15 states have (on average 27.466666666666665) internal successors, (412), 15 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:50,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:45:50,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2024-10-13 12:45:50,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:45:58,649 INFO L124 PetriNetUnfolderBase]: 33317/52138 cut-off events. [2024-10-13 12:45:58,650 INFO L125 PetriNetUnfolderBase]: For 185126/186320 co-relation queries the response was YES. [2024-10-13 12:45:59,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208196 conditions, 52138 events. 33317/52138 cut-off events. For 185126/186320 co-relation queries the response was YES. Maximal size of possible extension queue 1076. Compared 380010 event pairs, 5303 based on Foata normal form. 1066/51270 useless extension candidates. Maximal degree in co-relation 208123. Up to 11911 conditions per place. [2024-10-13 12:45:59,266 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 402 selfloop transitions, 36 changer transitions 4/474 dead transitions. [2024-10-13 12:45:59,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 474 transitions, 4396 flow [2024-10-13 12:45:59,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 12:45:59,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-13 12:45:59,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 529 transitions. [2024-10-13 12:45:59,268 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6897001303780965 [2024-10-13 12:45:59,268 INFO L175 Difference]: Start difference. First operand has 143 places, 143 transitions, 1220 flow. Second operand 13 states and 529 transitions. [2024-10-13 12:45:59,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 474 transitions, 4396 flow [2024-10-13 12:45:59,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 474 transitions, 4291 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-10-13 12:45:59,940 INFO L231 Difference]: Finished difference. Result has 156 places, 153 transitions, 1383 flow [2024-10-13 12:45:59,941 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1182, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1383, PETRI_PLACES=156, PETRI_TRANSITIONS=153} [2024-10-13 12:45:59,941 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 98 predicate places. [2024-10-13 12:45:59,941 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 153 transitions, 1383 flow [2024-10-13 12:45:59,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 27.466666666666665) internal successors, (412), 15 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:59,941 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:45:59,942 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:45:59,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-10-13 12:46:00,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:46:00,142 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-13 12:46:00,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:46:00,143 INFO L85 PathProgramCache]: Analyzing trace with hash 872488610, now seen corresponding path program 2 times [2024-10-13 12:46:00,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:46:00,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1208001014] [2024-10-13 12:46:00,143 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 12:46:00,143 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:46:00,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:46:00,144 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:46:00,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-10-13 12:46:00,210 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 12:46:00,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:46:00,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 12:46:00,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:46:00,221 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 8 treesize of output 7 [2024-10-13 12:46:00,501 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 12:46:00,501 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:46:01,051 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 12:46:01,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:46:01,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1208001014] [2024-10-13 12:46:01,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1208001014] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:46:01,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:46:01,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2024-10-13 12:46:01,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388257087] [2024-10-13 12:46:01,052 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:46:01,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 12:46:01,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:46:01,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 12:46:01,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-10-13 12:46:02,385 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 59 [2024-10-13 12:46:02,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 153 transitions, 1383 flow. Second operand has 13 states, 13 states have (on average 27.307692307692307) internal successors, (355), 13 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:46:02,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:46:02,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 59 [2024-10-13 12:46:02,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand