Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r373-tall-171683789200419.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ShieldPPPt-PT-040B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683789200419
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Apr 11 14:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 11 14:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 762K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716988346438

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=gold2023
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-040B
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-29 13:12:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 13:12:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 13:12:28] [INFO ] Load time of PNML (sax parser for PT used): 171 ms
[2024-05-29 13:12:28] [INFO ] Transformed 3123 places.
[2024-05-29 13:12:28] [INFO ] Transformed 2843 transitions.
[2024-05-29 13:12:28] [INFO ] Found NUPN structural information;
[2024-05-29 13:12:28] [INFO ] Parsed PT model containing 3123 places and 2843 transitions and 7126 arcs in 364 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 513 ms. (steps per millisecond=19 ) properties (out of 13) seen :6
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2843 rows 3123 cols
[2024-05-29 13:12:29] [INFO ] Computed 441 invariants in 47 ms
[2024-05-29 13:12:31] [INFO ] [Real]Absence check using 441 positive place invariants in 180 ms returned sat
[2024-05-29 13:12:31] [INFO ] After 1354ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-29 13:12:32] [INFO ] [Nat]Absence check using 441 positive place invariants in 171 ms returned sat
[2024-05-29 13:12:34] [INFO ] After 2180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-29 13:12:35] [INFO ] Deduced a trap composed of 14 places in 971 ms of which 13 ms to minimize.
[2024-05-29 13:12:36] [INFO ] Deduced a trap composed of 22 places in 970 ms of which 2 ms to minimize.
[2024-05-29 13:12:37] [INFO ] Deduced a trap composed of 15 places in 948 ms of which 3 ms to minimize.
[2024-05-29 13:12:38] [INFO ] Deduced a trap composed of 36 places in 943 ms of which 3 ms to minimize.
[2024-05-29 13:12:39] [INFO ] Deduced a trap composed of 28 places in 897 ms of which 2 ms to minimize.
[2024-05-29 13:12:40] [INFO ] Deduced a trap composed of 12 places in 879 ms of which 1 ms to minimize.
[2024-05-29 13:12:41] [INFO ] Deduced a trap composed of 31 places in 869 ms of which 2 ms to minimize.
[2024-05-29 13:12:42] [INFO ] Deduced a trap composed of 40 places in 836 ms of which 2 ms to minimize.
[2024-05-29 13:12:43] [INFO ] Deduced a trap composed of 23 places in 820 ms of which 1 ms to minimize.
[2024-05-29 13:12:44] [INFO ] Deduced a trap composed of 23 places in 821 ms of which 2 ms to minimize.
[2024-05-29 13:12:45] [INFO ] Deduced a trap composed of 30 places in 847 ms of which 2 ms to minimize.
[2024-05-29 13:12:46] [INFO ] Deduced a trap composed of 29 places in 828 ms of which 2 ms to minimize.
[2024-05-29 13:12:47] [INFO ] Deduced a trap composed of 38 places in 838 ms of which 1 ms to minimize.
[2024-05-29 13:12:48] [INFO ] Deduced a trap composed of 24 places in 770 ms of which 4 ms to minimize.
[2024-05-29 13:12:49] [INFO ] Deduced a trap composed of 24 places in 780 ms of which 1 ms to minimize.
[2024-05-29 13:12:50] [INFO ] Deduced a trap composed of 24 places in 842 ms of which 2 ms to minimize.
[2024-05-29 13:12:51] [INFO ] Deduced a trap composed of 30 places in 824 ms of which 1 ms to minimize.
[2024-05-29 13:12:51] [INFO ] Deduced a trap composed of 26 places in 794 ms of which 1 ms to minimize.
[2024-05-29 13:12:52] [INFO ] Deduced a trap composed of 21 places in 789 ms of which 2 ms to minimize.
[2024-05-29 13:12:53] [INFO ] Deduced a trap composed of 33 places in 741 ms of which 2 ms to minimize.
[2024-05-29 13:12:54] [INFO ] Deduced a trap composed of 42 places in 807 ms of which 2 ms to minimize.
[2024-05-29 13:12:55] [INFO ] Deduced a trap composed of 25 places in 744 ms of which 2 ms to minimize.
[2024-05-29 13:12:56] [INFO ] Deduced a trap composed of 35 places in 718 ms of which 2 ms to minimize.
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.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:944)
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)
[2024-05-29 13:12:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 13:12:56] [INFO ] After 25123ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 546 ms.
Support contains 49 out of 3123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3123/3123 places, 2843/2843 transitions.
Drop transitions removed 728 transitions
Trivial Post-agglo rules discarded 728 transitions
Performed 728 trivial Post agglomeration. Transition count delta: 728
Iterating post reduction 0 with 728 rules applied. Total rules applied 728 place count 3123 transition count 2115
Reduce places removed 728 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 730 rules applied. Total rules applied 1458 place count 2395 transition count 2113
Reduce places removed 1 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 2 with 10 rules applied. Total rules applied 1468 place count 2394 transition count 2104
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1477 place count 2385 transition count 2104
Performed 168 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 168 Pre rules applied. Total rules applied 1477 place count 2385 transition count 1936
Deduced a syphon composed of 168 places in 4 ms
Reduce places removed 168 places and 0 transitions.
Iterating global reduction 4 with 336 rules applied. Total rules applied 1813 place count 2217 transition count 1936
Discarding 267 places :
Symmetric choice reduction at 4 with 267 rule applications. Total rules 2080 place count 1950 transition count 1669
Iterating global reduction 4 with 267 rules applied. Total rules applied 2347 place count 1950 transition count 1669
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 113 Pre rules applied. Total rules applied 2347 place count 1950 transition count 1556
Deduced a syphon composed of 113 places in 10 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 4 with 226 rules applied. Total rules applied 2573 place count 1837 transition count 1556
Performed 654 Post agglomeration using F-continuation condition.Transition count delta: 654
Deduced a syphon composed of 654 places in 4 ms
Reduce places removed 654 places and 0 transitions.
Iterating global reduction 4 with 1308 rules applied. Total rules applied 3881 place count 1183 transition count 902
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4083 place count 1082 transition count 902
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 4111 place count 1068 transition count 902
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4112 place count 1068 transition count 901
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4113 place count 1067 transition count 901
Partial Free-agglomeration rule applied 117 times.
Drop transitions removed 117 transitions
Iterating global reduction 5 with 117 rules applied. Total rules applied 4230 place count 1067 transition count 901
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4231 place count 1066 transition count 900
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4232 place count 1065 transition count 900
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 4232 place count 1065 transition count 898
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 4236 place count 1063 transition count 898
Applied a total of 4236 rules in 905 ms. Remains 1063 /3123 variables (removed 2060) and now considering 898/2843 (removed 1945) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 906 ms. Remains : 1063/3123 places, 898/2843 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) seen :1
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 898 rows 1063 cols
[2024-05-29 13:12:58] [INFO ] Computed 440 invariants in 6 ms
[2024-05-29 13:12:58] [INFO ] [Real]Absence check using 440 positive place invariants in 86 ms returned sat
[2024-05-29 13:12:58] [INFO ] After 330ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 13:12:59] [INFO ] [Nat]Absence check using 440 positive place invariants in 74 ms returned sat
[2024-05-29 13:12:59] [INFO ] After 642ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-29 13:12:59] [INFO ] State equation strengthened by 171 read => feed constraints.
[2024-05-29 13:13:00] [INFO ] After 636ms SMT Verify possible using 171 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-29 13:13:00] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 0 ms to minimize.
[2024-05-29 13:13:00] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
[2024-05-29 13:13:00] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 0 ms to minimize.
[2024-05-29 13:13:00] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 0 ms to minimize.
[2024-05-29 13:13:01] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 1 ms to minimize.
[2024-05-29 13:13:01] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 0 ms to minimize.
[2024-05-29 13:13:01] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 0 ms to minimize.
[2024-05-29 13:13:01] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2024-05-29 13:13:01] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1101 ms
[2024-05-29 13:13:01] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 1 ms to minimize.
[2024-05-29 13:13:02] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 0 ms to minimize.
[2024-05-29 13:13:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 334 ms
[2024-05-29 13:13:02] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 0 ms to minimize.
[2024-05-29 13:13:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2024-05-29 13:13:02] [INFO ] After 2850ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 466 ms.
[2024-05-29 13:13:03] [INFO ] After 4359ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 218 ms.
Support contains 28 out of 1063 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1063/1063 places, 898/898 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1063 transition count 893
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 1058 transition count 892
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 1057 transition count 892
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 12 place count 1057 transition count 889
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 18 place count 1054 transition count 889
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 3 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 44 place count 1041 transition count 876
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 46 place count 1040 transition count 876
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 48 place count 1040 transition count 874
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 50 place count 1038 transition count 874
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 55 place count 1038 transition count 874
Applied a total of 55 rules in 249 ms. Remains 1038 /1063 variables (removed 25) and now considering 874/898 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 250 ms. Remains : 1038/1063 places, 874/898 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 115364 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 115364 steps, saw 96943 distinct states, run finished after 3002 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 874 rows 1038 cols
[2024-05-29 13:13:07] [INFO ] Computed 440 invariants in 4 ms
[2024-05-29 13:13:07] [INFO ] [Real]Absence check using 440 positive place invariants in 78 ms returned sat
[2024-05-29 13:13:07] [INFO ] After 329ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 13:13:07] [INFO ] [Nat]Absence check using 440 positive place invariants in 78 ms returned sat
[2024-05-29 13:13:08] [INFO ] After 722ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-29 13:13:08] [INFO ] State equation strengthened by 178 read => feed constraints.
[2024-05-29 13:13:09] [INFO ] After 761ms SMT Verify possible using 178 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-29 13:13:09] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 0 ms to minimize.
[2024-05-29 13:13:09] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-05-29 13:13:09] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 0 ms to minimize.
[2024-05-29 13:13:09] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
[2024-05-29 13:13:09] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2024-05-29 13:13:10] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-05-29 13:13:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 732 ms
[2024-05-29 13:13:10] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 0 ms to minimize.
[2024-05-29 13:13:10] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
[2024-05-29 13:13:11] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 0 ms to minimize.
[2024-05-29 13:13:11] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-29 13:13:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 627 ms
[2024-05-29 13:13:11] [INFO ] After 2703ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 568 ms.
[2024-05-29 13:13:11] [INFO ] After 4363ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 299 ms.
Support contains 28 out of 1038 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1038/1038 places, 874/874 transitions.
Applied a total of 0 rules in 31 ms. Remains 1038 /1038 variables (removed 0) and now considering 874/874 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 1038/1038 places, 874/874 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1038/1038 places, 874/874 transitions.
Applied a total of 0 rules in 25 ms. Remains 1038 /1038 variables (removed 0) and now considering 874/874 (removed 0) transitions.
[2024-05-29 13:13:12] [INFO ] Invariant cache hit.
[2024-05-29 13:13:12] [INFO ] Implicit Places using invariants in 596 ms returned [1021, 1025]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 598 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1036/1038 places, 874/874 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1034 transition count 872
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1034 transition count 872
Applied a total of 4 rules in 44 ms. Remains 1034 /1036 variables (removed 2) and now considering 872/874 (removed 2) transitions.
// Phase 1: matrix 872 rows 1034 cols
[2024-05-29 13:13:12] [INFO ] Computed 438 invariants in 9 ms
[2024-05-29 13:13:13] [INFO ] Implicit Places using invariants in 629 ms returned []
[2024-05-29 13:13:13] [INFO ] Invariant cache hit.
[2024-05-29 13:13:14] [INFO ] State equation strengthened by 177 read => feed constraints.
[2024-05-29 13:13:16] [INFO ] Implicit Places using invariants and state equation in 2701 ms returned []
Implicit Place search using SMT with State Equation took 3332 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1034/1038 places, 872/874 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4000 ms. Remains : 1034/1038 places, 872/874 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 128618 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 128618 steps, saw 108102 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-29 13:13:19] [INFO ] Invariant cache hit.
[2024-05-29 13:13:20] [INFO ] [Real]Absence check using 438 positive place invariants in 73 ms returned sat
[2024-05-29 13:13:20] [INFO ] After 290ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 13:13:20] [INFO ] [Nat]Absence check using 438 positive place invariants in 76 ms returned sat
[2024-05-29 13:13:21] [INFO ] After 653ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-29 13:13:21] [INFO ] State equation strengthened by 177 read => feed constraints.
[2024-05-29 13:13:21] [INFO ] After 865ms SMT Verify possible using 177 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-29 13:13:22] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 0 ms to minimize.
[2024-05-29 13:13:22] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 1 ms to minimize.
[2024-05-29 13:13:22] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 1 ms to minimize.
[2024-05-29 13:13:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 441 ms
[2024-05-29 13:13:22] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 0 ms to minimize.
[2024-05-29 13:13:22] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 1 ms to minimize.
[2024-05-29 13:13:23] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 0 ms to minimize.
[2024-05-29 13:13:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 410 ms
[2024-05-29 13:13:23] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 0 ms to minimize.
[2024-05-29 13:13:23] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2024-05-29 13:13:23] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2024-05-29 13:13:23] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 2 ms to minimize.
[2024-05-29 13:13:23] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 0 ms to minimize.
[2024-05-29 13:13:24] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 0 ms to minimize.
[2024-05-29 13:13:24] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 0 ms to minimize.
[2024-05-29 13:13:24] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
[2024-05-29 13:13:24] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1099 ms
[2024-05-29 13:13:24] [INFO ] After 3292ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 543 ms.
[2024-05-29 13:13:24] [INFO ] After 4887ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 149 ms.
Support contains 28 out of 1034 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1034/1034 places, 872/872 transitions.
Applied a total of 0 rules in 25 ms. Remains 1034 /1034 variables (removed 0) and now considering 872/872 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 1034/1034 places, 872/872 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1034/1034 places, 872/872 transitions.
Applied a total of 0 rules in 22 ms. Remains 1034 /1034 variables (removed 0) and now considering 872/872 (removed 0) transitions.
[2024-05-29 13:13:25] [INFO ] Invariant cache hit.
[2024-05-29 13:13:25] [INFO ] Implicit Places using invariants in 560 ms returned []
[2024-05-29 13:13:25] [INFO ] Invariant cache hit.
[2024-05-29 13:13:26] [INFO ] State equation strengthened by 177 read => feed constraints.
[2024-05-29 13:13:28] [INFO ] Implicit Places using invariants and state equation in 2637 ms returned []
Implicit Place search using SMT with State Equation took 3200 ms to find 0 implicit places.
[2024-05-29 13:13:28] [INFO ] Redundant transitions in 52 ms returned []
[2024-05-29 13:13:28] [INFO ] Invariant cache hit.
[2024-05-29 13:13:28] [INFO ] Dead Transitions using invariants and state equation in 531 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3817 ms. Remains : 1034/1034 places, 872/872 transitions.
Partial Free-agglomeration rule applied 249 times.
Drop transitions removed 249 transitions
Iterating global reduction 0 with 249 rules applied. Total rules applied 249 place count 1034 transition count 872
Applied a total of 249 rules in 55 ms. Remains 1034 /1034 variables (removed 0) and now considering 872/872 (removed 0) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 872 rows 1034 cols
[2024-05-29 13:13:29] [INFO ] Computed 438 invariants in 6 ms
[2024-05-29 13:13:29] [INFO ] [Real]Absence check using 438 positive place invariants in 83 ms returned sat
[2024-05-29 13:13:29] [INFO ] After 317ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 13:13:29] [INFO ] [Nat]Absence check using 438 positive place invariants in 73 ms returned sat
[2024-05-29 13:13:30] [INFO ] After 755ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-29 13:13:30] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-29 13:13:32] [INFO ] After 2098ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-29 13:13:32] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 0 ms to minimize.
[2024-05-29 13:13:33] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 1 ms to minimize.
[2024-05-29 13:13:33] [INFO ] Deduced a trap composed of 3 places in 160 ms of which 0 ms to minimize.
[2024-05-29 13:13:33] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 0 ms to minimize.
[2024-05-29 13:13:33] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 2 ms to minimize.
[2024-05-29 13:13:33] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 0 ms to minimize.
[2024-05-29 13:13:33] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 2 ms to minimize.
[2024-05-29 13:13:34] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 0 ms to minimize.
[2024-05-29 13:13:34] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 1 ms to minimize.
[2024-05-29 13:13:34] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 0 ms to minimize.
[2024-05-29 13:13:34] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 1 ms to minimize.
[2024-05-29 13:13:34] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 1 ms to minimize.
[2024-05-29 13:13:35] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 1 ms to minimize.
[2024-05-29 13:13:35] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 0 ms to minimize.
[2024-05-29 13:13:35] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 0 ms to minimize.
[2024-05-29 13:13:35] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 1 ms to minimize.
[2024-05-29 13:13:35] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 1 ms to minimize.
[2024-05-29 13:13:36] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 1 ms to minimize.
[2024-05-29 13:13:36] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3442 ms
[2024-05-29 13:13:36] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 1 ms to minimize.
[2024-05-29 13:13:36] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 1 ms to minimize.
[2024-05-29 13:13:36] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 0 ms to minimize.
[2024-05-29 13:13:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 564 ms
[2024-05-29 13:13:37] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 0 ms to minimize.
[2024-05-29 13:13:37] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 1 ms to minimize.
[2024-05-29 13:13:37] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 1 ms to minimize.
[2024-05-29 13:13:37] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 1 ms to minimize.
[2024-05-29 13:13:37] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 0 ms to minimize.
[2024-05-29 13:13:37] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 1 ms to minimize.
[2024-05-29 13:13:38] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1159 ms
[2024-05-29 13:13:38] [INFO ] Deduced a trap composed of 3 places in 133 ms of which 1 ms to minimize.
[2024-05-29 13:13:38] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 0 ms to minimize.
[2024-05-29 13:13:39] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 0 ms to minimize.
[2024-05-29 13:13:39] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 1 ms to minimize.
[2024-05-29 13:13:39] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 1 ms to minimize.
[2024-05-29 13:13:39] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 1 ms to minimize.
[2024-05-29 13:13:39] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 0 ms to minimize.
[2024-05-29 13:13:40] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 0 ms to minimize.
[2024-05-29 13:13:40] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 1 ms to minimize.
[2024-05-29 13:13:40] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 0 ms to minimize.
[2024-05-29 13:13:40] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 1 ms to minimize.
[2024-05-29 13:13:40] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 1 ms to minimize.
[2024-05-29 13:13:40] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 0 ms to minimize.
[2024-05-29 13:13:41] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 1 ms to minimize.
[2024-05-29 13:13:41] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 0 ms to minimize.
[2024-05-29 13:13:41] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 0 ms to minimize.
[2024-05-29 13:13:41] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 0 ms to minimize.
[2024-05-29 13:13:41] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3220 ms
[2024-05-29 13:13:41] [INFO ] After 11252ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2392 ms.
[2024-05-29 13:13:44] [INFO ] After 14789ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2024-05-29 13:13:44] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-29 13:13:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1034 places, 872 transitions and 3944 arcs took 5 ms.
[2024-05-29 13:13:44] [INFO ] Flatten gal took : 142 ms
Total runtime 76128 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldPPPt-PT-040B
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/371
ReachabilityCardinality

FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2024-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2024-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2024-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2024-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2024-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2024-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1716988426486
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15924996 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15925200 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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/371/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/371/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/371/ReachabilityCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 25 (type EXCL) for 12 ShieldPPPt-PT-040B-ReachabilityCardinality-2024-08
lola: time limit : 599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 21 (type FNDP) for 12 ShieldPPPt-PT-040B-ReachabilityCardinality-2024-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 22 (type EQUN) for 12 ShieldPPPt-PT-040B-ReachabilityCardinality-2024-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 24 (type SRCH) for 12 ShieldPPPt-PT-040B-ReachabilityCardinality-2024-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 24 (type SRCH) for ShieldPPPt-PT-040B-ReachabilityCardinality-2024-08
lola: result : true
lola: markings : 64
lola: fired transitions : 63
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 21 (type FNDP) for ShieldPPPt-PT-040B-ReachabilityCardinality-2024-08 (obsolete)
lola: CANCELED task # 22 (type EQUN) for ShieldPPPt-PT-040B-ReachabilityCardinality-2024-08 (obsolete)
lola: CANCELED task # 25 (type EXCL) for ShieldPPPt-PT-040B-ReachabilityCardinality-2024-08 (obsolete)
lola: LAUNCH task # 29 (type EXCL) for 6 ShieldPPPt-PT-040B-ReachabilityCardinality-2024-03
lola: time limit : 719 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 19 (type FNDP) for 6 ShieldPPPt-PT-040B-ReachabilityCardinality-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 20 (type EQUN) for 6 ShieldPPPt-PT-040B-ReachabilityCardinality-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 28 (type SRCH) for 6 ShieldPPPt-PT-040B-ReachabilityCardinality-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 21 (type FNDP) for ShieldPPPt-PT-040B-ReachabilityCardinality-2024-08
lola: result : true
lola: fired transitions : 62
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
sara: try reading problem file /home/mcc/execution/371/ReachabilityCardinality-22.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 28 (type SRCH) for ShieldPPPt-PT-040B-ReachabilityCardinality-2024-03
lola: result : true
lola: markings : 83
lola: fired transitions : 82
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 19 (type FNDP) for ShieldPPPt-PT-040B-ReachabilityCardinality-2024-03 (obsolete)
lola: CANCELED task # 20 (type EQUN) for ShieldPPPt-PT-040B-ReachabilityCardinality-2024-03 (obsolete)
lola: CANCELED task # 29 (type EXCL) for ShieldPPPt-PT-040B-ReachabilityCardinality-2024-03 (obsolete)
lola: LAUNCH task # 41 (type EXCL) for 3 ShieldPPPt-PT-040B-ReachabilityCardinality-2024-01
lola: time limit : 899 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 45 (type FNDP) for 15 ShieldPPPt-PT-040B-ReachabilityCardinality-2024-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 46 (type EQUN) for 15 ShieldPPPt-PT-040B-ReachabilityCardinality-2024-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 48 (type SRCH) for 15 ShieldPPPt-PT-040B-ReachabilityCardinality-2024-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 19 (type FNDP) for ShieldPPPt-PT-040B-ReachabilityCardinality-2024-03
lola: result : true
lola: fired transitions : 81
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
sara: try reading problem file /home/mcc/execution/371/ReachabilityCardinality-20.sara.
lola: FINISHED task # 48 (type SRCH) for ShieldPPPt-PT-040B-ReachabilityCardinality-2024-13
lola: result : true
lola: markings : 138
lola: fired transitions : 137
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 45 (type FNDP) for ShieldPPPt-PT-040B-ReachabilityCardinality-2024-13 (obsolete)
lola: CANCELED task # 46 (type EQUN) for ShieldPPPt-PT-040B-ReachabilityCardinality-2024-13 (obsolete)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 35 (type FNDP) for 9 ShieldPPPt-PT-040B-ReachabilityCardinality-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 36 (type EQUN) for 9 ShieldPPPt-PT-040B-ReachabilityCardinality-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 38 (type SRCH) for 9 ShieldPPPt-PT-040B-ReachabilityCardinality-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 35 (type FNDP) for ShieldPPPt-PT-040B-ReachabilityCardinality-2024-04
lola: result : true
lola: fired transitions : 58
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 36 (type EQUN) for ShieldPPPt-PT-040B-ReachabilityCardinality-2024-04 (obsolete)
lola: CANCELED task # 38 (type SRCH) for ShieldPPPt-PT-040B-ReachabilityCardinality-2024-04 (obsolete)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 51 (type FNDP) for 0 ShieldPPPt-PT-040B-ReachabilityCardinality-2024-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 52 (type EQUN) for 0 ShieldPPPt-PT-040B-ReachabilityCardinality-2024-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 54 (type SRCH) for 0 ShieldPPPt-PT-040B-ReachabilityCardinality-2024-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 51 (type FNDP) for ShieldPPPt-PT-040B-ReachabilityCardinality-2024-00
lola: result : true
lola: fired transitions : 57
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 52 (type EQUN) for ShieldPPPt-PT-040B-ReachabilityCardinality-2024-00 (obsolete)
lola: CANCELED task # 54 (type SRCH) for ShieldPPPt-PT-040B-ReachabilityCardinality-2024-00 (obsolete)
lola: LAUNCH task # 32 (type FNDP) for 3 ShieldPPPt-PT-040B-ReachabilityCardinality-2024-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 33 (type EQUN) for 3 ShieldPPPt-PT-040B-ReachabilityCardinality-2024-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 40 (type SRCH) for 3 ShieldPPPt-PT-040B-ReachabilityCardinality-2024-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
sara: try reading problem file /home/mcc/execution/371/ReachabilityCardinality-36.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
sara: try reading problem file /home/mcc/execution/371/ReachabilityCardinality-46.sara.
lola: FINISHED task # 32 (type FNDP) for ShieldPPPt-PT-040B-ReachabilityCardinality-2024-01
lola: result : true
lola: fired transitions : 55
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 33 (type EQUN) for ShieldPPPt-PT-040B-ReachabilityCardinality-2024-01 (obsolete)
lola: CANCELED task # 40 (type SRCH) for ShieldPPPt-PT-040B-ReachabilityCardinality-2024-01 (obsolete)
lola: CANCELED task # 41 (type EXCL) for ShieldPPPt-PT-040B-ReachabilityCardinality-2024-01 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-040B-ReachabilityCardinality-2024-00: EF true findpath
ShieldPPPt-PT-040B-ReachabilityCardinality-2024-01: AG false findpath
ShieldPPPt-PT-040B-ReachabilityCardinality-2024-03: AG false tandem / insertion
ShieldPPPt-PT-040B-ReachabilityCardinality-2024-04: EF true findpath
ShieldPPPt-PT-040B-ReachabilityCardinality-2024-08: EF true tandem / insertion
ShieldPPPt-PT-040B-ReachabilityCardinality-2024-13: AG false tandem / insertion


Time elapsed: 1 secs. Pages in use: 2
sara: place or transition ordering is non-deterministic

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="ShieldPPPt-PT-040B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is ShieldPPPt-PT-040B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r373-tall-171683789200419"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-040B.tgz
mv ShieldPPPt-PT-040B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;