Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r512-smll-171654407600445.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is Philosophers-COL-002000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654407600445
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 5.7K Apr 13 12:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Apr 13 12:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 13 11:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 13 11:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 13 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 13 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 13 15:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 13 15:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 96K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Philosophers-COL-002000-UpperBounds-00
FORMULA_NAME Philosophers-COL-002000-UpperBounds-01
FORMULA_NAME Philosophers-COL-002000-UpperBounds-02
FORMULA_NAME Philosophers-COL-002000-UpperBounds-03
FORMULA_NAME Philosophers-COL-002000-UpperBounds-04
FORMULA_NAME Philosophers-COL-002000-UpperBounds-05
FORMULA_NAME Philosophers-COL-002000-UpperBounds-06
FORMULA_NAME Philosophers-COL-002000-UpperBounds-07
FORMULA_NAME Philosophers-COL-002000-UpperBounds-08
FORMULA_NAME Philosophers-COL-002000-UpperBounds-09
FORMULA_NAME Philosophers-COL-002000-UpperBounds-10
FORMULA_NAME Philosophers-COL-002000-UpperBounds-11
FORMULA_NAME Philosophers-COL-002000-UpperBounds-12
FORMULA_NAME Philosophers-COL-002000-UpperBounds-13
FORMULA_NAME Philosophers-COL-002000-UpperBounds-14
FORMULA_NAME Philosophers-COL-002000-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717322814392

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-002000
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 10:06:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-02 10:06:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 10:06:57] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-02 10:06:57] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-02 10:06:58] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1386 ms
[2024-06-02 10:06:58] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 10000 PT places and 10000.0 transition bindings in 43 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Reduction of identical properties reduced properties to check from 16 to 5
[2024-06-02 10:06:58] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 8 ms.
[2024-06-02 10:06:58] [INFO ] Skeletonized 5 HLPN properties in 0 ms.
// Phase 1: matrix 5 rows 5 cols
[2024-06-02 10:06:58] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[2000, 0, 0, 0, 2000] Max Struct:[2000, 2000, 2000, 1000, 2000]
FORMULA Philosophers-COL-002000-UpperBounds-13 2000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-002000-UpperBounds-03 2000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-002000-UpperBounds-04 2000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-002000-UpperBounds-05 2000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-002000-UpperBounds-06 2000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-002000-UpperBounds-08 2000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-002000-UpperBounds-12 2000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-002000-UpperBounds-00 2000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-06-02 10:06:58] [INFO ] Invariant cache hit.
[2024-06-02 10:06:58] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2024-06-02 10:06:58] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-06-02 10:06:59] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-02 10:06:59] [INFO ] Added : 0 causal constraints over 0 iterations in 24 ms. Result :sat
Minimization took 17 ms.
[2024-06-02 10:06:59] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-02 10:06:59] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-02 10:06:59] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-02 10:06:59] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 5 ms.
[2024-06-02 10:06:59] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2024-06-02 10:06:59] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-02 10:06:59] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-02 10:06:59] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 5 ms.
[2024-06-02 10:06:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 10:06:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-02 10:06:59] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-02 10:06:59] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-02 10:06:59] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0] Max Struct:[2000, 2000, 1000]
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 2000) 2000) 2000)]] contains successor/predecessor on variables of sort Philo
[2024-06-02 10:06:59] [INFO ] Unfolded HLPN to a Petri net with 10000 places and 10000 transitions 32000 arcs in 259 ms.
[2024-06-02 10:06:59] [INFO ] Unfolded 3 HLPN properties in 2 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0] Max Struct:[2000, 2000, 1000]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0] Max Struct:[2000, 2000, 1000]
// Phase 1: matrix 10000 rows 10000 cols
[2024-06-02 10:06:59] [INFO ] Computed 4000 invariants in 151 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[2000, 2000, 1000]
RANDOM walk for 10000 steps (2 resets) in 6813 ms. (1 steps per ms)
BEST_FIRST walk for 30003 steps (6 resets) in 4765 ms. (6 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[608, 638, 308] Max Struct:[2000, 2000, 1000]
[2024-06-02 10:07:11] [INFO ] Invariant cache hit.
[2024-06-02 10:07:16] [INFO ] [Real]Absence check using 4000 positive place invariants in 2755 ms returned unknown
[2024-06-02 10:07:21] [INFO ] [Real]Absence check using 4000 positive place invariants in 3175 ms returned sat
[2024-06-02 10:07:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:851)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-02 10:07:25] [INFO ] [Real]Absence check using 4000 positive place invariants in 2426 ms returned sat
[2024-06-02 10:07:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:851)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[608, 638, 308] Max Struct:[2000, 2000, 1000]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[608, 638, 308] Max Struct:[2000, 2000, 1000]
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 948 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 970 ms. Remains : 10000/10000 places, 10000/10000 transitions.
[2024-06-02 10:07:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[608, 638, 308] Max Struct:[2000, 2000, 1000]
RANDOM walk for 86152 steps (0 resets) in 30001 ms. (2 steps per ms)
BEST_FIRST walk for 106843 steps (0 resets) in 15234 ms. (7 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[992, 977, 308] Max Struct:[2000, 2000, 1000]
[2024-06-02 10:08:12] [INFO ] Invariant cache hit.
[2024-06-02 10:08:18] [INFO ] [Real]Absence check using 4000 positive place invariants in 4058 ms returned sat
[2024-06-02 10:08:27] [INFO ] [Real]Absence check using state equation in 9122 ms returned sat
[2024-06-02 10:08:30] [INFO ] Computed and/alt/rep : 6000/8000/6000 causal constraints (skipped 0 transitions) in 777 ms.
[2024-06-02 10:08:49] [INFO ] Added : 80 causal constraints over 16 iterations in 20060 ms.(timeout) Result :sat
Minimization took 7392 ms.
[2024-06-02 10:09:03] [INFO ] [Real]Absence check using 4000 positive place invariants in 3889 ms returned sat
[2024-06-02 10:09:12] [INFO ] [Real]Absence check using state equation in 8917 ms returned sat
[2024-06-02 10:09:13] [INFO ] Computed and/alt/rep : 6000/8000/6000 causal constraints (skipped 0 transitions) in 678 ms.
[2024-06-02 10:09:34] [INFO ] Added : 70 causal constraints over 14 iterations in 20969 ms.(timeout) Result :sat
Minimization took 7750 ms.
[2024-06-02 10:09:46] [INFO ] [Real]Absence check using 4000 positive place invariants in 1981 ms returned sat
[2024-06-02 10:09:55] [INFO ] [Real]Absence check using state equation in 8746 ms returned sat
[2024-06-02 10:09:57] [INFO ] Computed and/alt/rep : 6000/8000/6000 causal constraints (skipped 0 transitions) in 683 ms.
[2024-06-02 10:10:16] [INFO ] Added : 70 causal constraints over 14 iterations in 20197 ms.(timeout) Result :sat
Minimization took 4510 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[992, 977, 308] Max Struct:[2000, 2000, 1000]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[992, 977, 308] Max Struct:[2000, 2000, 1000]
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 900 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 901 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 447 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2024-06-02 10:10:23] [INFO ] Invariant cache hit.
[2024-06-02 10:10:34] [INFO ] Implicit Places using invariants in 11837 ms returned []
Implicit Place search using SMT only with invariants took 11842 ms to find 0 implicit places.
Running 6000 sub problems to find dead transitions.
[2024-06-02 10:10:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8000 variables, 2000/2000 constraints. Problems are: Problem set: 0 solved, 6000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8000/20000 variables, and 2000 constraints, problems are : Problem set: 0 solved, 6000 unsolved in 30220 ms.
Refiners :[Positive P Invariants (semi-flows): 2000/4000 constraints, State Equation: 0/10000 constraints, PredecessorRefiner: 6000/6000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6000 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8000 variables, 2000/2000 constraints. Problems are: Problem set: 0 solved, 6000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8000/20000 variables, and 2000 constraints, problems are : Problem set: 0 solved, 6000 unsolved in 30130 ms.
Refiners :[Positive P Invariants (semi-flows): 2000/4000 constraints, State Equation: 0/10000 constraints, PredecessorRefiner: 0/6000 constraints, Known Traps: 0/0 constraints]
After SMT, in 67035ms problems are : Problem set: 0 solved, 6000 unsolved
Search for dead transitions found 0 dead transitions in 67165ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79494 ms. Remains : 10000/10000 places, 10000/10000 transitions.
[2024-06-02 10:11:42] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[992, 977, 308] Max Struct:[2000, 2000, 1000]
RANDOM walk for 85703 steps (0 resets) in 30001 ms. (2 steps per ms)
BEST_FIRST walk for 107827 steps (0 resets) in 15208 ms. (7 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[992, 1016, 308] Max Struct:[2000, 2000, 1000]
[2024-06-02 10:12:27] [INFO ] Invariant cache hit.
[2024-06-02 10:12:33] [INFO ] [Real]Absence check using 4000 positive place invariants in 4471 ms returned sat
[2024-06-02 10:12:43] [INFO ] [Real]Absence check using state equation in 9658 ms returned sat
[2024-06-02 10:12:45] [INFO ] Computed and/alt/rep : 6000/8000/6000 causal constraints (skipped 0 transitions) in 657 ms.
[2024-06-02 10:13:04] [INFO ] Added : 75 causal constraints over 15 iterations in 20489 ms.(timeout) Result :sat
Minimization took 6836 ms.
[2024-06-02 10:13:18] [INFO ] [Real]Absence check using 4000 positive place invariants in 4104 ms returned sat
[2024-06-02 10:13:28] [INFO ] [Real]Absence check using state equation in 9855 ms returned sat
[2024-06-02 10:13:29] [INFO ] Computed and/alt/rep : 6000/8000/6000 causal constraints (skipped 0 transitions) in 659 ms.
[2024-06-02 10:13:50] [INFO ] Added : 80 causal constraints over 16 iterations in 20842 ms.(timeout) Result :sat
Minimization took 6530 ms.
[2024-06-02 10:14:01] [INFO ] [Real]Absence check using 4000 positive place invariants in 2029 ms returned sat
[2024-06-02 10:14:11] [INFO ] [Real]Absence check using state equation in 10299 ms returned sat
[2024-06-02 10:14:13] [INFO ] Computed and/alt/rep : 6000/8000/6000 causal constraints (skipped 0 transitions) in 664 ms.
[2024-06-02 10:14:32] [INFO ] Added : 105 causal constraints over 21 iterations in 20172 ms.(timeout) Result :sat
Minimization took 4506 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[992, 1016, 308] Max Struct:[2000, 2000, 1000]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[992, 1016, 308] Max Struct:[2000, 2000, 1000]
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 454 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 455 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 497 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2024-06-02 10:14:39] [INFO ] Invariant cache hit.
[2024-06-02 10:14:48] [INFO ] Implicit Places using invariants in 9945 ms returned []
Implicit Place search using SMT only with invariants took 9949 ms to find 0 implicit places.
Running 6000 sub problems to find dead transitions.
[2024-06-02 10:14:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8000 variables, 2000/2000 constraints. Problems are: Problem set: 0 solved, 6000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8000/20000 variables, and 2000 constraints, problems are : Problem set: 0 solved, 6000 unsolved in 30137 ms.
Refiners :[Positive P Invariants (semi-flows): 2000/4000 constraints, State Equation: 0/10000 constraints, PredecessorRefiner: 6000/6000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6000 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8000 variables, 2000/2000 constraints. Problems are: Problem set: 0 solved, 6000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8000/20000 variables, and 2000 constraints, problems are : Problem set: 0 solved, 6000 unsolved in 30121 ms.
Refiners :[Positive P Invariants (semi-flows): 2000/4000 constraints, State Equation: 0/10000 constraints, PredecessorRefiner: 0/6000 constraints, Known Traps: 0/0 constraints]
After SMT, in 66561ms problems are : Problem set: 0 solved, 6000 unsolved
Search for dead transitions found 0 dead transitions in 66682ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77154 ms. Remains : 10000/10000 places, 10000/10000 transitions.
[2024-06-02 10:15:55] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[992, 1016, 308] Max Struct:[2000, 2000, 1000]
RANDOM walk for 89198 steps (0 resets) in 30001 ms. (2 steps per ms)
BEST_FIRST walk for 105859 steps (0 resets) in 15272 ms. (6 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1001, 1056, 308] Max Struct:[2000, 2000, 1000]
[2024-06-02 10:16:40] [INFO ] Invariant cache hit.
[2024-06-02 10:16:46] [INFO ] [Real]Absence check using 4000 positive place invariants in 4307 ms returned sat
[2024-06-02 10:16:57] [INFO ] [Real]Absence check using state equation in 11024 ms returned sat
[2024-06-02 10:17:00] [INFO ] Computed and/alt/rep : 6000/8000/6000 causal constraints (skipped 0 transitions) in 781 ms.
[2024-06-02 10:17:19] [INFO ] Added : 80 causal constraints over 16 iterations in 20369 ms.(timeout) Result :sat
Minimization took 5575 ms.
[2024-06-02 10:17:32] [INFO ] [Real]Absence check using 4000 positive place invariants in 4361 ms returned sat
[2024-06-02 10:17:45] [INFO ] [Real]Absence check using state equation in 12977 ms returned sat
[2024-06-02 10:17:47] [INFO ] Computed and/alt/rep : 6000/8000/6000 causal constraints (skipped 0 transitions) in 786 ms.
[2024-06-02 10:18:07] [INFO ] Added : 95 causal constraints over 19 iterations in 21054 ms.(timeout) Result :sat
Minimization took 2591 ms.
[2024-06-02 10:18:14] [INFO ] [Real]Absence check using 4000 positive place invariants in 2206 ms returned sat
[2024-06-02 10:18:25] [INFO ] [Real]Absence check using state equation in 10544 ms returned sat
[2024-06-02 10:18:27] [INFO ] Computed and/alt/rep : 6000/8000/6000 causal constraints (skipped 0 transitions) in 641 ms.
[2024-06-02 10:18:47] [INFO ] Added : 100 causal constraints over 20 iterations in 20726 ms.(timeout) Result :sat
Minimization took 4506 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1001, 1056, 308] Max Struct:[2000, 2000, 1000]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1001, 1056, 308] Max Struct:[2000, 2000, 1000]
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 433 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 433 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 395 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2024-06-02 10:18:53] [INFO ] Invariant cache hit.
[2024-06-02 10:19:06] [INFO ] Implicit Places using invariants in 13085 ms returned []
Implicit Place search using SMT only with invariants took 13087 ms to find 0 implicit places.
Running 6000 sub problems to find dead transitions.
[2024-06-02 10:19:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8000 variables, 2000/2000 constraints. Problems are: Problem set: 0 solved, 6000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8000/20000 variables, and 2000 constraints, problems are : Problem set: 0 solved, 6000 unsolved in 30126 ms.
Refiners :[Positive P Invariants (semi-flows): 2000/4000 constraints, State Equation: 0/10000 constraints, PredecessorRefiner: 6000/6000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6000 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8000 variables, 2000/2000 constraints. Problems are: Problem set: 0 solved, 6000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8000/20000 variables, and 2000 constraints, problems are : Problem set: 0 solved, 6000 unsolved in 30115 ms.
Refiners :[Positive P Invariants (semi-flows): 2000/4000 constraints, State Equation: 0/10000 constraints, PredecessorRefiner: 0/6000 constraints, Known Traps: 0/0 constraints]
After SMT, in 66099ms problems are : Problem set: 0 solved, 6000 unsolved
Search for dead transitions found 0 dead transitions in 66164ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79658 ms. Remains : 10000/10000 places, 10000/10000 transitions.
[2024-06-02 10:20:12] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1001, 1056, 308] Max Struct:[2000, 2000, 1000]
RANDOM walk for 86045 steps (0 resets) in 30001 ms. (2 steps per ms)
BEST_FIRST walk for 106843 steps (0 resets) in 15191 ms. (7 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1017, 1056, 308] Max Struct:[2000, 2000, 1000]
[2024-06-02 10:20:57] [INFO ] Invariant cache hit.
[2024-06-02 10:21:03] [INFO ] [Real]Absence check using 4000 positive place invariants in 4242 ms returned sat
[2024-06-02 10:21:13] [INFO ] [Real]Absence check using state equation in 9466 ms returned sat
[2024-06-02 10:21:14] [INFO ] Computed and/alt/rep : 6000/8000/6000 causal constraints (skipped 0 transitions) in 631 ms.
[2024-06-02 10:21:35] [INFO ] Added : 70 causal constraints over 14 iterations in 21257 ms.(timeout) Result :sat
Minimization took 6347 ms.
[2024-06-02 10:21:48] [INFO ] [Real]Absence check using 4000 positive place invariants in 4005 ms returned sat
[2024-06-02 10:21:58] [INFO ] [Real]Absence check using state equation in 10485 ms returned sat
[2024-06-02 10:22:01] [INFO ] Computed and/alt/rep : 6000/8000/6000 causal constraints (skipped 0 transitions) in 682 ms.
[2024-06-02 10:22:20] [INFO ] Added : 65 causal constraints over 13 iterations in 20166 ms.(timeout) Result :sat
Minimization took 6250 ms.
[2024-06-02 10:22:32] [INFO ] [Real]Absence check using 4000 positive place invariants in 2632 ms returned sat
[2024-06-02 10:22:41] [INFO ] [Real]Absence check using state equation in 9463 ms returned sat
[2024-06-02 10:22:43] [INFO ] Computed and/alt/rep : 6000/8000/6000 causal constraints (skipped 0 transitions) in 765 ms.
[2024-06-02 10:23:03] [INFO ] Added : 70 causal constraints over 14 iterations in 20545 ms.(timeout) Result :sat
Minimization took 4507 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1017, 1056, 308] Max Struct:[2000, 2000, 1000]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1017, 1056, 308] Max Struct:[2000, 2000, 1000]
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 386 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 386 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 366 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2024-06-02 10:23:09] [INFO ] Invariant cache hit.
[2024-06-02 10:23:20] [INFO ] Implicit Places using invariants in 11300 ms returned []
Implicit Place search using SMT only with invariants took 11303 ms to find 0 implicit places.
Running 6000 sub problems to find dead transitions.
[2024-06-02 10:23:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8000 variables, 2000/2000 constraints. Problems are: Problem set: 0 solved, 6000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8000/20000 variables, and 2000 constraints, problems are : Problem set: 0 solved, 6000 unsolved in 30124 ms.
Refiners :[Positive P Invariants (semi-flows): 2000/4000 constraints, State Equation: 0/10000 constraints, PredecessorRefiner: 6000/6000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6000 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8000 variables, 2000/2000 constraints. Problems are: Problem set: 0 solved, 6000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8000/20000 variables, and 2000 constraints, problems are : Problem set: 0 solved, 6000 unsolved in 30184 ms.
Refiners :[Positive P Invariants (semi-flows): 2000/4000 constraints, State Equation: 0/10000 constraints, PredecessorRefiner: 0/6000 constraints, Known Traps: 0/0 constraints]
After SMT, in 65836ms problems are : Problem set: 0 solved, 6000 unsolved
Search for dead transitions found 0 dead transitions in 65900ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77583 ms. Remains : 10000/10000 places, 10000/10000 transitions.
[2024-06-02 10:24:26] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1017, 1056, 308] Max Struct:[2000, 2000, 1000]
RANDOM walk for 85705 steps (0 resets) in 30001 ms. (2 steps per ms)
BEST_FIRST walk for 106843 steps (0 resets) in 15085 ms. (7 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1096, 1056, 308] Max Struct:[2000, 2000, 1000]
[2024-06-02 10:25:11] [INFO ] Invariant cache hit.
[2024-06-02 10:25:18] [INFO ] [Real]Absence check using 4000 positive place invariants in 4655 ms returned sat
[2024-06-02 10:25:29] [INFO ] [Real]Absence check using state equation in 11211 ms returned sat
[2024-06-02 10:25:31] [INFO ] Computed and/alt/rep : 6000/8000/6000 causal constraints (skipped 0 transitions) in 733 ms.
[2024-06-02 10:25:51] [INFO ] Added : 70 causal constraints over 14 iterations in 20296 ms.(timeout) Result :sat
Minimization took 4669 ms.
[2024-06-02 10:26:02] [INFO ] [Real]Absence check using 4000 positive place invariants in 4124 ms returned sat
[2024-06-02 10:26:12] [INFO ] [Real]Absence check using state equation in 9682 ms returned sat
[2024-06-02 10:26:14] [INFO ] Computed and/alt/rep : 6000/8000/6000 causal constraints (skipped 0 transitions) in 658 ms.
[2024-06-02 10:26:35] [INFO ] Added : 80 causal constraints over 16 iterations in 21372 ms.(timeout) Result :sat
Minimization took 5915 ms.
[2024-06-02 10:26:45] [INFO ] [Real]Absence check using 4000 positive place invariants in 2335 ms returned sat
[2024-06-02 10:26:55] [INFO ] [Real]Absence check using state equation in 9338 ms returned sat
[2024-06-02 10:26:56] [INFO ] Computed and/alt/rep : 6000/8000/6000 causal constraints (skipped 0 transitions) in 625 ms.
[2024-06-02 10:27:17] [INFO ] Added : 75 causal constraints over 15 iterations in 20721 ms.(timeout) Result :sat
Minimization took 4506 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1096, 1056, 308] Max Struct:[2000, 2000, 1000]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1096, 1056, 308] Max Struct:[2000, 2000, 1000]
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 342 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 342 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 492 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2024-06-02 10:27:23] [INFO ] Invariant cache hit.
[2024-06-02 10:27:32] [INFO ] Implicit Places using invariants in 9221 ms returned []
Implicit Place search using SMT only with invariants took 9226 ms to find 0 implicit places.
Running 6000 sub problems to find dead transitions.
[2024-06-02 10:27:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8000 variables, 2000/2000 constraints. Problems are: Problem set: 0 solved, 6000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8000/20000 variables, and 2000 constraints, problems are : Problem set: 0 solved, 6000 unsolved in 30115 ms.
Refiners :[Positive P Invariants (semi-flows): 2000/4000 constraints, State Equation: 0/10000 constraints, PredecessorRefiner: 6000/6000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6000 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8000 variables, 2000/2000 constraints. Problems are: Problem set: 0 solved, 6000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8000/20000 variables, and 2000 constraints, problems are : Problem set: 0 solved, 6000 unsolved in 30109 ms.
Refiners :[Positive P Invariants (semi-flows): 2000/4000 constraints, State Equation: 0/10000 constraints, PredecessorRefiner: 0/6000 constraints, Known Traps: 0/0 constraints]
After SMT, in 65712ms problems are : Problem set: 0 solved, 6000 unsolved
Search for dead transitions found 0 dead transitions in 65777ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75508 ms. Remains : 10000/10000 places, 10000/10000 transitions.
[2024-06-02 10:28:38] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1096, 1056, 308] Max Struct:[2000, 2000, 1000]
RANDOM walk for 85919 steps (0 resets) in 30001 ms. (2 steps per ms)
BEST_FIRST walk for 107827 steps (0 resets) in 15350 ms. (7 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1096, 1251, 308] Max Struct:[2000, 2000, 1000]
[2024-06-02 10:29:23] [INFO ] Invariant cache hit.
[2024-06-02 10:29:31] [INFO ] [Real]Absence check using 4000 positive place invariants in 5968 ms returned sat
[2024-06-02 10:29:45] [INFO ] [Real]Absence check using state equation in 13921 ms returned sat
[2024-06-02 10:29:46] [INFO ] Computed and/alt/rep : 6000/8000/6000 causal constraints (skipped 0 transitions) in 646 ms.
[2024-06-02 10:30:06] [INFO ] Added : 80 causal constraints over 16 iterations in 20469 ms.(timeout) Result :sat
Minimization took 987 ms.
[2024-06-02 10:30:15] [INFO ] [Real]Absence check using 4000 positive place invariants in 4943 ms returned sat
[2024-06-02 10:30:24] [INFO ] [Real]Absence check using state equation in 9614 ms returned sat
[2024-06-02 10:30:26] [INFO ] Computed and/alt/rep : 6000/8000/6000 causal constraints (skipped 0 transitions) in 663 ms.
[2024-06-02 10:30:46] [INFO ] Added : 70 causal constraints over 14 iterations in 20518 ms.(timeout) Result :sat
Minimization took 6133 ms.
[2024-06-02 10:30:57] [INFO ] [Real]Absence check using 4000 positive place invariants in 2119 ms returned sat
[2024-06-02 10:31:08] [INFO ] [Real]Absence check using state equation in 10643 ms returned sat
[2024-06-02 10:31:10] [INFO ] Computed and/alt/rep : 6000/8000/6000 causal constraints (skipped 0 transitions) in 651 ms.
[2024-06-02 10:31:29] [INFO ] Added : 85 causal constraints over 17 iterations in 20513 ms.(timeout) Result :sat
Minimization took 4506 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1096, 1251, 308] Max Struct:[2000, 2000, 1000]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1096, 1251, 308] Max Struct:[2000, 2000, 1000]
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 362 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 363 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 365 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2024-06-02 10:31:35] [INFO ] Invariant cache hit.
[2024-06-02 10:31:50] [INFO ] Implicit Places using invariants in 15075 ms returned []
Implicit Place search using SMT only with invariants took 15077 ms to find 0 implicit places.
Running 6000 sub problems to find dead transitions.
[2024-06-02 10:31:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8000 variables, 2000/2000 constraints. Problems are: Problem set: 0 solved, 6000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8000/20000 variables, and 2000 constraints, problems are : Problem set: 0 solved, 6000 unsolved in 30117 ms.
Refiners :[Positive P Invariants (semi-flows): 2000/4000 constraints, State Equation: 0/10000 constraints, PredecessorRefiner: 6000/6000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6000 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8000 variables, 2000/2000 constraints. Problems are: Problem set: 0 solved, 6000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8000/20000 variables, and 2000 constraints, problems are : Problem set: 0 solved, 6000 unsolved in 30110 ms.
Refiners :[Positive P Invariants (semi-flows): 2000/4000 constraints, State Equation: 0/10000 constraints, PredecessorRefiner: 0/6000 constraints, Known Traps: 0/0 constraints]
After SMT, in 67158ms problems are : Problem set: 0 solved, 6000 unsolved
Search for dead transitions found 0 dead transitions in 67269ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82735 ms. Remains : 10000/10000 places, 10000/10000 transitions.
[2024-06-02 10:32:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1096, 1251, 308] Max Struct:[2000, 2000, 1000]
RANDOM walk for 86585 steps (0 resets) in 30001 ms. (2 steps per ms)
BEST_FIRST walk for 107827 steps (0 resets) in 15301 ms. (7 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1147, 1251, 308] Max Struct:[2000, 2000, 1000]
[2024-06-02 10:33:43] [INFO ] Invariant cache hit.
[2024-06-02 10:33:50] [INFO ] [Real]Absence check using 4000 positive place invariants in 5298 ms returned sat
[2024-06-02 10:34:02] [INFO ] [Real]Absence check using state equation in 11901 ms returned sat
[2024-06-02 10:34:04] [INFO ] Computed and/alt/rep : 6000/8000/6000 causal constraints (skipped 0 transitions) in 821 ms.
[2024-06-02 10:34:24] [INFO ] Added : 80 causal constraints over 16 iterations in 20039 ms.(timeout) Result :sat
Minimization took 3983 ms.
[2024-06-02 10:34:35] [INFO ] [Real]Absence check using 4000 positive place invariants in 4890 ms returned sat
[2024-06-02 10:34:46] [INFO ] [Real]Absence check using state equation in 10894 ms returned sat
[2024-06-02 10:34:48] [INFO ] Computed and/alt/rep : 6000/8000/6000 causal constraints (skipped 0 transitions) in 709 ms.
[2024-06-02 10:35:09] [INFO ] Added : 85 causal constraints over 17 iterations in 21300 ms.(timeout) Result :sat
Minimization took 3336 ms.
[2024-06-02 10:35:17] [INFO ] [Real]Absence check using 4000 positive place invariants in 1966 ms returned sat
[2024-06-02 10:35:26] [INFO ] [Real]Absence check using state equation in 9235 ms returned sat
[2024-06-02 10:35:28] [INFO ] Computed and/alt/rep : 6000/8000/6000 causal constraints (skipped 0 transitions) in 655 ms.
[2024-06-02 10:35:48] [INFO ] Added : 95 causal constraints over 19 iterations in 20883 ms.(timeout) Result :sat
Minimization took 4506 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1147, 1251, 308] Max Struct:[2000, 2000, 1000]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1147, 1251, 308] Max Struct:[2000, 2000, 1000]
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 348 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 348 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 346 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2024-06-02 10:35:54] [INFO ] Invariant cache hit.
[2024-06-02 10:36:05] [INFO ] Implicit Places using invariants in 11082 ms returned []
Implicit Place search using SMT only with invariants took 11085 ms to find 0 implicit places.
Running 6000 sub problems to find dead transitions.
[2024-06-02 10:36:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8000 variables, 2000/2000 constraints. Problems are: Problem set: 0 solved, 6000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8000/20000 variables, and 2000 constraints, problems are : Problem set: 0 solved, 6000 unsolved in 30109 ms.
Refiners :[Positive P Invariants (semi-flows): 2000/4000 constraints, State Equation: 0/10000 constraints, PredecessorRefiner: 6000/6000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6000 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8000 variables, 2000/2000 constraints. Problems are: Problem set: 0 solved, 6000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8000/20000 variables, and 2000 constraints, problems are : Problem set: 0 solved, 6000 unsolved in 30113 ms.
Refiners :[Positive P Invariants (semi-flows): 2000/4000 constraints, State Equation: 0/10000 constraints, PredecessorRefiner: 0/6000 constraints, Known Traps: 0/0 constraints]
After SMT, in 65976ms problems are : Problem set: 0 solved, 6000 unsolved
Search for dead transitions found 0 dead transitions in 66079ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77529 ms. Remains : 10000/10000 places, 10000/10000 transitions.
[2024-06-02 10:37:11] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1147, 1251, 308] Max Struct:[2000, 2000, 1000]
RANDOM walk for 84962 steps (0 resets) in 30001 ms. (2 steps per ms)
BEST_FIRST walk for 107827 steps (0 resets) in 15193 ms. (7 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1233, 1251, 308] Max Struct:[2000, 2000, 1000]
[2024-06-02 10:37:57] [INFO ] Invariant cache hit.
[2024-06-02 10:38:03] [INFO ] [Real]Absence check using 4000 positive place invariants in 5157 ms returned sat
[2024-06-02 10:38:13] [INFO ] [Real]Absence check using state equation in 9921 ms returned sat
[2024-06-02 10:38:15] [INFO ] Computed and/alt/rep : 6000/8000/6000 causal constraints (skipped 0 transitions) in 655 ms.
[2024-06-02 10:38:35] [INFO ] Added : 85 causal constraints over 17 iterations in 20429 ms.(timeout) Result :sat
Minimization took 6223 ms.
[2024-06-02 10:38:48] [INFO ] [Real]Absence check using 4000 positive place invariants in 5030 ms returned sat
[2024-06-02 10:38:59] [INFO ] [Real]Absence check using state equation in 10422 ms returned sat
[2024-06-02 10:39:00] [INFO ] Computed and/alt/rep : 6000/8000/6000 causal constraints (skipped 0 transitions) in 655 ms.
[2024-06-02 10:39:21] [INFO ] Added : 80 causal constraints over 16 iterations in 21024 ms.(timeout) Result :sat
Minimization took 5162 ms.
[2024-06-02 10:39:31] [INFO ] [Real]Absence check using 4000 positive place invariants in 2248 ms returned sat
[2024-06-02 10:39:39] [INFO ] [Real]Absence check using state equation in 8883 ms returned sat
[2024-06-02 10:39:41] [INFO ] Computed and/alt/rep : 6000/8000/6000 causal constraints (skipped 0 transitions) in 708 ms.
[2024-06-02 10:40:02] [INFO ] Added : 80 causal constraints over 16 iterations in 21166 ms.(timeout) Result :sat
Minimization took 4507 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1233, 1251, 308] Max Struct:[2000, 2000, 1000]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1233, 1251, 308] Max Struct:[2000, 2000, 1000]
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 353 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 355 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 347 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2024-06-02 10:40:08] [INFO ] Invariant cache hit.
[2024-06-02 10:40:19] [INFO ] Implicit Places using invariants in 11433 ms returned []
Implicit Place search using SMT only with invariants took 11435 ms to find 0 implicit places.
Running 6000 sub problems to find dead transitions.
[2024-06-02 10:40:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8000 variables, 2000/2000 constraints. Problems are: Problem set: 0 solved, 6000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8000/20000 variables, and 2000 constraints, problems are : Problem set: 0 solved, 6000 unsolved in 30107 ms.
Refiners :[Positive P Invariants (semi-flows): 2000/4000 constraints, State Equation: 0/10000 constraints, PredecessorRefiner: 6000/6000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6000 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8000 variables, 2000/2000 constraints. Problems are: Problem set: 0 solved, 6000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8000/20000 variables, and 2000 constraints, problems are : Problem set: 0 solved, 6000 unsolved in 30110 ms.
Refiners :[Positive P Invariants (semi-flows): 2000/4000 constraints, State Equation: 0/10000 constraints, PredecessorRefiner: 0/6000 constraints, Known Traps: 0/0 constraints]
After SMT, in 65851ms problems are : Problem set: 0 solved, 6000 unsolved
Search for dead transitions found 0 dead transitions in 65918ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77708 ms. Remains : 10000/10000 places, 10000/10000 transitions.
[2024-06-02 10:41:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1233, 1251, 308] Max Struct:[2000, 2000, 1000]
RANDOM walk for 84989 steps (0 resets) in 30001 ms. (2 steps per ms)
BEST_FIRST walk for 106843 steps (0 resets) in 15167 ms. (7 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1233, 1251, 308] Max Struct:[2000, 2000, 1000]
[2024-06-02 10:42:10] [INFO ] Invariant cache hit.
[2024-06-02 10:42:18] [INFO ] [Real]Absence check using 4000 positive place invariants in 5367 ms returned sat
[2024-06-02 10:42:30] [INFO ] [Real]Absence check using state equation in 12098 ms returned sat
[2024-06-02 10:42:32] [INFO ] Computed and/alt/rep : 6000/8000/6000 causal constraints (skipped 0 transitions) in 671 ms.
[2024-06-02 10:42:52] [INFO ] Added : 75 causal constraints over 15 iterations in 21201 ms.(timeout) Result :sat
Minimization took 2154 ms.
[2024-06-02 10:43:03] [INFO ] [Real]Absence check using 4000 positive place invariants in 5326 ms returned sat
[2024-06-02 10:43:14] [INFO ] [Real]Absence check using state equation in 11089 ms returned sat
[2024-06-02 10:43:16] [INFO ] Computed and/alt/rep : 6000/8000/6000 causal constraints (skipped 0 transitions) in 652 ms.
[2024-06-02 10:43:36] [INFO ] Added : 80 causal constraints over 16 iterations in 20649 ms.(timeout) Result :sat
Minimization took 4065 ms.
[2024-06-02 10:43:45] [INFO ] [Real]Absence check using 4000 positive place invariants in 2402 ms returned sat
[2024-06-02 10:43:57] [INFO ] [Real]Absence check using state equation in 12316 ms returned sat
[2024-06-02 10:43:59] [INFO ] Computed and/alt/rep : 6000/8000/6000 causal constraints (skipped 0 transitions) in 695 ms.
[2024-06-02 10:44:20] [INFO ] Added : 90 causal constraints over 18 iterations in 21101 ms.(timeout) Result :sat
Minimization took 4506 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1233, 1251, 308] Max Struct:[2000, 2000, 1000]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1233, 1251, 308] Max Struct:[2000, 2000, 1000]
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 342 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 342 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 332 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2024-06-02 10:44:25] [INFO ] Invariant cache hit.
[2024-06-02 10:44:37] [INFO ] Implicit Places using invariants in 11213 ms returned []
Implicit Place search using SMT only with invariants took 11216 ms to find 0 implicit places.
Running 6000 sub problems to find dead transitions.
[2024-06-02 10:44:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8000 variables, 2000/2000 constraints. Problems are: Problem set: 0 solved, 6000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8000/20000 variables, and 2000 constraints, problems are : Problem set: 0 solved, 6000 unsolved in 30111 ms.
Refiners :[Positive P Invariants (semi-flows): 2000/4000 constraints, State Equation: 0/10000 constraints, PredecessorRefiner: 6000/6000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6000 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8000 variables, 2000/2000 constraints. Problems are: Problem set: 0 solved, 6000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8000/20000 variables, and 2000 constraints, problems are : Problem set: 0 solved, 6000 unsolved in 30109 ms.
Refiners :[Positive P Invariants (semi-flows): 2000/4000 constraints, State Equation: 0/10000 constraints, PredecessorRefiner: 0/6000 constraints, Known Traps: 0/0 constraints]
After SMT, in 65877ms problems are : Problem set: 0 solved, 6000 unsolved
Search for dead transitions found 0 dead transitions in 65967ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77528 ms. Remains : 10000/10000 places, 10000/10000 transitions.
RANDOM walk for 40000 steps (8 resets) in 37377 ms. (1 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 7220 ms. (5 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5961 ms. (6 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 6203 ms. (6 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 6910 ms. (5 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 6350 ms. (6 steps per ms) remains 5/5 properties
[2024-06-02 10:46:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6000 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10000/20000 variables, and 4000 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 4000/4000 constraints, State Equation: 0/10000 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6000 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 10000/20000 variables, and 4000 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5035 ms.
Refiners :[Positive P Invariants (semi-flows): 4000/4000 constraints, State Equation: 0/10000 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 11093ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 364 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 367 ms. Remains : 10000/10000 places, 10000/10000 transitions.
RANDOM walk for 40000 steps (8 resets) in 33779 ms. (1 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5943 ms. (6 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 6196 ms. (6 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 6576 ms. (6 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 6321 ms. (6 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 6127 ms. (6 steps per ms) remains 5/5 properties
Probabilistic random walk after 112883 steps, saw 112823 distinct states, run finished after 48217 ms. (steps per millisecond=2 ) properties seen :0
[2024-06-02 10:47:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6000 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 4000/10000 variables, 4000/4000 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10000 variables, 0/4000 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SMT process timed out in 46214ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 372 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 376 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 362 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2024-06-02 10:48:04] [INFO ] Invariant cache hit.
[2024-06-02 10:48:14] [INFO ] Implicit Places using invariants in 10103 ms returned []
Implicit Place search using SMT only with invariants took 10104 ms to find 0 implicit places.
Running 6000 sub problems to find dead transitions.
[2024-06-02 10:48:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8000 variables, 2000/2000 constraints. Problems are: Problem set: 0 solved, 6000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8000/20000 variables, and 2000 constraints, problems are : Problem set: 0 solved, 6000 unsolved in 30124 ms.
Refiners :[Positive P Invariants (semi-flows): 2000/4000 constraints, State Equation: 0/10000 constraints, PredecessorRefiner: 6000/6000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6000 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8000 variables, 2000/2000 constraints. Problems are: Problem set: 0 solved, 6000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8000/20000 variables, and 2000 constraints, problems are : Problem set: 0 solved, 6000 unsolved in 30119 ms.
Refiners :[Positive P Invariants (semi-flows): 2000/4000 constraints, State Equation: 0/10000 constraints, PredecessorRefiner: 0/6000 constraints, Known Traps: 0/0 constraints]
After SMT, in 67045ms problems are : Problem set: 0 solved, 6000 unsolved
Search for dead transitions found 0 dead transitions in 67116ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77591 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1233, 1251, 308] Max Struct:[2000, 2000, 1000]
Starting property specific reduction for Philosophers-COL-002000-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[2000]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[2000]
[2024-06-02 10:49:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[2000]
RANDOM walk for 10000 steps (2 resets) in 4647 ms. (2 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 1392 ms. (7 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[616] Max Struct:[2000]
[2024-06-02 10:49:28] [INFO ] Invariant cache hit.
[2024-06-02 10:49:32] [INFO ] [Real]Absence check using 4000 positive place invariants in 3222 ms returned sat
[2024-06-02 10:49:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:851)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:929)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[616] Max Struct:[2000]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[616] Max Struct:[2000]
Support contains 2000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Performed 2000 Post agglomeration using F-continuation condition.Transition count delta: 2000
Deduced a syphon composed of 2000 places in 2 ms
Reduce places removed 2000 places and 0 transitions.
Iterating global reduction 0 with 4000 rules applied. Total rules applied 4000 place count 8000 transition count 8000
Free-agglomeration rule (complex) applied 2000 times.
Iterating global reduction 0 with 2000 rules applied. Total rules applied 6000 place count 8000 transition count 6000
Reduce places removed 2000 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2000 transitions
Reduce isomorphic transitions removed 2000 transitions.
Iterating post reduction 0 with 4000 rules applied. Total rules applied 10000 place count 6000 transition count 4000
Applied a total of 10000 rules in 3895 ms. Remains 6000 /10000 variables (removed 4000) and now considering 4000/10000 (removed 6000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3896 ms. Remains : 6000/10000 places, 4000/10000 transitions.
// Phase 1: matrix 4000 rows 6000 cols
[2024-06-02 10:49:37] [INFO ] Computed 4000 invariants in 17 ms
Current structural bounds on expressions (after invariants) : Max Seen:[616] Max Struct:[2000]
RANDOM walk for 83323 steps (16 resets) in 30001 ms. (2 steps per ms)
FORMULA Philosophers-COL-002000-UpperBounds-01 2000 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 36018 steps (0 resets) in 5108 ms. (7 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 6 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Philosophers-COL-002000-UpperBounds-01 in 50154 ms.
Starting property specific reduction for Philosophers-COL-002000-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[2000]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[2000]
// Phase 1: matrix 10000 rows 10000 cols
[2024-06-02 10:50:12] [INFO ] Computed 4000 invariants in 36 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[2000]
RANDOM walk for 10000 steps (2 resets) in 4617 ms. (2 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 1425 ms. (7 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[624] Max Struct:[2000]
[2024-06-02 10:50:18] [INFO ] Invariant cache hit.
[2024-06-02 10:50:23] [INFO ] [Real]Absence check using 4000 positive place invariants in 3200 ms returned sat
[2024-06-02 10:50:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:851)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:929)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[624] Max Struct:[2000]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[624] Max Struct:[2000]
Support contains 2000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Performed 2000 Post agglomeration using F-continuation condition.Transition count delta: 2000
Deduced a syphon composed of 2000 places in 2 ms
Reduce places removed 2000 places and 0 transitions.
Iterating global reduction 0 with 4000 rules applied. Total rules applied 4000 place count 8000 transition count 8000
Free-agglomeration rule (complex) applied 2000 times.
Iterating global reduction 0 with 2000 rules applied. Total rules applied 6000 place count 8000 transition count 6000
Reduce places removed 2000 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2000 transitions
Reduce isomorphic transitions removed 2000 transitions.
Iterating post reduction 0 with 4000 rules applied. Total rules applied 10000 place count 6000 transition count 4000
Applied a total of 10000 rules in 2995 ms. Remains 6000 /10000 variables (removed 4000) and now considering 4000/10000 (removed 6000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2996 ms. Remains : 6000/10000 places, 4000/10000 transitions.
// Phase 1: matrix 4000 rows 6000 cols
[2024-06-02 10:50:26] [INFO ] Computed 4000 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[624] Max Struct:[2000]
RANDOM walk for 85680 steps (17 resets) in 30001 ms. (2 steps per ms)
FORMULA Philosophers-COL-002000-UpperBounds-09 2000 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Philosophers-COL-002000-UpperBounds-14 2000 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Philosophers-COL-002000-UpperBounds-15 2000 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Philosophers-COL-002000-UpperBounds-02 2000 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 37019 steps (0 resets) in 5093 ms. (7 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 7 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Philosophers-COL-002000-UpperBounds-02 in 49254 ms.
Starting property specific reduction for Philosophers-COL-002000-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1000]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1000]
// Phase 1: matrix 10000 rows 10000 cols
[2024-06-02 10:51:01] [INFO ] Computed 4000 invariants in 26 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1000]
RANDOM walk for 10000 steps (2 resets) in 4645 ms. (2 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 1449 ms. (6 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[304] Max Struct:[1000]
[2024-06-02 10:51:07] [INFO ] Invariant cache hit.
[2024-06-02 10:51:11] [INFO ] [Real]Absence check using 4000 positive place invariants in 2110 ms returned sat
[2024-06-02 10:51:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:851)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:929)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[304] Max Struct:[1000]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[304] Max Struct:[1000]
Support contains 2000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Free-agglomeration rule (complex) applied 4000 times.
Iterating global reduction 0 with 4000 rules applied. Total rules applied 4000 place count 10000 transition count 6000
Reduce places removed 4000 places and 0 transitions.
Ensure Unique test removed 2000 transitions
Reduce isomorphic transitions removed 2000 transitions.
Iterating post reduction 0 with 6000 rules applied. Total rules applied 10000 place count 6000 transition count 4000
Applied a total of 10000 rules in 3567 ms. Remains 6000 /10000 variables (removed 4000) and now considering 4000/10000 (removed 6000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3567 ms. Remains : 6000/10000 places, 4000/10000 transitions.
// Phase 1: matrix 4000 rows 6000 cols
[2024-06-02 10:51:16] [INFO ] Computed 4000 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[304] Max Struct:[1000]
RANDOM walk for 84936 steps (0 resets) in 30001 ms. (2 steps per ms)
BEST_FIRST walk for 34746 steps (0 resets) in 5022 ms. (6 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[595] Max Struct:[1000]
[2024-06-02 10:51:51] [INFO ] Invariant cache hit.
[2024-06-02 10:51:54] [INFO ] [Real]Absence check using 4000 positive place invariants in 2117 ms returned sat
[2024-06-02 10:51:58] [INFO ] [Real]Absence check using state equation in 4214 ms returned sat
[2024-06-02 10:51:59] [INFO ] Computed and/alt/rep : 2000/2000/2000 causal constraints (skipped 0 transitions) in 255 ms.
[2024-06-02 10:52:00] [INFO ] Added : 0 causal constraints over 0 iterations in 813 ms. Result :sat
Minimization took 1071 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[595] Max Struct:[1000]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1000] Max Struct:[1000]
Support contains 2000 out of 6000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6000/6000 places, 4000/4000 transitions.
Applied a total of 0 rules in 322 ms. Remains 6000 /6000 variables (removed 0) and now considering 4000/4000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 322 ms. Remains : 6000/6000 places, 4000/4000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6000/6000 places, 4000/4000 transitions.
Applied a total of 0 rules in 616 ms. Remains 6000 /6000 variables (removed 0) and now considering 4000/4000 (removed 0) transitions.
[2024-06-02 10:52:30] [INFO ] Invariant cache hit.
[2024-06-02 10:52:38] [INFO ] Implicit Places using invariants in 8385 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346, 347, 348, 349, 350, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 400, 401, 402, 403, 404, 405, 406, 407, 408, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418, 419, 420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, 605, 606, 607, 608, 609, 610, 611, 612, 613, 614, 615, 616, 617, 618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628, 629, 630, 631, 632, 633, 634, 635, 636, 637, 638, 639, 640, 641, 642, 643, 644, 645, 646, 647, 648, 649, 650, 651, 652, 653, 654, 655, 656, 657, 658, 659, 660, 661, 662, 663, 664, 665, 666, 667, 668, 669, 670, 671, 672, 673, 674, 675, 676, 677, 678, 679, 680, 681, 682, 683, 684, 685, 686, 687, 688, 689, 690, 691, 692, 693, 694, 695, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 707, 708, 709, 710, 711, 712, 713, 714, 715, 716, 717, 718, 719, 720, 721, 722, 723, 724, 725, 726, 727, 728, 729, 730, 731, 732, 733, 734, 735, 736, 737, 738, 739, 740, 741, 742, 743, 744, 745, 746, 747, 748, 749, 750, 751, 752, 753, 754, 755, 756, 757, 758, 759, 760, 761, 762, 763, 764, 765, 766, 767, 768, 769, 770, 771, 772, 773, 774, 775, 776, 777, 778, 779, 780, 781, 782, 783, 784, 785, 786, 787, 788, 789, 790, 791, 792, 793, 794, 795, 796, 797, 798, 799, 800, 801, 802, 803, 804, 805, 806, 807, 808, 809, 810, 811, 812, 813, 814, 815, 816, 817, 818, 819, 820, 821, 822, 823, 824, 825, 826, 827, 828, 829, 830, 831, 832, 833, 834, 835, 836, 837, 838, 839, 840, 841, 842, 843, 844, 845, 846, 847, 848, 849, 850, 851, 852, 853, 854, 855, 856, 857, 858, 859, 860, 861, 862, 863, 864, 865, 866, 867, 868, 869, 870, 871, 872, 873, 874, 875, 876, 877, 878, 879, 880, 881, 882, 883, 884, 885, 886, 887, 888, 889, 890, 891, 892, 893, 894, 895, 896, 897, 898, 899, 900, 901, 902, 903, 904, 905, 906, 907, 908, 909, 910, 911, 912, 913, 914, 915, 916, 917, 918, 919, 920, 921, 922, 923, 924, 925, 926, 927, 928, 929, 930, 931, 932, 933, 934, 935, 936, 937, 938, 939, 940, 941, 942, 943, 944, 945, 946, 947, 948, 949, 950, 951, 952, 953, 954, 955, 956, 957, 958, 959, 960, 961, 962, 963, 964, 965, 966, 967, 968, 969, 970, 971, 972, 973, 974, 975, 976, 977, 978, 979, 980, 981, 982, 983, 984, 985, 986, 987, 988, 989, 990, 991, 992, 993, 994, 995, 996, 997, 998, 999, 1000, 1001, 1002, 1003, 1004, 1005, 1006, 1007, 1008, 1009, 1010, 1011, 1012, 1013, 1014, 1015, 1016, 1017, 1018, 1019, 1020, 1021, 1022, 1023, 1024, 1025, 1026, 1027, 1028, 1029, 1030, 1031, 1032, 1033, 1034, 1035, 1036, 1037, 1038, 1039, 1040, 1041, 1042, 1043, 1044, 1045, 1046, 1047, 1048, 1049, 1050, 1051, 1052, 1053, 1054, 1055, 1056, 1057, 1058, 1059, 1060, 1061, 1062, 1063, 1064, 1065, 1066, 1067, 1068, 1069, 1070, 1071, 1072, 1073, 1074, 1075, 1076, 1077, 1078, 1079, 1080, 1081, 1082, 1083, 1084, 1085, 1086, 1087, 1088, 1089, 1090, 1091, 1092, 1093, 1094, 1095, 1096, 1097, 1098, 1099, 1100, 1101, 1102, 1103, 1104, 1105, 1106, 1107, 1108, 1109, 1110, 1111, 1112, 1113, 1114, 1115, 1116, 1117, 1118, 1119, 1120, 1121, 1122, 1123, 1124, 1125, 1126, 1127, 1128, 1129, 1130, 1131, 1132, 1133, 1134, 1135, 1136, 1137, 1138, 1139, 1140, 1141, 1142, 1143, 1144, 1145, 1146, 1147, 1148, 1149, 1150, 1151, 1152, 1153, 1154, 1155, 1156, 1157, 1158, 1159, 1160, 1161, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1179, 1180, 1181, 1182, 1183, 1184, 1185, 1186, 1187, 1188, 1189, 1190, 1191, 1192, 1193, 1194, 1195, 1196, 1197, 1198, 1199, 1200, 1201, 1202, 1203, 1204, 1205, 1206, 1207, 1208, 1209, 1210, 1211, 1212, 1213, 1214, 1215, 1216, 1217, 1218, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235, 1236, 1237, 1238, 1239, 1240, 1241, 1242, 1243, 1244, 1245, 1246, 1247, 1248, 1249, 1250, 1251, 1252, 1253, 1254, 1255, 1256, 1257, 1258, 1259, 1260, 1261, 1262, 1263, 1264, 1265, 1266, 1267, 1268, 1269, 1270, 1271, 1272, 1273, 1274, 1275, 1276, 1277, 1278, 1279, 1280, 1281, 1282, 1283, 1284, 1285, 1286, 1287, 1288, 1289, 1290, 1291, 1292, 1293, 1294, 1295, 1296, 1297, 1298, 1299, 1300, 1301, 1302, 1303, 1304, 1305, 1306, 1307, 1308, 1309, 1310, 1311, 1312, 1313, 1314, 1315, 1316, 1317, 1318, 1319, 1320, 1321, 1322, 1323, 1324, 1325, 1326, 1327, 1328, 1329, 1330, 1331, 1332, 1333, 1334, 1335, 1336, 1337, 1338, 1339, 1340, 1341, 1342, 1343, 1344, 1345, 1346, 1347, 1348, 1349, 1350, 1351, 1352, 1353, 1354, 1355, 1356, 1357, 1358, 1359, 1360, 1361, 1362, 1363, 1364, 1365, 1366, 1367, 1368, 1369, 1370, 1371, 1372, 1373, 1374, 1375, 1376, 1377, 1378, 1379, 1380, 1381, 1382, 1383, 1384, 1385, 1386, 1387, 1388, 1389, 1390, 1391, 1392, 1393, 1394, 1395, 1396, 1397, 1398, 1399, 1400, 1401, 1402, 1403, 1404, 1405, 1406, 1407, 1408, 1409, 1410, 1411, 1412, 1413, 1414, 1415, 1416, 1417, 1418, 1419, 1420, 1421, 1422, 1423, 1424, 1425, 1426, 1427, 1428, 1429, 1430, 1431, 1432, 1433, 1434, 1435, 1436, 1437, 1438, 1439, 1440, 1441, 1442, 1443, 1444, 1445, 1446, 1447, 1448, 1449, 1450, 1451, 1452, 1453, 1454, 1455, 1456, 1457, 1458, 1459, 1460, 1461, 1462, 1463, 1464, 1465, 1466, 1467, 1468, 1469, 1470, 1471, 1472, 1473, 1474, 1475, 1476, 1477, 1478, 1479, 1480, 1481, 1482, 1483, 1484, 1485, 1486, 1487, 1488, 1489, 1490, 1491, 1492, 1493, 1494, 1495, 1496, 1497, 1498, 1499, 1500, 1501, 1502, 1503, 1504, 1505, 1506, 1507, 1508, 1509, 1510, 1511, 1512, 1513, 1514, 1515, 1516, 1517, 1518, 1519, 1520, 1521, 1522, 1523, 1524, 1525, 1526, 1527, 1528, 1529, 1530, 1531, 1532, 1533, 1534, 1535, 1536, 1537, 1538, 1539, 1540, 1541, 1542, 1543, 1544, 1545, 1546, 1547, 1548, 1549, 1550, 1551, 1552, 1553, 1554, 1555, 1556, 1557, 1558, 1559, 1560, 1561, 1562, 1563, 1564, 1565, 1566, 1567, 1568, 1569, 1570, 1571, 1572, 1573, 1574, 1575, 1576, 1577, 1578, 1579, 1580, 1581, 1582, 1583, 1584, 1585, 1586, 1587, 1588, 1589, 1590, 1591, 1592, 1593, 1594, 1595, 1596, 1597, 1598, 1599, 1600, 1601, 1602, 1603, 1604, 1605, 1606, 1607, 1608, 1609, 1610, 1611, 1612, 1613, 1614, 1615, 1616, 1617, 1618, 1619, 1620, 1621, 1622, 1623, 1624, 1625, 1626, 1627, 1628, 1629, 1630, 1631, 1632, 1633, 1634, 1635, 1636, 1637, 1638, 1639, 1640, 1641, 1642, 1643, 1644, 1645, 1646, 1647, 1648, 1649, 1650, 1651, 1652, 1653, 1654, 1655, 1656, 1657, 1658, 1659, 1660, 1661, 1662, 1663, 1664, 1665, 1666, 1667, 1668, 1669, 1670, 1671, 1672, 1673, 1674, 1675, 1676, 1677, 1678, 1679, 1680, 1681, 1682, 1683, 1684, 1685, 1686, 1687, 1688, 1689, 1690, 1691, 1692, 1693, 1694, 1695, 1696, 1697, 1698, 1699, 1700, 1701, 1702, 1703, 1704, 1705, 1706, 1707, 1708, 1709, 1710, 1711, 1712, 1713, 1714, 1715, 1716, 1717, 1718, 1719, 1720, 1721, 1722, 1723, 1724, 1725, 1726, 1727, 1728, 1729, 1730, 1731, 1732, 1733, 1734, 1735, 1736, 1737, 1738, 1739, 1740, 1741, 1742, 1743, 1744, 1745, 1746, 1747, 1748, 1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771, 1772, 1773, 1774, 1775, 1776, 1777, 1778, 1779, 1780, 1781, 1782, 1783, 1784, 1785, 1786, 1787, 1788, 1789, 1790, 1791, 1792, 1793, 1794, 1795, 1796, 1797, 1798, 1799, 1800, 1801, 1802, 1803, 1804, 1805, 1806, 1807, 1808, 1809, 1810, 1811, 1812, 1813, 1814, 1815, 1816, 1817, 1818, 1819, 1820, 1821, 1822, 1823, 1824, 1825, 1826, 1827, 1828, 1829, 1830, 1831, 1832, 1833, 1834, 1835, 1836, 1837, 1838, 1839, 1840, 1841, 1842, 1843, 1844, 1845, 1846, 1847, 1848, 1849, 1850, 1851, 1852, 1853, 1854, 1855, 1856, 1857, 1858, 1859, 1860, 1861, 1862, 1863, 1864, 1865, 1866, 1867, 1868, 1869, 1870, 1871, 1872, 1873, 1874, 1875, 1876, 1877, 1878, 1879, 1880, 1881, 1882, 1883, 1884, 1885, 1886, 1887, 1888, 1889, 1890, 1891, 1892, 1893, 1894, 1895, 1896, 1897, 1898, 1899, 1900, 1901, 1902, 1903, 1904, 1905, 1906, 1907, 1908, 1909, 1910, 1911, 1912, 1913, 1914, 1915, 1916, 1917, 1918, 1919, 1920, 1921, 1922, 1923, 1924, 1925, 1926, 1927, 1928, 1929, 1930, 1931, 1932, 1933, 1934, 1935, 1936, 1937, 1938, 1939, 1940, 1941, 1942, 1943, 1944, 1945, 1946, 1947, 1948, 1949, 1950, 1951, 1952, 1953, 1954, 1955, 1956, 1957, 1958, 1959, 1960, 1961, 1962, 1963, 1964, 1965, 1966, 1967, 1968, 1969, 1970, 1971, 1972, 1973, 1974, 1975, 1976, 1977, 1978, 1979, 1980, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999]
Discarding 2000 places :
Implicit Place search using SMT only with invariants took 8478 ms to find 2000 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 4000/6000 places, 4000/4000 transitions.
Applied a total of 0 rules in 165 ms. Remains 4000 /4000 variables (removed 0) and now considering 4000/4000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 9260 ms. Remains : 4000/6000 places, 4000/4000 transitions.
// Phase 1: matrix 4000 rows 4000 cols
[2024-06-02 10:52:39] [INFO ] Computed 2000 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1000] Max Struct:[1000]
FORMULA Philosophers-COL-002000-UpperBounds-10 1000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-002000-UpperBounds-11 1000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-002000-UpperBounds-07 1000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 186959 steps (0 resets) in 30001 ms. (6 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Philosophers-COL-002000-UpperBounds-07 in 127604 ms.
[2024-06-02 10:53:10] [INFO ] Flatten gal took : 1082 ms
Total runtime 2773576 ms.
ITS solved all properties within timeout

BK_STOP 1717325590511

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Philosophers-COL-002000"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is Philosophers-COL-002000, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r512-smll-171654407600445"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-002000.tgz
mv Philosophers-COL-002000 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;