./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0224e82797c7b26c7800eaf85be5e5678e7961d21aa4e2312eda2860d261b33a --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:49:01,347 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:49:01,397 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:49:01,400 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:49:01,400 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:49:01,423 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:49:01,424 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:49:01,424 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:49:01,425 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:49:01,425 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:49:01,425 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:49:01,426 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:49:01,426 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:49:01,426 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:49:01,426 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:49:01,426 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:49:01,426 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:49:01,427 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:49:01,427 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:49:01,427 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:49:01,427 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:49:01,427 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:49:01,427 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:49:01,427 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:49:01,427 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:49:01,427 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:49:01,427 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:49:01,427 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:49:01,427 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:49:01,427 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:49:01,428 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:49:01,428 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:49:01,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:49:01,428 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:49:01,428 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:49:01,428 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:49:01,429 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:49:01,429 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:49:01,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:49:01,429 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:49:01,429 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:49:01,429 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:49:01,429 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:49:01,429 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/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 ! call(reach_error())) ) 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 -> 0224e82797c7b26c7800eaf85be5e5678e7961d21aa4e2312eda2860d261b33a [2025-03-13 21:49:01,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:49:01,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:49:01,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:49:01,663 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:49:01,664 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:49:01,665 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c [2025-03-13 21:49:02,814 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e21bf035c/bb85a58bf6fe49e2b7ea8425a330e1c8/FLAG142958f9c [2025-03-13 21:49:03,042 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:49:03,043 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c [2025-03-13 21:49:03,050 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e21bf035c/bb85a58bf6fe49e2b7ea8425a330e1c8/FLAG142958f9c [2025-03-13 21:49:03,067 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e21bf035c/bb85a58bf6fe49e2b7ea8425a330e1c8 [2025-03-13 21:49:03,069 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:49:03,071 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:49:03,072 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:49:03,072 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:49:03,075 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:49:03,076 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:49:03" (1/1) ... [2025-03-13 21:49:03,077 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a8cba8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:03, skipping insertion in model container [2025-03-13 21:49:03,078 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:49:03" (1/1) ... [2025-03-13 21:49:03,092 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:49:03,225 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c[2625,2638] [2025-03-13 21:49:03,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:49:03,243 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:49:03,260 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c[2625,2638] [2025-03-13 21:49:03,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:49:03,274 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:49:03,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:03 WrapperNode [2025-03-13 21:49:03,275 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:49:03,276 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:49:03,276 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:49:03,276 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:49:03,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:03" (1/1) ... [2025-03-13 21:49:03,287 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:03" (1/1) ... [2025-03-13 21:49:03,301 INFO L138 Inliner]: procedures = 23, calls = 28, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 84 [2025-03-13 21:49:03,301 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:49:03,302 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:49:03,302 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:49:03,302 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:49:03,308 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:03" (1/1) ... [2025-03-13 21:49:03,308 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:03" (1/1) ... [2025-03-13 21:49:03,314 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:03" (1/1) ... [2025-03-13 21:49:03,323 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-13 21:49:03,324 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:03" (1/1) ... [2025-03-13 21:49:03,324 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:03" (1/1) ... [2025-03-13 21:49:03,329 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:03" (1/1) ... [2025-03-13 21:49:03,329 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:03" (1/1) ... [2025-03-13 21:49:03,330 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:03" (1/1) ... [2025-03-13 21:49:03,331 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:03" (1/1) ... [2025-03-13 21:49:03,332 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:49:03,333 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:49:03,333 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:49:03,333 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:49:03,333 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:03" (1/1) ... [2025-03-13 21:49:03,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:49:03,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:03,356 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) [2025-03-13 21:49:03,358 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 [2025-03-13 21:49:03,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:49:03,375 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 21:49:03,375 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 21:49:03,375 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 21:49:03,375 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 21:49:03,375 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-13 21:49:03,375 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-13 21:49:03,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:49:03,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-13 21:49:03,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-13 21:49:03,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-13 21:49:03,376 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 21:49:03,376 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 21:49:03,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 21:49:03,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:49:03,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:49:03,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-13 21:49:03,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-13 21:49:03,377 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:49:03,453 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:49:03,455 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:49:03,663 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:49:03,664 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:49:03,664 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:49:03,812 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:49:03,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:49:03 BoogieIcfgContainer [2025-03-13 21:49:03,812 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:49:03,815 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:49:03,815 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:49:03,818 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:49:03,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:49:03" (1/3) ... [2025-03-13 21:49:03,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e197e19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:49:03, skipping insertion in model container [2025-03-13 21:49:03,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:49:03" (2/3) ... [2025-03-13 21:49:03,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e197e19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:49:03, skipping insertion in model container [2025-03-13 21:49:03,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:49:03" (3/3) ... [2025-03-13 21:49:03,821 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array-hom.wvr.c [2025-03-13 21:49:03,831 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:49:03,832 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-min-array-hom.wvr.c that has 4 procedures, 30 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-13 21:49:03,833 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:49:03,879 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-13 21:49:03,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 33 transitions, 87 flow [2025-03-13 21:49:03,931 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2025-03-13 21:49:03,933 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 21:49:03,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 30 events. 4/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2025-03-13 21:49:03,935 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 33 transitions, 87 flow [2025-03-13 21:49:03,936 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 29 transitions, 76 flow [2025-03-13 21:49:03,941 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:49:03,964 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=LoopHeads, 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;@5843cd10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:49:03,964 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-13 21:49:03,977 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:49:03,978 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2025-03-13 21:49:03,978 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 21:49:03,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:03,978 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:03,979 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:49:03,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:03,982 INFO L85 PathProgramCache]: Analyzing trace with hash 557860275, now seen corresponding path program 1 times [2025-03-13 21:49:03,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:03,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110619040] [2025-03-13 21:49:03,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:49:03,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:04,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-13 21:49:04,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 21:49:04,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:04,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:04,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:04,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:04,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110619040] [2025-03-13 21:49:04,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110619040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:04,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:04,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:49:04,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720977335] [2025-03-13 21:49:04,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:04,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:49:04,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:04,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:49:04,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:49:04,557 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-13 21:49:04,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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) [2025-03-13 21:49:04,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:04,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-13 21:49:04,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:04,786 INFO L124 PetriNetUnfolderBase]: 617/954 cut-off events. [2025-03-13 21:49:04,786 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-03-13 21:49:04,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1949 conditions, 954 events. 617/954 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3780 event pairs, 126 based on Foata normal form. 1/950 useless extension candidates. Maximal degree in co-relation 1715. Up to 677 conditions per place. [2025-03-13 21:49:04,798 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 37 selfloop transitions, 4 changer transitions 1/46 dead transitions. [2025-03-13 21:49:04,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 46 transitions, 209 flow [2025-03-13 21:49:04,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:49:04,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:49:04,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2025-03-13 21:49:04,810 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6464646464646465 [2025-03-13 21:49:04,811 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 76 flow. Second operand 3 states and 64 transitions. [2025-03-13 21:49:04,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 46 transitions, 209 flow [2025-03-13 21:49:04,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 46 transitions, 187 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-13 21:49:04,821 INFO L231 Difference]: Finished difference. Result has 32 places, 32 transitions, 90 flow [2025-03-13 21:49:04,823 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=32, PETRI_TRANSITIONS=32} [2025-03-13 21:49:04,826 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2025-03-13 21:49:04,826 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 32 transitions, 90 flow [2025-03-13 21:49:04,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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) [2025-03-13 21:49:04,828 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:04,828 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:04,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:49:04,829 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:49:04,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:04,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1404449691, now seen corresponding path program 1 times [2025-03-13 21:49:04,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:04,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984454956] [2025-03-13 21:49:04,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:49:04,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:04,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-13 21:49:04,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:49:04,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:04,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:04,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:04,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:04,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984454956] [2025-03-13 21:49:04,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984454956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:04,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:04,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:49:04,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191011493] [2025-03-13 21:49:04,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:04,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:49:04,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:04,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:49:04,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:49:04,936 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-13 21:49:04,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 32 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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) [2025-03-13 21:49:04,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:04,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-13 21:49:04,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:05,059 INFO L124 PetriNetUnfolderBase]: 617/965 cut-off events. [2025-03-13 21:49:05,060 INFO L125 PetriNetUnfolderBase]: For 199/199 co-relation queries the response was YES. [2025-03-13 21:49:05,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2170 conditions, 965 events. 617/965 cut-off events. For 199/199 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4078 event pairs, 407 based on Foata normal form. 0/957 useless extension candidates. Maximal degree in co-relation 802. Up to 895 conditions per place. [2025-03-13 21:49:05,064 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 27 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2025-03-13 21:49:05,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 33 transitions, 150 flow [2025-03-13 21:49:05,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:49:05,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:49:05,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2025-03-13 21:49:05,065 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2025-03-13 21:49:05,066 INFO L175 Difference]: Start difference. First operand has 32 places, 32 transitions, 90 flow. Second operand 3 states and 48 transitions. [2025-03-13 21:49:05,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 33 transitions, 150 flow [2025-03-13 21:49:05,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 146 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:49:05,067 INFO L231 Difference]: Finished difference. Result has 34 places, 33 transitions, 98 flow [2025-03-13 21:49:05,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=34, PETRI_TRANSITIONS=33} [2025-03-13 21:49:05,068 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2025-03-13 21:49:05,068 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 33 transitions, 98 flow [2025-03-13 21:49:05,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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) [2025-03-13 21:49:05,068 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:05,068 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:05,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:49:05,069 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:49:05,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:05,069 INFO L85 PathProgramCache]: Analyzing trace with hash 779917777, now seen corresponding path program 1 times [2025-03-13 21:49:05,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:05,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368437377] [2025-03-13 21:49:05,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:49:05,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:05,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-13 21:49:05,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:49:05,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:05,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:05,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:05,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:05,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368437377] [2025-03-13 21:49:05,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368437377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:05,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:05,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:49:05,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252968834] [2025-03-13 21:49:05,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:05,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:49:05,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:05,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:49:05,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:49:05,166 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-13 21:49:05,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 33 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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) [2025-03-13 21:49:05,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:05,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-13 21:49:05,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:05,286 INFO L124 PetriNetUnfolderBase]: 790/1161 cut-off events. [2025-03-13 21:49:05,286 INFO L125 PetriNetUnfolderBase]: For 187/187 co-relation queries the response was YES. [2025-03-13 21:49:05,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2575 conditions, 1161 events. 790/1161 cut-off events. For 187/187 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4572 event pairs, 246 based on Foata normal form. 0/1118 useless extension candidates. Maximal degree in co-relation 2562. Up to 576 conditions per place. [2025-03-13 21:49:05,293 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 40 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2025-03-13 21:49:05,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 47 transitions, 224 flow [2025-03-13 21:49:05,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:49:05,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:49:05,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2025-03-13 21:49:05,296 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4772727272727273 [2025-03-13 21:49:05,297 INFO L175 Difference]: Start difference. First operand has 34 places, 33 transitions, 98 flow. Second operand 4 states and 63 transitions. [2025-03-13 21:49:05,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 47 transitions, 224 flow [2025-03-13 21:49:05,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 47 transitions, 218 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-13 21:49:05,301 INFO L231 Difference]: Finished difference. Result has 38 places, 34 transitions, 113 flow [2025-03-13 21:49:05,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=38, PETRI_TRANSITIONS=34} [2025-03-13 21:49:05,302 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2025-03-13 21:49:05,302 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 113 flow [2025-03-13 21:49:05,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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) [2025-03-13 21:49:05,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:05,303 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:05,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:49:05,303 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:49:05,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:05,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1043708507, now seen corresponding path program 1 times [2025-03-13 21:49:05,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:05,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029508909] [2025-03-13 21:49:05,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:49:05,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:05,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-13 21:49:05,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:49:05,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:05,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:05,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:05,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:05,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029508909] [2025-03-13 21:49:05,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029508909] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:05,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867490218] [2025-03-13 21:49:05,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:49:05,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:05,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:05,404 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:49:05,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-13 21:49:05,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-13 21:49:05,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:49:05,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:05,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:05,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-13 21:49:05,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:05,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:05,522 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:05,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:05,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867490218] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:05,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-13 21:49:05,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-03-13 21:49:05,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183874875] [2025-03-13 21:49:05,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:05,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:49:05,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:05,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:49:05,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-13 21:49:05,559 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-13 21:49:05,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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) [2025-03-13 21:49:05,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:05,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-13 21:49:05,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:05,707 INFO L124 PetriNetUnfolderBase]: 855/1295 cut-off events. [2025-03-13 21:49:05,707 INFO L125 PetriNetUnfolderBase]: For 505/505 co-relation queries the response was YES. [2025-03-13 21:49:05,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3247 conditions, 1295 events. 855/1295 cut-off events. For 505/505 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5382 event pairs, 256 based on Foata normal form. 0/1230 useless extension candidates. Maximal degree in co-relation 3227. Up to 670 conditions per place. [2025-03-13 21:49:05,715 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 41 selfloop transitions, 5 changer transitions 0/50 dead transitions. [2025-03-13 21:49:05,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 50 transitions, 257 flow [2025-03-13 21:49:05,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:49:05,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:49:05,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2025-03-13 21:49:05,717 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2025-03-13 21:49:05,717 INFO L175 Difference]: Start difference. First operand has 38 places, 34 transitions, 113 flow. Second operand 5 states and 72 transitions. [2025-03-13 21:49:05,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 50 transitions, 257 flow [2025-03-13 21:49:05,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 251 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:49:05,721 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 132 flow [2025-03-13 21:49:05,721 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=132, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2025-03-13 21:49:05,722 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2025-03-13 21:49:05,722 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 132 flow [2025-03-13 21:49:05,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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) [2025-03-13 21:49:05,722 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:05,722 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:05,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-13 21:49:05,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:05,923 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:49:05,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:05,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1212184845, now seen corresponding path program 1 times [2025-03-13 21:49:05,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:05,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032051040] [2025-03-13 21:49:05,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:49:05,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:05,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-13 21:49:05,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:49:05,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:05,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:06,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:06,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:06,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032051040] [2025-03-13 21:49:06,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032051040] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:06,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565073760] [2025-03-13 21:49:06,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:49:06,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:06,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:06,705 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:49:06,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-13 21:49:06,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-13 21:49:06,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:49:06,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:06,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:06,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-13 21:49:06,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:06,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-13 21:49:07,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2025-03-13 21:49:07,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:07,162 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:08,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 282 treesize of output 254 [2025-03-13 21:49:08,857 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:49:08,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 372 treesize of output 376 [2025-03-13 21:49:24,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 208 [2025-03-13 21:49:24,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:49:24,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 261 treesize of output 291 [2025-03-13 21:49:26,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:26,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565073760] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:49:26,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:49:26,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 23 [2025-03-13 21:49:26,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4078420] [2025-03-13 21:49:26,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:49:26,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-13 21:49:26,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:26,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-13 21:49:26,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2025-03-13 21:49:26,822 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-13 21:49:26,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 132 flow. Second operand has 24 states, 24 states have (on average 8.666666666666666) internal successors, (208), 24 states have internal predecessors, (208), 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) [2025-03-13 21:49:26,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:26,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-13 21:49:26,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:28,511 INFO L124 PetriNetUnfolderBase]: 1841/2761 cut-off events. [2025-03-13 21:49:28,511 INFO L125 PetriNetUnfolderBase]: For 1721/1721 co-relation queries the response was YES. [2025-03-13 21:49:28,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7669 conditions, 2761 events. 1841/2761 cut-off events. For 1721/1721 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 12690 event pairs, 106 based on Foata normal form. 1/2761 useless extension candidates. Maximal degree in co-relation 5614. Up to 1375 conditions per place. [2025-03-13 21:49:28,526 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 137 selfloop transitions, 57 changer transitions 1/199 dead transitions. [2025-03-13 21:49:28,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 199 transitions, 1067 flow [2025-03-13 21:49:28,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-13 21:49:28,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-13 21:49:28,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 321 transitions. [2025-03-13 21:49:28,530 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46320346320346323 [2025-03-13 21:49:28,530 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 132 flow. Second operand 21 states and 321 transitions. [2025-03-13 21:49:28,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 199 transitions, 1067 flow [2025-03-13 21:49:28,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 199 transitions, 1050 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-13 21:49:28,536 INFO L231 Difference]: Finished difference. Result has 64 places, 91 transitions, 543 flow [2025-03-13 21:49:28,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=543, PETRI_PLACES=64, PETRI_TRANSITIONS=91} [2025-03-13 21:49:28,537 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 29 predicate places. [2025-03-13 21:49:28,538 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 91 transitions, 543 flow [2025-03-13 21:49:28,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.666666666666666) internal successors, (208), 24 states have internal predecessors, (208), 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) [2025-03-13 21:49:28,539 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:28,539 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:28,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-13 21:49:28,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:28,739 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:49:28,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:28,740 INFO L85 PathProgramCache]: Analyzing trace with hash 886983781, now seen corresponding path program 2 times [2025-03-13 21:49:28,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:28,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862764751] [2025-03-13 21:49:28,740 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:49:28,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:28,746 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-13 21:49:28,777 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:49:28,777 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:49:28,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:29,198 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:29,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:29,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862764751] [2025-03-13 21:49:29,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862764751] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:29,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144280290] [2025-03-13 21:49:29,199 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:49:29,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:29,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:29,201 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:49:29,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-13 21:49:29,240 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-13 21:49:29,254 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:49:29,255 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:49:29,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:29,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-13 21:49:29,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:29,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 39 [2025-03-13 21:49:29,568 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:29,568 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:29,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:49:29,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 75 [2025-03-13 21:49:29,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:29,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144280290] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:49:29,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:49:29,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2025-03-13 21:49:29,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102782172] [2025-03-13 21:49:29,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:49:29,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-13 21:49:29,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:29,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-13 21:49:29,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2025-03-13 21:49:30,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-13 21:49:30,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 91 transitions, 543 flow. Second operand has 21 states, 21 states have (on average 9.80952380952381) internal successors, (206), 21 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) [2025-03-13 21:49:30,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:30,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-13 21:49:30,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:30,828 INFO L124 PetriNetUnfolderBase]: 1618/2628 cut-off events. [2025-03-13 21:49:30,829 INFO L125 PetriNetUnfolderBase]: For 3717/3717 co-relation queries the response was YES. [2025-03-13 21:49:30,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8545 conditions, 2628 events. 1618/2628 cut-off events. For 3717/3717 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 13715 event pairs, 122 based on Foata normal form. 2/2628 useless extension candidates. Maximal degree in co-relation 7995. Up to 1663 conditions per place. [2025-03-13 21:49:30,847 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 139 selfloop transitions, 89 changer transitions 1/235 dead transitions. [2025-03-13 21:49:30,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 235 transitions, 1631 flow [2025-03-13 21:49:30,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-13 21:49:30,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-13 21:49:30,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 316 transitions. [2025-03-13 21:49:30,850 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.455988455988456 [2025-03-13 21:49:30,850 INFO L175 Difference]: Start difference. First operand has 64 places, 91 transitions, 543 flow. Second operand 21 states and 316 transitions. [2025-03-13 21:49:30,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 235 transitions, 1631 flow [2025-03-13 21:49:30,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 235 transitions, 1469 flow, removed 54 selfloop flow, removed 3 redundant places. [2025-03-13 21:49:30,865 INFO L231 Difference]: Finished difference. Result has 91 places, 150 transitions, 1050 flow [2025-03-13 21:49:30,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1050, PETRI_PLACES=91, PETRI_TRANSITIONS=150} [2025-03-13 21:49:30,867 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 56 predicate places. [2025-03-13 21:49:30,867 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 150 transitions, 1050 flow [2025-03-13 21:49:30,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 9.80952380952381) internal successors, (206), 21 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) [2025-03-13 21:49:30,867 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:30,867 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:30,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-13 21:49:31,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:31,068 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:49:31,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:31,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1745271629, now seen corresponding path program 3 times [2025-03-13 21:49:31,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:31,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594579074] [2025-03-13 21:49:31,069 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:49:31,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:31,074 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-13 21:49:31,083 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:49:31,083 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:49:31,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:31,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:31,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:31,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594579074] [2025-03-13 21:49:31,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594579074] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:31,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683340769] [2025-03-13 21:49:31,408 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:49:31,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:31,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:31,410 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:49:31,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-13 21:49:31,446 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-13 21:49:31,461 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:49:31,461 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:49:31,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:31,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-13 21:49:31,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:31,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-13 21:49:31,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2025-03-13 21:49:31,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:31,700 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:32,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 217 treesize of output 195 [2025-03-13 21:49:32,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:49:32,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 296 treesize of output 278 [2025-03-13 21:49:36,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 167 [2025-03-13 21:49:36,285 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:49:36,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 215 treesize of output 219 [2025-03-13 21:49:37,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 96 [2025-03-13 21:49:37,179 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-13 21:49:37,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 115 [2025-03-13 21:49:37,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:37,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683340769] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:49:37,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:49:37,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 22 [2025-03-13 21:49:37,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860867526] [2025-03-13 21:49:37,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:49:37,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-13 21:49:37,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:37,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-13 21:49:37,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2025-03-13 21:49:37,677 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-13 21:49:37,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 150 transitions, 1050 flow. Second operand has 23 states, 23 states have (on average 9.782608695652174) internal successors, (225), 23 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:37,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:37,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-13 21:49:37,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:39,756 INFO L124 PetriNetUnfolderBase]: 3278/5291 cut-off events. [2025-03-13 21:49:39,756 INFO L125 PetriNetUnfolderBase]: For 13147/13167 co-relation queries the response was YES. [2025-03-13 21:49:39,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19951 conditions, 5291 events. 3278/5291 cut-off events. For 13147/13167 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 31209 event pairs, 247 based on Foata normal form. 20/5309 useless extension candidates. Maximal degree in co-relation 18814. Up to 2428 conditions per place. [2025-03-13 21:49:39,788 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 223 selfloop transitions, 187 changer transitions 2/418 dead transitions. [2025-03-13 21:49:39,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 418 transitions, 3345 flow [2025-03-13 21:49:39,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-13 21:49:39,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-13 21:49:39,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 523 transitions. [2025-03-13 21:49:39,790 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4661319073083779 [2025-03-13 21:49:39,790 INFO L175 Difference]: Start difference. First operand has 91 places, 150 transitions, 1050 flow. Second operand 34 states and 523 transitions. [2025-03-13 21:49:39,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 418 transitions, 3345 flow [2025-03-13 21:49:39,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 418 transitions, 3332 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-03-13 21:49:39,819 INFO L231 Difference]: Finished difference. Result has 134 places, 262 transitions, 2433 flow [2025-03-13 21:49:39,819 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1037, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=2433, PETRI_PLACES=134, PETRI_TRANSITIONS=262} [2025-03-13 21:49:39,820 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 99 predicate places. [2025-03-13 21:49:39,820 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 262 transitions, 2433 flow [2025-03-13 21:49:39,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.782608695652174) internal successors, (225), 23 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:39,820 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:39,820 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:39,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-13 21:49:40,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:40,021 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:49:40,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:40,022 INFO L85 PathProgramCache]: Analyzing trace with hash -998669659, now seen corresponding path program 4 times [2025-03-13 21:49:40,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:40,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59871263] [2025-03-13 21:49:40,022 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:49:40,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:40,028 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-13 21:49:40,045 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:49:40,048 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:49:40,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:40,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:40,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:40,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59871263] [2025-03-13 21:49:40,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59871263] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:40,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344799491] [2025-03-13 21:49:40,406 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:49:40,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:40,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:40,408 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:49:40,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-13 21:49:40,441 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-13 21:49:40,459 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:49:40,460 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:49:40,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:40,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-13 21:49:40,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:40,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2025-03-13 21:49:40,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:40,663 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:40,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:49:40,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 75 [2025-03-13 21:49:41,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:41,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344799491] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:49:41,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:49:41,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 25 [2025-03-13 21:49:41,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396094446] [2025-03-13 21:49:41,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:49:41,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-13 21:49:41,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:41,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-13 21:49:41,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2025-03-13 21:49:41,119 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-13 21:49:41,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 262 transitions, 2433 flow. Second operand has 26 states, 26 states have (on average 8.653846153846153) internal successors, (225), 26 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:41,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:41,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-13 21:49:41,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:42,054 INFO L124 PetriNetUnfolderBase]: 5173/8073 cut-off events. [2025-03-13 21:49:42,054 INFO L125 PetriNetUnfolderBase]: For 36051/36103 co-relation queries the response was YES. [2025-03-13 21:49:42,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35998 conditions, 8073 events. 5173/8073 cut-off events. For 36051/36103 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 49389 event pairs, 780 based on Foata normal form. 13/8083 useless extension candidates. Maximal degree in co-relation 34077. Up to 6034 conditions per place. [2025-03-13 21:49:42,101 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 294 selfloop transitions, 196 changer transitions 1/496 dead transitions. [2025-03-13 21:49:42,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 496 transitions, 5464 flow [2025-03-13 21:49:42,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-13 21:49:42,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-13 21:49:42,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 192 transitions. [2025-03-13 21:49:42,103 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3878787878787879 [2025-03-13 21:49:42,103 INFO L175 Difference]: Start difference. First operand has 134 places, 262 transitions, 2433 flow. Second operand 15 states and 192 transitions. [2025-03-13 21:49:42,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 496 transitions, 5464 flow [2025-03-13 21:49:42,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 496 transitions, 5136 flow, removed 106 selfloop flow, removed 12 redundant places. [2025-03-13 21:49:42,205 INFO L231 Difference]: Finished difference. Result has 145 places, 410 transitions, 4431 flow [2025-03-13 21:49:42,205 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2221, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4431, PETRI_PLACES=145, PETRI_TRANSITIONS=410} [2025-03-13 21:49:42,206 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 110 predicate places. [2025-03-13 21:49:42,206 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 410 transitions, 4431 flow [2025-03-13 21:49:42,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 8.653846153846153) internal successors, (225), 26 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:42,206 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:42,206 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:42,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-13 21:49:42,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:42,406 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:49:42,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:42,407 INFO L85 PathProgramCache]: Analyzing trace with hash -231077975, now seen corresponding path program 5 times [2025-03-13 21:49:42,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:42,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611965853] [2025-03-13 21:49:42,407 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:49:42,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:42,412 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-13 21:49:42,420 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:49:42,420 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:49:42,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:43,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:43,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:43,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611965853] [2025-03-13 21:49:43,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611965853] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:43,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699789365] [2025-03-13 21:49:43,038 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:49:43,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:43,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:43,040 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:49:43,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-13 21:49:43,078 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-13 21:49:43,096 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:49:43,096 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:49:43,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:43,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-13 21:49:43,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:43,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2025-03-13 21:49:43,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:43,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:43,536 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:49:43,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 75 [2025-03-13 21:49:43,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:43,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699789365] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:49:43,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:49:43,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 29 [2025-03-13 21:49:43,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144904281] [2025-03-13 21:49:43,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:49:43,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-13 21:49:43,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:43,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-13 21:49:43,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2025-03-13 21:49:43,931 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-13 21:49:43,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 410 transitions, 4431 flow. Second operand has 30 states, 30 states have (on average 7.5) internal successors, (225), 30 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:43,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:43,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-13 21:49:43,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:45,751 INFO L124 PetriNetUnfolderBase]: 10095/14619 cut-off events. [2025-03-13 21:49:45,751 INFO L125 PetriNetUnfolderBase]: For 75043/75784 co-relation queries the response was YES. [2025-03-13 21:49:45,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70425 conditions, 14619 events. 10095/14619 cut-off events. For 75043/75784 co-relation queries the response was YES. Maximal size of possible extension queue 653. Compared 84711 event pairs, 1052 based on Foata normal form. 604/15176 useless extension candidates. Maximal degree in co-relation 69008. Up to 8996 conditions per place. [2025-03-13 21:49:45,833 INFO L140 encePairwiseOnDemand]: 18/33 looper letters, 340 selfloop transitions, 415 changer transitions 4/762 dead transitions. [2025-03-13 21:49:45,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 762 transitions, 9298 flow [2025-03-13 21:49:45,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-13 21:49:45,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-13 21:49:45,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 306 transitions. [2025-03-13 21:49:45,835 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4214876033057851 [2025-03-13 21:49:45,835 INFO L175 Difference]: Start difference. First operand has 145 places, 410 transitions, 4431 flow. Second operand 22 states and 306 transitions. [2025-03-13 21:49:45,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 762 transitions, 9298 flow [2025-03-13 21:49:46,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 762 transitions, 9045 flow, removed 105 selfloop flow, removed 2 redundant places. [2025-03-13 21:49:46,102 INFO L231 Difference]: Finished difference. Result has 173 places, 643 transitions, 8574 flow [2025-03-13 21:49:46,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4290, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=214, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=8574, PETRI_PLACES=173, PETRI_TRANSITIONS=643} [2025-03-13 21:49:46,103 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 138 predicate places. [2025-03-13 21:49:46,103 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 643 transitions, 8574 flow [2025-03-13 21:49:46,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.5) internal successors, (225), 30 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:49:46,103 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:46,103 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:46,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-13 21:49:46,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:46,304 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:49:46,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:46,304 INFO L85 PathProgramCache]: Analyzing trace with hash 886717827, now seen corresponding path program 6 times [2025-03-13 21:49:46,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:46,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770015542] [2025-03-13 21:49:46,305 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:49:46,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:46,309 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-03-13 21:49:46,313 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 25 of 26 statements. [2025-03-13 21:49:46,313 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-13 21:49:46,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:46,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:46,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:46,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770015542] [2025-03-13 21:49:46,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770015542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:49:46,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:49:46,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-13 21:49:46,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934333855] [2025-03-13 21:49:46,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:49:46,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-13 21:49:46,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:46,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-13 21:49:46,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-13 21:49:46,849 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-13 21:49:46,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 643 transitions, 8574 flow. Second operand has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 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) [2025-03-13 21:49:46,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:46,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-13 21:49:46,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:49,257 INFO L124 PetriNetUnfolderBase]: 12102/17384 cut-off events. [2025-03-13 21:49:49,257 INFO L125 PetriNetUnfolderBase]: For 125290/126146 co-relation queries the response was YES. [2025-03-13 21:49:49,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98269 conditions, 17384 events. 12102/17384 cut-off events. For 125290/126146 co-relation queries the response was YES. Maximal size of possible extension queue 868. Compared 102281 event pairs, 996 based on Foata normal form. 791/18134 useless extension candidates. Maximal degree in co-relation 98024. Up to 9544 conditions per place. [2025-03-13 21:49:49,386 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 406 selfloop transitions, 784 changer transitions 1/1194 dead transitions. [2025-03-13 21:49:49,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 1194 transitions, 17558 flow [2025-03-13 21:49:49,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-13 21:49:49,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-03-13 21:49:49,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 375 transitions. [2025-03-13 21:49:49,387 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39184952978056425 [2025-03-13 21:49:49,387 INFO L175 Difference]: Start difference. First operand has 173 places, 643 transitions, 8574 flow. Second operand 29 states and 375 transitions. [2025-03-13 21:49:49,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 1194 transitions, 17558 flow [2025-03-13 21:49:49,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 1194 transitions, 17193 flow, removed 132 selfloop flow, removed 8 redundant places. [2025-03-13 21:49:49,914 INFO L231 Difference]: Finished difference. Result has 207 places, 1076 transitions, 17061 flow [2025-03-13 21:49:49,915 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=8347, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=643, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=386, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=17061, PETRI_PLACES=207, PETRI_TRANSITIONS=1076} [2025-03-13 21:49:49,915 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 172 predicate places. [2025-03-13 21:49:49,915 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 1076 transitions, 17061 flow [2025-03-13 21:49:49,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 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) [2025-03-13 21:49:49,915 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:49,915 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:49,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 21:49:49,915 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:49:49,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:49,916 INFO L85 PathProgramCache]: Analyzing trace with hash -345265887, now seen corresponding path program 7 times [2025-03-13 21:49:49,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:49,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832051237] [2025-03-13 21:49:49,916 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:49:49,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:49,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-13 21:49:49,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:49:49,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:49,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:50,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:50,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:50,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832051237] [2025-03-13 21:49:50,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832051237] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:50,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155695288] [2025-03-13 21:49:50,359 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:49:50,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:50,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:50,362 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:49:50,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-13 21:49:50,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-13 21:49:50,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:49:50,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:49:50,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:50,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-13 21:49:50,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:50,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-13 21:49:50,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2025-03-13 21:49:50,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:50,702 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:52,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 96 [2025-03-13 21:49:52,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:49:52,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 119 [2025-03-13 21:49:52,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 167 [2025-03-13 21:49:52,344 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2025-03-13 21:49:52,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 215 treesize of output 1 [2025-03-13 21:49:52,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 217 treesize of output 195 [2025-03-13 21:49:52,361 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2025-03-13 21:49:52,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 296 treesize of output 1 [2025-03-13 21:49:52,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:49:52,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155695288] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:49:52,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:49:52,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 25 [2025-03-13 21:49:52,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064551080] [2025-03-13 21:49:52,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:49:52,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-13 21:49:52,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:52,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-13 21:49:52,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2025-03-13 21:49:52,534 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-13 21:49:52,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 1076 transitions, 17061 flow. Second operand has 26 states, 26 states have (on average 8.76923076923077) internal successors, (228), 26 states have internal predecessors, (228), 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) [2025-03-13 21:49:52,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:52,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-13 21:49:52,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:49:56,152 INFO L124 PetriNetUnfolderBase]: 11253/16520 cut-off events. [2025-03-13 21:49:56,152 INFO L125 PetriNetUnfolderBase]: For 174759/176370 co-relation queries the response was YES. [2025-03-13 21:49:56,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109746 conditions, 16520 events. 11253/16520 cut-off events. For 174759/176370 co-relation queries the response was YES. Maximal size of possible extension queue 878. Compared 101642 event pairs, 822 based on Foata normal form. 1164/17505 useless extension candidates. Maximal degree in co-relation 109455. Up to 10143 conditions per place. [2025-03-13 21:49:56,299 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 613 selfloop transitions, 598 changer transitions 2/1236 dead transitions. [2025-03-13 21:49:56,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 1236 transitions, 20876 flow [2025-03-13 21:49:56,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-13 21:49:56,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-13 21:49:56,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 332 transitions. [2025-03-13 21:49:56,301 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4573002754820937 [2025-03-13 21:49:56,301 INFO L175 Difference]: Start difference. First operand has 207 places, 1076 transitions, 17061 flow. Second operand 22 states and 332 transitions. [2025-03-13 21:49:56,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 1236 transitions, 20876 flow [2025-03-13 21:49:57,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 1236 transitions, 19954 flow, removed 458 selfloop flow, removed 2 redundant places. [2025-03-13 21:49:57,696 INFO L231 Difference]: Finished difference. Result has 228 places, 1122 transitions, 18379 flow [2025-03-13 21:49:57,697 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=16215, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1076, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=556, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=494, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=18379, PETRI_PLACES=228, PETRI_TRANSITIONS=1122} [2025-03-13 21:49:57,697 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 193 predicate places. [2025-03-13 21:49:57,697 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 1122 transitions, 18379 flow [2025-03-13 21:49:57,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 8.76923076923077) internal successors, (228), 26 states have internal predecessors, (228), 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) [2025-03-13 21:49:57,698 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:49:57,698 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:49:57,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-13 21:49:57,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:57,902 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:49:57,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:49:57,903 INFO L85 PathProgramCache]: Analyzing trace with hash 2134599543, now seen corresponding path program 8 times [2025-03-13 21:49:57,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:49:57,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244338184] [2025-03-13 21:49:57,903 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:49:57,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:49:57,907 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-13 21:49:57,910 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:49:57,910 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:49:57,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:57,966 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:57,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:49:57,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244338184] [2025-03-13 21:49:57,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244338184] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:49:57,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581115038] [2025-03-13 21:49:57,967 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:49:57,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:49:57,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:49:57,969 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:49:57,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-13 21:49:58,009 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-13 21:49:58,025 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:49:58,026 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:49:58,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:49:58,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-13 21:49:58,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:49:58,106 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:58,106 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:49:58,170 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:49:58,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581115038] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:49:58,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:49:58,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-13 21:49:58,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147507143] [2025-03-13 21:49:58,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:49:58,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-13 21:49:58,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:49:58,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-13 21:49:58,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2025-03-13 21:49:58,211 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-13 21:49:58,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 1122 transitions, 18379 flow. Second operand has 18 states, 18 states have (on average 7.277777777777778) internal successors, (131), 18 states have internal predecessors, (131), 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) [2025-03-13 21:49:58,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:49:58,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-13 21:49:58,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:02,311 INFO L124 PetriNetUnfolderBase]: 16304/23820 cut-off events. [2025-03-13 21:50:02,312 INFO L125 PetriNetUnfolderBase]: For 249993/251395 co-relation queries the response was YES. [2025-03-13 21:50:02,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153156 conditions, 23820 events. 16304/23820 cut-off events. For 249993/251395 co-relation queries the response was YES. Maximal size of possible extension queue 1206. Compared 152681 event pairs, 2778 based on Foata normal form. 1009/24714 useless extension candidates. Maximal degree in co-relation 151196. Up to 8021 conditions per place. [2025-03-13 21:50:02,487 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 1711 selfloop transitions, 185 changer transitions 2/1919 dead transitions. [2025-03-13 21:50:02,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 1919 transitions, 33145 flow [2025-03-13 21:50:02,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-13 21:50:02,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-13 21:50:02,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 219 transitions. [2025-03-13 21:50:02,489 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.474025974025974 [2025-03-13 21:50:02,489 INFO L175 Difference]: Start difference. First operand has 228 places, 1122 transitions, 18379 flow. Second operand 14 states and 219 transitions. [2025-03-13 21:50:02,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 1919 transitions, 33145 flow [2025-03-13 21:50:03,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 1919 transitions, 32732 flow, removed 78 selfloop flow, removed 11 redundant places. [2025-03-13 21:50:03,892 INFO L231 Difference]: Finished difference. Result has 236 places, 1231 transitions, 19810 flow [2025-03-13 21:50:03,893 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=17913, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1030, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=19810, PETRI_PLACES=236, PETRI_TRANSITIONS=1231} [2025-03-13 21:50:03,893 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 201 predicate places. [2025-03-13 21:50:03,893 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 1231 transitions, 19810 flow [2025-03-13 21:50:03,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.277777777777778) internal successors, (131), 18 states have internal predecessors, (131), 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) [2025-03-13 21:50:03,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:03,893 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:50:03,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-13 21:50:04,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-13 21:50:04,094 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:50:04,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:04,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1884228951, now seen corresponding path program 9 times [2025-03-13 21:50:04,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:04,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541057596] [2025-03-13 21:50:04,095 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:50:04,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:04,099 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-03-13 21:50:04,104 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:50:04,104 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:50:04,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:04,144 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:50:04,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:04,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541057596] [2025-03-13 21:50:04,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541057596] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:50:04,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507446696] [2025-03-13 21:50:04,145 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:50:04,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:04,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:50:04,147 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:50:04,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-13 21:50:04,184 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-03-13 21:50:04,198 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:50:04,199 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:50:04,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:04,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 21:50:04,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:50:04,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:50:04,251 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:50:04,291 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:50:04,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507446696] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-13 21:50:04,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-13 21:50:04,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 13 [2025-03-13 21:50:04,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168507614] [2025-03-13 21:50:04,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:50:04,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:50:04,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:04,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:50:04,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-03-13 21:50:04,299 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-13 21:50:04,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 1231 transitions, 19810 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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) [2025-03-13 21:50:04,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:04,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-13 21:50:04,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:08,554 INFO L124 PetriNetUnfolderBase]: 15118/22256 cut-off events. [2025-03-13 21:50:08,554 INFO L125 PetriNetUnfolderBase]: For 264246/266114 co-relation queries the response was YES. [2025-03-13 21:50:08,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156413 conditions, 22256 events. 15118/22256 cut-off events. For 264246/266114 co-relation queries the response was YES. Maximal size of possible extension queue 1122. Compared 143647 event pairs, 2081 based on Foata normal form. 1475/23649 useless extension candidates. Maximal degree in co-relation 154382. Up to 8144 conditions per place. [2025-03-13 21:50:08,734 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 1490 selfloop transitions, 98 changer transitions 0/1647 dead transitions. [2025-03-13 21:50:08,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 1647 transitions, 28861 flow [2025-03-13 21:50:08,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-13 21:50:08,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-13 21:50:08,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2025-03-13 21:50:08,735 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2025-03-13 21:50:08,735 INFO L175 Difference]: Start difference. First operand has 236 places, 1231 transitions, 19810 flow. Second operand 8 states and 144 transitions. [2025-03-13 21:50:08,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 1647 transitions, 28861 flow [2025-03-13 21:50:10,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 1647 transitions, 28606 flow, removed 124 selfloop flow, removed 3 redundant places. [2025-03-13 21:50:10,468 INFO L231 Difference]: Finished difference. Result has 242 places, 1245 transitions, 20128 flow [2025-03-13 21:50:10,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=19466, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=20128, PETRI_PLACES=242, PETRI_TRANSITIONS=1245} [2025-03-13 21:50:10,469 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 207 predicate places. [2025-03-13 21:50:10,469 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 1245 transitions, 20128 flow [2025-03-13 21:50:10,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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) [2025-03-13 21:50:10,469 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:10,470 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:50:10,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-13 21:50:10,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-13 21:50:10,671 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:50:10,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:10,671 INFO L85 PathProgramCache]: Analyzing trace with hash 339548657, now seen corresponding path program 10 times [2025-03-13 21:50:10,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:10,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774584601] [2025-03-13 21:50:10,671 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:50:10,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:10,675 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-13 21:50:10,676 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 27 of 29 statements. [2025-03-13 21:50:10,676 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-13 21:50:10,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:10,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:50:10,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:10,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774584601] [2025-03-13 21:50:10,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774584601] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:50:10,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672770905] [2025-03-13 21:50:10,722 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:50:10,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:10,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:50:10,724 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:50:10,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-13 21:50:10,761 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-13 21:50:10,791 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 27 of 29 statements. [2025-03-13 21:50:10,791 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-13 21:50:10,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:10,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 21:50:10,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:50:10,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:50:10,864 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:50:10,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:50:10,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672770905] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:50:10,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:50:10,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-03-13 21:50:10,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847442855] [2025-03-13 21:50:10,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:50:10,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-13 21:50:10,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:10,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-13 21:50:10,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-03-13 21:50:10,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-13 21:50:10,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 1245 transitions, 20128 flow. Second operand has 14 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 states have internal predecessors, (100), 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) [2025-03-13 21:50:10,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:10,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-13 21:50:10,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:16,674 INFO L124 PetriNetUnfolderBase]: 21669/31342 cut-off events. [2025-03-13 21:50:16,674 INFO L125 PetriNetUnfolderBase]: For 374056/374056 co-relation queries the response was YES. [2025-03-13 21:50:16,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216520 conditions, 31342 events. 21669/31342 cut-off events. For 374056/374056 co-relation queries the response was YES. Maximal size of possible extension queue 1401. Compared 200842 event pairs, 2398 based on Foata normal form. 14/31356 useless extension candidates. Maximal degree in co-relation 214265. Up to 9689 conditions per place. [2025-03-13 21:50:17,056 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 2289 selfloop transitions, 512 changer transitions 1/2803 dead transitions. [2025-03-13 21:50:17,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 2803 transitions, 50133 flow [2025-03-13 21:50:17,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-13 21:50:17,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-13 21:50:17,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 261 transitions. [2025-03-13 21:50:17,058 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41626794258373206 [2025-03-13 21:50:17,058 INFO L175 Difference]: Start difference. First operand has 242 places, 1245 transitions, 20128 flow. Second operand 19 states and 261 transitions. [2025-03-13 21:50:17,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 2803 transitions, 50133 flow [2025-03-13 21:50:19,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 2803 transitions, 50078 flow, removed 25 selfloop flow, removed 2 redundant places. [2025-03-13 21:50:19,956 INFO L231 Difference]: Finished difference. Result has 272 places, 1563 transitions, 26878 flow [2025-03-13 21:50:19,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=20117, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=205, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=985, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=26878, PETRI_PLACES=272, PETRI_TRANSITIONS=1563} [2025-03-13 21:50:19,958 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 237 predicate places. [2025-03-13 21:50:19,958 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 1563 transitions, 26878 flow [2025-03-13 21:50:19,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 states have internal predecessors, (100), 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) [2025-03-13 21:50:19,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:19,958 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:50:19,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-13 21:50:20,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-13 21:50:20,159 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:50:20,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:20,160 INFO L85 PathProgramCache]: Analyzing trace with hash 114886501, now seen corresponding path program 11 times [2025-03-13 21:50:20,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:20,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571607672] [2025-03-13 21:50:20,160 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:50:20,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:20,164 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-13 21:50:20,166 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 21:50:20,166 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:50:20,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:20,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:50:20,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:20,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571607672] [2025-03-13 21:50:20,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571607672] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:50:20,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984732588] [2025-03-13 21:50:20,204 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:50:20,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:20,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:50:20,206 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:50:20,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-13 21:50:20,244 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-13 21:50:20,256 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 21:50:20,256 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:50:20,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:20,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 21:50:20,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:50:20,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:50:20,295 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:50:20,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:50:20,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984732588] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:50:20,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:50:20,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-13 21:50:20,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980485049] [2025-03-13 21:50:20,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:50:20,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-13 21:50:20,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:20,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-13 21:50:20,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-13 21:50:20,346 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-13 21:50:20,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 1563 transitions, 26878 flow. Second operand has 14 states, 14 states have (on average 9.5) internal successors, (133), 14 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:20,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:20,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-13 21:50:20,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:24,947 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([351] L71-->L70-3: Formula: (let ((.cse0 (select (select |v_#memory_int#1_59| v_~A~0.base_113) (+ v_~A~0.offset_113 (* v_thread3Thread1of1ForFork2_~i~2_7 4))))) (or (and (= v_~min3~0_82 .cse0) (< .cse0 v_~min3~0_83)) (and (= v_~min3~0_83 v_~min3~0_82) (<= v_~min3~0_83 .cse0) (= |v_thread3Thread1of1ForFork2_#t~mem8_2| |v_thread3Thread1of1ForFork2_#t~mem8_1|)))) InVars {thread3Thread1of1ForFork2_#t~mem8=|v_thread3Thread1of1ForFork2_#t~mem8_1|, ~A~0.base=v_~A~0.base_113, ~A~0.offset=v_~A~0.offset_113, #memory_int#1=|v_#memory_int#1_59|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7, ~min3~0=v_~min3~0_83} OutVars{~A~0.base=v_~A~0.base_113, ~A~0.offset=v_~A~0.offset_113, thread3Thread1of1ForFork2_#t~mem8=|v_thread3Thread1of1ForFork2_#t~mem8_2|, thread3Thread1of1ForFork2_#t~mem7=|v_thread3Thread1of1ForFork2_#t~mem7_1|, #memory_int#1=|v_#memory_int#1_59|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7, ~min3~0=v_~min3~0_82} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem8, thread3Thread1of1ForFork2_#t~mem7, ~min3~0][1212], [Black: 1027#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 917#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), Black: 1029#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))), Black: 847#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1023#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (or (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1))) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork1_~i~0 0) (or (< (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~min3~0 0))), Black: 1031#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (= thread3Thread1of1ForFork2_~i~2 0)), 842#true, Black: 995#(or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (and (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (= ~M~0 0))), Black: 1019#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1259#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~min3~0 0)), Black: 1264#(and (= ~min1~0 0) (or (and (= ~min2~0 0) (or (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~min3~0 0))) (< 1 ~N~0)) (= ~A~0.offset 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1281#(and (= ~min1~0 0) (or (and (= ~min2~0 0) (or (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~min3~0 0))) (< 1 ~N~0)) (= ~A~0.offset 0) (or (not (= thread3Thread1of1ForFork2_~i~2 0)) (and (= ~min2~0 0) (= ~min3~0 0))) (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1262#(and (= ~min1~0 0) (= ~A~0.offset 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= 0 thread3Thread1of1ForFork2_~i~2) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0))) (or (not (= thread3Thread1of1ForFork2_~i~2 0)) (and (= ~min2~0 0) (or (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~min3~0 0))))), Black: 1267#(or (and (= ~min2~0 ~min1~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 0) (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0))), Black: 1271#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~min3~0 0) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1266#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (and (= ~min2~0 ~min1~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 0) (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0))), Black: 1273#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~min3~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1263#(and (= ~min1~0 0) (= ~A~0.offset 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= 0 thread3Thread1of1ForFork2_~i~2) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0))) (or (not (= thread3Thread1of1ForFork2_~i~2 0)) (and (= ~min2~0 0) (or (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~min3~0 0)))) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1269#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~min3~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1285#(and (= ~min1~0 0) (= ~A~0.offset 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= 0 thread3Thread1of1ForFork2_~i~2) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0))) (or (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1)) (< 1 ~N~0)) (or (not (= thread3Thread1of1ForFork2_~i~2 0)) (and (= ~min2~0 0) (= ~min3~0 0))) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1265#(and (= thread1Thread1of1ForFork1_~i~0 0) (or (and (= ~min2~0 ~min1~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 0) (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (< 1 ~N~0))), Black: 1261#(and (= ~min1~0 0) (= ~A~0.offset 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= 0 thread3Thread1of1ForFork2_~i~2) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0))) (or (not (= thread3Thread1of1ForFork2_~i~2 0)) (and (= ~min2~0 0) (= ~min3~0 0)))), 1907#(<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), 1041#true, Black: 48#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~N~0) |ULTIMATE.start_create_fresh_int_array_~size#1|), Black: 2084#(and (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 613#true, Black: 1938#(and (<= 0 thread1Thread1of1ForFork1_~i~0) (<= ~M~0 0)), Black: 52#(<= (+ ~M~0 1) ~N~0), Black: 2088#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= 2 ~N~0) (<= ~M~0 0)), Black: 2092#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 11#L94-1true, Black: 2094#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= 2 ~N~0) (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1958#(and (<= 2 ~N~0) (<= ~M~0 0)), 2163#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 1)), 1538#(<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), Black: 2102#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0) (<= ~M~0 0)), Black: 811#(and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 1)) (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 1))) (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (<= ~min2~0 ~min3~0)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))) (or (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 ~min3~0)) (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))), Black: 2098#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0) (<= ~M~0 0)), Black: 809#(and (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)))), Black: 1902#(<= ~M~0 0), Black: 827#(and (= ~min2~0 0) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min3~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2086#(and (<= 0 thread1Thread1of1ForFork1_~i~0) (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 813#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (<= ~min3~0 (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4))) (or (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1))) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork1_~i~0 0) (or (< (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~min3~0 0))), Black: 2082#(and (<= thread2Thread1of1ForFork0_~i~1 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 817#(and (or (and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))) (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))) (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min3~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))), Black: 1948#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~M~0 0)), Black: 2090#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= thread3Thread1of1ForFork2_~i~2 0) (<= 2 ~N~0) (<= ~M~0 0)), Black: 795#(and (or (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (and (or (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (and (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) ~min2~0)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (and (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0)) (and (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) ~min2~0))))) (or (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (or (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 ~min3~0)) (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min3~0)) (or (and (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (<= ~min2~0 ~min3~0)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))) (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min3~0)) (or (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (and (or (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (and (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) ~min2~0)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (and (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0)) (and (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) ~min2~0)))))), Black: 1901#(<= thread2Thread1of1ForFork0_~i~1 0), Black: 829#(and (= ~min2~0 0) (or (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min3~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), Black: 619#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 753#(and (or (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (and (or (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (and (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) ~min2~0)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (and (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0)) (and (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) ~min2~0))))) (or (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (or (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 ~min3~0)) (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min3~0))), Black: 825#(and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 1)) (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 1))) (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)))), Black: 821#(and (= ~min2~0 0) (<= ~min3~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min3~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 803#(and (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (<= ~min2~0 ~min3~0)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))) (or (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 ~min3~0)) (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))), 7#L46true, Black: 586#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 588#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~M~0 0)), Black: 420#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (= ~min1~0 0) (and (not (= (select (select |#memory_int#1| ~A~0.base) 0) 0)) (<= (select (select |#memory_int#1| ~A~0.base) 0) 0))) (or (= ~min1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1))) (= ~min3~0 0) (= ~M~0 0)), Black: 584#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= ~M~0 0)), Black: 590#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 416#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~min3~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 602#(and (= ~min2~0 0) (<= ~min3~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0) (= ~M~0 0)), Black: 415#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~min3~0 0)), Black: 419#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (= ~min1~0 0) (and (not (= (select (select |#memory_int#1| ~A~0.base) 0) 0)) (<= (select (select |#memory_int#1| ~A~0.base) 0) 0))) (or (= ~min1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1))) (= ~min3~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 1895#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0)), Black: 1726#(<= 2 ~N~0), 1722#true, 1316#true, Black: 406#(and (= ~min2~0 0) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))), Black: 378#(and (= ~min1~0 0) (= ~min2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= ~min3~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 382#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (<= ~N~0 1) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 347#(and (or (and (or (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (and (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) ~min2~0))) (or (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 ~min3~0)) (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min3~0))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (and (or (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (and (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0)) (and (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) ~min2~0))) (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0)) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min3~0))))), Black: 380#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (<= ~N~0 1) (= ~M~0 0)), Black: 1534#(<= 2 ~N~0), Black: 1707#(and (<= 2 ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1535#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= 2 ~N~0)), Black: 1593#(and (<= 2 ~N~0) (<= ~M~0 0)), 412#true, Black: 1711#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= 2 ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1715#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0) (<= ~M~0 0)), 1256#true, Black: 200#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 1 ~N~0)), 61#(<= 1 ~N~0), Black: 1228#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (<= 1 ~N~0) (= ~min3~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1234#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~N~0 1) (= ~min3~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 thread3Thread1of1ForFork2_~i~2) (= ~M~0 0)), Black: 1119#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), Black: 1053#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (<= 0 ~min3~0))))), Black: 1244#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1238#(and (= ~A~0.offset 0) (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (and (= ~min2~0 0) (or (and (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) 0)) (<= (+ (select (select |#memory_int#1| ~A~0.base) 0) 1) ~min1~0) (<= (+ ~min3~0 1) 0)) (and (= ~min1~0 0) (<= 0 ~min3~0) (<= 0 (select (select |#memory_int#1| ~A~0.base) 0))))) (< 1 ~N~0)) (or (< 0 ~N~0) (and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (<= 0 ~min3~0))))) (= thread1Thread1of1ForFork1_~i~0 0)), 29#L59true, Black: 1242#(and (or (and (not (= thread3Thread1of1ForFork2_~i~2 0)) (or (< 1 ~N~0) (< (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0))) (and (= ~min2~0 0) (or (and (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) 0)) (<= (+ (select (select |#memory_int#1| ~A~0.base) 0) 1) ~min1~0) (<= (+ ~min3~0 1) 0)) (and (= ~min1~0 0) (<= 0 ~min3~0) (<= 0 (select (select |#memory_int#1| ~A~0.base) 0)))))) (= ~A~0.offset 0) (or (< 0 ~N~0) (and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (<= 0 ~min3~0))))) (= thread1Thread1of1ForFork1_~i~0 0)), 203#true, 34#L70-3true, Black: 1527#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min3~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))), Black: 1523#(and (= ~min2~0 0) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (or (= ~min1~0 0) (< ~min3~0 0)) (<= ~min3~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= thread1Thread1of1ForFork1_~i~0 0) (= ~min3~0 ~min1~0))]) [2025-03-13 21:50:24,948 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-03-13 21:50:24,948 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-13 21:50:24,948 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-13 21:50:24,948 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-03-13 21:50:25,118 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([351] L71-->L70-3: Formula: (let ((.cse0 (select (select |v_#memory_int#1_59| v_~A~0.base_113) (+ v_~A~0.offset_113 (* v_thread3Thread1of1ForFork2_~i~2_7 4))))) (or (and (= v_~min3~0_82 .cse0) (< .cse0 v_~min3~0_83)) (and (= v_~min3~0_83 v_~min3~0_82) (<= v_~min3~0_83 .cse0) (= |v_thread3Thread1of1ForFork2_#t~mem8_2| |v_thread3Thread1of1ForFork2_#t~mem8_1|)))) InVars {thread3Thread1of1ForFork2_#t~mem8=|v_thread3Thread1of1ForFork2_#t~mem8_1|, ~A~0.base=v_~A~0.base_113, ~A~0.offset=v_~A~0.offset_113, #memory_int#1=|v_#memory_int#1_59|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7, ~min3~0=v_~min3~0_83} OutVars{~A~0.base=v_~A~0.base_113, ~A~0.offset=v_~A~0.offset_113, thread3Thread1of1ForFork2_#t~mem8=|v_thread3Thread1of1ForFork2_#t~mem8_2|, thread3Thread1of1ForFork2_#t~mem7=|v_thread3Thread1of1ForFork2_#t~mem7_1|, #memory_int#1=|v_#memory_int#1_59|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7, ~min3~0=v_~min3~0_82} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem8, thread3Thread1of1ForFork2_#t~mem7, ~min3~0][1212], [Black: 1027#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 917#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), Black: 1029#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))), Black: 847#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1023#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (or (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1))) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork1_~i~0 0) (or (< (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~min3~0 0))), Black: 1031#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (= thread3Thread1of1ForFork2_~i~2 0)), 842#true, Black: 995#(or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (and (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (= ~M~0 0))), Black: 1019#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1259#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~min3~0 0)), Black: 1264#(and (= ~min1~0 0) (or (and (= ~min2~0 0) (or (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~min3~0 0))) (< 1 ~N~0)) (= ~A~0.offset 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1281#(and (= ~min1~0 0) (or (and (= ~min2~0 0) (or (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~min3~0 0))) (< 1 ~N~0)) (= ~A~0.offset 0) (or (not (= thread3Thread1of1ForFork2_~i~2 0)) (and (= ~min2~0 0) (= ~min3~0 0))) (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1262#(and (= ~min1~0 0) (= ~A~0.offset 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= 0 thread3Thread1of1ForFork2_~i~2) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0))) (or (not (= thread3Thread1of1ForFork2_~i~2 0)) (and (= ~min2~0 0) (or (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~min3~0 0))))), Black: 1267#(or (and (= ~min2~0 ~min1~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 0) (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0))), Black: 1271#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~min3~0 0) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1266#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (and (= ~min2~0 ~min1~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 0) (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0))), Black: 1273#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~min3~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1263#(and (= ~min1~0 0) (= ~A~0.offset 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= 0 thread3Thread1of1ForFork2_~i~2) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0))) (or (not (= thread3Thread1of1ForFork2_~i~2 0)) (and (= ~min2~0 0) (or (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~min3~0 0)))) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1269#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~min3~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1285#(and (= ~min1~0 0) (= ~A~0.offset 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= 0 thread3Thread1of1ForFork2_~i~2) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0))) (or (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1)) (< 1 ~N~0)) (or (not (= thread3Thread1of1ForFork2_~i~2 0)) (and (= ~min2~0 0) (= ~min3~0 0))) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1265#(and (= thread1Thread1of1ForFork1_~i~0 0) (or (and (= ~min2~0 ~min1~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 0) (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (< 1 ~N~0))), Black: 1261#(and (= ~min1~0 0) (= ~A~0.offset 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= 0 thread3Thread1of1ForFork2_~i~2) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0))) (or (not (= thread3Thread1of1ForFork2_~i~2 0)) (and (= ~min2~0 0) (= ~min3~0 0)))), 1907#(<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), 1041#true, Black: 48#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~N~0) |ULTIMATE.start_create_fresh_int_array_~size#1|), 613#true, Black: 2084#(and (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1938#(and (<= 0 thread1Thread1of1ForFork1_~i~0) (<= ~M~0 0)), Black: 52#(<= (+ ~M~0 1) ~N~0), Black: 2088#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= 2 ~N~0) (<= ~M~0 0)), Black: 2092#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 2094#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= 2 ~N~0) (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 2163#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 1)), Black: 1958#(and (<= 2 ~N~0) (<= ~M~0 0)), 1538#(<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), Black: 2102#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0) (<= ~M~0 0)), Black: 811#(and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 1)) (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 1))) (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (<= ~min2~0 ~min3~0)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))) (or (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 ~min3~0)) (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))), Black: 2098#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0) (<= ~M~0 0)), Black: 809#(and (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)))), Black: 1902#(<= ~M~0 0), Black: 827#(and (= ~min2~0 0) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min3~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2086#(and (<= 0 thread1Thread1of1ForFork1_~i~0) (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 813#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (<= ~min3~0 (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4))) (or (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1))) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork1_~i~0 0) (or (< (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~min3~0 0))), Black: 2082#(and (<= thread2Thread1of1ForFork0_~i~1 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 817#(and (or (and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))) (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))) (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min3~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))), Black: 1948#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~M~0 0)), Black: 2090#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= thread3Thread1of1ForFork2_~i~2 0) (<= 2 ~N~0) (<= ~M~0 0)), Black: 795#(and (or (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (and (or (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (and (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) ~min2~0)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (and (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0)) (and (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) ~min2~0))))) (or (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (or (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 ~min3~0)) (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min3~0)) (or (and (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (<= ~min2~0 ~min3~0)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))) (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min3~0)) (or (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (and (or (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (and (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) ~min2~0)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (and (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0)) (and (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) ~min2~0)))))), Black: 829#(and (= ~min2~0 0) (or (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min3~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), Black: 1901#(<= thread2Thread1of1ForFork0_~i~1 0), Black: 619#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 753#(and (or (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (and (or (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (and (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) ~min2~0)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (and (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0)) (and (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) ~min2~0))))) (or (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (or (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 ~min3~0)) (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min3~0))), Black: 825#(and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 1)) (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 1))) (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)))), Black: 821#(and (= ~min2~0 0) (<= ~min3~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min3~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 803#(and (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (<= ~min2~0 ~min3~0)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))) (or (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 ~min3~0)) (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))), 7#L46true, Black: 586#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 588#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~M~0 0)), Black: 420#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (= ~min1~0 0) (and (not (= (select (select |#memory_int#1| ~A~0.base) 0) 0)) (<= (select (select |#memory_int#1| ~A~0.base) 0) 0))) (or (= ~min1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1))) (= ~min3~0 0) (= ~M~0 0)), Black: 584#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= ~M~0 0)), Black: 590#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 416#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~min3~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 602#(and (= ~min2~0 0) (<= ~min3~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0) (= ~M~0 0)), Black: 415#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~min3~0 0)), Black: 419#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (= ~min1~0 0) (and (not (= (select (select |#memory_int#1| ~A~0.base) 0) 0)) (<= (select (select |#memory_int#1| ~A~0.base) 0) 0))) (or (= ~min1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1))) (= ~min3~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 1895#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0)), Black: 1726#(<= 2 ~N~0), 1722#true, 1316#true, Black: 406#(and (= ~min2~0 0) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))), Black: 378#(and (= ~min1~0 0) (= ~min2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= ~min3~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 382#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (<= ~N~0 1) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 347#(and (or (and (or (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (and (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) ~min2~0))) (or (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 ~min3~0)) (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min3~0))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (and (or (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (and (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0)) (and (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) ~min2~0))) (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0)) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min3~0))))), Black: 380#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (<= ~N~0 1) (= ~M~0 0)), 26#L95true, Black: 1534#(<= 2 ~N~0), Black: 1707#(and (<= 2 ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1535#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= 2 ~N~0)), Black: 1593#(and (<= 2 ~N~0) (<= ~M~0 0)), 412#true, Black: 1711#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= 2 ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1715#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0) (<= ~M~0 0)), 1256#true, Black: 200#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 1 ~N~0)), 61#(<= 1 ~N~0), Black: 1228#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (<= 1 ~N~0) (= ~min3~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1234#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~N~0 1) (= ~min3~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 thread3Thread1of1ForFork2_~i~2) (= ~M~0 0)), Black: 1119#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), Black: 1053#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (<= 0 ~min3~0))))), Black: 1244#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1238#(and (= ~A~0.offset 0) (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (and (= ~min2~0 0) (or (and (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) 0)) (<= (+ (select (select |#memory_int#1| ~A~0.base) 0) 1) ~min1~0) (<= (+ ~min3~0 1) 0)) (and (= ~min1~0 0) (<= 0 ~min3~0) (<= 0 (select (select |#memory_int#1| ~A~0.base) 0))))) (< 1 ~N~0)) (or (< 0 ~N~0) (and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (<= 0 ~min3~0))))) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1242#(and (or (and (not (= thread3Thread1of1ForFork2_~i~2 0)) (or (< 1 ~N~0) (< (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0))) (and (= ~min2~0 0) (or (and (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) 0)) (<= (+ (select (select |#memory_int#1| ~A~0.base) 0) 1) ~min1~0) (<= (+ ~min3~0 1) 0)) (and (= ~min1~0 0) (<= 0 ~min3~0) (<= 0 (select (select |#memory_int#1| ~A~0.base) 0)))))) (= ~A~0.offset 0) (or (< 0 ~N~0) (and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (<= 0 ~min3~0))))) (= thread1Thread1of1ForFork1_~i~0 0)), 29#L59true, 203#true, 34#L70-3true, Black: 1527#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min3~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))), Black: 1523#(and (= ~min2~0 0) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (or (= ~min1~0 0) (< ~min3~0 0)) (<= ~min3~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= thread1Thread1of1ForFork1_~i~0 0) (= ~min3~0 ~min1~0))]) [2025-03-13 21:50:25,119 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-03-13 21:50:25,119 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-03-13 21:50:25,119 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-13 21:50:25,119 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-03-13 21:50:25,384 INFO L124 PetriNetUnfolderBase]: 14715/22340 cut-off events. [2025-03-13 21:50:25,384 INFO L125 PetriNetUnfolderBase]: For 378479/380110 co-relation queries the response was YES. [2025-03-13 21:50:25,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172483 conditions, 22340 events. 14715/22340 cut-off events. For 378479/380110 co-relation queries the response was YES. Maximal size of possible extension queue 1176. Compared 152792 event pairs, 3043 based on Foata normal form. 1642/23830 useless extension candidates. Maximal degree in co-relation 170766. Up to 8191 conditions per place. [2025-03-13 21:50:25,654 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 1429 selfloop transitions, 111 changer transitions 4/1679 dead transitions. [2025-03-13 21:50:25,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 1679 transitions, 30700 flow [2025-03-13 21:50:25,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:50:25,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:50:25,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2025-03-13 21:50:25,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2025-03-13 21:50:25,655 INFO L175 Difference]: Start difference. First operand has 272 places, 1563 transitions, 26878 flow. Second operand 7 states and 121 transitions. [2025-03-13 21:50:25,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 1679 transitions, 30700 flow [2025-03-13 21:50:29,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 1679 transitions, 30457 flow, removed 120 selfloop flow, removed 1 redundant places. [2025-03-13 21:50:29,373 INFO L231 Difference]: Finished difference. Result has 278 places, 1414 transitions, 24042 flow [2025-03-13 21:50:29,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=23785, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=24042, PETRI_PLACES=278, PETRI_TRANSITIONS=1414} [2025-03-13 21:50:29,374 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 243 predicate places. [2025-03-13 21:50:29,374 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 1414 transitions, 24042 flow [2025-03-13 21:50:29,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.5) internal successors, (133), 14 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:50:29,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:50:29,375 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:50:29,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-13 21:50:29,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-13 21:50:29,575 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:50:29,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:50:29,576 INFO L85 PathProgramCache]: Analyzing trace with hash 946645666, now seen corresponding path program 1 times [2025-03-13 21:50:29,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:50:29,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743277860] [2025-03-13 21:50:29,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:50:29,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:50:29,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-13 21:50:29,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 21:50:29,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:50:29,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:29,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:29,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:50:29,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743277860] [2025-03-13 21:50:29,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743277860] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:50:29,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384333629] [2025-03-13 21:50:29,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:50:29,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:50:29,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:50:29,633 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:50:29,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-13 21:50:29,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-13 21:50:29,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 21:50:29,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:50:29,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:50:29,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 21:50:29,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:50:29,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:29,732 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:50:29,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:50:29,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384333629] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:50:29,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:50:29,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-13 21:50:29,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670934070] [2025-03-13 21:50:29,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:50:29,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-13 21:50:29,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:50:29,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-13 21:50:29,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-13 21:50:29,792 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-13 21:50:29,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 1414 transitions, 24042 flow. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 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) [2025-03-13 21:50:29,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:50:29,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-13 21:50:29,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:50:33,069 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([351] L71-->L70-3: Formula: (let ((.cse0 (select (select |v_#memory_int#1_59| v_~A~0.base_113) (+ v_~A~0.offset_113 (* v_thread3Thread1of1ForFork2_~i~2_7 4))))) (or (and (= v_~min3~0_82 .cse0) (< .cse0 v_~min3~0_83)) (and (= v_~min3~0_83 v_~min3~0_82) (<= v_~min3~0_83 .cse0) (= |v_thread3Thread1of1ForFork2_#t~mem8_2| |v_thread3Thread1of1ForFork2_#t~mem8_1|)))) InVars {thread3Thread1of1ForFork2_#t~mem8=|v_thread3Thread1of1ForFork2_#t~mem8_1|, ~A~0.base=v_~A~0.base_113, ~A~0.offset=v_~A~0.offset_113, #memory_int#1=|v_#memory_int#1_59|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7, ~min3~0=v_~min3~0_83} OutVars{~A~0.base=v_~A~0.base_113, ~A~0.offset=v_~A~0.offset_113, thread3Thread1of1ForFork2_#t~mem8=|v_thread3Thread1of1ForFork2_#t~mem8_2|, thread3Thread1of1ForFork2_#t~mem7=|v_thread3Thread1of1ForFork2_#t~mem7_1|, #memory_int#1=|v_#memory_int#1_59|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7, ~min3~0=v_~min3~0_82} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem8, thread3Thread1of1ForFork2_#t~mem7, ~min3~0][623], [Black: 1027#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 917#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), Black: 1029#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))), Black: 847#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1023#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (or (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1))) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork1_~i~0 0) (or (< (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~min3~0 0))), Black: 1031#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (= thread3Thread1of1ForFork2_~i~2 0)), 842#true, Black: 995#(or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (and (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (= ~M~0 0))), Black: 1019#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1259#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~min3~0 0)), 1316#true, Black: 1264#(and (= ~min1~0 0) (or (and (= ~min2~0 0) (or (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~min3~0 0))) (< 1 ~N~0)) (= ~A~0.offset 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 406#(and (= ~min2~0 0) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))), Black: 1281#(and (= ~min1~0 0) (or (and (= ~min2~0 0) (or (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~min3~0 0))) (< 1 ~N~0)) (= ~A~0.offset 0) (or (not (= thread3Thread1of1ForFork2_~i~2 0)) (and (= ~min2~0 0) (= ~min3~0 0))) (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 378#(and (= ~min1~0 0) (= ~min2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= ~min3~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1262#(and (= ~min1~0 0) (= ~A~0.offset 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= 0 thread3Thread1of1ForFork2_~i~2) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0))) (or (not (= thread3Thread1of1ForFork2_~i~2 0)) (and (= ~min2~0 0) (or (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~min3~0 0))))), Black: 382#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (<= ~N~0 1) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 1267#(or (and (= ~min2~0 ~min1~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 0) (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0))), Black: 347#(and (or (and (or (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (and (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) ~min2~0))) (or (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 ~min3~0)) (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min3~0))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (and (or (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (and (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0)) (and (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) ~min2~0))) (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0)) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min3~0))))), Black: 380#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (<= ~N~0 1) (= ~M~0 0)), 1895#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0)), Black: 1271#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~min3~0 0) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1266#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (and (= ~min2~0 ~min1~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 0) (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0))), Black: 1273#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~min3~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 1263#(and (= ~min1~0 0) (= ~A~0.offset 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= 0 thread3Thread1of1ForFork2_~i~2) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0))) (or (not (= thread3Thread1of1ForFork2_~i~2 0)) (and (= ~min2~0 0) (or (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~min3~0 0)))) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1269#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~min3~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1285#(and (= ~min1~0 0) (= ~A~0.offset 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= 0 thread3Thread1of1ForFork2_~i~2) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0))) (or (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1)) (< 1 ~N~0)) (or (not (= thread3Thread1of1ForFork2_~i~2 0)) (and (= ~min2~0 0) (= ~min3~0 0))) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1265#(and (= thread1Thread1of1ForFork1_~i~0 0) (or (and (= ~min2~0 ~min1~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 0) (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (< 1 ~N~0))), 9#L47true, Black: 1261#(and (= ~min1~0 0) (= ~A~0.offset 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= 0 thread3Thread1of1ForFork2_~i~2) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0))) (or (not (= thread3Thread1of1ForFork2_~i~2 0)) (and (= ~min2~0 0) (= ~min3~0 0)))), 1907#(<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0), 26#L95true, 1041#true, Black: 48#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~N~0) |ULTIMATE.start_create_fresh_int_array_~size#1|), Black: 1534#(<= 2 ~N~0), Black: 1535#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= 2 ~N~0)), Black: 2084#(and (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1593#(and (<= 2 ~N~0) (<= ~M~0 0)), 613#true, Black: 1938#(and (<= 0 thread1Thread1of1ForFork1_~i~0) (<= ~M~0 0)), Black: 1711#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= 2 ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 52#(<= (+ ~M~0 1) ~N~0), 412#true, Black: 1715#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0) (<= ~M~0 0)), Black: 2088#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= 2 ~N~0) (<= ~M~0 0)), 1256#true, Black: 2092#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 2094#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= 2 ~N~0) (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1958#(and (<= 2 ~N~0) (<= ~M~0 0)), Black: 2098#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0) (<= ~M~0 0)), Black: 811#(and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 1)) (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 1))) (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (<= ~min2~0 ~min3~0)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))) (or (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 ~min3~0)) (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))), Black: 1902#(<= ~M~0 0), Black: 809#(and (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)))), Black: 2086#(and (<= 0 thread1Thread1of1ForFork1_~i~0) (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 827#(and (= ~min2~0 0) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min3~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2082#(and (<= thread2Thread1of1ForFork0_~i~1 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 813#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (<= ~min3~0 (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4))) (or (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1))) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork1_~i~0 0) (or (< (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~min3~0 0))), Black: 817#(and (or (and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))) (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))) (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min3~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))), Black: 1948#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~M~0 0)), Black: 2090#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= thread3Thread1of1ForFork2_~i~2 0) (<= 2 ~N~0) (<= ~M~0 0)), Black: 795#(and (or (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (and (or (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (and (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) ~min2~0)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (and (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0)) (and (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) ~min2~0))))) (or (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (or (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 ~min3~0)) (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min3~0)) (or (and (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (<= ~min2~0 ~min3~0)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))) (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min3~0)) (or (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (and (or (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (and (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) ~min2~0)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (and (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0)) (and (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) ~min2~0)))))), Black: 829#(and (= ~min2~0 0) (or (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min3~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), Black: 1901#(<= thread2Thread1of1ForFork0_~i~1 0), Black: 619#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 753#(and (or (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (and (or (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (and (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) ~min2~0)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (and (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0)) (and (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0) (<= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1) ~min2~0))))) (or (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (or (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 ~min3~0)) (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min3~0))), Black: 825#(and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 1)) (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 1))) (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)))), Black: 821#(and (= ~min2~0 0) (<= ~min3~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min3~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 803#(and (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (<= ~min2~0 ~min3~0)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (< ~min3~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))) (or (and (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 ~min3~0)) (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))), Black: 61#(<= 1 ~N~0), 2300#true, 1707#(and (<= 2 ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 2117#true, Black: 586#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 588#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~M~0 0)), Black: 420#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (= ~min1~0 0) (and (not (= (select (select |#memory_int#1| ~A~0.base) 0) 0)) (<= (select (select |#memory_int#1| ~A~0.base) 0) 0))) (or (= ~min1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1))) (= ~min3~0 0) (= ~M~0 0)), Black: 584#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1228#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (<= 1 ~N~0) (= ~min3~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 590#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 1234#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~N~0 1) (= ~min3~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 thread3Thread1of1ForFork2_~i~2) (= ~M~0 0)), Black: 416#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~min3~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 1119#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), Black: 602#(and (= ~min2~0 0) (<= ~min3~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0) (= ~M~0 0)), Black: 1053#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (<= 0 ~min3~0))))), Black: 1244#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 415#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~min3~0 0)), Black: 419#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (= ~min1~0 0) (and (not (= (select (select |#memory_int#1| ~A~0.base) 0) 0)) (<= (select (select |#memory_int#1| ~A~0.base) 0) 0))) (or (= ~min1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< 0 (+ (select (select |#memory_int#1| ~A~0.base) 0) 1))) (= ~min3~0 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 1238#(and (= ~A~0.offset 0) (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (and (= ~min2~0 0) (or (and (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) 0)) (<= (+ (select (select |#memory_int#1| ~A~0.base) 0) 1) ~min1~0) (<= (+ ~min3~0 1) 0)) (and (= ~min1~0 0) (<= 0 ~min3~0) (<= 0 (select (select |#memory_int#1| ~A~0.base) 0))))) (< 1 ~N~0)) (or (< 0 ~N~0) (and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (<= 0 ~min3~0))))) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1242#(and (or (and (not (= thread3Thread1of1ForFork2_~i~2 0)) (or (< 1 ~N~0) (< (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0))) (and (= ~min2~0 0) (or (and (= ~min3~0 (select (select |#memory_int#1| ~A~0.base) 0)) (<= (+ (select (select |#memory_int#1| ~A~0.base) 0) 1) ~min1~0) (<= (+ ~min3~0 1) 0)) (and (= ~min1~0 0) (<= 0 ~min3~0) (<= 0 (select (select |#memory_int#1| ~A~0.base) 0)))))) (= ~A~0.offset 0) (or (< 0 ~N~0) (and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (<= 0 ~min3~0))))) (= thread1Thread1of1ForFork1_~i~0 0)), 29#L59true, Black: 1722#true, Black: 1726#(<= 2 ~N~0), 203#true, 34#L70-3true, Black: 1527#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min3~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))), Black: 1523#(and (= ~min2~0 0) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (or (= ~min1~0 0) (< ~min3~0 0)) (<= ~min3~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= thread1Thread1of1ForFork1_~i~0 0) (= ~min3~0 ~min1~0)), Black: 2163#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 1))]) [2025-03-13 21:50:33,069 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2025-03-13 21:50:33,069 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-03-13 21:50:33,069 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-03-13 21:50:33,069 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-13 21:50:33,163 INFO L124 PetriNetUnfolderBase]: 9782/15286 cut-off events. [2025-03-13 21:50:33,163 INFO L125 PetriNetUnfolderBase]: For 250490/251811 co-relation queries the response was YES. [2025-03-13 21:50:33,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115653 conditions, 15286 events. 9782/15286 cut-off events. For 250490/251811 co-relation queries the response was YES. Maximal size of possible extension queue 854. Compared 103778 event pairs, 2985 based on Foata normal form. 806/15910 useless extension candidates. Maximal degree in co-relation 115513. Up to 7833 conditions per place. [2025-03-13 21:50:33,292 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 1015 selfloop transitions, 20 changer transitions 37/1244 dead transitions. [2025-03-13 21:50:33,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 1244 transitions, 22788 flow [2025-03-13 21:50:33,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:50:33,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:50:33,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2025-03-13 21:50:33,293 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.494949494949495 [2025-03-13 21:50:33,293 INFO L175 Difference]: Start difference. First operand has 278 places, 1414 transitions, 24042 flow. Second operand 6 states and 98 transitions. [2025-03-13 21:50:33,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 1244 transitions, 22788 flow