Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r105-tall-167814481300493.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is DES-PT-60a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481300493
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 8.8K Feb 26 15:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 26 15:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 15:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 15:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 15:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 15:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Feb 26 15:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 110K Mar 5 18:22 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 DES-PT-60a-UpperBounds-00
FORMULA_NAME DES-PT-60a-UpperBounds-01
FORMULA_NAME DES-PT-60a-UpperBounds-02
FORMULA_NAME DES-PT-60a-UpperBounds-03
FORMULA_NAME DES-PT-60a-UpperBounds-04
FORMULA_NAME DES-PT-60a-UpperBounds-05
FORMULA_NAME DES-PT-60a-UpperBounds-06
FORMULA_NAME DES-PT-60a-UpperBounds-07
FORMULA_NAME DES-PT-60a-UpperBounds-08
FORMULA_NAME DES-PT-60a-UpperBounds-09
FORMULA_NAME DES-PT-60a-UpperBounds-10
FORMULA_NAME DES-PT-60a-UpperBounds-11
FORMULA_NAME DES-PT-60a-UpperBounds-12
FORMULA_NAME DES-PT-60a-UpperBounds-13
FORMULA_NAME DES-PT-60a-UpperBounds-14
FORMULA_NAME DES-PT-60a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678312195008

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-60a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 21:49:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-08 21:49:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 21:49:56] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2023-03-08 21:49:56] [INFO ] Transformed 354 places.
[2023-03-08 21:49:56] [INFO ] Transformed 311 transitions.
[2023-03-08 21:49:56] [INFO ] Found NUPN structural information;
[2023-03-08 21:49:56] [INFO ] Parsed PT model containing 354 places and 311 transitions and 1496 arcs in 132 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
// Phase 1: matrix 297 rows 354 cols
[2023-03-08 21:49:56] [INFO ] Computed 59 place invariants in 36 ms
Incomplete random walk after 10000 steps, including 222 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 16) seen :3
FORMULA DES-PT-60a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 44 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 44 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 13) seen :0
[2023-03-08 21:49:57] [INFO ] Invariant cache hit.
[2023-03-08 21:49:57] [INFO ] [Real]Absence check using 34 positive place invariants in 18 ms returned sat
[2023-03-08 21:49:57] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-08 21:49:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:49:57] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2023-03-08 21:49:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:49:57] [INFO ] [Nat]Absence check using 34 positive place invariants in 11 ms returned sat
[2023-03-08 21:49:57] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 167 ms returned sat
[2023-03-08 21:49:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:49:59] [INFO ] [Nat]Absence check using state equation in 1832 ms returned sat
[2023-03-08 21:49:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 21:50:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 1559 ms returned sat
[2023-03-08 21:50:01] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 71 ms.
[2023-03-08 21:50:02] [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: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-08 21:50:02] [INFO ] [Real]Absence check using 34 positive place invariants in 46 ms returned sat
[2023-03-08 21:50:02] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 117 ms returned sat
[2023-03-08 21:50:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:50:03] [INFO ] [Real]Absence check using state equation in 570 ms returned sat
[2023-03-08 21:50:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:50:03] [INFO ] [Nat]Absence check using 34 positive place invariants in 62 ms returned sat
[2023-03-08 21:50:03] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 59 ms returned sat
[2023-03-08 21:50:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:50:05] [INFO ] [Nat]Absence check using state equation in 1527 ms returned sat
[2023-03-08 21:50:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 20 ms returned sat
[2023-03-08 21:50:05] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 25 ms.
[2023-03-08 21:50:07] [INFO ] Added : 156 causal constraints over 32 iterations in 2166 ms. Result :sat
Minimization took 356 ms.
[2023-03-08 21:50:08] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-08 21:50:08] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 21:50:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:50:08] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2023-03-08 21:50:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:50:08] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-08 21:50:08] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 111 ms returned sat
[2023-03-08 21:50:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:50:09] [INFO ] [Nat]Absence check using state equation in 1111 ms returned sat
[2023-03-08 21:50:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-08 21:50:09] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 30 ms.
[2023-03-08 21:50:11] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 4 ms to minimize.
[2023-03-08 21:50:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2023-03-08 21:50:11] [INFO ] Added : 155 causal constraints over 31 iterations in 2106 ms. Result :sat
Minimization took 306 ms.
[2023-03-08 21:50:12] [INFO ] [Real]Absence check using 34 positive place invariants in 13 ms returned sat
[2023-03-08 21:50:12] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 21 ms returned sat
[2023-03-08 21:50:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:50:12] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2023-03-08 21:50:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:50:12] [INFO ] [Nat]Absence check using 34 positive place invariants in 12 ms returned sat
[2023-03-08 21:50:12] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 99 ms returned sat
[2023-03-08 21:50:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:50:13] [INFO ] [Nat]Absence check using state equation in 1263 ms returned sat
[2023-03-08 21:50:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 78 ms returned sat
[2023-03-08 21:50:14] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 34 ms.
[2023-03-08 21:50:16] [INFO ] Added : 236 causal constraints over 48 iterations in 2306 ms. Result :sat
Minimization took 510 ms.
[2023-03-08 21:50:17] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2023-03-08 21:50:17] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 25 ms returned sat
[2023-03-08 21:50:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:50:17] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2023-03-08 21:50:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:50:17] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-08 21:50:17] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 158 ms returned sat
[2023-03-08 21:50:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:50:21] [INFO ] [Nat]Absence check using state equation in 3932 ms returned sat
[2023-03-08 21:50:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 84 ms returned sat
[2023-03-08 21:50:21] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 39 ms.
[2023-03-08 21:50:22] [INFO ] Added : 75 causal constraints over 15 iterations in 732 ms. Result :unknown
[2023-03-08 21:50:22] [INFO ] [Real]Absence check using 34 positive place invariants in 10 ms returned sat
[2023-03-08 21:50:22] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 21 ms returned sat
[2023-03-08 21:50:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:50:22] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2023-03-08 21:50:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:50:22] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-08 21:50:22] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 42 ms returned sat
[2023-03-08 21:50:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:50:23] [INFO ] [Nat]Absence check using state equation in 925 ms returned sat
[2023-03-08 21:50:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 28 ms returned sat
[2023-03-08 21:50:23] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 23 ms.
[2023-03-08 21:50:25] [INFO ] Added : 167 causal constraints over 34 iterations in 1668 ms. Result :sat
Minimization took 759 ms.
[2023-03-08 21:50:26] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-08 21:50:26] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-08 21:50:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:50:26] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2023-03-08 21:50:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:50:26] [INFO ] [Nat]Absence check using 34 positive place invariants in 18 ms returned sat
[2023-03-08 21:50:27] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 721 ms returned sat
[2023-03-08 21:50:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:50:29] [INFO ] [Nat]Absence check using state equation in 2624 ms returned sat
[2023-03-08 21:50:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 120 ms returned sat
[2023-03-08 21:50:30] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 37 ms.
[2023-03-08 21:50:31] [INFO ] Added : 113 causal constraints over 23 iterations in 1177 ms. Result :sat
Minimization took 246 ms.
[2023-03-08 21:50:31] [INFO ] [Real]Absence check using 34 positive place invariants in 10 ms returned sat
[2023-03-08 21:50:31] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 21:50:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:50:31] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2023-03-08 21:50:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:50:31] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-08 21:50:32] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 234 ms returned sat
[2023-03-08 21:50:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:50:33] [INFO ] [Nat]Absence check using state equation in 1454 ms returned sat
[2023-03-08 21:50:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 215 ms returned sat
[2023-03-08 21:50:33] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 17 ms.
[2023-03-08 21:50:36] [INFO ] Deduced a trap composed of 12 places in 407 ms of which 1 ms to minimize.
[2023-03-08 21:50:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 469 ms
[2023-03-08 21:50:36] [INFO ] Added : 106 causal constraints over 22 iterations in 2854 ms. Result :sat
Minimization took 138 ms.
[2023-03-08 21:50:36] [INFO ] [Real]Absence check using 34 positive place invariants in 12 ms returned sat
[2023-03-08 21:50:36] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 26 ms returned sat
[2023-03-08 21:50:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:50:37] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2023-03-08 21:50:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:50:37] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-08 21:50:37] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 132 ms returned sat
[2023-03-08 21:50:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:50:41] [INFO ] [Nat]Absence check using state equation in 3808 ms returned sat
[2023-03-08 21:50:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2023-03-08 21:50:41] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 16 ms.
[2023-03-08 21:50:41] [INFO ] Added : 83 causal constraints over 17 iterations in 398 ms. Result :sat
Minimization took 144 ms.
[2023-03-08 21:50:41] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-08 21:50:41] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 21:50:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:50:42] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2023-03-08 21:50:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:50:42] [INFO ] [Nat]Absence check using 34 positive place invariants in 12 ms returned sat
[2023-03-08 21:50:42] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 48 ms returned sat
[2023-03-08 21:50:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:50:43] [INFO ] [Nat]Absence check using state equation in 790 ms returned sat
[2023-03-08 21:50:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2023-03-08 21:50:43] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 15 ms.
[2023-03-08 21:50:47] [INFO ] Added : 10 causal constraints over 2 iterations in 4019 ms. Result :unknown
[2023-03-08 21:50:47] [INFO ] [Real]Absence check using 34 positive place invariants in 37 ms returned sat
[2023-03-08 21:50:47] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 25 ms returned sat
[2023-03-08 21:50:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:50:47] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2023-03-08 21:50:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:50:47] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-08 21:50:47] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 76 ms returned sat
[2023-03-08 21:50:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:50:50] [INFO ] [Nat]Absence check using state equation in 2944 ms returned sat
[2023-03-08 21:50:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 311 ms returned sat
[2023-03-08 21:50:51] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
[2023-03-08 21:50:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-03-08 21:50:51] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 16 ms.
[2023-03-08 21:50:52] [INFO ] Added : 113 causal constraints over 24 iterations in 1501 ms. Result :sat
Minimization took 9 ms.
[2023-03-08 21:50:52] [INFO ] [Real]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-08 21:50:52] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 18 ms returned sat
[2023-03-08 21:50:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:50:52] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2023-03-08 21:50:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:50:52] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-08 21:50:52] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 41 ms returned sat
[2023-03-08 21:50:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:50:53] [INFO ] [Nat]Absence check using state equation in 562 ms returned sat
[2023-03-08 21:50:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 130 ms returned sat
[2023-03-08 21:50:53] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 2 ms to minimize.
[2023-03-08 21:50:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-08 21:50:53] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 16 ms.
[2023-03-08 21:50:56] [INFO ] Added : 247 causal constraints over 50 iterations in 3191 ms. Result :sat
Minimization took 489 ms.
[2023-03-08 21:50:57] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-08 21:50:57] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 21:50:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:50:57] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2023-03-08 21:50:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:50:57] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-08 21:50:57] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 142 ms returned sat
[2023-03-08 21:50:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:50:58] [INFO ] [Nat]Absence check using state equation in 370 ms returned sat
[2023-03-08 21:50:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 47 ms returned sat
[2023-03-08 21:50:58] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 0 ms to minimize.
[2023-03-08 21:50:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-03-08 21:50:58] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 17 ms.
[2023-03-08 21:51:00] [INFO ] Added : 203 causal constraints over 41 iterations in 1627 ms. Result :sat
Minimization took 377 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA DES-PT-60a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-60a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-60a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-60a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-60a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-60a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-60a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-60a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 354 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 297/297 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 354 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 353 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 353 transition count 294
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 353 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 352 transition count 293
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 351 transition count 293
Applied a total of 12 rules in 145 ms. Remains 351 /354 variables (removed 3) and now considering 293/297 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 351/354 places, 293/297 transitions.
// Phase 1: matrix 293 rows 351 cols
[2023-03-08 21:51:03] [INFO ] Computed 60 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 13665 resets, run finished after 2135 ms. (steps per millisecond=468 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2278 resets, run finished after 863 ms. (steps per millisecond=1158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2307 resets, run finished after 886 ms. (steps per millisecond=1128 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2279 resets, run finished after 874 ms. (steps per millisecond=1144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2264 resets, run finished after 863 ms. (steps per millisecond=1158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2287 resets, run finished after 866 ms. (steps per millisecond=1154 ) properties (out of 5) seen :0
[2023-03-08 21:51:10] [INFO ] Invariant cache hit.
[2023-03-08 21:51:10] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 21:51:10] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-08 21:51:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:51:10] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2023-03-08 21:51:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:51:10] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 21:51:11] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 909 ms returned sat
[2023-03-08 21:51:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:51:17] [INFO ] [Nat]Absence check using state equation in 6126 ms returned unknown
[2023-03-08 21:51:17] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 21:51:17] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 21:51:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:51:17] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2023-03-08 21:51:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:51:17] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 21:51:18] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 351 ms returned sat
[2023-03-08 21:51:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:51:18] [INFO ] [Nat]Absence check using state equation in 647 ms returned sat
[2023-03-08 21:51:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 21:51:18] [INFO ] [Nat]Added 2 Read/Feed constraints in 20 ms returned sat
[2023-03-08 21:51:18] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 20 ms.
[2023-03-08 21:51:23] [INFO ] Added : 239 causal constraints over 48 iterations in 4913 ms. Result :sat
Minimization took 89 ms.
[2023-03-08 21:51:24] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 21:51:24] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 21:51:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:51:24] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2023-03-08 21:51:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:51:24] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 21:51:24] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 241 ms returned sat
[2023-03-08 21:51:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:51:25] [INFO ] [Nat]Absence check using state equation in 492 ms returned sat
[2023-03-08 21:51:25] [INFO ] [Nat]Added 2 Read/Feed constraints in 13 ms returned sat
[2023-03-08 21:51:25] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 16 ms.
[2023-03-08 21:51:26] [INFO ] Added : 208 causal constraints over 42 iterations in 1057 ms. Result :sat
Minimization took 76 ms.
[2023-03-08 21:51:26] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 21:51:26] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 21:51:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:51:26] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2023-03-08 21:51:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:51:26] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 21:51:26] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 283 ms returned sat
[2023-03-08 21:51:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:51:27] [INFO ] [Nat]Absence check using state equation in 354 ms returned sat
[2023-03-08 21:51:27] [INFO ] [Nat]Added 2 Read/Feed constraints in 10 ms returned sat
[2023-03-08 21:51:27] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 0 ms to minimize.
[2023-03-08 21:51:27] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 0 ms to minimize.
[2023-03-08 21:51:27] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 1 ms to minimize.
[2023-03-08 21:51:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 348 ms
[2023-03-08 21:51:27] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 14 ms.
[2023-03-08 21:51:28] [INFO ] Added : 208 causal constraints over 43 iterations in 1050 ms. Result :sat
Minimization took 166 ms.
[2023-03-08 21:51:28] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 21:51:28] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 21:51:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:51:29] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2023-03-08 21:51:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:51:29] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 21:51:29] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 280 ms returned sat
[2023-03-08 21:51:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:51:30] [INFO ] [Nat]Absence check using state equation in 898 ms returned sat
[2023-03-08 21:51:30] [INFO ] [Nat]Added 2 Read/Feed constraints in 7 ms returned sat
[2023-03-08 21:51:30] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
[2023-03-08 21:51:30] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 1 ms to minimize.
[2023-03-08 21:51:30] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 1 ms to minimize.
[2023-03-08 21:51:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 368 ms
[2023-03-08 21:51:30] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 15 ms.
[2023-03-08 21:51:31] [INFO ] Added : 232 causal constraints over 47 iterations in 1251 ms. Result :sat
Minimization took 85 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 13 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 18 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-08 21:51:33] [INFO ] Invariant cache hit.
[2023-03-08 21:51:34] [INFO ] Implicit Places using invariants in 513 ms returned []
[2023-03-08 21:51:34] [INFO ] Invariant cache hit.
[2023-03-08 21:51:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 21:51:34] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 1049 ms to find 0 implicit places.
[2023-03-08 21:51:34] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-08 21:51:34] [INFO ] Invariant cache hit.
[2023-03-08 21:51:35] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1296 ms. Remains : 351/351 places, 293/293 transitions.
Starting property specific reduction for DES-PT-60a-UpperBounds-00
[2023-03-08 21:51:35] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 136 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-08 21:51:35] [INFO ] Invariant cache hit.
[2023-03-08 21:51:35] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 21:51:35] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 19 ms returned sat
[2023-03-08 21:51:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:51:35] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2023-03-08 21:51:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:51:35] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 21:51:36] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 911 ms returned sat
[2023-03-08 21:51:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:51:40] [INFO ] [Nat]Absence check using state equation in 4039 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 18 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 351/351 places, 293/293 transitions.
[2023-03-08 21:51:40] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13589 resets, run finished after 1862 ms. (steps per millisecond=537 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2241 resets, run finished after 820 ms. (steps per millisecond=1219 ) properties (out of 1) seen :0
[2023-03-08 21:51:43] [INFO ] Invariant cache hit.
[2023-03-08 21:51:43] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 21:51:43] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 21:51:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:51:43] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2023-03-08 21:51:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:51:43] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 21:51:44] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 864 ms returned sat
[2023-03-08 21:51:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:51:50] [INFO ] [Nat]Absence check using state equation in 6137 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 20 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 11 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-08 21:51:50] [INFO ] Invariant cache hit.
[2023-03-08 21:51:50] [INFO ] Implicit Places using invariants in 270 ms returned []
[2023-03-08 21:51:50] [INFO ] Invariant cache hit.
[2023-03-08 21:51:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 21:51:51] [INFO ] Implicit Places using invariants and state equation in 524 ms returned []
Implicit Place search using SMT with State Equation took 796 ms to find 0 implicit places.
[2023-03-08 21:51:51] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-08 21:51:51] [INFO ] Invariant cache hit.
[2023-03-08 21:51:51] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 992 ms. Remains : 351/351 places, 293/293 transitions.
Ending property specific reduction for DES-PT-60a-UpperBounds-00 in 16326 ms.
Starting property specific reduction for DES-PT-60a-UpperBounds-05
[2023-03-08 21:51:51] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 134 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-08 21:51:51] [INFO ] Invariant cache hit.
[2023-03-08 21:51:51] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 21:51:51] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 21:51:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:51:51] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2023-03-08 21:51:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:51:51] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 21:51:52] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 383 ms returned sat
[2023-03-08 21:51:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:51:52] [INFO ] [Nat]Absence check using state equation in 636 ms returned sat
[2023-03-08 21:51:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 21:51:52] [INFO ] [Nat]Added 2 Read/Feed constraints in 19 ms returned sat
[2023-03-08 21:51:52] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 14 ms.
[2023-03-08 21:51:56] [INFO ] Added : 239 causal constraints over 48 iterations in 3884 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 10 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 351/351 places, 293/293 transitions.
[2023-03-08 21:51:57] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13680 resets, run finished after 1860 ms. (steps per millisecond=537 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2243 resets, run finished after 830 ms. (steps per millisecond=1204 ) properties (out of 1) seen :0
[2023-03-08 21:51:59] [INFO ] Invariant cache hit.
[2023-03-08 21:52:00] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 21:52:00] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-08 21:52:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:52:00] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2023-03-08 21:52:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:52:00] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 21:52:00] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 372 ms returned sat
[2023-03-08 21:52:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:52:01] [INFO ] [Nat]Absence check using state equation in 651 ms returned sat
[2023-03-08 21:52:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 21:52:01] [INFO ] [Nat]Added 2 Read/Feed constraints in 29 ms returned sat
[2023-03-08 21:52:01] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 18 ms.
[2023-03-08 21:52:06] [INFO ] Added : 239 causal constraints over 48 iterations in 4903 ms. Result :sat
Minimization took 89 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 11 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 10 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-08 21:52:06] [INFO ] Invariant cache hit.
[2023-03-08 21:52:07] [INFO ] Implicit Places using invariants in 210 ms returned []
[2023-03-08 21:52:07] [INFO ] Invariant cache hit.
[2023-03-08 21:52:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 21:52:07] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 738 ms to find 0 implicit places.
[2023-03-08 21:52:07] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-08 21:52:07] [INFO ] Invariant cache hit.
[2023-03-08 21:52:07] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 936 ms. Remains : 351/351 places, 293/293 transitions.
Ending property specific reduction for DES-PT-60a-UpperBounds-05 in 16325 ms.
Starting property specific reduction for DES-PT-60a-UpperBounds-07
[2023-03-08 21:52:07] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 21:52:07] [INFO ] Invariant cache hit.
[2023-03-08 21:52:07] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 21:52:07] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 21:52:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:52:08] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2023-03-08 21:52:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:52:08] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 21:52:08] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 245 ms returned sat
[2023-03-08 21:52:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:52:08] [INFO ] [Nat]Absence check using state equation in 515 ms returned sat
[2023-03-08 21:52:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 21:52:08] [INFO ] [Nat]Added 2 Read/Feed constraints in 14 ms returned sat
[2023-03-08 21:52:08] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 18 ms.
[2023-03-08 21:52:10] [INFO ] Added : 208 causal constraints over 42 iterations in 1140 ms. Result :sat
Minimization took 77 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 10 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 351/351 places, 293/293 transitions.
[2023-03-08 21:52:10] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13702 resets, run finished after 1924 ms. (steps per millisecond=519 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2248 resets, run finished after 852 ms. (steps per millisecond=1173 ) properties (out of 1) seen :0
[2023-03-08 21:52:13] [INFO ] Invariant cache hit.
[2023-03-08 21:52:13] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 21:52:13] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 21:52:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:52:13] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2023-03-08 21:52:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:52:13] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 21:52:13] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 243 ms returned sat
[2023-03-08 21:52:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:52:14] [INFO ] [Nat]Absence check using state equation in 502 ms returned sat
[2023-03-08 21:52:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 21:52:14] [INFO ] [Nat]Added 2 Read/Feed constraints in 13 ms returned sat
[2023-03-08 21:52:14] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 18 ms.
[2023-03-08 21:52:15] [INFO ] Added : 208 causal constraints over 42 iterations in 1060 ms. Result :sat
Minimization took 74 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 13 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 9 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-08 21:52:16] [INFO ] Invariant cache hit.
[2023-03-08 21:52:16] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-03-08 21:52:16] [INFO ] Invariant cache hit.
[2023-03-08 21:52:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 21:52:16] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 709 ms to find 0 implicit places.
[2023-03-08 21:52:16] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-08 21:52:16] [INFO ] Invariant cache hit.
[2023-03-08 21:52:16] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 885 ms. Remains : 351/351 places, 293/293 transitions.
Ending property specific reduction for DES-PT-60a-UpperBounds-07 in 9051 ms.
Starting property specific reduction for DES-PT-60a-UpperBounds-10
[2023-03-08 21:52:16] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 131 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-08 21:52:16] [INFO ] Invariant cache hit.
[2023-03-08 21:52:16] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 21:52:17] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 21:52:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:52:17] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2023-03-08 21:52:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:52:17] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 21:52:17] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 281 ms returned sat
[2023-03-08 21:52:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:52:17] [INFO ] [Nat]Absence check using state equation in 336 ms returned sat
[2023-03-08 21:52:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 21:52:17] [INFO ] [Nat]Added 2 Read/Feed constraints in 10 ms returned sat
[2023-03-08 21:52:17] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 1 ms to minimize.
[2023-03-08 21:52:18] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 1 ms to minimize.
[2023-03-08 21:52:18] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2023-03-08 21:52:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 336 ms
[2023-03-08 21:52:18] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 14 ms.
[2023-03-08 21:52:19] [INFO ] Added : 208 causal constraints over 43 iterations in 1078 ms. Result :sat
Minimization took 169 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 9 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 351/351 places, 293/293 transitions.
[2023-03-08 21:52:19] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13669 resets, run finished after 1900 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2293 resets, run finished after 843 ms. (steps per millisecond=1186 ) properties (out of 1) seen :0
[2023-03-08 21:52:22] [INFO ] Invariant cache hit.
[2023-03-08 21:52:22] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 21:52:22] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 27 ms returned sat
[2023-03-08 21:52:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:52:22] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2023-03-08 21:52:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:52:22] [INFO ] [Nat]Absence check using 35 positive place invariants in 8 ms returned sat
[2023-03-08 21:52:23] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 287 ms returned sat
[2023-03-08 21:52:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:52:23] [INFO ] [Nat]Absence check using state equation in 353 ms returned sat
[2023-03-08 21:52:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 21:52:23] [INFO ] [Nat]Added 2 Read/Feed constraints in 10 ms returned sat
[2023-03-08 21:52:23] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 0 ms to minimize.
[2023-03-08 21:52:23] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 1 ms to minimize.
[2023-03-08 21:52:23] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 1 ms to minimize.
[2023-03-08 21:52:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 369 ms
[2023-03-08 21:52:23] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 16 ms.
[2023-03-08 21:52:25] [INFO ] Added : 208 causal constraints over 43 iterations in 1092 ms. Result :sat
Minimization took 169 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 11 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 8 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-08 21:52:25] [INFO ] Invariant cache hit.
[2023-03-08 21:52:25] [INFO ] Implicit Places using invariants in 202 ms returned []
[2023-03-08 21:52:25] [INFO ] Invariant cache hit.
[2023-03-08 21:52:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 21:52:26] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 716 ms to find 0 implicit places.
[2023-03-08 21:52:26] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 21:52:26] [INFO ] Invariant cache hit.
[2023-03-08 21:52:26] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 910 ms. Remains : 351/351 places, 293/293 transitions.
Ending property specific reduction for DES-PT-60a-UpperBounds-10 in 9664 ms.
Starting property specific reduction for DES-PT-60a-UpperBounds-14
[2023-03-08 21:52:26] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 137 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-08 21:52:26] [INFO ] Invariant cache hit.
[2023-03-08 21:52:26] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 21:52:26] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-08 21:52:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:52:26] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2023-03-08 21:52:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:52:26] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 21:52:27] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 286 ms returned sat
[2023-03-08 21:52:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:52:28] [INFO ] [Nat]Absence check using state equation in 946 ms returned sat
[2023-03-08 21:52:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 21:52:28] [INFO ] [Nat]Added 2 Read/Feed constraints in 7 ms returned sat
[2023-03-08 21:52:28] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 0 ms to minimize.
[2023-03-08 21:52:28] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 0 ms to minimize.
[2023-03-08 21:52:28] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 0 ms to minimize.
[2023-03-08 21:52:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 317 ms
[2023-03-08 21:52:28] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 15 ms.
[2023-03-08 21:52:29] [INFO ] Added : 232 causal constraints over 47 iterations in 1278 ms. Result :sat
Minimization took 87 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 9 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 351/351 places, 293/293 transitions.
[2023-03-08 21:52:30] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13690 resets, run finished after 1907 ms. (steps per millisecond=524 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2246 resets, run finished after 838 ms. (steps per millisecond=1193 ) properties (out of 1) seen :0
[2023-03-08 21:52:33] [INFO ] Invariant cache hit.
[2023-03-08 21:52:33] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 21:52:33] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-08 21:52:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:52:33] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2023-03-08 21:52:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:52:33] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 21:52:33] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 289 ms returned sat
[2023-03-08 21:52:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:52:34] [INFO ] [Nat]Absence check using state equation in 956 ms returned sat
[2023-03-08 21:52:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 21:52:34] [INFO ] [Nat]Added 2 Read/Feed constraints in 7 ms returned sat
[2023-03-08 21:52:34] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 0 ms to minimize.
[2023-03-08 21:52:35] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 1 ms to minimize.
[2023-03-08 21:52:35] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 0 ms to minimize.
[2023-03-08 21:52:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 345 ms
[2023-03-08 21:52:35] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 18 ms.
[2023-03-08 21:52:36] [INFO ] Added : 232 causal constraints over 47 iterations in 1329 ms. Result :sat
Minimization took 89 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 9 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 9 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-08 21:52:37] [INFO ] Invariant cache hit.
[2023-03-08 21:52:37] [INFO ] Implicit Places using invariants in 178 ms returned []
[2023-03-08 21:52:37] [INFO ] Invariant cache hit.
[2023-03-08 21:52:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 21:52:37] [INFO ] Implicit Places using invariants and state equation in 519 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
[2023-03-08 21:52:37] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 21:52:37] [INFO ] Invariant cache hit.
[2023-03-08 21:52:38] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 891 ms. Remains : 351/351 places, 293/293 transitions.
Ending property specific reduction for DES-PT-60a-UpperBounds-14 in 11538 ms.
[2023-03-08 21:52:38] [INFO ] Flatten gal took : 66 ms
[2023-03-08 21:52:38] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-08 21:52:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 351 places, 293 transitions and 1409 arcs took 3 ms.
Total runtime 161905 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/800/ub_0_ --maxsum=/tmp/800/ub_1_ --maxsum=/tmp/800/ub_2_ --maxsum=/tmp/800/ub_3_ --maxsum=/tmp/800/ub_4_
FORMULA DES-PT-60a-UpperBounds-00 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-60a-UpperBounds-05 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-60a-UpperBounds-07 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-60a-UpperBounds-10 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DES-PT-60a-UpperBounds-14 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678313236810

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2023
ub formula name DES-PT-60a-UpperBounds-00
ub formula formula --maxsum=/tmp/800/ub_0_
ub formula name DES-PT-60a-UpperBounds-05
ub formula formula --maxsum=/tmp/800/ub_1_
ub formula name DES-PT-60a-UpperBounds-07
ub formula formula --maxsum=/tmp/800/ub_2_
ub formula name DES-PT-60a-UpperBounds-10
ub formula formula --maxsum=/tmp/800/ub_3_
ub formula name DES-PT-60a-UpperBounds-14
ub formula formula --maxsum=/tmp/800/ub_4_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 351 places, 293 transitions and 1409 arcs
pnml2lts-sym: Petri net DES_PT_60a analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 293->288 groups
pnml2lts-sym: Regrouping took 0.080 real 0.080 user 0.000 sys
pnml2lts-sym: state vector length is 351; there are 288 groups
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Exploration took 125523285 group checks and 0 next state calls
pnml2lts-sym: reachability took 864.950 real 3424.670 user 31.940 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 2.250 real 9.010 user 0.000 sys
pnml2lts-sym: state space has 41370672495980 states, 7212900 nodes
pnml2lts-sym: Maximum sum of /tmp/800/ub_0_ is: 1
pnml2lts-sym: Maximum sum of /tmp/800/ub_1_ is: 1
pnml2lts-sym: Maximum sum of /tmp/800/ub_2_ is: 1
pnml2lts-sym: Maximum sum of /tmp/800/ub_3_ is: 1
pnml2lts-sym: Maximum sum of /tmp/800/ub_4_ is: 1
pnml2lts-sym: group_next: 3156 nodes total
pnml2lts-sym: group_explored: 3324 nodes, 3976 short vectors total
pnml2lts-sym: max token count: 1

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="DES-PT-60a"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is DES-PT-60a, 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 r105-tall-167814481300493"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-60a.tgz
mv DES-PT-60a 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 ;