./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-sum-array-hom.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sum-array-hom.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 37731ec014f4053387ac8b56c0764486866d63670c206743514c9636df9b594a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:44:48,909 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:44:48,965 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 12:44:48,974 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:44:48,975 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:44:49,010 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:44:49,017 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:44:49,018 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:44:49,018 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:44:49,019 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:44:49,019 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:44:49,019 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:44:49,020 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:44:49,020 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:44:49,021 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:44:49,021 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:44:49,022 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:44:49,022 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:44:49,022 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:44:49,022 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:44:49,023 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:44:49,024 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:44:49,024 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:44:49,024 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:44:49,025 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:44:49,028 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:44:49,029 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:44:49,029 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:44:49,029 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:44:49,029 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:44:49,030 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:44:49,030 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:44:49,030 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:44:49,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:44:49,030 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:44:49,031 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:44:49,031 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 12:44:49,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 12:44:49,031 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:44:49,031 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:44:49,032 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:44:49,034 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:44:49,035 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 -> 37731ec014f4053387ac8b56c0764486866d63670c206743514c9636df9b594a [2024-10-13 12:44:49,321 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:44:49,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:44:49,351 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:44:49,352 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:44:49,353 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:44:49,354 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c [2024-10-13 12:44:50,772 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:44:50,959 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:44:50,960 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c [2024-10-13 12:44:50,969 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a20786aff/4f7367f92fbc499ebd10d8fde4e26741/FLAG16b6ebd27 [2024-10-13 12:44:50,988 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a20786aff/4f7367f92fbc499ebd10d8fde4e26741 [2024-10-13 12:44:50,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:44:50,992 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:44:50,994 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:44:50,994 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:44:51,004 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:44:51,005 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:44:50" (1/1) ... [2024-10-13 12:44:51,006 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ea02e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:51, skipping insertion in model container [2024-10-13 12:44:51,006 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:44:50" (1/1) ... [2024-10-13 12:44:51,032 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:44:51,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:44:51,271 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-13 12:44:51,272 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@32a3b8a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:51, skipping insertion in model container [2024-10-13 12:44:51,272 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:44:51,273 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-13 12:44:51,275 INFO L158 Benchmark]: Toolchain (without parser) took 281.32ms. Allocated memory is still 169.9MB. Free memory was 119.5MB in the beginning and 107.5MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 12:44:51,276 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 96.5MB. Free memory is still 58.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:44:51,277 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.45ms. Allocated memory is still 169.9MB. Free memory was 119.5MB in the beginning and 108.2MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 12:44:51,278 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.25ms. Allocated memory is still 96.5MB. Free memory is still 58.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 278.45ms. Allocated memory is still 169.9MB. Free memory was 119.5MB in the beginning and 108.2MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 99]: 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-sum-array-hom.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 37731ec014f4053387ac8b56c0764486866d63670c206743514c9636df9b594a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:44:53,294 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:44:53,375 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-13 12:44:53,383 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:44:53,383 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:44:53,412 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:44:53,412 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:44:53,413 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:44:53,413 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:44:53,414 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:44:53,414 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:44:53,414 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:44:53,415 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:44:53,416 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:44:53,416 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:44:53,416 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:44:53,417 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:44:53,417 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:44:53,418 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:44:53,418 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:44:53,418 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:44:53,423 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:44:53,423 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:44:53,423 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:44:53,423 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:44:53,424 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 12:44:53,424 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:44:53,424 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 12:44:53,424 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:44:53,424 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:44:53,425 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:44:53,425 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:44:53,425 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:44:53,425 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:44:53,426 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:44:53,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:44:53,430 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:44:53,430 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:44:53,430 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 12:44:53,431 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 12:44:53,431 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:44:53,431 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:44:53,431 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:44:53,432 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:44:53,432 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 12:44:53,432 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 -> 37731ec014f4053387ac8b56c0764486866d63670c206743514c9636df9b594a [2024-10-13 12:44:53,757 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:44:53,780 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:44:53,783 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:44:53,784 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:44:53,785 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:44:53,787 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c [2024-10-13 12:44:55,329 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:44:55,533 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:44:55,534 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c [2024-10-13 12:44:55,556 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83fe28934/99a32757454c4097bf2f0e762f7b2f1f/FLAGe4dad5e36 [2024-10-13 12:44:55,900 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83fe28934/99a32757454c4097bf2f0e762f7b2f1f [2024-10-13 12:44:55,902 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:44:55,904 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:44:55,905 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:44:55,905 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:44:55,910 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:44:55,911 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:44:55" (1/1) ... [2024-10-13 12:44:55,912 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c94ceee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:55, skipping insertion in model container [2024-10-13 12:44:55,912 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:44:55" (1/1) ... [2024-10-13 12:44:55,933 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:44:56,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:44:56,186 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-13 12:44:56,191 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:44:56,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:44:56,225 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:44:56,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:44:56,283 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:44:56,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:56 WrapperNode [2024-10-13 12:44:56,284 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:44:56,285 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:44:56,285 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:44:56,285 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:44:56,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:56" (1/1) ... [2024-10-13 12:44:56,307 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:56" (1/1) ... [2024-10-13 12:44:56,334 INFO L138 Inliner]: procedures = 26, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 86 [2024-10-13 12:44:56,337 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:44:56,337 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:44:56,338 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:44:56,338 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:44:56,348 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:56" (1/1) ... [2024-10-13 12:44:56,349 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:56" (1/1) ... [2024-10-13 12:44:56,354 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:56" (1/1) ... [2024-10-13 12:44:56,386 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-10-13 12:44:56,390 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:56" (1/1) ... [2024-10-13 12:44:56,390 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:56" (1/1) ... [2024-10-13 12:44:56,400 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:56" (1/1) ... [2024-10-13 12:44:56,407 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:56" (1/1) ... [2024-10-13 12:44:56,411 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:56" (1/1) ... [2024-10-13 12:44:56,412 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:56" (1/1) ... [2024-10-13 12:44:56,420 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:44:56,421 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:44:56,421 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:44:56,421 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:44:56,421 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:56" (1/1) ... [2024-10-13 12:44:56,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:44:56,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:44:56,455 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 12:44:56,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 12:44:56,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:44:56,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 12:44:56,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 12:44:56,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 12:44:56,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 12:44:56,513 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-13 12:44:56,513 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-13 12:44:56,513 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-13 12:44:56,513 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-13 12:44:56,514 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-13 12:44:56,514 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-13 12:44:56,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 12:44:56,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:44:56,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:44:56,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 12:44:56,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 12:44:56,519 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 12:44:56,657 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:44:56,659 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:44:57,049 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 12:44:57,052 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:44:57,282 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:44:57,283 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-13 12:44:57,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:44:57 BoogieIcfgContainer [2024-10-13 12:44:57,283 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:44:57,285 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:44:57,285 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:44:57,289 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:44:57,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:44:55" (1/3) ... [2024-10-13 12:44:57,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@323aac13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:44:57, skipping insertion in model container [2024-10-13 12:44:57,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:56" (2/3) ... [2024-10-13 12:44:57,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@323aac13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:44:57, skipping insertion in model container [2024-10-13 12:44:57,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:44:57" (3/3) ... [2024-10-13 12:44:57,293 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-sum-array-hom.wvr.c [2024-10-13 12:44:57,309 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:44:57,310 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-10-13 12:44:57,310 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 12:44:57,375 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-13 12:44:57,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 41 transitions, 103 flow [2024-10-13 12:44:57,441 INFO L124 PetriNetUnfolderBase]: 4/38 cut-off events. [2024-10-13 12:44:57,442 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-13 12:44:57,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 38 events. 4/38 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 64 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2024-10-13 12:44:57,447 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 41 transitions, 103 flow [2024-10-13 12:44:57,450 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 37 transitions, 92 flow [2024-10-13 12:44:57,463 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:44:57,472 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;@7fbfeb8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:44:57,472 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2024-10-13 12:44:57,480 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:44:57,480 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-10-13 12:44:57,481 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:44:57,481 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:44:57,482 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-13 12:44:57,485 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-13 12:44:57,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:44:57,491 INFO L85 PathProgramCache]: Analyzing trace with hash 404545, now seen corresponding path program 1 times [2024-10-13 12:44:57,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:44:57,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1782472807] [2024-10-13 12:44:57,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:44:57,504 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:44:57,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:44:57,505 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:44:57,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 12:44:57,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:44:57,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:44:57,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:44:57,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 12:44:57,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:44:57,674 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:44:57,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:44:57,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1782472807] [2024-10-13 12:44:57,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1782472807] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:44:57,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:44:57,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:44:57,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354143998] [2024-10-13 12:44:57,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:44:57,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:44:57,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:44:57,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:44:57,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:44:57,744 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-10-13 12:44:57,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:44:57,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:44:57,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-10-13 12:44:57,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:44:57,928 INFO L124 PetriNetUnfolderBase]: 200/345 cut-off events. [2024-10-13 12:44:57,929 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-10-13 12:44:57,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 684 conditions, 345 events. 200/345 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1163 event pairs, 124 based on Foata normal form. 1/316 useless extension candidates. Maximal degree in co-relation 582. Up to 293 conditions per place. [2024-10-13 12:44:57,935 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 21 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2024-10-13 12:44:57,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 34 transitions, 132 flow [2024-10-13 12:44:57,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:44:57,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:44:57,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2024-10-13 12:44:57,950 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5691056910569106 [2024-10-13 12:44:57,951 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 92 flow. Second operand 3 states and 70 transitions. [2024-10-13 12:44:57,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 34 transitions, 132 flow [2024-10-13 12:44:57,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 34 transitions, 120 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-13 12:44:57,957 INFO L231 Difference]: Finished difference. Result has 36 places, 34 transitions, 78 flow [2024-10-13 12:44:57,960 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=36, PETRI_TRANSITIONS=34} [2024-10-13 12:44:57,964 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, -7 predicate places. [2024-10-13 12:44:57,964 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 34 transitions, 78 flow [2024-10-13 12:44:57,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:44:57,964 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:44:57,965 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-13 12:44:57,968 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 (2)] Forceful destruction successful, exit code 0 [2024-10-13 12:44:58,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:44:58,167 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-13 12:44:58,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:44:58,168 INFO L85 PathProgramCache]: Analyzing trace with hash 404546, now seen corresponding path program 1 times [2024-10-13 12:44:58,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:44:58,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [666131766] [2024-10-13 12:44:58,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:44:58,169 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:44:58,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:44:58,172 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:44:58,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 12:44:58,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:44:58,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 12:44:58,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:44:58,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-13 12:44:58,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:44:58,322 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:44:58,322 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:44:58,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [666131766] [2024-10-13 12:44:58,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [666131766] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:44:58,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:44:58,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:44:58,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293342952] [2024-10-13 12:44:58,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:44:58,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:44:58,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:44:58,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:44:58,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:44:58,399 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-10-13 12:44:58,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 34 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:44:58,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:44:58,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-10-13 12:44:58,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:44:58,603 INFO L124 PetriNetUnfolderBase]: 201/348 cut-off events. [2024-10-13 12:44:58,603 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-13 12:44:58,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 666 conditions, 348 events. 201/348 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1172 event pairs, 124 based on Foata normal form. 0/318 useless extension candidates. Maximal degree in co-relation 644. Up to 298 conditions per place. [2024-10-13 12:44:58,607 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 23 selfloop transitions, 4 changer transitions 0/37 dead transitions. [2024-10-13 12:44:58,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 37 transitions, 140 flow [2024-10-13 12:44:58,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:44:58,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:44:58,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2024-10-13 12:44:58,609 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5365853658536586 [2024-10-13 12:44:58,609 INFO L175 Difference]: Start difference. First operand has 36 places, 34 transitions, 78 flow. Second operand 4 states and 88 transitions. [2024-10-13 12:44:58,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 37 transitions, 140 flow [2024-10-13 12:44:58,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:44:58,611 INFO L231 Difference]: Finished difference. Result has 39 places, 37 transitions, 101 flow [2024-10-13 12:44:58,612 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=39, PETRI_TRANSITIONS=37} [2024-10-13 12:44:58,612 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, -4 predicate places. [2024-10-13 12:44:58,613 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 101 flow [2024-10-13 12:44:58,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:44:58,613 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:44:58,613 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2024-10-13 12:44:58,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 12:44:58,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:44:58,816 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-13 12:44:58,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:44:58,817 INFO L85 PathProgramCache]: Analyzing trace with hash 388781164, now seen corresponding path program 1 times [2024-10-13 12:44:58,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:44:58,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [810990290] [2024-10-13 12:44:58,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:44:58,818 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:44:58,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:44:58,821 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:44:58,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 12:44:58,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:44:58,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 12:44:58,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:44:58,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-13 12:44:59,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:44:59,066 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:44:59,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:44:59,323 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:44:59,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [810990290] [2024-10-13 12:44:59,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [810990290] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:44:59,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:44:59,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-10-13 12:44:59,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097122783] [2024-10-13 12:44:59,324 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:44:59,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 12:44:59,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:44:59,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 12:44:59,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-13 12:44:59,607 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-10-13 12:44:59,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 101 flow. Second operand has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:44:59,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:44:59,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-10-13 12:44:59,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:45:00,090 INFO L124 PetriNetUnfolderBase]: 204/357 cut-off events. [2024-10-13 12:45:00,090 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-13 12:45:00,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 703 conditions, 357 events. 204/357 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1231 event pairs, 124 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 651. Up to 301 conditions per place. [2024-10-13 12:45:00,094 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 23 selfloop transitions, 13 changer transitions 0/46 dead transitions. [2024-10-13 12:45:00,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 209 flow [2024-10-13 12:45:00,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 12:45:00,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-13 12:45:00,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions. [2024-10-13 12:45:00,100 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4609756097560976 [2024-10-13 12:45:00,100 INFO L175 Difference]: Start difference. First operand has 39 places, 37 transitions, 101 flow. Second operand 10 states and 189 transitions. [2024-10-13 12:45:00,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 209 flow [2024-10-13 12:45:00,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 46 transitions, 206 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:45:00,103 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 178 flow [2024-10-13 12:45:00,103 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=178, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2024-10-13 12:45:00,104 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 7 predicate places. [2024-10-13 12:45:00,105 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 178 flow [2024-10-13 12:45:00,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:00,105 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:45:00,106 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 12:45:00,109 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-13 12:45:00,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:00,307 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-13 12:45:00,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:45:00,307 INFO L85 PathProgramCache]: Analyzing trace with hash -830666854, now seen corresponding path program 1 times [2024-10-13 12:45:00,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:45:00,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [760656758] [2024-10-13 12:45:00,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:45:00,308 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:00,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:45:00,309 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:45:00,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 12:45:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:45:00,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:45:00,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:45:00,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 12:45:00,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:45:00,400 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:45:00,400 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:45:00,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [760656758] [2024-10-13 12:45:00,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [760656758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:45:00,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:45:00,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:45:00,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453613921] [2024-10-13 12:45:00,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:45:00,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:45:00,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:45:00,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:45:00,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:45:00,444 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2024-10-13 12:45:00,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:00,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:45:00,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2024-10-13 12:45:00,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:45:00,544 INFO L124 PetriNetUnfolderBase]: 204/341 cut-off events. [2024-10-13 12:45:00,544 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-10-13 12:45:00,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 341 events. 204/341 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1076 event pairs, 124 based on Foata normal form. 0/327 useless extension candidates. Maximal degree in co-relation 675. Up to 296 conditions per place. [2024-10-13 12:45:00,547 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 29 selfloop transitions, 6 changer transitions 0/43 dead transitions. [2024-10-13 12:45:00,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 43 transitions, 242 flow [2024-10-13 12:45:00,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:45:00,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:45:00,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2024-10-13 12:45:00,549 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45121951219512196 [2024-10-13 12:45:00,549 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 178 flow. Second operand 4 states and 74 transitions. [2024-10-13 12:45:00,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 43 transitions, 242 flow [2024-10-13 12:45:00,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 43 transitions, 212 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-10-13 12:45:00,552 INFO L231 Difference]: Finished difference. Result has 47 places, 43 transitions, 154 flow [2024-10-13 12:45:00,552 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=47, PETRI_TRANSITIONS=43} [2024-10-13 12:45:00,553 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 4 predicate places. [2024-10-13 12:45:00,553 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 43 transitions, 154 flow [2024-10-13 12:45:00,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:00,553 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:45:00,553 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 12:45:00,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 12:45:00,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:00,757 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-13 12:45:00,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:45:00,758 INFO L85 PathProgramCache]: Analyzing trace with hash -830666853, now seen corresponding path program 1 times [2024-10-13 12:45:00,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:45:00,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [44447600] [2024-10-13 12:45:00,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:45:00,759 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:00,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:45:00,762 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:45:00,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 12:45:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:45:00,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 12:45:00,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:45:00,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-13 12:45:00,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:45:00,982 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:45:00,982 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:45:00,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [44447600] [2024-10-13 12:45:00,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [44447600] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:45:00,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:45:00,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:45:00,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505202756] [2024-10-13 12:45:00,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:45:00,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:45:00,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:45:00,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:45:00,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:45:01,118 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2024-10-13 12:45:01,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 43 transitions, 154 flow. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:01,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:45:01,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2024-10-13 12:45:01,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:45:01,447 INFO L124 PetriNetUnfolderBase]: 514/805 cut-off events. [2024-10-13 12:45:01,447 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-10-13 12:45:01,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1616 conditions, 805 events. 514/805 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3148 event pairs, 214 based on Foata normal form. 0/707 useless extension candidates. Maximal degree in co-relation 1585. Up to 492 conditions per place. [2024-10-13 12:45:01,452 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 51 selfloop transitions, 12 changer transitions 0/69 dead transitions. [2024-10-13 12:45:01,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 69 transitions, 336 flow [2024-10-13 12:45:01,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:45:01,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 12:45:01,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2024-10-13 12:45:01,454 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.556910569105691 [2024-10-13 12:45:01,454 INFO L175 Difference]: Start difference. First operand has 47 places, 43 transitions, 154 flow. Second operand 6 states and 137 transitions. [2024-10-13 12:45:01,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 69 transitions, 336 flow [2024-10-13 12:45:01,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 69 transitions, 329 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:45:01,457 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 204 flow [2024-10-13 12:45:01,457 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=204, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2024-10-13 12:45:01,460 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places. [2024-10-13 12:45:01,461 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 204 flow [2024-10-13 12:45:01,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:01,462 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:45:01,462 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-10-13 12:45:01,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-13 12:45:01,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:01,663 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-13 12:45:01,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:45:01,663 INFO L85 PathProgramCache]: Analyzing trace with hash 593084543, now seen corresponding path program 1 times [2024-10-13 12:45:01,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:45:01,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [140778917] [2024-10-13 12:45:01,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:45:01,664 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:01,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:45:01,667 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:45:01,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-13 12:45:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:45:01,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-13 12:45:01,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:45:01,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-13 12:45:01,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:45:01,899 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:45:01,900 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:45:01,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [140778917] [2024-10-13 12:45:01,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [140778917] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:45:01,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:45:01,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:45:01,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496166421] [2024-10-13 12:45:01,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:45:01,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:45:01,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:45:01,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:45:01,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:45:02,001 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 41 [2024-10-13 12:45:02,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 204 flow. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:02,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:45:02,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 41 [2024-10-13 12:45:02,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:45:02,267 INFO L124 PetriNetUnfolderBase]: 567/971 cut-off events. [2024-10-13 12:45:02,268 INFO L125 PetriNetUnfolderBase]: For 645/822 co-relation queries the response was YES. [2024-10-13 12:45:02,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2451 conditions, 971 events. 567/971 cut-off events. For 645/822 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4440 event pairs, 308 based on Foata normal form. 141/1097 useless extension candidates. Maximal degree in co-relation 2417. Up to 628 conditions per place. [2024-10-13 12:45:02,275 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 59 selfloop transitions, 5 changer transitions 0/73 dead transitions. [2024-10-13 12:45:02,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 73 transitions, 396 flow [2024-10-13 12:45:02,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:45:02,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:45:02,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2024-10-13 12:45:02,276 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6634146341463415 [2024-10-13 12:45:02,277 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 204 flow. Second operand 5 states and 136 transitions. [2024-10-13 12:45:02,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 73 transitions, 396 flow [2024-10-13 12:45:02,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 73 transitions, 379 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-13 12:45:02,281 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 230 flow [2024-10-13 12:45:02,281 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=230, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2024-10-13 12:45:02,282 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 12 predicate places. [2024-10-13 12:45:02,282 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 230 flow [2024-10-13 12:45:02,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:02,282 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:45:02,282 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:45:02,287 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 (7)] Forceful destruction successful, exit code 0 [2024-10-13 12:45:02,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:02,483 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-13 12:45:02,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:45:02,483 INFO L85 PathProgramCache]: Analyzing trace with hash 583463203, now seen corresponding path program 1 times [2024-10-13 12:45:02,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:45:02,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2078006869] [2024-10-13 12:45:02,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:45:02,484 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:02,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:45:02,485 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:45:02,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-13 12:45:02,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:45:02,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-13 12:45:02,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:45:02,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-13 12:45:02,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:45:02,769 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:45:02,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:45:02,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2078006869] [2024-10-13 12:45:02,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2078006869] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:45:02,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:45:02,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:45:02,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232716562] [2024-10-13 12:45:02,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:45:02,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:45:02,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:45:02,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:45:02,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:45:02,912 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2024-10-13 12:45:02,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 230 flow. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:02,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:45:02,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2024-10-13 12:45:02,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:45:03,415 INFO L124 PetriNetUnfolderBase]: 1273/1915 cut-off events. [2024-10-13 12:45:03,415 INFO L125 PetriNetUnfolderBase]: For 2576/2909 co-relation queries the response was YES. [2024-10-13 12:45:03,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5543 conditions, 1915 events. 1273/1915 cut-off events. For 2576/2909 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 8570 event pairs, 479 based on Foata normal form. 198/1894 useless extension candidates. Maximal degree in co-relation 5508. Up to 1200 conditions per place. [2024-10-13 12:45:03,428 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 63 selfloop transitions, 16 changer transitions 0/86 dead transitions. [2024-10-13 12:45:03,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 86 transitions, 560 flow [2024-10-13 12:45:03,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:45:03,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 12:45:03,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 135 transitions. [2024-10-13 12:45:03,430 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5487804878048781 [2024-10-13 12:45:03,430 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 230 flow. Second operand 6 states and 135 transitions. [2024-10-13 12:45:03,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 86 transitions, 560 flow [2024-10-13 12:45:03,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 86 transitions, 555 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:45:03,434 INFO L231 Difference]: Finished difference. Result has 60 places, 59 transitions, 338 flow [2024-10-13 12:45:03,434 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=338, PETRI_PLACES=60, PETRI_TRANSITIONS=59} [2024-10-13 12:45:03,435 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 17 predicate places. [2024-10-13 12:45:03,435 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 59 transitions, 338 flow [2024-10-13 12:45:03,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:03,435 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:45:03,435 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:45:03,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-13 12:45:03,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:03,642 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-13 12:45:03,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:45:03,642 INFO L85 PathProgramCache]: Analyzing trace with hash 494412437, now seen corresponding path program 1 times [2024-10-13 12:45:03,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:45:03,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1363031500] [2024-10-13 12:45:03,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:45:03,643 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:03,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:45:03,646 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:45:03,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-13 12:45:03,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:45:03,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 12:45:03,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:45:03,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-13 12:45:03,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 12:45:03,937 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:45:04,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 12:45:04,347 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:45:04,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1363031500] [2024-10-13 12:45:04,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1363031500] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:45:04,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:45:04,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2024-10-13 12:45:04,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412637805] [2024-10-13 12:45:04,347 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:45:04,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 12:45:04,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:45:04,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 12:45:04,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-10-13 12:45:04,990 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2024-10-13 12:45:04,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 59 transitions, 338 flow. Second operand has 14 states, 14 states have (on average 15.428571428571429) internal successors, (216), 14 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:04,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:45:04,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2024-10-13 12:45:04,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:45:06,726 INFO L124 PetriNetUnfolderBase]: 2365/3462 cut-off events. [2024-10-13 12:45:06,726 INFO L125 PetriNetUnfolderBase]: For 7121/7437 co-relation queries the response was YES. [2024-10-13 12:45:06,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12299 conditions, 3462 events. 2365/3462 cut-off events. For 7121/7437 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 15439 event pairs, 440 based on Foata normal form. 308/3691 useless extension candidates. Maximal degree in co-relation 12261. Up to 1176 conditions per place. [2024-10-13 12:45:06,754 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 171 selfloop transitions, 29 changer transitions 0/207 dead transitions. [2024-10-13 12:45:06,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 207 transitions, 1484 flow [2024-10-13 12:45:06,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 12:45:06,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-13 12:45:06,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 326 transitions. [2024-10-13 12:45:06,757 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6116322701688556 [2024-10-13 12:45:06,757 INFO L175 Difference]: Start difference. First operand has 60 places, 59 transitions, 338 flow. Second operand 13 states and 326 transitions. [2024-10-13 12:45:06,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 207 transitions, 1484 flow [2024-10-13 12:45:06,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 207 transitions, 1477 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:45:06,768 INFO L231 Difference]: Finished difference. Result has 73 places, 72 transitions, 490 flow [2024-10-13 12:45:06,769 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=490, PETRI_PLACES=73, PETRI_TRANSITIONS=72} [2024-10-13 12:45:06,769 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 30 predicate places. [2024-10-13 12:45:06,770 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 72 transitions, 490 flow [2024-10-13 12:45:06,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 15.428571428571429) internal successors, (216), 14 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:06,770 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:45:06,770 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:45:06,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-10-13 12:45:06,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:06,972 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-13 12:45:06,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:45:06,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1938610701, now seen corresponding path program 1 times [2024-10-13 12:45:06,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:45:06,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1845281154] [2024-10-13 12:45:06,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:45:06,972 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:06,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:45:06,973 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:45:06,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-13 12:45:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:45:07,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 12:45:07,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:45:07,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:45:07,091 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:45:07,091 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:45:07,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1845281154] [2024-10-13 12:45:07,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1845281154] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:45:07,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:45:07,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:45:07,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648026339] [2024-10-13 12:45:07,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:45:07,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:45:07,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:45:07,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:45:07,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:45:07,135 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-10-13 12:45:07,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 72 transitions, 490 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:07,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:45:07,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-10-13 12:45:07,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:45:07,748 INFO L124 PetriNetUnfolderBase]: 2731/4008 cut-off events. [2024-10-13 12:45:07,748 INFO L125 PetriNetUnfolderBase]: For 17340/18302 co-relation queries the response was YES. [2024-10-13 12:45:07,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16480 conditions, 4008 events. 2731/4008 cut-off events. For 17340/18302 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 19226 event pairs, 1349 based on Foata normal form. 176/3735 useless extension candidates. Maximal degree in co-relation 16438. Up to 3380 conditions per place. [2024-10-13 12:45:07,795 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 75 selfloop transitions, 5 changer transitions 0/93 dead transitions. [2024-10-13 12:45:07,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 93 transitions, 728 flow [2024-10-13 12:45:07,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:45:07,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:45:07,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2024-10-13 12:45:07,797 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6146341463414634 [2024-10-13 12:45:07,797 INFO L175 Difference]: Start difference. First operand has 73 places, 72 transitions, 490 flow. Second operand 5 states and 126 transitions. [2024-10-13 12:45:07,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 93 transitions, 728 flow [2024-10-13 12:45:07,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 93 transitions, 685 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-10-13 12:45:07,810 INFO L231 Difference]: Finished difference. Result has 75 places, 74 transitions, 474 flow [2024-10-13 12:45:07,812 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=474, PETRI_PLACES=75, PETRI_TRANSITIONS=74} [2024-10-13 12:45:07,812 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 32 predicate places. [2024-10-13 12:45:07,813 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 74 transitions, 474 flow [2024-10-13 12:45:07,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:07,813 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:45:07,813 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2024-10-13 12:45:07,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-13 12:45:08,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:08,014 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-13 12:45:08,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:45:08,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1858535958, now seen corresponding path program 2 times [2024-10-13 12:45:08,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:45:08,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1593828104] [2024-10-13 12:45:08,015 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 12:45:08,015 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:08,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:45:08,016 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:45:08,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-13 12:45:08,082 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 12:45:08,082 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:45:08,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 12:45:08,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:45:08,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-13 12:45:08,341 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:45:08,341 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:45:08,869 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:45:08,869 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:45:08,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1593828104] [2024-10-13 12:45:08,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1593828104] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:45:08,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:45:08,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2024-10-13 12:45:08,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904940819] [2024-10-13 12:45:08,870 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:45:08,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 12:45:08,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:45:08,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 12:45:08,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-10-13 12:45:09,400 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-10-13 12:45:09,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 74 transitions, 474 flow. Second operand has 14 states, 14 states have (on average 16.571428571428573) internal successors, (232), 14 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:09,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:45:09,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-10-13 12:45:09,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:45:11,553 INFO L124 PetriNetUnfolderBase]: 2133/3282 cut-off events. [2024-10-13 12:45:11,553 INFO L125 PetriNetUnfolderBase]: For 12314/13070 co-relation queries the response was YES. [2024-10-13 12:45:11,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13276 conditions, 3282 events. 2133/3282 cut-off events. For 12314/13070 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 16385 event pairs, 1053 based on Foata normal form. 129/3189 useless extension candidates. Maximal degree in co-relation 13153. Up to 2773 conditions per place. [2024-10-13 12:45:11,577 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 48 selfloop transitions, 31 changer transitions 0/92 dead transitions. [2024-10-13 12:45:11,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 92 transitions, 734 flow [2024-10-13 12:45:11,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-13 12:45:11,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-10-13 12:45:11,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 390 transitions. [2024-10-13 12:45:11,580 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.43237250554323725 [2024-10-13 12:45:11,580 INFO L175 Difference]: Start difference. First operand has 75 places, 74 transitions, 474 flow. Second operand 22 states and 390 transitions. [2024-10-13 12:45:11,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 92 transitions, 734 flow [2024-10-13 12:45:11,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 92 transitions, 729 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:45:11,590 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 663 flow [2024-10-13 12:45:11,590 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=663, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2024-10-13 12:45:11,591 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 57 predicate places. [2024-10-13 12:45:11,591 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 92 transitions, 663 flow [2024-10-13 12:45:11,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 16.571428571428573) internal successors, (232), 14 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:11,591 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:45:11,591 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:45:11,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-13 12:45:11,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:11,792 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-13 12:45:11,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:45:11,793 INFO L85 PathProgramCache]: Analyzing trace with hash 2021743241, now seen corresponding path program 1 times [2024-10-13 12:45:11,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:45:11,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [164040848] [2024-10-13 12:45:11,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:45:11,793 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:11,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:45:11,794 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:45:11,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-13 12:45:11,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:45:11,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-13 12:45:11,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:45:11,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-13 12:45:12,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:45:12,229 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:45:12,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:45:12,943 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:45:12,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [164040848] [2024-10-13 12:45:12,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [164040848] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:45:12,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:45:12,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2024-10-13 12:45:12,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824465988] [2024-10-13 12:45:12,943 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:45:12,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 12:45:12,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:45:12,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 12:45:12,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-13 12:45:14,029 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2024-10-13 12:45:14,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 92 transitions, 663 flow. Second operand has 14 states, 14 states have (on average 14.714285714285714) internal successors, (206), 14 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:14,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:45:14,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2024-10-13 12:45:14,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:45:17,133 INFO L124 PetriNetUnfolderBase]: 9789/13504 cut-off events. [2024-10-13 12:45:17,133 INFO L125 PetriNetUnfolderBase]: For 52797/56182 co-relation queries the response was YES. [2024-10-13 12:45:17,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56580 conditions, 13504 events. 9789/13504 cut-off events. For 52797/56182 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 69686 event pairs, 3867 based on Foata normal form. 880/12735 useless extension candidates. Maximal degree in co-relation 56517. Up to 4683 conditions per place. [2024-10-13 12:45:17,265 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 257 selfloop transitions, 40 changer transitions 0/308 dead transitions. [2024-10-13 12:45:17,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 308 transitions, 2701 flow [2024-10-13 12:45:17,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 12:45:17,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-10-13 12:45:17,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 337 transitions. [2024-10-13 12:45:17,268 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5479674796747968 [2024-10-13 12:45:17,268 INFO L175 Difference]: Start difference. First operand has 100 places, 92 transitions, 663 flow. Second operand 15 states and 337 transitions. [2024-10-13 12:45:17,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 308 transitions, 2701 flow [2024-10-13 12:45:17,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 308 transitions, 2621 flow, removed 27 selfloop flow, removed 9 redundant places. [2024-10-13 12:45:17,321 INFO L231 Difference]: Finished difference. Result has 109 places, 106 transitions, 825 flow [2024-10-13 12:45:17,321 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=825, PETRI_PLACES=109, PETRI_TRANSITIONS=106} [2024-10-13 12:45:17,321 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 66 predicate places. [2024-10-13 12:45:17,322 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 106 transitions, 825 flow [2024-10-13 12:45:17,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 14.714285714285714) internal successors, (206), 14 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:17,322 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:45:17,322 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:45:17,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-13 12:45:17,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:17,523 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-13 12:45:17,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:45:17,523 INFO L85 PathProgramCache]: Analyzing trace with hash 2027789661, now seen corresponding path program 1 times [2024-10-13 12:45:17,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:45:17,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1782002388] [2024-10-13 12:45:17,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:45:17,524 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:17,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:45:17,525 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:45:17,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-13 12:45:17,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:45:17,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 12:45:17,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:45:17,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-13 12:45:17,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 12:45:17,906 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:45:18,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 12:45:18,317 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:45:18,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1782002388] [2024-10-13 12:45:18,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1782002388] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:45:18,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:45:18,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2024-10-13 12:45:18,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10362654] [2024-10-13 12:45:18,318 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:45:18,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 12:45:18,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:45:18,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 12:45:18,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-10-13 12:45:18,894 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2024-10-13 12:45:18,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 106 transitions, 825 flow. Second operand has 14 states, 14 states have (on average 15.714285714285714) internal successors, (220), 14 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:18,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:45:18,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2024-10-13 12:45:18,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:45:21,836 INFO L124 PetriNetUnfolderBase]: 13975/19787 cut-off events. [2024-10-13 12:45:21,836 INFO L125 PetriNetUnfolderBase]: For 91979/100221 co-relation queries the response was YES. [2024-10-13 12:45:21,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87869 conditions, 19787 events. 13975/19787 cut-off events. For 91979/100221 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 110604 event pairs, 3363 based on Foata normal form. 2452/21594 useless extension candidates. Maximal degree in co-relation 87805. Up to 8193 conditions per place. [2024-10-13 12:45:22,016 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 299 selfloop transitions, 42 changer transitions 4/358 dead transitions. [2024-10-13 12:45:22,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 358 transitions, 3446 flow [2024-10-13 12:45:22,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 12:45:22,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-13 12:45:22,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 314 transitions. [2024-10-13 12:45:22,021 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5891181988742964 [2024-10-13 12:45:22,021 INFO L175 Difference]: Start difference. First operand has 109 places, 106 transitions, 825 flow. Second operand 13 states and 314 transitions. [2024-10-13 12:45:22,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 358 transitions, 3446 flow [2024-10-13 12:45:22,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 358 transitions, 3311 flow, removed 52 selfloop flow, removed 7 redundant places. [2024-10-13 12:45:22,215 INFO L231 Difference]: Finished difference. Result has 117 places, 119 transitions, 987 flow [2024-10-13 12:45:22,216 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=987, PETRI_PLACES=117, PETRI_TRANSITIONS=119} [2024-10-13 12:45:22,216 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 74 predicate places. [2024-10-13 12:45:22,217 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 119 transitions, 987 flow [2024-10-13 12:45:22,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 15.714285714285714) internal successors, (220), 14 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:22,217 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:45:22,217 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:45:22,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-13 12:45:22,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:22,418 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-13 12:45:22,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:45:22,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1506733761, now seen corresponding path program 2 times [2024-10-13 12:45:22,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:45:22,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1772464141] [2024-10-13 12:45:22,419 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 12:45:22,419 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:22,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:45:22,420 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:45:22,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-13 12:45:22,495 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 12:45:22,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:45:22,497 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-13 12:45:22,499 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:45:22,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-13 12:45:22,816 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:45:22,816 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:45:23,689 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:45:23,689 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:45:23,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1772464141] [2024-10-13 12:45:23,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1772464141] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:45:23,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:45:23,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2024-10-13 12:45:23,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317363394] [2024-10-13 12:45:23,690 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:45:23,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-13 12:45:23,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:45:23,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-13 12:45:23,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2024-10-13 12:45:25,023 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2024-10-13 12:45:25,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 119 transitions, 987 flow. Second operand has 19 states, 19 states have (on average 14.68421052631579) internal successors, (279), 19 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:25,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:45:25,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2024-10-13 12:45:25,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:45:30,191 INFO L124 PetriNetUnfolderBase]: 12117/17297 cut-off events. [2024-10-13 12:45:30,192 INFO L125 PetriNetUnfolderBase]: For 97808/102979 co-relation queries the response was YES. [2024-10-13 12:45:30,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84471 conditions, 17297 events. 12117/17297 cut-off events. For 97808/102979 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 95765 event pairs, 4210 based on Foata normal form. 1044/17534 useless extension candidates. Maximal degree in co-relation 84402. Up to 6630 conditions per place. [2024-10-13 12:45:30,407 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 347 selfloop transitions, 55 changer transitions 2/416 dead transitions. [2024-10-13 12:45:30,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 416 transitions, 4157 flow [2024-10-13 12:45:30,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 12:45:30,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-10-13 12:45:30,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 417 transitions. [2024-10-13 12:45:30,410 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5982783357245337 [2024-10-13 12:45:30,410 INFO L175 Difference]: Start difference. First operand has 117 places, 119 transitions, 987 flow. Second operand 17 states and 417 transitions. [2024-10-13 12:45:30,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 416 transitions, 4157 flow [2024-10-13 12:45:30,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 416 transitions, 3783 flow, removed 90 selfloop flow, removed 5 redundant places. [2024-10-13 12:45:30,603 INFO L231 Difference]: Finished difference. Result has 135 places, 147 transitions, 1340 flow [2024-10-13 12:45:30,603 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=909, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1340, PETRI_PLACES=135, PETRI_TRANSITIONS=147} [2024-10-13 12:45:30,604 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 92 predicate places. [2024-10-13 12:45:30,604 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 147 transitions, 1340 flow [2024-10-13 12:45:30,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 14.68421052631579) internal successors, (279), 19 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:30,604 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:45:30,604 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:45:30,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-13 12:45:30,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:30,805 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-13 12:45:30,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:45:30,806 INFO L85 PathProgramCache]: Analyzing trace with hash 2007698179, now seen corresponding path program 1 times [2024-10-13 12:45:30,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:45:30,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [485229806] [2024-10-13 12:45:30,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:45:30,807 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:30,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:45:30,810 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:45:30,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-13 12:45:30,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:45:30,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-13 12:45:30,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:45:30,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-13 12:45:31,349 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:45:31,349 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:45:32,931 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:45:32,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:45:32,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [485229806] [2024-10-13 12:45:32,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [485229806] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:45:32,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:45:32,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2024-10-13 12:45:32,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478842819] [2024-10-13 12:45:32,932 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:45:32,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-13 12:45:32,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:45:32,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 12:45:32,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2024-10-13 12:45:35,183 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2024-10-13 12:45:35,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 147 transitions, 1340 flow. Second operand has 18 states, 18 states have (on average 15.777777777777779) internal successors, (284), 18 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:35,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:45:35,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2024-10-13 12:45:35,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:45:46,332 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L49-->L48-6: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread1Thread1of1ForFork2_~i~0_9))) (let ((.cse1 (bvadd v_~A~0.offset_17 (_ bv4 32) .cse3)) (.cse0 (bvadd v_~A~0.offset_17 .cse3))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |v_#valid_26| v_~A~0.base_20))) (bvule .cse0 .cse1) (= v_thread1Thread1of1ForFork2_~i~0_10 (bvadd (_ bv1 32) v_thread1Thread1of1ForFork2_~i~0_9)) (bvule .cse1 (select |v_#length_21| v_~A~0.base_20)) (bvule (_ bv0 32) .cse0) (= (bvadd (let ((.cse2 (select |v_#memory_int#1_14| v_~A~0.base_20))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_17 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~A~0.offset_17 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~A~0.offset_17 (_ bv1 32) .cse3))) (select .cse2 .cse0))) v_~sum1~0_22) v_~sum1~0_21)))) InVars {~A~0.base=v_~A~0.base_20, ~A~0.offset=v_~A~0.offset_17, ~sum1~0=v_~sum1~0_22, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_9, #valid=|v_#valid_26|, #length=|v_#length_21|, #memory_int#1=|v_#memory_int#1_14|} OutVars{~A~0.base=v_~A~0.base_20, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork2_#t~mem1=|v_thread1Thread1of1ForFork2_#t~mem1_1|, ~sum1~0=v_~sum1~0_21, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_10, #valid=|v_#valid_26|, thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, #length=|v_#length_21|, #memory_int#1=|v_#memory_int#1_14|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem1, ~sum1~0, thread1Thread1of1ForFork2_~i~0, thread1Thread1of1ForFork2_#t~post2][350], [Black: 755#(and (or (and (bvule (bvadd (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) ~A~0.offset (_ bv8 32)) (bvadd (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) ~A~0.offset (_ bv12 32))) (bvule (bvadd (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) ~A~0.offset (_ bv12 32)) (select |#length| ~A~0.base))) (not (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv2 32)) ~N~0))) (or (not (bvslt (_ bv4 32) ~N~0)) (and (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base)) (bvule (bvadd ~A~0.offset (_ bv16 32)) (bvadd ~A~0.offset (_ bv20 32)))))), 338#true, 843#(or (and (bvule (bvadd ~A~0.offset (_ bv4 32) (bvmul ~M~0 (_ bv4 32))) (bvadd ~A~0.offset (_ bv8 32) (bvmul ~M~0 (_ bv4 32)))) (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul ~M~0 (_ bv4 32))) (select |#length| ~A~0.base))) (not (bvslt (bvadd ~M~0 (_ bv1 32)) ~N~0)) (not (bvslt ~M~0 ~N~0))), Black: 70#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (exists ((v_subst_1 (_ BitVec 32))) (and (= (bvmul (_ bv4 32) v_subst_1) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule v_subst_1 (_ bv1073741823 32)) (bvslt (_ bv0 32) v_subst_1))) (= (bvmul |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv4 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)), Black: 335#(and (bvsle ~M~0 ~N~0) (bvsge ~M~0 (_ bv0 32)) (bvsge thread3Thread1of1ForFork1_~i~2 (_ bv0 32)) (bvsle thread3Thread1of1ForFork1_~i~2 ~N~0) (not (bvslt (_ bv0 32) ~N~0))), 444#true, 7#L85true, Black: 210#(and (bvsge ~M~0 (_ bv0 32)) (= ~A~0.offset (_ bv0 32)) (= thread2Thread1of1ForFork0_~i~1 (_ bv0 32)) (exists ((~N~0 (_ BitVec 32))) (and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base))))), Black: 216#(and (bvsge ~M~0 (_ bv0 32)) (= ~A~0.offset (_ bv0 32)) (= thread2Thread1of1ForFork0_~i~1 (_ bv0 32)) (exists ((~N~0 (_ BitVec 32))) (and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)))) (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)))), Black: 537#(and (bvule (bvadd ~A~0.offset (_ bv4 32) (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))) (select |#length| ~A~0.base)) (or (and (bvule (bvadd ~A~0.offset (bvmul ~M~0 (_ bv4 32))) (bvadd ~A~0.offset (_ bv4 32) (bvmul ~M~0 (_ bv4 32)))) (bvule (bvadd ~A~0.offset (_ bv4 32) (bvmul ~M~0 (_ bv4 32))) (select |#length| ~A~0.base))) (not (bvslt ~M~0 ~N~0))) (bvule (bvadd ~A~0.offset (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))) (bvadd ~A~0.offset (_ bv4 32) (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))))), 296#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (or (not (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0)) (and (bvule (bvadd (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) (_ bv4 32)) (select |#length| ~A~0.base)) (bvule (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) (bvadd (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) (_ bv4 32)))))), Black: 533#(and (bvsle ~M~0 ~N~0) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (bvsge ~M~0 (_ bv0 32)) (bvsge thread3Thread1of1ForFork1_~i~2 (_ bv0 32)) (exists ((v_subst_10 (_ BitVec 32))) (and (not (bvslt (_ bv1 32) v_subst_10)) (bvslt thread3Thread1of1ForFork1_~i~2 v_subst_10))) (bvslt (_ bv0 32) ~N~0) (= ~A~0.offset (_ bv0 32)) (not (bvslt (_ bv1 32) ~N~0))), Black: 535#(and (or (and (bvule (bvadd ~A~0.offset (_ bv4 32) (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))) (select |#length| ~A~0.base)) (bvule (bvadd ~A~0.offset (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))) (bvadd ~A~0.offset (_ bv4 32) (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))))) (not (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0))) (or (and (bvule (bvadd ~A~0.offset (bvmul ~M~0 (_ bv4 32))) (bvadd ~A~0.offset (_ bv4 32) (bvmul ~M~0 (_ bv4 32)))) (bvule (bvadd ~A~0.offset (_ bv4 32) (bvmul ~M~0 (_ bv4 32))) (select |#length| ~A~0.base))) (not (bvslt ~M~0 ~N~0)))), Black: 531#(and (bvsle ~M~0 ~N~0) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (bvsge ~M~0 (_ bv0 32)) (bvsge thread3Thread1of1ForFork1_~i~2 (_ bv0 32)) (bvslt (_ bv0 32) ~N~0) (= ~A~0.offset (_ bv0 32)) (bvsle thread3Thread1of1ForFork1_~i~2 ~N~0) (not (bvslt (_ bv1 32) ~N~0))), Black: 157#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork2_~i~0 (_ bv0 32)) (exists ((v_subst_3 (_ BitVec 32))) (and (= (select |#length| ~A~0.base) (bvmul (_ bv4 32) v_subst_3)) (bvslt (_ bv0 32) v_subst_3) (bvule v_subst_3 (_ bv1073741823 32))))), Black: 151#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork2_~i~0 (_ bv0 32))), 8#L48-6true, 26#L57true, Black: 298#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (bvule (bvadd (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) (_ bv4 32)) (select |#length| ~A~0.base)) (bvule (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) (bvadd (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) (_ bv4 32))) (= ~A~0.offset (_ bv0 32))), Black: 294#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (bvule (bvadd (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) (_ bv4 32)) (select |#length| ~A~0.base)) (bvule (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) (bvadd (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) (_ bv4 32))) (= ~A~0.offset (_ bv0 32)) (or (and (bvule (bvadd (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) (_ bv8 32)) (select |#length| ~A~0.base)) (bvule (bvadd (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) (_ bv4 32)) (bvadd (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) (_ bv8 32)))) (not (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0)))), Black: 290#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (= thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) (= ~A~0.offset (_ bv0 32)) (exists ((v_subst_4 (_ BitVec 32))) (and (bvule v_subst_4 (_ bv1073741823 32)) (bvslt (_ bv1 32) v_subst_4) (= (bvmul (_ bv4 32) v_subst_4) (select |#length| ~A~0.base))))), 125#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| ~A~0.base))), Black: 112#(and (or (and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|))) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|))) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))), Black: 108#(and (= (_ bv1 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (exists ((v_subst_2 (_ BitVec 32))) (and (bvslt (_ bv1 32) v_subst_2) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) v_subst_2)) (bvule v_subst_2 (_ bv1073741823 32)))) (= (bvmul |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv4 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)), Black: 94#(and (bvule (bvadd |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|))) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))), 637#true, 625#(and (= thread2Thread1of1ForFork0_~i~1 (_ bv1 32)) (= ~A~0.offset (_ bv0 32)) (bvslt (_ bv0 32) ~M~0) (exists ((~N~0 (_ BitVec 32))) (and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)))) (exists ((~N~0 (_ BitVec 32))) (and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (bvslt (_ bv1 32) ~N~0)))), Black: 437#(and (or (and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|))) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|))) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))), Black: 433#(and (or (and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|))) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|))) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))), Black: 425#(and (or (and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|))) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (_ bv16 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (bvadd (_ bv16 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|))) (or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv16 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (bvadd (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|))) (bvule (bvadd (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))), 28#thread3EXITtrue, Black: 421#(and (= (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (exists ((v_subst_5 (_ BitVec 32))) (and (bvslt (_ bv4 32) v_subst_5) (bvule v_subst_5 (_ bv1073741823 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) v_subst_5)))) (= (bvmul |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv4 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)), Black: 633#(and (bvsge ~M~0 (_ bv0 32)) (= ~A~0.offset (_ bv0 32)) (exists ((~N~0 (_ BitVec 32))) (and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)))) (bvule (bvmul thread2Thread1of1ForFork0_~i~1 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork0_~i~1 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork0_~i~1 (_ bv4 32))) (select |#length| ~A~0.base))), Black: 429#(and (or (and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|))) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (_ bv16 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (bvadd (_ bv16 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|))) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))), Black: 757#(and (or (not (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0)) (and (bvule (bvadd (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) ~A~0.offset (_ bv4 32)) (bvadd (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) ~A~0.offset (_ bv8 32))) (bvule (bvadd (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) ~A~0.offset (_ bv8 32)) (select |#length| ~A~0.base)))) (or (not (bvslt (_ bv4 32) ~N~0)) (and (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base)) (bvule (bvadd ~A~0.offset (_ bv16 32)) (bvadd ~A~0.offset (_ bv20 32)))))), Black: 169#(and (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~size#1_67| (_ BitVec 32))) (and (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67|) (select |#length| ~A~0.base)) (bvule |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67| (_ bv1073741823 32)) (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67|)))) (= ~A~0.offset (_ bv0 32))), Black: 379#(and (bvule (bvadd |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|))) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))), Black: 176#(and (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~size#1_67| (_ BitVec 32))) (and (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67|) (select |#length| ~A~0.base)) (bvule |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67| (_ bv1073741823 32)) (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67|)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork2_~i~0 (_ bv0 32))), Black: 667#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (= thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) (= ~A~0.offset (_ bv0 32)) (not (bvslt (_ bv1 32) ~N~0))), Black: 629#(and (bvsge ~M~0 (_ bv0 32)) (= ~A~0.offset (_ bv0 32)) (exists ((~N~0 (_ BitVec 32))) (and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)))) (bvule (bvmul thread2Thread1of1ForFork0_~i~1 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork0_~i~1 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork0_~i~1 (_ bv4 32))) (select |#length| ~A~0.base)) (or (and (bvule (bvadd (_ bv8 32) (bvmul thread2Thread1of1ForFork0_~i~1 (_ bv4 32))) (select |#length| ~A~0.base)) (bvule (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork0_~i~1 (_ bv4 32))) (bvadd (_ bv8 32) (bvmul thread2Thread1of1ForFork0_~i~1 (_ bv4 32))))) (not (bvslt (bvadd thread2Thread1of1ForFork0_~i~1 (_ bv1 32)) ~M~0)))), Black: 759#(and (or (not (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0)) (and (bvule (bvadd (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) ~A~0.offset (_ bv4 32)) (select |#length| ~A~0.base)) (bvule (bvadd (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) ~A~0.offset) (bvadd (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) ~A~0.offset (_ bv4 32))))) (or (not (bvslt (_ bv4 32) ~N~0)) (and (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base)) (bvule (bvadd ~A~0.offset (_ bv16 32)) (bvadd ~A~0.offset (_ bv20 32)))))), Black: 660#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork2_~i~0 (_ bv0 32)) (not (bvslt (_ bv1 32) ~N~0))), Black: 761#(and (bvule (bvadd (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) ~A~0.offset (_ bv4 32)) (select |#length| ~A~0.base)) (bvule (bvadd (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) ~A~0.offset) (bvadd (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) ~A~0.offset (_ bv4 32))) (or (not (bvslt (_ bv4 32) ~N~0)) (and (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base)) (bvule (bvadd ~A~0.offset (_ bv16 32)) (bvadd ~A~0.offset (_ bv20 32)))))), Black: 753#(and (or (not (bvslt (_ bv4 32) ~N~0)) (and (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base)) (bvule (bvadd ~A~0.offset (_ bv16 32)) (bvadd ~A~0.offset (_ bv20 32))))) (or (not (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv3 32)) ~N~0)) (and (bvule (bvadd (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) ~A~0.offset (_ bv12 32)) (bvadd (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) ~A~0.offset (_ bv16 32))) (bvule (bvadd (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) ~A~0.offset (_ bv16 32)) (select |#length| ~A~0.base)))))]) [2024-10-13 12:45:46,333 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-10-13 12:45:46,333 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-13 12:45:46,333 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-13 12:45:46,333 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-13 12:45:46,334 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([393] L57-->L56-6: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork0_~i~1_9))) (let ((.cse1 (bvadd v_~A~0.offset_27 .cse3)) (.cse0 (bvadd v_~A~0.offset_27 (_ bv4 32) .cse3))) (and (bvule .cse0 (select |v_#length_31| v_~A~0.base_30)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |v_#valid_36| v_~A~0.base_30))) (= v_thread2Thread1of1ForFork0_~i~1_10 (bvadd (_ bv1 32) v_thread2Thread1of1ForFork0_~i~1_9)) (bvule (_ bv0 32) .cse1) (= (bvadd v_~sum2~0_22 (let ((.cse2 (select |v_#memory_int#1_24| v_~A~0.base_30))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_27 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~A~0.offset_27 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~A~0.offset_27 (_ bv1 32) .cse3))) (select .cse2 .cse1)))) v_~sum2~0_21) (bvule .cse1 .cse0)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_9, ~A~0.base=v_~A~0.base_30, ~A~0.offset=v_~A~0.offset_27, #valid=|v_#valid_36|, ~sum2~0=v_~sum2~0_22, #length=|v_#length_31|, #memory_int#1=|v_#memory_int#1_24|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_10, ~A~0.base=v_~A~0.base_30, thread2Thread1of1ForFork0_#t~post4=|v_thread2Thread1of1ForFork0_#t~post4_1|, ~A~0.offset=v_~A~0.offset_27, #valid=|v_#valid_36|, ~sum2~0=v_~sum2~0_21, #length=|v_#length_31|, #memory_int#1=|v_#memory_int#1_24|, thread2Thread1of1ForFork0_#t~mem3=|v_thread2Thread1of1ForFork0_#t~mem3_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post4, ~sum2~0, thread2Thread1of1ForFork0_#t~mem3][238], [Black: 755#(and (or (and (bvule (bvadd (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) ~A~0.offset (_ bv8 32)) (bvadd (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) ~A~0.offset (_ bv12 32))) (bvule (bvadd (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) ~A~0.offset (_ bv12 32)) (select |#length| ~A~0.base))) (not (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv2 32)) ~N~0))) (or (not (bvslt (_ bv4 32) ~N~0)) (and (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base)) (bvule (bvadd ~A~0.offset (_ bv16 32)) (bvadd ~A~0.offset (_ bv20 32)))))), 338#true, 843#(or (and (bvule (bvadd ~A~0.offset (_ bv4 32) (bvmul ~M~0 (_ bv4 32))) (bvadd ~A~0.offset (_ bv8 32) (bvmul ~M~0 (_ bv4 32)))) (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul ~M~0 (_ bv4 32))) (select |#length| ~A~0.base))) (not (bvslt (bvadd ~M~0 (_ bv1 32)) ~N~0)) (not (bvslt ~M~0 ~N~0))), Black: 70#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (exists ((v_subst_1 (_ BitVec 32))) (and (= (bvmul (_ bv4 32) v_subst_1) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule v_subst_1 (_ bv1073741823 32)) (bvslt (_ bv0 32) v_subst_1))) (= (bvmul |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv4 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)), Black: 335#(and (bvsle ~M~0 ~N~0) (bvsge ~M~0 (_ bv0 32)) (bvsge thread3Thread1of1ForFork1_~i~2 (_ bv0 32)) (bvsle thread3Thread1of1ForFork1_~i~2 ~N~0) (not (bvslt (_ bv0 32) ~N~0))), 627#(and (bvsge ~M~0 (_ bv0 32)) (or (bvule (bvmul thread2Thread1of1ForFork0_~i~1 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork0_~i~1 (_ bv4 32)))) (not (bvslt thread2Thread1of1ForFork0_~i~1 ~M~0))) (= ~A~0.offset (_ bv0 32)) (exists ((~N~0 (_ BitVec 32))) (and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)))) (or (and (bvule (bvadd (_ bv8 32) (bvmul thread2Thread1of1ForFork0_~i~1 (_ bv4 32))) (select |#length| ~A~0.base)) (bvule (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork0_~i~1 (_ bv4 32))) (bvadd (_ bv8 32) (bvmul thread2Thread1of1ForFork0_~i~1 (_ bv4 32))))) (not (bvslt (bvadd thread2Thread1of1ForFork0_~i~1 (_ bv1 32)) ~M~0)))), 444#true, 7#L85true, Black: 210#(and (bvsge ~M~0 (_ bv0 32)) (= ~A~0.offset (_ bv0 32)) (= thread2Thread1of1ForFork0_~i~1 (_ bv0 32)) (exists ((~N~0 (_ BitVec 32))) (and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base))))), 22#L56-6true, Black: 216#(and (bvsge ~M~0 (_ bv0 32)) (= ~A~0.offset (_ bv0 32)) (= thread2Thread1of1ForFork0_~i~1 (_ bv0 32)) (exists ((~N~0 (_ BitVec 32))) (and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)))) (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)))), Black: 537#(and (bvule (bvadd ~A~0.offset (_ bv4 32) (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))) (select |#length| ~A~0.base)) (or (and (bvule (bvadd ~A~0.offset (bvmul ~M~0 (_ bv4 32))) (bvadd ~A~0.offset (_ bv4 32) (bvmul ~M~0 (_ bv4 32)))) (bvule (bvadd ~A~0.offset (_ bv4 32) (bvmul ~M~0 (_ bv4 32))) (select |#length| ~A~0.base))) (not (bvslt ~M~0 ~N~0))) (bvule (bvadd ~A~0.offset (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))) (bvadd ~A~0.offset (_ bv4 32) (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))))), Black: 533#(and (bvsle ~M~0 ~N~0) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (bvsge ~M~0 (_ bv0 32)) (bvsge thread3Thread1of1ForFork1_~i~2 (_ bv0 32)) (exists ((v_subst_10 (_ BitVec 32))) (and (not (bvslt (_ bv1 32) v_subst_10)) (bvslt thread3Thread1of1ForFork1_~i~2 v_subst_10))) (bvslt (_ bv0 32) ~N~0) (= ~A~0.offset (_ bv0 32)) (not (bvslt (_ bv1 32) ~N~0))), Black: 535#(and (or (and (bvule (bvadd ~A~0.offset (_ bv4 32) (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))) (select |#length| ~A~0.base)) (bvule (bvadd ~A~0.offset (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))) (bvadd ~A~0.offset (_ bv4 32) (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))))) (not (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0))) (or (and (bvule (bvadd ~A~0.offset (bvmul ~M~0 (_ bv4 32))) (bvadd ~A~0.offset (_ bv4 32) (bvmul ~M~0 (_ bv4 32)))) (bvule (bvadd ~A~0.offset (_ bv4 32) (bvmul ~M~0 (_ bv4 32))) (select |#length| ~A~0.base))) (not (bvslt ~M~0 ~N~0)))), Black: 531#(and (bvsle ~M~0 ~N~0) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (bvsge ~M~0 (_ bv0 32)) (bvsge thread3Thread1of1ForFork1_~i~2 (_ bv0 32)) (bvslt (_ bv0 32) ~N~0) (= ~A~0.offset (_ bv0 32)) (bvsle thread3Thread1of1ForFork1_~i~2 ~N~0) (not (bvslt (_ bv1 32) ~N~0))), Black: 157#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork2_~i~0 (_ bv0 32)) (exists ((v_subst_3 (_ BitVec 32))) (and (= (select |#length| ~A~0.base) (bvmul (_ bv4 32) v_subst_3)) (bvslt (_ bv0 32) v_subst_3) (bvule v_subst_3 (_ bv1073741823 32))))), Black: 151#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork2_~i~0 (_ bv0 32))), 6#L49true, Black: 298#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (bvule (bvadd (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) (_ bv4 32)) (select |#length| ~A~0.base)) (bvule (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) (bvadd (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) (_ bv4 32))) (= ~A~0.offset (_ bv0 32))), Black: 290#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (= thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) (= ~A~0.offset (_ bv0 32)) (exists ((v_subst_4 (_ BitVec 32))) (and (bvule v_subst_4 (_ bv1073741823 32)) (bvslt (_ bv1 32) v_subst_4) (= (bvmul (_ bv4 32) v_subst_4) (select |#length| ~A~0.base))))), 125#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| ~A~0.base))), Black: 112#(and (or (and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|))) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|))) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))), Black: 108#(and (= (_ bv1 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (exists ((v_subst_2 (_ BitVec 32))) (and (bvslt (_ bv1 32) v_subst_2) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) v_subst_2)) (bvule v_subst_2 (_ bv1073741823 32)))) (= (bvmul |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv4 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)), Black: 94#(and (bvule (bvadd |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|))) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))), 637#true, Black: 437#(and (or (and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|))) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|))) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))), Black: 433#(and (or (and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|))) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|))) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))), 294#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (bvule (bvadd (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) (_ bv4 32)) (select |#length| ~A~0.base)) (bvule (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) (bvadd (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) (_ bv4 32))) (= ~A~0.offset (_ bv0 32)) (or (and (bvule (bvadd (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) (_ bv8 32)) (select |#length| ~A~0.base)) (bvule (bvadd (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) (_ bv4 32)) (bvadd (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) (_ bv8 32)))) (not (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0)))), Black: 425#(and (or (and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|))) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (_ bv16 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (bvadd (_ bv16 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|))) (or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv16 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (bvadd (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|))) (bvule (bvadd (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))), 28#thread3EXITtrue, Black: 421#(and (= (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (exists ((v_subst_5 (_ BitVec 32))) (and (bvslt (_ bv4 32) v_subst_5) (bvule v_subst_5 (_ bv1073741823 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) v_subst_5)))) (= (bvmul |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv4 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)), Black: 633#(and (bvsge ~M~0 (_ bv0 32)) (= ~A~0.offset (_ bv0 32)) (exists ((~N~0 (_ BitVec 32))) (and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)))) (bvule (bvmul thread2Thread1of1ForFork0_~i~1 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork0_~i~1 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork0_~i~1 (_ bv4 32))) (select |#length| ~A~0.base))), Black: 169#(and (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~size#1_67| (_ BitVec 32))) (and (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67|) (select |#length| ~A~0.base)) (bvule |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67| (_ bv1073741823 32)) (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67|)))) (= ~A~0.offset (_ bv0 32))), Black: 429#(and (or (and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|))) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv1 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (_ bv16 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv12 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (bvadd (_ bv16 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|))) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))), Black: 757#(and (or (not (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) ~N~0)) (and (bvule (bvadd (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) ~A~0.offset (_ bv4 32)) (bvadd (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) ~A~0.offset (_ bv8 32))) (bvule (bvadd (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) ~A~0.offset (_ bv8 32)) (select |#length| ~A~0.base)))) (or (not (bvslt (_ bv4 32) ~N~0)) (and (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base)) (bvule (bvadd ~A~0.offset (_ bv16 32)) (bvadd ~A~0.offset (_ bv20 32)))))), Black: 625#(and (= thread2Thread1of1ForFork0_~i~1 (_ bv1 32)) (= ~A~0.offset (_ bv0 32)) (bvslt (_ bv0 32) ~M~0) (exists ((~N~0 (_ BitVec 32))) (and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)))) (exists ((~N~0 (_ BitVec 32))) (and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (bvslt (_ bv1 32) ~N~0)))), Black: 176#(and (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~size#1_67| (_ BitVec 32))) (and (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67|) (select |#length| ~A~0.base)) (bvule |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67| (_ bv1073741823 32)) (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67|)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork2_~i~0 (_ bv0 32))), Black: 379#(and (bvule (bvadd |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|))) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))), Black: 667#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (= thread1Thread1of1ForFork2_~i~0 (_ bv1 32)) (= ~A~0.offset (_ bv0 32)) (not (bvslt (_ bv1 32) ~N~0))), Black: 629#(and (bvsge ~M~0 (_ bv0 32)) (= ~A~0.offset (_ bv0 32)) (exists ((~N~0 (_ BitVec 32))) (and (bvsle ~M~0 ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)))) (bvule (bvmul thread2Thread1of1ForFork0_~i~1 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork0_~i~1 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork0_~i~1 (_ bv4 32))) (select |#length| ~A~0.base)) (or (and (bvule (bvadd (_ bv8 32) (bvmul thread2Thread1of1ForFork0_~i~1 (_ bv4 32))) (select |#length| ~A~0.base)) (bvule (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork0_~i~1 (_ bv4 32))) (bvadd (_ bv8 32) (bvmul thread2Thread1of1ForFork0_~i~1 (_ bv4 32))))) (not (bvslt (bvadd thread2Thread1of1ForFork0_~i~1 (_ bv1 32)) ~M~0)))), Black: 759#(and (or (not (bvslt thread1Thread1of1ForFork2_~i~0 ~N~0)) (and (bvule (bvadd (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) ~A~0.offset (_ bv4 32)) (select |#length| ~A~0.base)) (bvule (bvadd (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) ~A~0.offset) (bvadd (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) ~A~0.offset (_ bv4 32))))) (or (not (bvslt (_ bv4 32) ~N~0)) (and (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base)) (bvule (bvadd ~A~0.offset (_ bv16 32)) (bvadd ~A~0.offset (_ bv20 32)))))), Black: 660#(and (bvule ~N~0 (_ bv1073741823 32)) (= (bvmul ~N~0 (_ bv4 32)) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork2_~i~0 (_ bv0 32)) (not (bvslt (_ bv1 32) ~N~0))), Black: 761#(and (bvule (bvadd (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) ~A~0.offset (_ bv4 32)) (select |#length| ~A~0.base)) (bvule (bvadd (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) ~A~0.offset) (bvadd (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) ~A~0.offset (_ bv4 32))) (or (not (bvslt (_ bv4 32) ~N~0)) (and (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base)) (bvule (bvadd ~A~0.offset (_ bv16 32)) (bvadd ~A~0.offset (_ bv20 32)))))), Black: 753#(and (or (not (bvslt (_ bv4 32) ~N~0)) (and (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base)) (bvule (bvadd ~A~0.offset (_ bv16 32)) (bvadd ~A~0.offset (_ bv20 32))))) (or (not (bvslt (bvadd thread1Thread1of1ForFork2_~i~0 (_ bv3 32)) ~N~0)) (and (bvule (bvadd (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) ~A~0.offset (_ bv12 32)) (bvadd (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) ~A~0.offset (_ bv16 32))) (bvule (bvadd (bvmul thread1Thread1of1ForFork2_~i~0 (_ bv4 32)) ~A~0.offset (_ bv16 32)) (select |#length| ~A~0.base)))))]) [2024-10-13 12:45:46,335 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-10-13 12:45:46,336 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-13 12:45:46,336 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-13 12:45:46,336 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-13 12:45:48,704 INFO L124 PetriNetUnfolderBase]: 40280/54035 cut-off events. [2024-10-13 12:45:48,704 INFO L125 PetriNetUnfolderBase]: For 322623/336120 co-relation queries the response was YES. [2024-10-13 12:45:49,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281314 conditions, 54035 events. 40280/54035 cut-off events. For 322623/336120 co-relation queries the response was YES. Maximal size of possible extension queue 1473. Compared 312724 event pairs, 14675 based on Foata normal form. 1859/48828 useless extension candidates. Maximal degree in co-relation 281236. Up to 21358 conditions per place. [2024-10-13 12:45:49,518 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 681 selfloop transitions, 71 changer transitions 0/770 dead transitions. [2024-10-13 12:45:49,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 770 transitions, 8609 flow [2024-10-13 12:45:49,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-13 12:45:49,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-10-13 12:45:49,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 551 transitions. [2024-10-13 12:45:49,521 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.584305408271474 [2024-10-13 12:45:49,522 INFO L175 Difference]: Start difference. First operand has 135 places, 147 transitions, 1340 flow. Second operand 23 states and 551 transitions. [2024-10-13 12:45:49,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 770 transitions, 8609 flow [2024-10-13 12:45:50,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 770 transitions, 8461 flow, removed 61 selfloop flow, removed 4 redundant places. [2024-10-13 12:45:50,332 INFO L231 Difference]: Finished difference. Result has 156 places, 191 transitions, 2040 flow [2024-10-13 12:45:50,332 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1300, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2040, PETRI_PLACES=156, PETRI_TRANSITIONS=191} [2024-10-13 12:45:50,333 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 113 predicate places. [2024-10-13 12:45:50,333 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 191 transitions, 2040 flow [2024-10-13 12:45:50,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 15.777777777777779) internal successors, (284), 18 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:50,333 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:45:50,333 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:45:50,338 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-13 12:45:50,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:50,534 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-13 12:45:50,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:45:50,535 INFO L85 PathProgramCache]: Analyzing trace with hash -333208119, now seen corresponding path program 2 times [2024-10-13 12:45:50,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:45:50,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [483778233] [2024-10-13 12:45:50,535 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 12:45:50,535 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:45:50,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:45:50,536 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:45:50,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-13 12:45:50,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 12:45:50,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:45:50,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-13 12:45:50,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:45:50,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-13 12:45:50,881 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:45:50,881 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:45:51,782 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:45:51,782 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:45:51,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [483778233] [2024-10-13 12:45:51,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [483778233] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:45:51,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:45:51,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2024-10-13 12:45:51,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475543928] [2024-10-13 12:45:51,783 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:45:51,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-13 12:45:51,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:45:51,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 12:45:51,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2024-10-13 12:45:53,498 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-10-13 12:45:53,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 191 transitions, 2040 flow. Second operand has 17 states, 17 states have (on average 16.529411764705884) internal successors, (281), 17 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:45:53,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:45:53,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-10-13 12:45:53,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:46:00,666 INFO L124 PetriNetUnfolderBase]: 26150/38156 cut-off events. [2024-10-13 12:46:00,666 INFO L125 PetriNetUnfolderBase]: For 322418/337728 co-relation queries the response was YES. [2024-10-13 12:46:01,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211651 conditions, 38156 events. 26150/38156 cut-off events. For 322418/337728 co-relation queries the response was YES. Maximal size of possible extension queue 1148. Compared 251916 event pairs, 9500 based on Foata normal form. 2025/37174 useless extension candidates. Maximal degree in co-relation 211567. Up to 14954 conditions per place. [2024-10-13 12:46:01,212 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 385 selfloop transitions, 62 changer transitions 0/475 dead transitions. [2024-10-13 12:46:01,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 475 transitions, 5730 flow [2024-10-13 12:46:01,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 12:46:01,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-10-13 12:46:01,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 409 transitions. [2024-10-13 12:46:01,215 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6234756097560976 [2024-10-13 12:46:01,215 INFO L175 Difference]: Start difference. First operand has 156 places, 191 transitions, 2040 flow. Second operand 16 states and 409 transitions. [2024-10-13 12:46:01,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 475 transitions, 5730 flow [2024-10-13 12:46:02,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 475 transitions, 5377 flow, removed 143 selfloop flow, removed 7 redundant places. [2024-10-13 12:46:02,602 INFO L231 Difference]: Finished difference. Result has 171 places, 218 transitions, 2402 flow [2024-10-13 12:46:02,602 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1859, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2402, PETRI_PLACES=171, PETRI_TRANSITIONS=218} [2024-10-13 12:46:02,602 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 128 predicate places. [2024-10-13 12:46:02,603 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 218 transitions, 2402 flow [2024-10-13 12:46:02,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 16.529411764705884) internal successors, (281), 17 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:46:02,603 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:46:02,603 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:46:02,606 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 (16)] Ended with exit code 0 [2024-10-13 12:46:02,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:46:02,804 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-13 12:46:02,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:46:02,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1603754165, now seen corresponding path program 2 times [2024-10-13 12:46:02,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:46:02,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1108415801] [2024-10-13 12:46:02,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 12:46:02,805 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:46:02,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:46:02,806 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:46:02,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-13 12:46:02,867 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 12:46:02,867 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:46:02,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-13 12:46:02,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:46:02,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-13 12:46:03,186 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 12:46:03,186 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:46:03,186 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:46:03,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1108415801] [2024-10-13 12:46:03,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1108415801] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:46:03,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:46:03,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:46:03,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112455172] [2024-10-13 12:46:03,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:46:03,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:46:03,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:46:03,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:46:03,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:46:03,342 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2024-10-13 12:46:03,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 218 transitions, 2402 flow. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:46:03,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:46:03,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2024-10-13 12:46:03,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:46:10,141 INFO L124 PetriNetUnfolderBase]: 36104/49025 cut-off events. [2024-10-13 12:46:10,141 INFO L125 PetriNetUnfolderBase]: For 360378/369472 co-relation queries the response was YES. [2024-10-13 12:46:10,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276821 conditions, 49025 events. 36104/49025 cut-off events. For 360378/369472 co-relation queries the response was YES. Maximal size of possible extension queue 1383. Compared 287178 event pairs, 6792 based on Foata normal form. 2586/46750 useless extension candidates. Maximal degree in co-relation 276727. Up to 20121 conditions per place. [2024-10-13 12:46:10,936 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 282 selfloop transitions, 85 changer transitions 0/385 dead transitions. [2024-10-13 12:46:10,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 385 transitions, 4954 flow [2024-10-13 12:46:10,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:46:10,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 12:46:10,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2024-10-13 12:46:10,938 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.516260162601626 [2024-10-13 12:46:10,938 INFO L175 Difference]: Start difference. First operand has 171 places, 218 transitions, 2402 flow. Second operand 6 states and 127 transitions. [2024-10-13 12:46:10,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 385 transitions, 4954 flow [2024-10-13 12:46:12,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 385 transitions, 4845 flow, removed 26 selfloop flow, removed 7 redundant places. [2024-10-13 12:46:12,920 INFO L231 Difference]: Finished difference. Result has 168 places, 217 transitions, 2461 flow [2024-10-13 12:46:12,920 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2291, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2461, PETRI_PLACES=168, PETRI_TRANSITIONS=217} [2024-10-13 12:46:12,921 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 125 predicate places. [2024-10-13 12:46:12,921 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 217 transitions, 2461 flow [2024-10-13 12:46:12,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:46:12,921 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:46:12,921 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:46:12,925 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 (17)] Forceful destruction successful, exit code 0 [2024-10-13 12:46:13,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:46:13,122 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-13 12:46:13,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:46:13,122 INFO L85 PathProgramCache]: Analyzing trace with hash -769903362, now seen corresponding path program 1 times [2024-10-13 12:46:13,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:46:13,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1654779553] [2024-10-13 12:46:13,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:46:13,123 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:46:13,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:46:13,126 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:46:13,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 (18)] Waiting until timeout for monitored process [2024-10-13 12:46:13,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:46:13,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:46:13,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:46:13,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:46:13,271 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:46:13,271 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:46:13,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1654779553] [2024-10-13 12:46:13,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1654779553] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:46:13,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:46:13,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:46:13,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95661375] [2024-10-13 12:46:13,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:46:13,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:46:13,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:46:13,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:46:13,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:46:13,273 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 41 [2024-10-13 12:46:13,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 217 transitions, 2461 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:46:13,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:46:13,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 41 [2024-10-13 12:46:13,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand