./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 4a390ef5 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-dev-4a390ef-m [2024-10-24 19:24:03,486 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 19:24:03,553 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-24 19:24:03,558 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 19:24:03,558 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 19:24:03,587 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 19:24:03,587 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 19:24:03,588 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 19:24:03,588 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 19:24:03,588 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 19:24:03,589 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 19:24:03,589 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 19:24:03,589 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 19:24:03,590 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 19:24:03,590 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 19:24:03,590 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 19:24:03,590 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 19:24:03,591 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 19:24:03,591 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 19:24:03,591 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 19:24:03,591 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 19:24:03,592 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 19:24:03,592 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 19:24:03,592 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 19:24:03,592 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 19:24:03,593 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 19:24:03,593 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 19:24:03,593 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 19:24:03,593 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 19:24:03,593 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 19:24:03,594 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 19:24:03,594 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 19:24:03,594 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 19:24:03,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:24:03,594 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 19:24:03,595 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 19:24:03,595 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 19:24:03,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 19:24:03,595 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 19:24:03,596 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 19:24:03,596 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 19:24:03,596 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 19:24:03,596 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-24 19:24:03,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 19:24:03,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 19:24:03,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 19:24:03,879 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 19:24:03,879 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 19:24:03,881 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-24 19:24:05,202 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 19:24:05,337 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 19:24:05,338 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c [2024-10-24 19:24:05,344 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06cbec0cf/ffaeb676eb7e4306ad6ca85ac2f00d87/FLAG8196007d3 [2024-10-24 19:24:05,354 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06cbec0cf/ffaeb676eb7e4306ad6ca85ac2f00d87 [2024-10-24 19:24:05,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 19:24:05,359 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 19:24:05,360 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 19:24:05,361 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 19:24:05,364 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 19:24:05,365 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:24:05" (1/1) ... [2024-10-24 19:24:05,366 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ad14e84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:05, skipping insertion in model container [2024-10-24 19:24:05,366 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:24:05" (1/1) ... [2024-10-24 19:24:05,381 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 19:24:05,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:24:05,665 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-24 19:24:05,665 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@41acdab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:05, skipping insertion in model container [2024-10-24 19:24:05,665 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 19:24:05,665 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-24 19:24:05,667 INFO L158 Benchmark]: Toolchain (without parser) took 306.59ms. Allocated memory was 134.2MB in the beginning and 169.9MB in the end (delta: 35.7MB). Free memory was 64.1MB in the beginning and 139.5MB in the end (delta: -75.4MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2024-10-24 19:24:05,667 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 134.2MB. Free memory is still 97.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 19:24:05,671 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.79ms. Allocated memory was 134.2MB in the beginning and 169.9MB in the end (delta: 35.7MB). Free memory was 63.9MB in the beginning and 139.5MB in the end (delta: -75.6MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2024-10-24 19:24:05,672 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.53ms. Allocated memory is still 134.2MB. Free memory is still 97.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 304.79ms. Allocated memory was 134.2MB in the beginning and 169.9MB in the end (delta: 35.7MB). Free memory was 63.9MB in the beginning and 139.5MB in the end (delta: -75.6MB). Peak memory consumption was 13.3MB. 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-dev-4a390ef-m [2024-10-24 19:24:07,709 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 19:24:07,769 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-24 19:24:07,773 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 19:24:07,774 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 19:24:07,805 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 19:24:07,806 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 19:24:07,806 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 19:24:07,807 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 19:24:07,807 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 19:24:07,807 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 19:24:07,807 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 19:24:07,808 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 19:24:07,809 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 19:24:07,810 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 19:24:07,810 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 19:24:07,813 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 19:24:07,813 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 19:24:07,813 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 19:24:07,813 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 19:24:07,814 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 19:24:07,814 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 19:24:07,814 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 19:24:07,815 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 19:24:07,815 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 19:24:07,816 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 19:24:07,816 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 19:24:07,816 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 19:24:07,817 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 19:24:07,817 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 19:24:07,817 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 19:24:07,817 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 19:24:07,818 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 19:24:07,818 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 19:24:07,819 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 19:24:07,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:24:07,819 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 19:24:07,820 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 19:24:07,820 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 19:24:07,820 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 19:24:07,820 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 19:24:07,821 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 19:24:07,821 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 19:24:07,821 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 19:24:07,821 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 19:24:07,821 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-24 19:24:08,143 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 19:24:08,168 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 19:24:08,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 19:24:08,174 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 19:24:08,174 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 19:24:08,177 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-24 19:24:09,567 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 19:24:09,755 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 19:24:09,756 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c [2024-10-24 19:24:09,766 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a53776f75/eb7b9eac23d94e66809819b37ad31cd9/FLAG111be6566 [2024-10-24 19:24:09,793 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a53776f75/eb7b9eac23d94e66809819b37ad31cd9 [2024-10-24 19:24:09,795 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 19:24:09,796 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 19:24:09,799 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 19:24:09,799 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 19:24:09,804 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 19:24:09,805 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:24:09" (1/1) ... [2024-10-24 19:24:09,805 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c2d7b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:09, skipping insertion in model container [2024-10-24 19:24:09,806 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:24:09" (1/1) ... [2024-10-24 19:24:09,827 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 19:24:10,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:24:10,047 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-24 19:24:10,052 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 19:24:10,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:24:10,084 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 19:24:10,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:24:10,146 INFO L204 MainTranslator]: Completed translation [2024-10-24 19:24:10,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:10 WrapperNode [2024-10-24 19:24:10,150 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 19:24:10,151 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 19:24:10,151 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 19:24:10,151 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 19:24:10,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:10" (1/1) ... [2024-10-24 19:24:10,178 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:10" (1/1) ... [2024-10-24 19:24:10,201 INFO L138 Inliner]: procedures = 25, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 89 [2024-10-24 19:24:10,203 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 19:24:10,204 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 19:24:10,204 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 19:24:10,204 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 19:24:10,213 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:10" (1/1) ... [2024-10-24 19:24:10,213 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:10" (1/1) ... [2024-10-24 19:24:10,217 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:10" (1/1) ... [2024-10-24 19:24:10,238 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-24 19:24:10,239 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:10" (1/1) ... [2024-10-24 19:24:10,239 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:10" (1/1) ... [2024-10-24 19:24:10,247 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:10" (1/1) ... [2024-10-24 19:24:10,251 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:10" (1/1) ... [2024-10-24 19:24:10,253 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:10" (1/1) ... [2024-10-24 19:24:10,254 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:10" (1/1) ... [2024-10-24 19:24:10,256 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 19:24:10,257 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 19:24:10,257 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 19:24:10,257 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 19:24:10,258 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:10" (1/1) ... [2024-10-24 19:24:10,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:24:10,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:24:10,294 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-24 19:24:10,299 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-24 19:24:10,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 19:24:10,350 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-24 19:24:10,350 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-24 19:24:10,350 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-24 19:24:10,350 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-24 19:24:10,355 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-24 19:24:10,355 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-24 19:24:10,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 19:24:10,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 19:24:10,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 19:24:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 19:24:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 19:24:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 19:24:10,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 19:24:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 19:24:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 19:24:10,358 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-24 19:24:10,555 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 19:24:10,558 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 19:24:10,950 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-24 19:24:10,951 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 19:24:11,118 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 19:24:11,118 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-24 19:24:11,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:24:11 BoogieIcfgContainer [2024-10-24 19:24:11,118 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 19:24:11,119 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 19:24:11,120 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 19:24:11,122 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 19:24:11,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:24:09" (1/3) ... [2024-10-24 19:24:11,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b0e4ed4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:24:11, skipping insertion in model container [2024-10-24 19:24:11,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:10" (2/3) ... [2024-10-24 19:24:11,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b0e4ed4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:24:11, skipping insertion in model container [2024-10-24 19:24:11,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:24:11" (3/3) ... [2024-10-24 19:24:11,125 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-sorted.wvr.c [2024-10-24 19:24:11,136 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 19:24:11,136 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-10-24 19:24:11,136 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-24 19:24:11,206 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-24 19:24:11,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 59 transitions, 139 flow [2024-10-24 19:24:11,263 INFO L124 PetriNetUnfolderBase]: 7/56 cut-off events. [2024-10-24 19:24:11,264 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-24 19:24:11,267 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-24 19:24:11,268 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 59 transitions, 139 flow [2024-10-24 19:24:11,271 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 55 transitions, 128 flow [2024-10-24 19:24:11,280 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 19:24:11,285 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;@6f799647, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 19:24:11,286 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2024-10-24 19:24:11,288 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 19:24:11,288 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-10-24 19:24:11,288 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 19:24:11,288 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:24:11,289 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-24 19:24:11,289 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-24 19:24:11,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:24:11,293 INFO L85 PathProgramCache]: Analyzing trace with hash 452661, now seen corresponding path program 1 times [2024-10-24 19:24:11,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:24:11,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [784355038] [2024-10-24 19:24:11,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:24:11,302 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-24 19:24:11,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:24:11,305 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-24 19:24:11,306 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-24 19:24:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:24:11,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 19:24:11,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:24:11,417 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-24 19:24:11,435 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-24 19:24:11,438 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:24:11,439 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:24:11,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [784355038] [2024-10-24 19:24:11,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [784355038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:24:11,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:24:11,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 19:24:11,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159214237] [2024-10-24 19:24:11,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:24:11,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:24:11,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:24:11,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:24:11,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:24:11,542 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 59 [2024-10-24 19:24:11,544 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-24 19:24:11,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:24:11,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 59 [2024-10-24 19:24:11,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:24:11,857 INFO L124 PetriNetUnfolderBase]: 785/1534 cut-off events. [2024-10-24 19:24:11,857 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2024-10-24 19:24:11,862 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-24 19:24:11,874 INFO L140 encePairwiseOnDemand]: 55/59 looper letters, 27 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2024-10-24 19:24:11,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 52 transitions, 180 flow [2024-10-24 19:24:11,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:24:11,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:24:11,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2024-10-24 19:24:11,888 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.632768361581921 [2024-10-24 19:24:11,889 INFO L175 Difference]: Start difference. First operand has 58 places, 55 transitions, 128 flow. Second operand 3 states and 112 transitions. [2024-10-24 19:24:11,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 52 transitions, 180 flow [2024-10-24 19:24:11,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 52 transitions, 168 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-24 19:24:11,897 INFO L231 Difference]: Finished difference. Result has 51 places, 52 transitions, 114 flow [2024-10-24 19:24:11,900 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-24 19:24:11,903 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, -7 predicate places. [2024-10-24 19:24:11,904 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 52 transitions, 114 flow [2024-10-24 19:24:11,905 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-24 19:24:11,905 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:24:11,905 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-24 19:24:11,912 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-24 19:24:12,108 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-24 19:24:12,109 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-24 19:24:12,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:24:12,110 INFO L85 PathProgramCache]: Analyzing trace with hash 452662, now seen corresponding path program 1 times [2024-10-24 19:24:12,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:24:12,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1024589959] [2024-10-24 19:24:12,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:24:12,110 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-24 19:24:12,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:24:12,115 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-24 19:24:12,121 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-24 19:24:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:24:12,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 19:24:12,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:24:12,190 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-24 19:24:12,250 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-24 19:24:12,250 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:24:12,251 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:24:12,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1024589959] [2024-10-24 19:24:12,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1024589959] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:24:12,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:24:12,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:24:12,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52891261] [2024-10-24 19:24:12,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:24:12,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:24:12,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:24:12,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:24:12,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:24:12,359 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 59 [2024-10-24 19:24:12,360 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-24 19:24:12,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:24:12,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 59 [2024-10-24 19:24:12,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:24:12,692 INFO L124 PetriNetUnfolderBase]: 786/1537 cut-off events. [2024-10-24 19:24:12,692 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-10-24 19:24:12,695 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-24 19:24:12,700 INFO L140 encePairwiseOnDemand]: 54/59 looper letters, 29 selfloop transitions, 4 changer transitions 0/55 dead transitions. [2024-10-24 19:24:12,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 55 transitions, 188 flow [2024-10-24 19:24:12,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:24:12,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 19:24:12,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2024-10-24 19:24:12,703 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6016949152542372 [2024-10-24 19:24:12,703 INFO L175 Difference]: Start difference. First operand has 51 places, 52 transitions, 114 flow. Second operand 4 states and 142 transitions. [2024-10-24 19:24:12,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 55 transitions, 188 flow [2024-10-24 19:24:12,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 55 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 19:24:12,705 INFO L231 Difference]: Finished difference. Result has 54 places, 55 transitions, 137 flow [2024-10-24 19:24:12,705 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-24 19:24:12,706 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2024-10-24 19:24:12,706 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 55 transitions, 137 flow [2024-10-24 19:24:12,706 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-24 19:24:12,706 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:24:12,706 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2024-10-24 19:24:12,710 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 (3)] Forceful destruction successful, exit code 0 [2024-10-24 19:24:12,907 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-24 19:24:12,907 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-24 19:24:12,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:24:12,909 INFO L85 PathProgramCache]: Analyzing trace with hash 435022628, now seen corresponding path program 1 times [2024-10-24 19:24:12,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:24:12,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1543596881] [2024-10-24 19:24:12,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:24:12,911 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-24 19:24:12,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:24:12,913 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-24 19:24:12,918 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-24 19:24:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:24:12,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 19:24:12,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:24:12,972 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-24 19:24:13,071 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-24 19:24:13,071 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 19:24:13,427 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-24 19:24:13,428 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:24:13,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1543596881] [2024-10-24 19:24:13,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1543596881] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 19:24:13,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 19:24:13,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-10-24 19:24:13,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292379412] [2024-10-24 19:24:13,428 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 19:24:13,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 19:24:13,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:24:13,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 19:24:13,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-24 19:24:14,064 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 59 [2024-10-24 19:24:14,065 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-24 19:24:14,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:24:14,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 59 [2024-10-24 19:24:14,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:24:14,532 INFO L124 PetriNetUnfolderBase]: 789/1546 cut-off events. [2024-10-24 19:24:14,532 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-10-24 19:24:14,534 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-24 19:24:14,538 INFO L140 encePairwiseOnDemand]: 54/59 looper letters, 29 selfloop transitions, 13 changer transitions 0/64 dead transitions. [2024-10-24 19:24:14,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 64 transitions, 257 flow [2024-10-24 19:24:14,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 19:24:14,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-24 19:24:14,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 315 transitions. [2024-10-24 19:24:14,541 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5338983050847458 [2024-10-24 19:24:14,541 INFO L175 Difference]: Start difference. First operand has 54 places, 55 transitions, 137 flow. Second operand 10 states and 315 transitions. [2024-10-24 19:24:14,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 64 transitions, 257 flow [2024-10-24 19:24:14,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 64 transitions, 254 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 19:24:14,542 INFO L231 Difference]: Finished difference. Result has 65 places, 64 transitions, 214 flow [2024-10-24 19:24:14,543 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-24 19:24:14,543 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 7 predicate places. [2024-10-24 19:24:14,543 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 64 transitions, 214 flow [2024-10-24 19:24:14,544 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-24 19:24:14,544 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:24:14,544 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:24:14,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-24 19:24:14,746 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-24 19:24:14,747 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-24 19:24:14,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:24:14,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1528129076, now seen corresponding path program 1 times [2024-10-24 19:24:14,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:24:14,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [444295616] [2024-10-24 19:24:14,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:24:14,749 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-24 19:24:14,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:24:14,753 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-24 19:24:14,755 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-24 19:24:14,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:24:14,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 19:24:14,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:24:14,798 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-24 19:24:14,812 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-24 19:24:14,812 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:24:14,813 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:24:14,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [444295616] [2024-10-24 19:24:14,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [444295616] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:24:14,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:24:14,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:24:14,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298729443] [2024-10-24 19:24:14,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:24:14,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:24:14,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:24:14,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:24:14,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:24:14,855 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 59 [2024-10-24 19:24:14,855 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-24 19:24:14,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:24:14,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 59 [2024-10-24 19:24:14,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:24:15,036 INFO L124 PetriNetUnfolderBase]: 1358/2162 cut-off events. [2024-10-24 19:24:15,036 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-10-24 19:24:15,038 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-24 19:24:15,044 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 38 selfloop transitions, 6 changer transitions 0/58 dead transitions. [2024-10-24 19:24:15,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 58 transitions, 290 flow [2024-10-24 19:24:15,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:24:15,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 19:24:15,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2024-10-24 19:24:15,045 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4661016949152542 [2024-10-24 19:24:15,045 INFO L175 Difference]: Start difference. First operand has 65 places, 64 transitions, 214 flow. Second operand 4 states and 110 transitions. [2024-10-24 19:24:15,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 58 transitions, 290 flow [2024-10-24 19:24:15,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 58 transitions, 260 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-10-24 19:24:15,047 INFO L231 Difference]: Finished difference. Result has 59 places, 58 transitions, 184 flow [2024-10-24 19:24:15,047 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-24 19:24:15,048 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 1 predicate places. [2024-10-24 19:24:15,048 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 58 transitions, 184 flow [2024-10-24 19:24:15,048 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-24 19:24:15,048 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:24:15,048 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:24:15,052 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-24 19:24:15,249 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-24 19:24:15,249 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-24 19:24:15,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:24:15,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1528129077, now seen corresponding path program 1 times [2024-10-24 19:24:15,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:24:15,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1262038601] [2024-10-24 19:24:15,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:24:15,251 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-24 19:24:15,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:24:15,255 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-24 19:24:15,259 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-24 19:24:15,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:24:15,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-24 19:24:15,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:24:15,316 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-24 19:24:15,444 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-24 19:24:15,445 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:24:15,445 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:24:15,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1262038601] [2024-10-24 19:24:15,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1262038601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:24:15,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:24:15,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:24:15,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948112208] [2024-10-24 19:24:15,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:24:15,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 19:24:15,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:24:15,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 19:24:15,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 19:24:15,725 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2024-10-24 19:24:15,726 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-24 19:24:15,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:24:15,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2024-10-24 19:24:15,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:24:16,194 INFO L124 PetriNetUnfolderBase]: 1527/2650 cut-off events. [2024-10-24 19:24:16,194 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-10-24 19:24:16,197 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-24 19:24:16,206 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 67 selfloop transitions, 10 changer transitions 0/92 dead transitions. [2024-10-24 19:24:16,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 92 transitions, 410 flow [2024-10-24 19:24:16,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 19:24:16,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 19:24:16,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 223 transitions. [2024-10-24 19:24:16,208 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6299435028248588 [2024-10-24 19:24:16,208 INFO L175 Difference]: Start difference. First operand has 59 places, 58 transitions, 184 flow. Second operand 6 states and 223 transitions. [2024-10-24 19:24:16,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 92 transitions, 410 flow [2024-10-24 19:24:16,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 92 transitions, 403 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 19:24:16,210 INFO L231 Difference]: Finished difference. Result has 64 places, 61 transitions, 218 flow [2024-10-24 19:24:16,210 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-24 19:24:16,211 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places. [2024-10-24 19:24:16,211 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 61 transitions, 218 flow [2024-10-24 19:24:16,211 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-24 19:24:16,211 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:24:16,211 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:24:16,218 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 (6)] Forceful destruction successful, exit code 0 [2024-10-24 19:24:16,414 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-24 19:24:16,415 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-24 19:24:16,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:24:16,416 INFO L85 PathProgramCache]: Analyzing trace with hash -481317404, now seen corresponding path program 1 times [2024-10-24 19:24:16,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:24:16,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1105929352] [2024-10-24 19:24:16,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:24:16,416 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-24 19:24:16,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:24:16,421 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-24 19:24:16,422 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-24 19:24:16,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:24:16,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-24 19:24:16,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:24:16,511 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-24 19:24:16,638 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-24 19:24:16,638 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:24:16,638 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:24:16,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1105929352] [2024-10-24 19:24:16,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1105929352] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:24:16,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:24:16,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:24:16,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341549566] [2024-10-24 19:24:16,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:24:16,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:24:16,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:24:16,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:24:16,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:24:16,807 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 59 [2024-10-24 19:24:16,808 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-24 19:24:16,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:24:16,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 59 [2024-10-24 19:24:16,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:24:17,177 INFO L124 PetriNetUnfolderBase]: 2296/4015 cut-off events. [2024-10-24 19:24:17,177 INFO L125 PetriNetUnfolderBase]: For 987/1089 co-relation queries the response was YES. [2024-10-24 19:24:17,182 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-24 19:24:17,195 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 57 selfloop transitions, 9 changer transitions 0/82 dead transitions. [2024-10-24 19:24:17,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 82 transitions, 413 flow [2024-10-24 19:24:17,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 19:24:17,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 19:24:17,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 184 transitions. [2024-10-24 19:24:17,197 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6237288135593221 [2024-10-24 19:24:17,197 INFO L175 Difference]: Start difference. First operand has 64 places, 61 transitions, 218 flow. Second operand 5 states and 184 transitions. [2024-10-24 19:24:17,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 82 transitions, 413 flow [2024-10-24 19:24:17,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 82 transitions, 395 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-24 19:24:17,200 INFO L231 Difference]: Finished difference. Result has 66 places, 63 transitions, 234 flow [2024-10-24 19:24:17,200 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-24 19:24:17,200 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 8 predicate places. [2024-10-24 19:24:17,200 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 234 flow [2024-10-24 19:24:17,201 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-24 19:24:17,201 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:24:17,201 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:24:17,209 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-24 19:24:17,404 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-24 19:24:17,404 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-24 19:24:17,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:24:17,404 INFO L85 PathProgramCache]: Analyzing trace with hash 2136367798, now seen corresponding path program 1 times [2024-10-24 19:24:17,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:24:17,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1814409061] [2024-10-24 19:24:17,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:24:17,405 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-24 19:24:17,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:24:17,407 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-24 19:24:17,408 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-24 19:24:17,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:24:17,443 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 19:24:17,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:24:17,454 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-24 19:24:17,454 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:24:17,454 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:24:17,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1814409061] [2024-10-24 19:24:17,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1814409061] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:24:17,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:24:17,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:24:17,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98441569] [2024-10-24 19:24:17,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:24:17,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:24:17,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:24:17,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:24:17,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:24:17,457 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2024-10-24 19:24:17,458 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-24 19:24:17,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:24:17,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2024-10-24 19:24:17,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:24:17,891 INFO L124 PetriNetUnfolderBase]: 3244/5134 cut-off events. [2024-10-24 19:24:17,892 INFO L125 PetriNetUnfolderBase]: For 1658/1764 co-relation queries the response was YES. [2024-10-24 19:24:17,899 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-24 19:24:17,912 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 95 selfloop transitions, 10 changer transitions 0/120 dead transitions. [2024-10-24 19:24:17,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 120 transitions, 606 flow [2024-10-24 19:24:17,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 19:24:17,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 19:24:17,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 216 transitions. [2024-10-24 19:24:17,914 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7322033898305085 [2024-10-24 19:24:17,914 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 234 flow. Second operand 5 states and 216 transitions. [2024-10-24 19:24:17,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 120 transitions, 606 flow [2024-10-24 19:24:17,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 120 transitions, 582 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-24 19:24:17,922 INFO L231 Difference]: Finished difference. Result has 69 places, 65 transitions, 257 flow [2024-10-24 19:24:17,922 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-24 19:24:17,922 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 11 predicate places. [2024-10-24 19:24:17,922 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 65 transitions, 257 flow [2024-10-24 19:24:17,923 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-24 19:24:17,923 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:24:17,923 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:24:17,926 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 (8)] Forceful destruction successful, exit code 0 [2024-10-24 19:24:18,123 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-24 19:24:18,123 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-24 19:24:18,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:24:18,124 INFO L85 PathProgramCache]: Analyzing trace with hash -2035937222, now seen corresponding path program 1 times [2024-10-24 19:24:18,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:24:18,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [504223965] [2024-10-24 19:24:18,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:24:18,124 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-24 19:24:18,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:24:18,127 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-24 19:24:18,127 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-24 19:24:18,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:24:18,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-24 19:24:18,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:24:18,180 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-24 19:24:18,310 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-24 19:24:18,310 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:24:18,311 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:24:18,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [504223965] [2024-10-24 19:24:18,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [504223965] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:24:18,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:24:18,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:24:18,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063606776] [2024-10-24 19:24:18,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:24:18,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:24:18,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:24:18,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:24:18,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:24:18,450 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 59 [2024-10-24 19:24:18,450 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-24 19:24:18,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:24:18,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 59 [2024-10-24 19:24:18,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:24:19,208 INFO L124 PetriNetUnfolderBase]: 4818/7799 cut-off events. [2024-10-24 19:24:19,208 INFO L125 PetriNetUnfolderBase]: For 4366/4478 co-relation queries the response was YES. [2024-10-24 19:24:19,220 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-24 19:24:19,245 INFO L140 encePairwiseOnDemand]: 50/59 looper letters, 79 selfloop transitions, 6 changer transitions 0/100 dead transitions. [2024-10-24 19:24:19,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 100 transitions, 537 flow [2024-10-24 19:24:19,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 19:24:19,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 19:24:19,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 201 transitions. [2024-10-24 19:24:19,248 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6813559322033899 [2024-10-24 19:24:19,248 INFO L175 Difference]: Start difference. First operand has 69 places, 65 transitions, 257 flow. Second operand 5 states and 201 transitions. [2024-10-24 19:24:19,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 100 transitions, 537 flow [2024-10-24 19:24:19,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 100 transitions, 537 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 19:24:19,253 INFO L231 Difference]: Finished difference. Result has 75 places, 68 transitions, 306 flow [2024-10-24 19:24:19,254 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-24 19:24:19,254 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 17 predicate places. [2024-10-24 19:24:19,254 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 68 transitions, 306 flow [2024-10-24 19:24:19,254 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-24 19:24:19,255 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:24:19,255 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:24:19,259 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-24 19:24:19,457 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-24 19:24:19,458 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-24 19:24:19,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:24:19,460 INFO L85 PathProgramCache]: Analyzing trace with hash 531280281, now seen corresponding path program 1 times [2024-10-24 19:24:19,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:24:19,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [810276299] [2024-10-24 19:24:19,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:24:19,461 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-24 19:24:19,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:24:19,462 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-24 19:24:19,463 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-24 19:24:19,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:24:19,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 19:24:19,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:24:19,545 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-24 19:24:19,546 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:24:19,547 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:24:19,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [810276299] [2024-10-24 19:24:19,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [810276299] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:24:19,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:24:19,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:24:19,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609922674] [2024-10-24 19:24:19,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:24:19,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:24:19,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:24:19,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:24:19,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:24:19,557 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 59 [2024-10-24 19:24:19,558 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-24 19:24:19,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:24:19,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 59 [2024-10-24 19:24:19,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:24:20,073 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-24 19:24:20,073 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-10-24 19:24:20,073 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-10-24 19:24:20,073 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-24 19:24:20,073 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-10-24 19:24:20,097 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-24 19:24:20,098 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-10-24 19:24:20,098 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-24 19:24:20,098 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-24 19:24:20,098 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-24 19:24:20,099 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-24 19:24:20,099 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-10-24 19:24:20,099 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-24 19:24:20,099 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-24 19:24:20,099 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-24 19:24:20,100 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-24 19:24:20,100 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-10-24 19:24:20,100 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-24 19:24:20,100 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-24 19:24:20,100 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-24 19:24:20,113 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-24 19:24:20,113 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-10-24 19:24:20,114 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-24 19:24:20,114 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-24 19:24:20,114 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-24 19:24:20,114 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-24 19:24:20,114 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-10-24 19:24:20,114 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-24 19:24:20,114 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-24 19:24:20,114 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-24 19:24:20,140 INFO L124 PetriNetUnfolderBase]: 3179/5463 cut-off events. [2024-10-24 19:24:20,141 INFO L125 PetriNetUnfolderBase]: For 4428/4707 co-relation queries the response was YES. [2024-10-24 19:24:20,153 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-24 19:24:20,168 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 44 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2024-10-24 19:24:20,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 64 transitions, 363 flow [2024-10-24 19:24:20,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:24:20,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:24:20,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2024-10-24 19:24:20,170 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.655367231638418 [2024-10-24 19:24:20,170 INFO L175 Difference]: Start difference. First operand has 75 places, 68 transitions, 306 flow. Second operand 3 states and 116 transitions. [2024-10-24 19:24:20,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 64 transitions, 363 flow [2024-10-24 19:24:20,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 64 transitions, 359 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 19:24:20,174 INFO L231 Difference]: Finished difference. Result has 73 places, 64 transitions, 271 flow [2024-10-24 19:24:20,174 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-24 19:24:20,175 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 15 predicate places. [2024-10-24 19:24:20,175 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 64 transitions, 271 flow [2024-10-24 19:24:20,175 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-24 19:24:20,176 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:24:20,176 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2024-10-24 19:24:20,182 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-24 19:24:20,378 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-24 19:24:20,378 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-24 19:24:20,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:24:20,379 INFO L85 PathProgramCache]: Analyzing trace with hash 418930414, now seen corresponding path program 2 times [2024-10-24 19:24:20,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:24:20,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [41407279] [2024-10-24 19:24:20,379 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 19:24:20,379 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-24 19:24:20,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:24:20,381 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-24 19:24:20,382 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-24 19:24:20,447 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 19:24:20,448 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 19:24:20,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 19:24:20,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:24:20,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-24 19:24:20,732 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-24 19:24:20,734 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 19:24:21,205 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-24 19:24:21,205 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:24:21,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [41407279] [2024-10-24 19:24:21,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [41407279] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 19:24:21,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 19:24:21,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2024-10-24 19:24:21,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856296992] [2024-10-24 19:24:21,206 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 19:24:21,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 19:24:21,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:24:21,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 19:24:21,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-10-24 19:24:22,133 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 59 [2024-10-24 19:24:22,134 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-24 19:24:22,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:24:22,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 59 [2024-10-24 19:24:22,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:24:24,279 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-24 19:24:24,279 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-10-24 19:24:24,280 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-10-24 19:24:24,280 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-10-24 19:24:24,280 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-24 19:24:24,297 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-24 19:24:24,297 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-10-24 19:24:24,297 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-24 19:24:24,297 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-24 19:24:24,297 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-24 19:24:24,298 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-24 19:24:24,298 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-10-24 19:24:24,298 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-24 19:24:24,298 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-24 19:24:24,298 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-24 19:24:24,298 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-24 19:24:24,298 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-10-24 19:24:24,298 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-24 19:24:24,299 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-24 19:24:24,299 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-24 19:24:24,310 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-24 19:24:24,311 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-10-24 19:24:24,311 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-24 19:24:24,311 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-24 19:24:24,311 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-24 19:24:24,311 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-24 19:24:24,311 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-10-24 19:24:24,311 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-24 19:24:24,311 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-24 19:24:24,311 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-24 19:24:24,378 INFO L124 PetriNetUnfolderBase]: 3185/5481 cut-off events. [2024-10-24 19:24:24,378 INFO L125 PetriNetUnfolderBase]: For 4463/4742 co-relation queries the response was YES. [2024-10-24 19:24:24,395 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-24 19:24:24,415 INFO L140 encePairwiseOnDemand]: 54/59 looper letters, 35 selfloop transitions, 30 changer transitions 0/82 dead transitions. [2024-10-24 19:24:24,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 82 transitions, 509 flow [2024-10-24 19:24:24,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-24 19:24:24,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-10-24 19:24:24,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 659 transitions. [2024-10-24 19:24:24,420 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5077041602465331 [2024-10-24 19:24:24,420 INFO L175 Difference]: Start difference. First operand has 73 places, 64 transitions, 271 flow. Second operand 22 states and 659 transitions. [2024-10-24 19:24:24,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 82 transitions, 509 flow [2024-10-24 19:24:24,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 82 transitions, 505 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 19:24:24,426 INFO L231 Difference]: Finished difference. Result has 98 places, 82 transitions, 465 flow [2024-10-24 19:24:24,426 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-24 19:24:24,426 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 40 predicate places. [2024-10-24 19:24:24,426 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 82 transitions, 465 flow [2024-10-24 19:24:24,427 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-24 19:24:24,427 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:24:24,427 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:24:24,431 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-24 19:24:24,630 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-24 19:24:24,630 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-24 19:24:24,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:24:24,631 INFO L85 PathProgramCache]: Analyzing trace with hash 546342284, now seen corresponding path program 1 times [2024-10-24 19:24:24,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:24:24,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1176780453] [2024-10-24 19:24:24,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:24:24,632 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-24 19:24:24,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:24:24,636 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-24 19:24:24,646 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-24 19:24:24,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:24:24,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 19:24:24,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:24:24,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-24 19:24:24,957 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-24 19:24:24,957 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:24:24,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:24:24,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1176780453] [2024-10-24 19:24:24,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1176780453] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:24:24,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:24:24,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:24:24,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465885992] [2024-10-24 19:24:24,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:24:24,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 19:24:24,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:24:24,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 19:24:24,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 19:24:25,196 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2024-10-24 19:24:25,197 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-24 19:24:25,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:24:25,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2024-10-24 19:24:25,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:24:26,128 INFO L124 PetriNetUnfolderBase]: 3666/6147 cut-off events. [2024-10-24 19:24:26,128 INFO L125 PetriNetUnfolderBase]: For 4645/4841 co-relation queries the response was YES. [2024-10-24 19:24:26,155 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-24 19:24:26,188 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 89 selfloop transitions, 15 changer transitions 0/120 dead transitions. [2024-10-24 19:24:26,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 120 transitions, 809 flow [2024-10-24 19:24:26,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 19:24:26,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 19:24:26,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 220 transitions. [2024-10-24 19:24:26,190 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6214689265536724 [2024-10-24 19:24:26,190 INFO L175 Difference]: Start difference. First operand has 98 places, 82 transitions, 465 flow. Second operand 6 states and 220 transitions. [2024-10-24 19:24:26,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 120 transitions, 809 flow [2024-10-24 19:24:26,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 120 transitions, 731 flow, removed 27 selfloop flow, removed 9 redundant places. [2024-10-24 19:24:26,196 INFO L231 Difference]: Finished difference. Result has 96 places, 83 transitions, 428 flow [2024-10-24 19:24:26,196 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-24 19:24:26,197 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 38 predicate places. [2024-10-24 19:24:26,197 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 83 transitions, 428 flow [2024-10-24 19:24:26,197 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-24 19:24:26,198 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:24:26,198 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:24:26,203 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-24 19:24:26,400 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-24 19:24:26,401 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-24 19:24:26,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:24:26,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1022433657, now seen corresponding path program 1 times [2024-10-24 19:24:26,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:24:26,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1773695593] [2024-10-24 19:24:26,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:24:26,403 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-24 19:24:26,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:24:26,405 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-24 19:24:26,410 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-24 19:24:26,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:24:26,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 19:24:26,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:24:26,547 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-24 19:24:26,547 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 19:24:26,654 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-24 19:24:26,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:24:26,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1773695593] [2024-10-24 19:24:26,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1773695593] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 19:24:26,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 19:24:26,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-10-24 19:24:26,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461646508] [2024-10-24 19:24:26,655 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 19:24:26,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 19:24:26,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:24:26,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 19:24:26,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-24 19:24:26,741 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 59 [2024-10-24 19:24:26,742 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-24 19:24:26,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:24:26,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 59 [2024-10-24 19:24:26,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:24:27,537 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-24 19:24:27,537 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-10-24 19:24:27,537 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-24 19:24:27,537 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-24 19:24:27,537 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-24 19:24:27,568 INFO L124 PetriNetUnfolderBase]: 4759/8343 cut-off events. [2024-10-24 19:24:27,568 INFO L125 PetriNetUnfolderBase]: For 11781/12114 co-relation queries the response was YES. [2024-10-24 19:24:27,590 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-24 19:24:27,613 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 90 selfloop transitions, 24 changer transitions 0/132 dead transitions. [2024-10-24 19:24:27,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 132 transitions, 880 flow [2024-10-24 19:24:27,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 19:24:27,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-24 19:24:27,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 266 transitions. [2024-10-24 19:24:27,615 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6440677966101694 [2024-10-24 19:24:27,615 INFO L175 Difference]: Start difference. First operand has 96 places, 83 transitions, 428 flow. Second operand 7 states and 266 transitions. [2024-10-24 19:24:27,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 132 transitions, 880 flow [2024-10-24 19:24:27,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 132 transitions, 840 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-24 19:24:27,623 INFO L231 Difference]: Finished difference. Result has 100 places, 85 transitions, 463 flow [2024-10-24 19:24:27,623 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-24 19:24:27,624 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 42 predicate places. [2024-10-24 19:24:27,624 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 85 transitions, 463 flow [2024-10-24 19:24:27,624 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-24 19:24:27,624 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:24:27,624 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:24:27,629 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-24 19:24:27,824 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-24 19:24:27,825 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-24 19:24:27,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:24:27,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1829403539, now seen corresponding path program 1 times [2024-10-24 19:24:27,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:24:27,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [3033554] [2024-10-24 19:24:27,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:24:27,826 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-24 19:24:27,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:24:27,830 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-24 19:24:27,831 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-24 19:24:27,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:24:27,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 19:24:27,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:24:27,958 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-24 19:24:27,958 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 19:24:28,030 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-24 19:24:28,108 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-24 19:24:28,108 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:24:28,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [3033554] [2024-10-24 19:24:28,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [3033554] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 19:24:28,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 19:24:28,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2024-10-24 19:24:28,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785566909] [2024-10-24 19:24:28,109 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 19:24:28,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 19:24:28,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:24:28,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 19:24:28,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-10-24 19:24:28,543 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 59 [2024-10-24 19:24:28,543 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-24 19:24:28,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:24:28,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 59 [2024-10-24 19:24:28,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:24:31,780 INFO L124 PetriNetUnfolderBase]: 19147/28764 cut-off events. [2024-10-24 19:24:31,780 INFO L125 PetriNetUnfolderBase]: For 32040/32510 co-relation queries the response was YES. [2024-10-24 19:24:31,906 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-24 19:24:32,010 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 261 selfloop transitions, 36 changer transitions 0/310 dead transitions. [2024-10-24 19:24:32,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 310 transitions, 2021 flow [2024-10-24 19:24:32,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 19:24:32,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-24 19:24:32,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 520 transitions. [2024-10-24 19:24:32,013 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6779661016949152 [2024-10-24 19:24:32,013 INFO L175 Difference]: Start difference. First operand has 100 places, 85 transitions, 463 flow. Second operand 13 states and 520 transitions. [2024-10-24 19:24:32,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 310 transitions, 2021 flow [2024-10-24 19:24:32,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 310 transitions, 2016 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 19:24:32,066 INFO L231 Difference]: Finished difference. Result has 116 places, 105 transitions, 688 flow [2024-10-24 19:24:32,066 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-24 19:24:32,067 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 58 predicate places. [2024-10-24 19:24:32,067 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 105 transitions, 688 flow [2024-10-24 19:24:32,067 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-24 19:24:32,067 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:24:32,068 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:24:32,075 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-24 19:24:32,268 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-24 19:24:32,268 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-24 19:24:32,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:24:32,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1049944069, now seen corresponding path program 1 times [2024-10-24 19:24:32,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:24:32,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1750411310] [2024-10-24 19:24:32,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:24:32,269 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-24 19:24:32,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:24:32,270 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-24 19:24:32,272 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-24 19:24:32,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:24:32,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 19:24:32,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:24:32,335 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-24 19:24:32,335 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:24:32,335 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:24:32,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1750411310] [2024-10-24 19:24:32,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1750411310] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:24:32,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:24:32,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:24:32,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096155248] [2024-10-24 19:24:32,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:24:32,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:24:32,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:24:32,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:24:32,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:24:32,339 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2024-10-24 19:24:32,339 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-24 19:24:32,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:24:32,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2024-10-24 19:24:32,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:24:34,981 INFO L124 PetriNetUnfolderBase]: 16039/25814 cut-off events. [2024-10-24 19:24:34,982 INFO L125 PetriNetUnfolderBase]: For 53990/54992 co-relation queries the response was YES. [2024-10-24 19:24:35,073 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-24 19:24:35,154 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 175 selfloop transitions, 17 changer transitions 0/213 dead transitions. [2024-10-24 19:24:35,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 213 transitions, 1727 flow [2024-10-24 19:24:35,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 19:24:35,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 19:24:35,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 212 transitions. [2024-10-24 19:24:35,156 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7186440677966102 [2024-10-24 19:24:35,156 INFO L175 Difference]: Start difference. First operand has 116 places, 105 transitions, 688 flow. Second operand 5 states and 212 transitions. [2024-10-24 19:24:35,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 213 transitions, 1727 flow [2024-10-24 19:24:35,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 213 transitions, 1669 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-10-24 19:24:35,257 INFO L231 Difference]: Finished difference. Result has 118 places, 108 transitions, 723 flow [2024-10-24 19:24:35,257 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-24 19:24:35,258 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 60 predicate places. [2024-10-24 19:24:35,265 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 108 transitions, 723 flow [2024-10-24 19:24:35,265 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-24 19:24:35,265 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:24:35,265 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:24:35,271 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 (15)] Ended with exit code 0 [2024-10-24 19:24:35,466 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-24 19:24:35,466 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-24 19:24:35,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:24:35,467 INFO L85 PathProgramCache]: Analyzing trace with hash 507090933, now seen corresponding path program 2 times [2024-10-24 19:24:35,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:24:35,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1481692643] [2024-10-24 19:24:35,470 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 19:24:35,470 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:24:35,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:24:35,473 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-24 19:24:35,473 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-24 19:24:35,575 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 19:24:35,575 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 19:24:35,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 19:24:35,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:24:35,596 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-24 19:24:35,848 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-24 19:24:35,852 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:24:35,852 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:24:35,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1481692643] [2024-10-24 19:24:35,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1481692643] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:24:35,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:24:35,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:24:35,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302749276] [2024-10-24 19:24:35,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:24:35,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 19:24:35,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:24:35,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 19:24:35,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 19:24:36,385 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2024-10-24 19:24:36,385 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-24 19:24:36,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:24:36,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2024-10-24 19:24:36,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:24:38,890 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-24 19:24:38,891 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-10-24 19:24:38,891 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-24 19:24:38,891 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-24 19:24:38,891 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-24 19:24:38,924 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-24 19:24:38,925 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-10-24 19:24:38,925 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-24 19:24:38,925 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-24 19:24:38,925 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-24 19:24:39,132 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-24 19:24:39,132 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-10-24 19:24:39,132 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-24 19:24:39,132 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-24 19:24:39,132 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-24 19:24:39,140 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-24 19:24:39,141 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-10-24 19:24:39,141 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-24 19:24:39,141 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-24 19:24:39,141 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-10-24 19:24:39,161 INFO L124 PetriNetUnfolderBase]: 12599/20909 cut-off events. [2024-10-24 19:24:39,161 INFO L125 PetriNetUnfolderBase]: For 48997/50482 co-relation queries the response was YES. [2024-10-24 19:24:39,230 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-24 19:24:39,303 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 139 selfloop transitions, 17 changer transitions 0/178 dead transitions. [2024-10-24 19:24:39,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 178 transitions, 1513 flow [2024-10-24 19:24:39,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 19:24:39,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 19:24:39,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 213 transitions. [2024-10-24 19:24:39,305 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6016949152542372 [2024-10-24 19:24:39,305 INFO L175 Difference]: Start difference. First operand has 118 places, 108 transitions, 723 flow. Second operand 6 states and 213 transitions. [2024-10-24 19:24:39,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 178 transitions, 1513 flow [2024-10-24 19:24:39,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 178 transitions, 1513 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 19:24:39,377 INFO L231 Difference]: Finished difference. Result has 121 places, 106 transitions, 753 flow [2024-10-24 19:24:39,377 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-24 19:24:39,378 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 63 predicate places. [2024-10-24 19:24:39,378 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 106 transitions, 753 flow [2024-10-24 19:24:39,378 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-24 19:24:39,378 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:24:39,378 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:24:39,381 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-24 19:24:39,580 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-24 19:24:39,581 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-24 19:24:39,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:24:39,581 INFO L85 PathProgramCache]: Analyzing trace with hash -876934459, now seen corresponding path program 1 times [2024-10-24 19:24:39,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:24:39,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1591776964] [2024-10-24 19:24:39,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:24:39,581 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-24 19:24:39,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:24:39,583 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-24 19:24:39,583 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-24 19:24:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:24:39,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-24 19:24:39,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:24:39,677 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-24 19:24:39,840 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-24 19:24:39,840 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 19:24:40,281 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-24 19:24:40,281 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:24:40,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1591776964] [2024-10-24 19:24:40,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1591776964] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 19:24:40,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 19:24:40,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2024-10-24 19:24:40,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438242138] [2024-10-24 19:24:40,281 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 19:24:40,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 19:24:40,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:24:40,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 19:24:40,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-24 19:24:41,979 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 59 [2024-10-24 19:24:41,983 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-24 19:24:41,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:24:41,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 59 [2024-10-24 19:24:41,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:24:45,151 INFO L124 PetriNetUnfolderBase]: 11886/18776 cut-off events. [2024-10-24 19:24:45,151 INFO L125 PetriNetUnfolderBase]: For 50546/51860 co-relation queries the response was YES. [2024-10-24 19:24:45,216 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-24 19:24:45,279 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 120 selfloop transitions, 32 changer transitions 0/168 dead transitions. [2024-10-24 19:24:45,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 168 transitions, 1393 flow [2024-10-24 19:24:45,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 19:24:45,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-24 19:24:45,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 287 transitions. [2024-10-24 19:24:45,284 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6080508474576272 [2024-10-24 19:24:45,284 INFO L175 Difference]: Start difference. First operand has 121 places, 106 transitions, 753 flow. Second operand 8 states and 287 transitions. [2024-10-24 19:24:45,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 168 transitions, 1393 flow [2024-10-24 19:24:45,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 168 transitions, 1347 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-24 19:24:45,373 INFO L231 Difference]: Finished difference. Result has 125 places, 109 transitions, 819 flow [2024-10-24 19:24:45,374 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-24 19:24:45,374 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 67 predicate places. [2024-10-24 19:24:45,374 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 109 transitions, 819 flow [2024-10-24 19:24:45,374 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-24 19:24:45,374 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:24:45,374 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:24:45,382 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-24 19:24:45,577 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-24 19:24:45,577 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-24 19:24:45,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:24:45,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1285061974, now seen corresponding path program 1 times [2024-10-24 19:24:45,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:24:45,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [75740087] [2024-10-24 19:24:45,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:24:45,582 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-24 19:24:45,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:24:45,584 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-24 19:24:45,585 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-24 19:24:45,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:24:45,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 19:24:45,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:24:45,707 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-24 19:24:45,707 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 19:24:45,782 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-24 19:24:45,863 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-24 19:24:45,863 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:24:45,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [75740087] [2024-10-24 19:24:45,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [75740087] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 19:24:45,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 19:24:45,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2024-10-24 19:24:45,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862690962] [2024-10-24 19:24:45,864 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 19:24:45,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 19:24:45,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:24:45,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 19:24:45,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-10-24 19:24:46,495 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 59 [2024-10-24 19:24:46,496 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-24 19:24:46,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:24:46,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 59 [2024-10-24 19:24:46,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:24:53,485 INFO L124 PetriNetUnfolderBase]: 36754/54246 cut-off events. [2024-10-24 19:24:53,485 INFO L125 PetriNetUnfolderBase]: For 145746/147098 co-relation queries the response was YES. [2024-10-24 19:24:53,965 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-24 19:24:54,172 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 467 selfloop transitions, 51 changer transitions 0/530 dead transitions. [2024-10-24 19:24:54,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 530 transitions, 4904 flow [2024-10-24 19:24:54,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 19:24:54,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-24 19:24:54,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 511 transitions. [2024-10-24 19:24:54,175 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.666232073011734 [2024-10-24 19:24:54,175 INFO L175 Difference]: Start difference. First operand has 125 places, 109 transitions, 819 flow. Second operand 13 states and 511 transitions. [2024-10-24 19:24:54,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 530 transitions, 4904 flow [2024-10-24 19:24:54,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 530 transitions, 4791 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-24 19:24:54,667 INFO L231 Difference]: Finished difference. Result has 138 places, 142 transitions, 1208 flow [2024-10-24 19:24:54,667 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-24 19:24:54,668 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 80 predicate places. [2024-10-24 19:24:54,668 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 142 transitions, 1208 flow [2024-10-24 19:24:54,668 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-24 19:24:54,668 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:24:54,668 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:24:54,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-10-24 19:24:54,872 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-24 19:24:54,872 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-24 19:24:54,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:24:54,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1182215116, now seen corresponding path program 1 times [2024-10-24 19:24:54,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:24:54,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [441743155] [2024-10-24 19:24:54,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:24:54,873 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-24 19:24:54,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:24:54,874 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-24 19:24:54,876 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-24 19:24:54,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:24:54,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-24 19:24:54,946 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:24:54,954 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-24 19:24:55,141 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-24 19:24:55,141 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 19:24:55,602 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-24 19:24:55,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:24:55,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [441743155] [2024-10-24 19:24:55,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [441743155] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 19:24:55,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 19:24:55,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2024-10-24 19:24:55,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817461175] [2024-10-24 19:24:55,602 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 19:24:55,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 19:24:55,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:24:55,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 19:24:55,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-24 19:24:56,930 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 59 [2024-10-24 19:24:56,931 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-24 19:24:56,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:24:56,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 59 [2024-10-24 19:24:56,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:25:03,631 INFO L124 PetriNetUnfolderBase]: 28782/44374 cut-off events. [2024-10-24 19:25:03,631 INFO L125 PetriNetUnfolderBase]: For 172923/176079 co-relation queries the response was YES. [2024-10-24 19:25:03,989 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-24 19:25:04,152 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 134 selfloop transitions, 35 changer transitions 8/201 dead transitions. [2024-10-24 19:25:04,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 201 transitions, 1942 flow [2024-10-24 19:25:04,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 19:25:04,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-24 19:25:04,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 281 transitions. [2024-10-24 19:25:04,155 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5953389830508474 [2024-10-24 19:25:04,155 INFO L175 Difference]: Start difference. First operand has 138 places, 142 transitions, 1208 flow. Second operand 8 states and 281 transitions. [2024-10-24 19:25:04,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 201 transitions, 1942 flow [2024-10-24 19:25:04,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 201 transitions, 1852 flow, removed 30 selfloop flow, removed 4 redundant places. [2024-10-24 19:25:04,631 INFO L231 Difference]: Finished difference. Result has 143 places, 143 transitions, 1220 flow [2024-10-24 19:25:04,631 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-24 19:25:04,631 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 85 predicate places. [2024-10-24 19:25:04,632 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 143 transitions, 1220 flow [2024-10-24 19:25:04,632 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-24 19:25:04,632 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:25:04,632 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:25:04,636 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-24 19:25:04,832 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-24 19:25:04,832 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-24 19:25:04,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:25:04,833 INFO L85 PathProgramCache]: Analyzing trace with hash 117381299, now seen corresponding path program 2 times [2024-10-24 19:25:04,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:25:04,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [506142101] [2024-10-24 19:25:04,833 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 19:25:04,833 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-24 19:25:04,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:25:04,836 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-24 19:25:04,836 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-24 19:25:04,892 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 19:25:04,892 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 19:25:04,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 19:25:04,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:25:04,902 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-24 19:25:05,177 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-24 19:25:05,177 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 19:25:05,818 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-24 19:25:05,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:25:05,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [506142101] [2024-10-24 19:25:05,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [506142101] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 19:25:05,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 19:25:05,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 13 [2024-10-24 19:25:05,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171565508] [2024-10-24 19:25:05,819 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 19:25:05,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 19:25:05,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:25:05,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 19:25:05,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2024-10-24 19:25:07,198 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2024-10-24 19:25:07,199 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-24 19:25:07,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:25:07,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2024-10-24 19:25:07,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:25:15,569 INFO L124 PetriNetUnfolderBase]: 33317/52138 cut-off events. [2024-10-24 19:25:15,570 INFO L125 PetriNetUnfolderBase]: For 185126/186320 co-relation queries the response was YES. [2024-10-24 19:25:16,085 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-24 19:25:16,344 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 402 selfloop transitions, 36 changer transitions 4/474 dead transitions. [2024-10-24 19:25:16,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 474 transitions, 4396 flow [2024-10-24 19:25:16,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 19:25:16,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-24 19:25:16,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 529 transitions. [2024-10-24 19:25:16,346 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6897001303780965 [2024-10-24 19:25:16,346 INFO L175 Difference]: Start difference. First operand has 143 places, 143 transitions, 1220 flow. Second operand 13 states and 529 transitions. [2024-10-24 19:25:16,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 474 transitions, 4396 flow [2024-10-24 19:25:17,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 474 transitions, 4291 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-10-24 19:25:17,016 INFO L231 Difference]: Finished difference. Result has 156 places, 153 transitions, 1383 flow [2024-10-24 19:25:17,016 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-24 19:25:17,017 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 98 predicate places. [2024-10-24 19:25:17,017 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 153 transitions, 1383 flow [2024-10-24 19:25:17,017 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-24 19:25:17,017 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:25:17,017 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:25:17,022 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-24 19:25:17,218 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-24 19:25:17,219 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-24 19:25:17,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:25:17,219 INFO L85 PathProgramCache]: Analyzing trace with hash 872488610, now seen corresponding path program 2 times [2024-10-24 19:25:17,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:25:17,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1610409856] [2024-10-24 19:25:17,220 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 19:25:17,220 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-24 19:25:17,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:25:17,225 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-24 19:25:17,230 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-24 19:25:17,300 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 19:25:17,301 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 19:25:17,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 19:25:17,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:25:17,316 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-24 19:25:17,683 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-24 19:25:17,684 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 19:25:18,492 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-24 19:25:18,493 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:25:18,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1610409856] [2024-10-24 19:25:18,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1610409856] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 19:25:18,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 19:25:18,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2024-10-24 19:25:18,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736680587] [2024-10-24 19:25:18,494 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 19:25:18,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 19:25:18,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:25:18,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 19:25:18,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-10-24 19:25:20,395 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 59 [2024-10-24 19:25:20,396 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-24 19:25:20,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:25:20,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 59 [2024-10-24 19:25:20,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand