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.r522-tall-167987247100245.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 marciexred
Input is EisenbergMcGuire-PT-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247100245
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 13K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Mar 23 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 23 15:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 753K Mar 31 16:48 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 EisenbergMcGuire-PT-06-UpperBounds-00
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-01
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-02
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-03
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-04
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-05
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-06
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-07
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-08
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-09
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-10
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-11
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-12
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-13
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-14
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1680824857792

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-06
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-06 23:47:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-04-06 23:47:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 23:47:39] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2023-04-06 23:47:39] [INFO ] Transformed 414 places.
[2023-04-06 23:47:39] [INFO ] Transformed 1296 transitions.
[2023-04-06 23:47:39] [INFO ] Found NUPN structural information;
[2023-04-06 23:47:39] [INFO ] Parsed PT model containing 414 places and 1296 transitions and 5976 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Normalized transition count is 702 out of 1296 initially.
// Phase 1: matrix 702 rows 414 cols
[2023-04-06 23:47:39] [INFO ] Computed 19 invariants in 26 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 16) seen :12
FORMULA EisenbergMcGuire-PT-06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 4) seen :0
[2023-04-06 23:47:39] [INFO ] Flow matrix only has 702 transitions (discarded 594 similar events)
// Phase 1: matrix 702 rows 414 cols
[2023-04-06 23:47:39] [INFO ] Computed 19 invariants in 7 ms
[2023-04-06 23:47:40] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-04-06 23:47:40] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 23:47:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 23:47:40] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2023-04-06 23:47:40] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 23:47:40] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-04-06 23:47:40] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 23:47:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 23:47:40] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2023-04-06 23:47:40] [INFO ] State equation strengthened by 314 read => feed constraints.
[2023-04-06 23:47:40] [INFO ] [Nat]Added 314 Read/Feed constraints in 45 ms returned sat
[2023-04-06 23:47:40] [INFO ] Deduced a trap composed of 35 places in 183 ms of which 4 ms to minimize.
[2023-04-06 23:47:40] [INFO ] Deduced a trap composed of 60 places in 184 ms of which 1 ms to minimize.
[2023-04-06 23:47:41] [INFO ] Deduced a trap composed of 25 places in 237 ms of which 1 ms to minimize.
[2023-04-06 23:47:41] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 2 ms to minimize.
[2023-04-06 23:47:41] [INFO ] Deduced a trap composed of 3 places in 158 ms of which 1 ms to minimize.
[2023-04-06 23:47:41] [INFO ] Deduced a trap composed of 3 places in 150 ms of which 0 ms to minimize.
[2023-04-06 23:47:41] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 0 ms to minimize.
[2023-04-06 23:47:42] [INFO ] Deduced a trap composed of 74 places in 121 ms of which 0 ms to minimize.
[2023-04-06 23:47:42] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 0 ms to minimize.
[2023-04-06 23:47:42] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2023-04-06 23:47:42] [INFO ] Deduced a trap composed of 47 places in 104 ms of which 1 ms to minimize.
[2023-04-06 23:47:42] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 0 ms to minimize.
[2023-04-06 23:47:42] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2023-04-06 23:47:42] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 0 ms to minimize.
[2023-04-06 23:47:42] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-04-06 23:47:42] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2318 ms
[2023-04-06 23:47:42] [INFO ] Computed and/alt/rep : 499/1075/409 causal constraints (skipped 287 transitions) in 82 ms.
[2023-04-06 23:47:45] [INFO ] Deduced a trap composed of 3 places in 161 ms of which 0 ms to minimize.
[2023-04-06 23:47:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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-04-06 23:47:45] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-04-06 23:47:45] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 23:47:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 23:47:45] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2023-04-06 23:47:45] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 23:47:45] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-04-06 23:47:45] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 23:47:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 23:47:45] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2023-04-06 23:47:45] [INFO ] [Nat]Added 314 Read/Feed constraints in 34 ms returned sat
[2023-04-06 23:47:46] [INFO ] Deduced a trap composed of 3 places in 151 ms of which 1 ms to minimize.
[2023-04-06 23:47:46] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 1 ms to minimize.
[2023-04-06 23:47:46] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 1 ms to minimize.
[2023-04-06 23:47:46] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 0 ms to minimize.
[2023-04-06 23:47:46] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 1 ms to minimize.
[2023-04-06 23:47:46] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 1 ms to minimize.
[2023-04-06 23:47:47] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 1 ms to minimize.
[2023-04-06 23:47:47] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 0 ms to minimize.
[2023-04-06 23:47:47] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 0 ms to minimize.
[2023-04-06 23:47:47] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2023-04-06 23:47:47] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1361 ms
[2023-04-06 23:47:47] [INFO ] Computed and/alt/rep : 499/1075/409 causal constraints (skipped 287 transitions) in 57 ms.
[2023-04-06 23:47:49] [INFO ] Added : 250 causal constraints over 50 iterations in 2308 ms. Result :sat
Minimization took 140 ms.
[2023-04-06 23:47:49] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-04-06 23:47:49] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 23:47:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 23:47:50] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2023-04-06 23:47:50] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 23:47:50] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-04-06 23:47:50] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 23:47:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 23:47:50] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2023-04-06 23:47:50] [INFO ] [Nat]Added 314 Read/Feed constraints in 32 ms returned sat
[2023-04-06 23:47:50] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 1 ms to minimize.
[2023-04-06 23:47:50] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 0 ms to minimize.
[2023-04-06 23:47:50] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 1 ms to minimize.
[2023-04-06 23:47:50] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 0 ms to minimize.
[2023-04-06 23:47:51] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 0 ms to minimize.
[2023-04-06 23:47:51] [INFO ] Deduced a trap composed of 55 places in 119 ms of which 1 ms to minimize.
[2023-04-06 23:47:51] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 0 ms to minimize.
[2023-04-06 23:47:51] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 0 ms to minimize.
[2023-04-06 23:47:51] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 1 ms to minimize.
[2023-04-06 23:47:51] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 0 ms to minimize.
[2023-04-06 23:47:51] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2023-04-06 23:47:51] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2023-04-06 23:47:51] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1644 ms
[2023-04-06 23:47:51] [INFO ] Computed and/alt/rep : 499/1075/409 causal constraints (skipped 287 transitions) in 49 ms.
[2023-04-06 23:47:54] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 0 ms to minimize.
[2023-04-06 23:47:54] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 0 ms to minimize.
[2023-04-06 23:47:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 393 ms
[2023-04-06 23:47:54] [INFO ] Added : 285 causal constraints over 58 iterations in 3021 ms. Result :sat
Minimization took 90 ms.
[2023-04-06 23:47:55] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-04-06 23:47:55] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 23:47:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 23:47:55] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2023-04-06 23:47:55] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 23:47:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-04-06 23:47:55] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 23:47:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 23:47:55] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2023-04-06 23:47:55] [INFO ] [Nat]Added 314 Read/Feed constraints in 35 ms returned sat
[2023-04-06 23:47:55] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 0 ms to minimize.
[2023-04-06 23:47:55] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 1 ms to minimize.
[2023-04-06 23:47:55] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 0 ms to minimize.
[2023-04-06 23:47:55] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 0 ms to minimize.
[2023-04-06 23:47:56] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 0 ms to minimize.
[2023-04-06 23:47:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 539 ms
[2023-04-06 23:47:56] [INFO ] Computed and/alt/rep : 499/1075/409 causal constraints (skipped 287 transitions) in 39 ms.
[2023-04-06 23:47:57] [INFO ] Added : 179 causal constraints over 36 iterations in 1571 ms. Result :sat
Minimization took 126 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
FORMULA EisenbergMcGuire-PT-06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 414 places. Attempting structural reductions.
Drop transitions removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1293/1293 transitions.
Reduce places removed 2 places and 2 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 412 transition count 1285
Reduce places removed 7 places and 3 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 405 transition count 1282
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 17 place count 403 transition count 1280
Reduce places removed 1 places and 3 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 402 transition count 1277
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 20 place count 400 transition count 1275
Reduce places removed 1 places and 3 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 21 place count 399 transition count 1272
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 23 place count 397 transition count 1270
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 24 place count 396 transition count 1269
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 25 place count 395 transition count 1268
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 109 Pre rules applied. Total rules applied 25 place count 395 transition count 1159
Deduced a syphon composed of 109 places in 3 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 9 with 218 rules applied. Total rules applied 243 place count 286 transition count 1159
Discarding 30 places :
Symmetric choice reduction at 9 with 30 rule applications. Total rules 273 place count 256 transition count 979
Iterating global reduction 9 with 30 rules applied. Total rules applied 303 place count 256 transition count 979
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 9 with 60 rules applied. Total rules applied 363 place count 226 transition count 949
Applied a total of 363 rules in 160 ms. Remains 226 /414 variables (removed 188) and now considering 949/1293 (removed 344) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 226/414 places, 949/1293 transitions.
Normalized transition count is 359 out of 949 initially.
// Phase 1: matrix 359 rows 226 cols
[2023-04-06 23:47:58] [INFO ] Computed 19 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1467 ms. (steps per millisecond=681 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 424 ms. (steps per millisecond=2358 ) properties (out of 1) seen :0
[2023-04-06 23:48:00] [INFO ] Flow matrix only has 359 transitions (discarded 590 similar events)
// Phase 1: matrix 359 rows 226 cols
[2023-04-06 23:48:00] [INFO ] Computed 19 invariants in 6 ms
[2023-04-06 23:48:00] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 23:48:00] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 23:48:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 23:48:00] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2023-04-06 23:48:00] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 23:48:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-04-06 23:48:00] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 23:48:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 23:48:00] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2023-04-06 23:48:00] [INFO ] State equation strengthened by 158 read => feed constraints.
[2023-04-06 23:48:00] [INFO ] [Nat]Added 158 Read/Feed constraints in 14 ms returned sat
[2023-04-06 23:48:00] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-04-06 23:48:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-04-06 23:48:00] [INFO ] Computed and/alt/rep : 307/738/221 causal constraints (skipped 132 transitions) in 44 ms.
[2023-04-06 23:48:00] [INFO ] Added : 62 causal constraints over 13 iterations in 335 ms. Result :sat
Minimization took 46 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 949/949 transitions.
Applied a total of 0 rules in 23 ms. Remains 226 /226 variables (removed 0) and now considering 949/949 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 226/226 places, 949/949 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 949/949 transitions.
Applied a total of 0 rules in 31 ms. Remains 226 /226 variables (removed 0) and now considering 949/949 (removed 0) transitions.
[2023-04-06 23:48:01] [INFO ] Flow matrix only has 359 transitions (discarded 590 similar events)
[2023-04-06 23:48:01] [INFO ] Invariant cache hit.
[2023-04-06 23:48:01] [INFO ] Implicit Places using invariants in 191 ms returned []
[2023-04-06 23:48:01] [INFO ] Flow matrix only has 359 transitions (discarded 590 similar events)
[2023-04-06 23:48:01] [INFO ] Invariant cache hit.
[2023-04-06 23:48:01] [INFO ] State equation strengthened by 158 read => feed constraints.
[2023-04-06 23:48:01] [INFO ] Implicit Places using invariants and state equation in 537 ms returned []
Implicit Place search using SMT with State Equation took 737 ms to find 0 implicit places.
[2023-04-06 23:48:01] [INFO ] Redundant transitions in 55 ms returned []
[2023-04-06 23:48:01] [INFO ] Flow matrix only has 359 transitions (discarded 590 similar events)
[2023-04-06 23:48:01] [INFO ] Invariant cache hit.
[2023-04-06 23:48:02] [INFO ] Dead Transitions using invariants and state equation in 308 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1149 ms. Remains : 226/226 places, 949/949 transitions.
Starting property specific reduction for EisenbergMcGuire-PT-06-UpperBounds-07
Normalized transition count is 359 out of 949 initially.
// Phase 1: matrix 359 rows 226 cols
[2023-04-06 23:48:02] [INFO ] Computed 19 invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2023-04-06 23:48:02] [INFO ] Flow matrix only has 359 transitions (discarded 590 similar events)
// Phase 1: matrix 359 rows 226 cols
[2023-04-06 23:48:02] [INFO ] Computed 19 invariants in 2 ms
[2023-04-06 23:48:02] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 23:48:02] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 23:48:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 23:48:02] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2023-04-06 23:48:02] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 23:48:02] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 23:48:02] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 1 ms returned sat
[2023-04-06 23:48:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 23:48:02] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2023-04-06 23:48:02] [INFO ] State equation strengthened by 158 read => feed constraints.
[2023-04-06 23:48:02] [INFO ] [Nat]Added 158 Read/Feed constraints in 16 ms returned sat
[2023-04-06 23:48:02] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-04-06 23:48:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-04-06 23:48:02] [INFO ] Computed and/alt/rep : 307/738/221 causal constraints (skipped 132 transitions) in 33 ms.
[2023-04-06 23:48:02] [INFO ] Added : 62 causal constraints over 13 iterations in 304 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 949/949 transitions.
Applied a total of 0 rules in 22 ms. Remains 226 /226 variables (removed 0) and now considering 949/949 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 226/226 places, 949/949 transitions.
Normalized transition count is 359 out of 949 initially.
// Phase 1: matrix 359 rows 226 cols
[2023-04-06 23:48:03] [INFO ] Computed 19 invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1326 ms. (steps per millisecond=754 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 392 ms. (steps per millisecond=2551 ) properties (out of 1) seen :0
[2023-04-06 23:48:04] [INFO ] Flow matrix only has 359 transitions (discarded 590 similar events)
// Phase 1: matrix 359 rows 226 cols
[2023-04-06 23:48:04] [INFO ] Computed 19 invariants in 3 ms
[2023-04-06 23:48:04] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-06 23:48:04] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 23:48:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 23:48:04] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2023-04-06 23:48:04] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 23:48:04] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-06 23:48:04] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 23:48:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 23:48:04] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2023-04-06 23:48:04] [INFO ] State equation strengthened by 158 read => feed constraints.
[2023-04-06 23:48:05] [INFO ] [Nat]Added 158 Read/Feed constraints in 15 ms returned sat
[2023-04-06 23:48:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-04-06 23:48:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-04-06 23:48:05] [INFO ] Computed and/alt/rep : 307/738/221 causal constraints (skipped 132 transitions) in 29 ms.
[2023-04-06 23:48:05] [INFO ] Added : 62 causal constraints over 13 iterations in 301 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 949/949 transitions.
Applied a total of 0 rules in 44 ms. Remains 226 /226 variables (removed 0) and now considering 949/949 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 226/226 places, 949/949 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 949/949 transitions.
Applied a total of 0 rules in 21 ms. Remains 226 /226 variables (removed 0) and now considering 949/949 (removed 0) transitions.
[2023-04-06 23:48:05] [INFO ] Flow matrix only has 359 transitions (discarded 590 similar events)
[2023-04-06 23:48:05] [INFO ] Invariant cache hit.
[2023-04-06 23:48:05] [INFO ] Implicit Places using invariants in 182 ms returned []
[2023-04-06 23:48:05] [INFO ] Flow matrix only has 359 transitions (discarded 590 similar events)
[2023-04-06 23:48:05] [INFO ] Invariant cache hit.
[2023-04-06 23:48:05] [INFO ] State equation strengthened by 158 read => feed constraints.
[2023-04-06 23:48:06] [INFO ] Implicit Places using invariants and state equation in 561 ms returned []
Implicit Place search using SMT with State Equation took 746 ms to find 0 implicit places.
[2023-04-06 23:48:06] [INFO ] Redundant transitions in 15 ms returned []
[2023-04-06 23:48:06] [INFO ] Flow matrix only has 359 transitions (discarded 590 similar events)
[2023-04-06 23:48:06] [INFO ] Invariant cache hit.
[2023-04-06 23:48:06] [INFO ] Dead Transitions using invariants and state equation in 300 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1090 ms. Remains : 226/226 places, 949/949 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-06-UpperBounds-07 in 4394 ms.
[2023-04-06 23:48:06] [INFO ] Flatten gal took : 91 ms
[2023-04-06 23:48:06] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-04-06 23:48:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 226 places, 949 transitions and 4886 arcs took 6 ms.
Total runtime 27491 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: EisenbergMcGuire_PT_06
(NrP: 226 NrTr: 949 NrArc: 4886)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.023sec

net check time: 0m 0.000sec

init dd package: 0m 2.770sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9778960 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16103916 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.002sec

69599 278683 301657 304826 410437 438034 442083 512393 544506 1183734 1496632 1491255 2354282 2465289

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="EisenbergMcGuire-PT-06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is EisenbergMcGuire-PT-06, 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 r522-tall-167987247100245"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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