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.r459-smll-167912651300486.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 smartxred
Input is StigmergyCommit-PT-07b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r459-smll-167912651300486
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 7.2K Feb 26 11:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 11:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 26 11:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 26 11:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 11:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 26 11:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 11:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 26 11:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 12M Mar 5 18:23 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 StigmergyCommit-PT-07b-ReachabilityCardinality-00
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-01
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-02
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-03
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-04
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-05
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-06
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-07
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-08
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-09
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-10
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-11
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-12
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-13
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-14
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679367738442

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=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-07b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-21 03:02:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 03:02:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 03:02:22] [INFO ] Load time of PNML (sax parser for PT used): 1097 ms
[2023-03-21 03:02:22] [INFO ] Transformed 2443 places.
[2023-03-21 03:02:22] [INFO ] Transformed 15956 transitions.
[2023-03-21 03:02:22] [INFO ] Found NUPN structural information;
[2023-03-21 03:02:22] [INFO ] Parsed PT model containing 2443 places and 15956 transitions and 219500 arcs in 1346 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 68 resets, run finished after 824 ms. (steps per millisecond=12 ) properties (out of 12) seen :1
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 50729 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :{5=1}
Probabilistic random walk after 50729 steps, saw 15662 distinct states, run finished after 3003 ms. (steps per millisecond=16 ) properties seen :1
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 10 properties.
// Phase 1: matrix 15956 rows 2443 cols
[2023-03-21 03:02:28] [INFO ] Computed 9 place invariants in 493 ms
[2023-03-21 03:02:30] [INFO ] After 1776ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-21 03:02:31] [INFO ] [Nat]Absence check using 9 positive place invariants in 41 ms returned sat
[2023-03-21 03:02:50] [INFO ] After 18008ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-21 03:03:03] [INFO ] Deduced a trap composed of 396 places in 12803 ms of which 24 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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 03:03:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 03:03:03] [INFO ] After 33512ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Parikh walk visited 0 properties in 570 ms.
Support contains 63 out of 2443 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2443/2443 places, 15956/15956 transitions.
Graph (trivial) has 2305 edges and 2443 vertex of which 148 / 2443 are part of one of the 22 SCC in 23 ms
Free SCC test removed 126 places
Drop transitions removed 161 transitions
Reduce isomorphic transitions removed 161 transitions.
Graph (complete) has 3996 edges and 2317 vertex of which 2301 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.152 ms
Discarding 16 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 1709 transitions
Trivial Post-agglo rules discarded 1709 transitions
Performed 1709 trivial Post agglomeration. Transition count delta: 1709
Iterating post reduction 0 with 1717 rules applied. Total rules applied 1719 place count 2301 transition count 14070
Reduce places removed 1709 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 1757 rules applied. Total rules applied 3476 place count 592 transition count 14022
Reduce places removed 20 places and 0 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Iterating post reduction 2 with 70 rules applied. Total rules applied 3546 place count 572 transition count 13972
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 52 rules applied. Total rules applied 3598 place count 522 transition count 13970
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 91 Pre rules applied. Total rules applied 3598 place count 522 transition count 13879
Deduced a syphon composed of 91 places in 16 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 4 with 182 rules applied. Total rules applied 3780 place count 431 transition count 13879
Discarding 80 places :
Symmetric choice reduction at 4 with 80 rule applications. Total rules 3860 place count 351 transition count 13799
Iterating global reduction 4 with 80 rules applied. Total rules applied 3940 place count 351 transition count 13799
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3940 place count 351 transition count 13798
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3942 place count 350 transition count 13798
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 3977 place count 315 transition count 1408
Iterating global reduction 4 with 35 rules applied. Total rules applied 4012 place count 315 transition count 1408
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 4026 place count 315 transition count 1394
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 4032 place count 309 transition count 1388
Iterating global reduction 5 with 6 rules applied. Total rules applied 4038 place count 309 transition count 1388
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 4043 place count 304 transition count 1383
Iterating global reduction 5 with 5 rules applied. Total rules applied 4048 place count 304 transition count 1383
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 4053 place count 304 transition count 1378
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 6 with 58 rules applied. Total rules applied 4111 place count 275 transition count 1349
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4112 place count 275 transition count 1348
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 4120 place count 267 transition count 1340
Iterating global reduction 7 with 8 rules applied. Total rules applied 4128 place count 267 transition count 1340
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 4133 place count 262 transition count 1335
Iterating global reduction 7 with 5 rules applied. Total rules applied 4138 place count 262 transition count 1335
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 4141 place count 259 transition count 1332
Iterating global reduction 7 with 3 rules applied. Total rules applied 4144 place count 259 transition count 1332
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 4154 place count 254 transition count 1347
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 4156 place count 254 transition count 1345
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 4158 place count 254 transition count 1343
Free-agglomeration rule applied 67 times.
Iterating global reduction 8 with 67 rules applied. Total rules applied 4225 place count 254 transition count 1276
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 8 with 67 rules applied. Total rules applied 4292 place count 187 transition count 1276
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 4299 place count 180 transition count 1269
Iterating global reduction 9 with 7 rules applied. Total rules applied 4306 place count 180 transition count 1269
Drop transitions removed 260 transitions
Redundant transition composition rules discarded 260 transitions
Iterating global reduction 9 with 260 rules applied. Total rules applied 4566 place count 180 transition count 1009
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 4567 place count 180 transition count 1008
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 4568 place count 179 transition count 1008
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 4575 place count 179 transition count 1008
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 4581 place count 179 transition count 1002
Applied a total of 4581 rules in 4742 ms. Remains 179 /2443 variables (removed 2264) and now considering 1002/15956 (removed 14954) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4743 ms. Remains : 179/2443 places, 1002/15956 transitions.
Incomplete random walk after 10000 steps, including 275 resets, run finished after 429 ms. (steps per millisecond=23 ) properties (out of 10) seen :1
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 1002 rows 179 cols
[2023-03-21 03:03:09] [INFO ] Computed 9 place invariants in 7 ms
[2023-03-21 03:03:10] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-21 03:03:10] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2023-03-21 03:03:11] [INFO ] After 828ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-21 03:03:11] [INFO ] State equation strengthened by 835 read => feed constraints.
[2023-03-21 03:03:12] [INFO ] After 1276ms SMT Verify possible using 835 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-21 03:03:13] [INFO ] Deduced a trap composed of 37 places in 460 ms of which 1 ms to minimize.
[2023-03-21 03:03:13] [INFO ] Deduced a trap composed of 30 places in 470 ms of which 2 ms to minimize.
[2023-03-21 03:03:14] [INFO ] Deduced a trap composed of 16 places in 481 ms of which 2 ms to minimize.
[2023-03-21 03:03:14] [INFO ] Deduced a trap composed of 26 places in 451 ms of which 2 ms to minimize.
[2023-03-21 03:03:15] [INFO ] Deduced a trap composed of 32 places in 436 ms of which 0 ms to minimize.
[2023-03-21 03:03:15] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2729 ms
[2023-03-21 03:03:16] [INFO ] Deduced a trap composed of 28 places in 429 ms of which 2 ms to minimize.
[2023-03-21 03:03:16] [INFO ] Deduced a trap composed of 34 places in 352 ms of which 2 ms to minimize.
[2023-03-21 03:03:16] [INFO ] Deduced a trap composed of 35 places in 325 ms of which 0 ms to minimize.
[2023-03-21 03:03:17] [INFO ] Deduced a trap composed of 32 places in 284 ms of which 1 ms to minimize.
[2023-03-21 03:03:17] [INFO ] Deduced a trap composed of 32 places in 358 ms of which 2 ms to minimize.
[2023-03-21 03:03:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2096 ms
[2023-03-21 03:03:18] [INFO ] Deduced a trap composed of 22 places in 435 ms of which 1 ms to minimize.
[2023-03-21 03:03:18] [INFO ] Deduced a trap composed of 26 places in 435 ms of which 2 ms to minimize.
[2023-03-21 03:03:19] [INFO ] Deduced a trap composed of 16 places in 320 ms of which 0 ms to minimize.
[2023-03-21 03:03:19] [INFO ] Deduced a trap composed of 23 places in 280 ms of which 1 ms to minimize.
[2023-03-21 03:03:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 1796 ms
[2023-03-21 03:03:20] [INFO ] Deduced a trap composed of 30 places in 307 ms of which 0 ms to minimize.
[2023-03-21 03:03:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 390 ms
[2023-03-21 03:03:20] [INFO ] Deduced a trap composed of 21 places in 314 ms of which 1 ms to minimize.
[2023-03-21 03:03:21] [INFO ] Deduced a trap composed of 22 places in 276 ms of which 0 ms to minimize.
[2023-03-21 03:03:21] [INFO ] Deduced a trap composed of 31 places in 342 ms of which 0 ms to minimize.
[2023-03-21 03:03:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1142 ms
[2023-03-21 03:03:21] [INFO ] After 10290ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 565 ms.
[2023-03-21 03:03:22] [INFO ] After 12167ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :8
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 106 ms.
Support contains 41 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 1002/1002 transitions.
Graph (trivial) has 45 edges and 179 vertex of which 2 / 179 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 178 transition count 983
Reduce places removed 17 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 19 rules applied. Total rules applied 37 place count 161 transition count 981
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 39 place count 159 transition count 981
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 39 place count 159 transition count 979
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 43 place count 157 transition count 979
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 46 place count 154 transition count 976
Iterating global reduction 3 with 3 rules applied. Total rules applied 49 place count 154 transition count 976
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 51 place count 152 transition count 974
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 152 transition count 974
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 54 place count 152 transition count 973
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 68 place count 145 transition count 966
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 69 place count 145 transition count 965
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 75 place count 139 transition count 959
Iterating global reduction 5 with 6 rules applied. Total rules applied 81 place count 139 transition count 959
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 83 place count 137 transition count 957
Iterating global reduction 5 with 2 rules applied. Total rules applied 85 place count 137 transition count 957
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 87 place count 137 transition count 955
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 88 place count 137 transition count 954
Free-agglomeration rule applied 9 times.
Iterating global reduction 6 with 9 rules applied. Total rules applied 97 place count 137 transition count 945
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 107 place count 128 transition count 944
Renaming transitions due to excessive name length > 1024 char.
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 7 with 14 rules applied. Total rules applied 121 place count 128 transition count 930
Applied a total of 121 rules in 591 ms. Remains 128 /179 variables (removed 51) and now considering 930/1002 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 592 ms. Remains : 128/179 places, 930/1002 transitions.
Incomplete random walk after 10000 steps, including 319 resets, run finished after 381 ms. (steps per millisecond=26 ) properties (out of 8) seen :1
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 47 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 48 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 930 rows 128 cols
[2023-03-21 03:03:23] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-21 03:03:23] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-21 03:03:23] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-21 03:03:24] [INFO ] After 441ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-21 03:03:24] [INFO ] State equation strengthened by 813 read => feed constraints.
[2023-03-21 03:03:25] [INFO ] After 606ms SMT Verify possible using 813 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-21 03:03:25] [INFO ] Deduced a trap composed of 10 places in 405 ms of which 1 ms to minimize.
[2023-03-21 03:03:25] [INFO ] Deduced a trap composed of 19 places in 363 ms of which 1 ms to minimize.
[2023-03-21 03:03:26] [INFO ] Deduced a trap composed of 21 places in 339 ms of which 1 ms to minimize.
[2023-03-21 03:03:26] [INFO ] Deduced a trap composed of 15 places in 336 ms of which 0 ms to minimize.
[2023-03-21 03:03:26] [INFO ] Deduced a trap composed of 21 places in 237 ms of which 1 ms to minimize.
[2023-03-21 03:03:27] [INFO ] Deduced a trap composed of 15 places in 339 ms of which 1 ms to minimize.
[2023-03-21 03:03:27] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2281 ms
[2023-03-21 03:03:27] [INFO ] Deduced a trap composed of 11 places in 285 ms of which 1 ms to minimize.
[2023-03-21 03:03:28] [INFO ] Deduced a trap composed of 14 places in 303 ms of which 1 ms to minimize.
[2023-03-21 03:03:28] [INFO ] Deduced a trap composed of 11 places in 296 ms of which 2 ms to minimize.
[2023-03-21 03:03:28] [INFO ] Deduced a trap composed of 15 places in 294 ms of which 1 ms to minimize.
[2023-03-21 03:03:29] [INFO ] Deduced a trap composed of 8 places in 288 ms of which 0 ms to minimize.
[2023-03-21 03:03:29] [INFO ] Deduced a trap composed of 10 places in 284 ms of which 1 ms to minimize.
[2023-03-21 03:03:29] [INFO ] Deduced a trap composed of 8 places in 222 ms of which 1 ms to minimize.
[2023-03-21 03:03:30] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 2 ms to minimize.
[2023-03-21 03:03:30] [INFO ] Deduced a trap composed of 12 places in 189 ms of which 4 ms to minimize.
[2023-03-21 03:03:30] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2882 ms
[2023-03-21 03:03:30] [INFO ] Deduced a trap composed of 23 places in 235 ms of which 1 ms to minimize.
[2023-03-21 03:03:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 318 ms
[2023-03-21 03:03:30] [INFO ] Deduced a trap composed of 22 places in 201 ms of which 1 ms to minimize.
[2023-03-21 03:03:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 293 ms
[2023-03-21 03:03:31] [INFO ] Deduced a trap composed of 14 places in 312 ms of which 0 ms to minimize.
[2023-03-21 03:03:31] [INFO ] Deduced a trap composed of 20 places in 255 ms of which 0 ms to minimize.
[2023-03-21 03:03:32] [INFO ] Deduced a trap composed of 14 places in 350 ms of which 2 ms to minimize.
[2023-03-21 03:03:32] [INFO ] Deduced a trap composed of 23 places in 298 ms of which 0 ms to minimize.
[2023-03-21 03:03:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1487 ms
[2023-03-21 03:03:32] [INFO ] After 8355ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 552 ms.
[2023-03-21 03:03:33] [INFO ] After 9645ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 6 different solutions.
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 5 properties in 62 ms.
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 930/930 transitions.
Graph (trivial) has 83 edges and 128 vertex of which 4 / 128 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 126 transition count 894
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 94 transition count 893
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 66 place count 94 transition count 890
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 72 place count 91 transition count 890
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 80 place count 83 transition count 881
Iterating global reduction 2 with 8 rules applied. Total rules applied 88 place count 83 transition count 881
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 91 place count 80 transition count 878
Iterating global reduction 2 with 3 rules applied. Total rules applied 94 place count 80 transition count 878
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 96 place count 78 transition count 876
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 78 transition count 876
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 99 place count 78 transition count 875
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 123 place count 66 transition count 863
Drop transitions removed 1 transitions
Ensure Unique test removed 138 transitions
Reduce isomorphic transitions removed 139 transitions.
Iterating post reduction 3 with 139 rules applied. Total rules applied 262 place count 66 transition count 724
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 271 place count 57 transition count 715
Iterating global reduction 4 with 9 rules applied. Total rules applied 280 place count 57 transition count 715
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 291 place count 57 transition count 704
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 295 place count 53 transition count 700
Iterating global reduction 5 with 4 rules applied. Total rules applied 299 place count 53 transition count 700
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 300 place count 53 transition count 699
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 302 place count 51 transition count 697
Iterating global reduction 6 with 2 rules applied. Total rules applied 304 place count 51 transition count 697
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 306 place count 51 transition count 695
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 308 place count 50 transition count 696
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 310 place count 50 transition count 694
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 315 place count 50 transition count 689
Free-agglomeration rule applied 7 times.
Iterating global reduction 8 with 7 rules applied. Total rules applied 322 place count 50 transition count 682
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 233 transitions
Reduce isomorphic transitions removed 235 transitions.
Iterating post reduction 8 with 242 rules applied. Total rules applied 564 place count 43 transition count 447
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 566 place count 41 transition count 443
Iterating global reduction 9 with 2 rules applied. Total rules applied 568 place count 41 transition count 443
Applied a total of 568 rules in 456 ms. Remains 41 /128 variables (removed 87) and now considering 443/930 (removed 487) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 456 ms. Remains : 41/128 places, 443/930 transitions.
Finished random walk after 4590 steps, including 1 resets, run visited all 2 properties in 213 ms. (steps per millisecond=21 )
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 72991 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running StigmergyCommit (PT), instance 07b
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 2443 places, 15956 transitions, 219500 arcs.
Final Score: 804920.424
Took : 1732 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: StigmergyCommit-PT-07b-ReachabilityCardinality-00 (reachable &!potential( ( (tk(P1998)) <= ( 0 ) )))
PROPERTY: StigmergyCommit-PT-07b-ReachabilityCardinality-01 (reachable & potential((! ( ( (tk(P1167)) <= ( 0 ) ) & ( ( ( (tk(P1080)) <= ( 0 ) ) | ( ( ( (! ( ( 1 ) <= (tk(P1569)) )) & (! ( (tk(P1253)) <= ( 1 ) )) ) & ( (! ( ( (tk(P1206)) <= (tk(P1609)) ) & ( (tk(P380)) <= ( 0 ) ) )) | ( (tk(P926)) <= (tk(P1174)) ) ) ) | ( (tk(P1666)) <= (tk(P1807)) ) ) ) & ( ( ( ( ( (! ( (tk(P1022)) <= (tk(P1941)) )) & ( (tk(P1042)) <= ( 0 ) ) ) | ( (tk(P2404)) <= (tk(P1270)) ) ) & ( ( 1 ) <= (tk(P19)) ) ) | ( (! ( ( (tk(P1707)) <= ( 1 ) ) & (! ( (tk(P2085)) <= ( 0 ) )) )) | ( ( 1 ) <= (tk(P1239)) ) ) ) | (! ( ( ( ( ( (tk(P737)) <= (tk(P1027)) ) & ( ( 1 ) <= (tk(P145)) ) ) & ( ( (tk(P176)) <= (tk(P1300)) ) | ( ( 1 ) <= (tk(P2290)) ) ) ) | ( ( ( (tk(P42)) <= ( 0 ) ) & ( (tk(P1431)) <= ( 0 ) ) ) & ( ( ( 1 ) <= (tk(P358)) ) & ( (tk(P1241)) <= ( 0 ) ) ) ) ) | ( ( (tk(P1997)) <= (tk(P885)) ) & ( ( 1 ) <= (tk(P738)) ) ) )) ) ) ))))
PROPERTY: StigmergyCommit-PT-07b-ReachabilityCardinality-02 (reachable & potential(( ( ( (! ( ( ( 1 ) <= (tk(P389)) ) | ( (tk(P1895)) <= ( 0 ) ) )) | ( ( ( ( (tk(P134)) <= (tk(P1665)) ) & ( ( ( 1 ) <= (tk(P1935)) ) & ( ( ( ( 1 ) <= (tk(P2040)) ) | ( (tk(P1227)) <= ( 1 ) ) ) | (! ( (tk(P1263)) <= (tk(P155)) )) ) ) ) | ( ( (! ( ( 1 ) <= (tk(P479)) )) | ( ( ( ( 1 ) <= (tk(P2285)) ) & ( (tk(P1150)) <= (tk(P798)) ) ) & ( (tk(P62)) <= (tk(P1200)) ) ) ) & ( (tk(P1337)) <= (tk(P1829)) ) ) ) & ( (tk(P380)) <= ( 0 ) ) ) ) & ( ( (! ( (tk(P1530)) <= ( 1 ) )) & ( (tk(P323)) <= (tk(P2075)) ) ) & ( ( (tk(P639)) <= ( 1 ) ) | (! ( (! ( ( (tk(P19)) <= ( 0 ) ) & ( (tk(P1173)) <= ( 0 ) ) )) | ( ( 1 ) <= (tk(P1900)) ) )) ) ) ) | (! ( (tk(P1002)) <= ( 1 ) )) )))
PROPERTY: StigmergyCommit-PT-07b-ReachabilityCardinality-03 (reachable & potential(( ( ( 1 ) <= (tk(P1974)) ) & (! ( ( 1 ) <= (tk(P702)) )) )))
PROPERTY: StigmergyCommit-PT-07b-ReachabilityCardinality-04 (reachable & potential(( ( 1 ) <= (tk(P1290)) )))
PROPERTY: StigmergyCommit-PT-07b-ReachabilityCardinality-05 (reachable & potential(( (! ( (tk(P2309)) <= (tk(P769)) )) & (! ( (tk(P271)) <= (tk(P1713)) )) )))
PROPERTY: StigmergyCommit-PT-07b-ReachabilityCardinality-06 (reachable &!potential( ( (! ( ( ( ( ( (tk(P2343)) <= (tk(P782)) ) | ( ( ( ( (tk(P1475)) <= ( 1 ) ) | ( (tk(P1060)) <= (tk(P2288)) ) ) | ( ( ( 1 ) <= (tk(P1172)) ) | ( ( 1 ) <= (tk(P2119)) ) ) ) | (! ( ( 1 ) <= (tk(P1293)) )) ) ) | ( (tk(P1805)) <= (tk(P387)) ) ) & ( (! ( (! ( ( 1 ) <= (tk(P25)) )) & ( (tk(P2334)) <= (tk(P52)) ) )) | ( (! ( ( (tk(P56)) <= (tk(P233)) ) | ( ( 1 ) <= (tk(P1354)) ) )) & ( ( ( (tk(P2184)) <= (tk(P1646)) ) & (! ( (tk(P1984)) <= (tk(P748)) )) ) | ( ( ( (tk(P1232)) <= ( 1 ) ) | ( (tk(P1189)) <= (tk(P171)) ) ) | ( ( (tk(P2330)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P1701)) ) ) ) ) ) ) ) | ( ( (tk(P429)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P1414)) ) ) )) | ( ( (tk(P361)) <= ( 1 ) ) & (! ( (! ( ( ( 1 ) <= (tk(P1247)) ) & ( (tk(P1558)) <= (tk(P482)) ) )) & (! ( ( (tk(P192)) <= ( 0 ) ) & ( ( ( (tk(P1360)) <= (tk(P497)) ) & ( (tk(P2371)) <= (tk(P991)) ) ) | ( (tk(P1316)) <= (tk(P836)) ) ) )) )) ) )))
PROPERTY: StigmergyCommit-PT-07b-ReachabilityCardinality-07 (reachable & potential(( ( ( ( ( ( ( ( ( (tk(P1742)) <= ( 1 ) ) | (! ( (tk(P2295)) <= ( 1 ) )) ) & ( (tk(P1020)) <= (tk(P700)) ) ) & ( ( 1 ) <= (tk(P2153)) ) ) & ( (tk(P746)) <= ( 0 ) ) ) | ( (! ( (! ( ( 1 ) <= (tk(P912)) )) | ( ( ( 1 ) <= (tk(P540)) ) & ( (tk(P548)) <= (tk(P1643)) ) ) )) & ( (tk(P6)) <= (tk(P2005)) ) ) ) & ( ( ( ( (! ( ( (tk(P754)) <= (tk(P1466)) ) & ( ( 1 ) <= (tk(P1940)) ) )) | ( ( ( 1 ) <= (tk(P710)) ) | ( (tk(P1789)) <= ( 0 ) ) ) ) | (! ( ( ( ( 1 ) <= (tk(P2300)) ) & ( (tk(P1168)) <= (tk(P2356)) ) ) | ( ( ( 1 ) <= (tk(P2266)) ) & ( (tk(P582)) <= (tk(P985)) ) ) )) ) | ( (! ( ( ( (tk(P1566)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P1223)) ) ) | ( (tk(P1842)) <= (tk(P314)) ) )) | (! ( (tk(P1090)) <= (tk(P1208)) )) ) ) & (! ( ( (tk(P1034)) <= (tk(P765)) ) | (! ( (tk(P1210)) <= (tk(P1646)) )) )) ) ) | ( ( ( 1 ) <= (tk(P615)) ) | ( ( 1 ) <= (tk(P1994)) ) ) ) | (! ( (! ( (! ( (tk(P1137)) <= ( 1 ) )) & ( (! ( ( ( 1 ) <= (tk(P173)) ) | ( ( 1 ) <= (tk(P764)) ) )) | (! ( (! ( (tk(P1711)) <= ( 1 ) )) & ( ( (tk(P836)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1790)) ) ) )) ) )) | ( ( ( 1 ) <= (tk(P1523)) ) & (! ( ( ( ( ( (tk(P841)) <= (tk(P915)) ) | ( ( 1 ) <= (tk(P2307)) ) ) & ( ( (tk(P2327)) <= (tk(P42)) ) | ( (tk(P1740)) <= (tk(P604)) ) ) ) & ( ( ( (tk(P951)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P853)) ) ) | ( ( ( 1 ) <= (tk(P85)) ) | ( ( 1 ) <= (tk(P1269)) ) ) ) ) & (! ( (! ( (tk(P1987)) <= (tk(P1765)) )) & ( ( (tk(P608)) <= (tk(P1240)) ) & ( ( 1 ) <= (tk(P1916)) ) ) )) )) ) )) )))
PROPERTY: StigmergyCommit-PT-07b-ReachabilityCardinality-08 (reachable &!potential( (! ( ( 1 ) <= (tk(P2288)) ))))
PROPERTY: StigmergyCommit-PT-07b-ReachabilityCardinality-09 (reachable & potential(( (! ( ( ( ( ( (tk(P1292)) <= ( 1 ) ) & ( ( ( ( 1 ) <= (tk(P721)) ) & ( ( 1 ) <= (tk(P1809)) ) ) | ( (tk(P995)) <= ( 1 ) ) ) ) | ( ( ( ( (tk(P1625)) <= (tk(P1711)) ) | ( ( 1 ) <= (tk(P34)) ) ) & (! ( (tk(P1248)) <= ( 0 ) )) ) & ( ( ( (tk(P2256)) <= (tk(P1885)) ) | ( (tk(P1050)) <= ( 1 ) ) ) | (! ( ( 1 ) <= (tk(P889)) )) ) ) ) | ( ( ( ( 1 ) <= (tk(P108)) ) & ( (tk(P1576)) <= ( 0 ) ) ) & ( ( 1 ) <= (tk(P2161)) ) ) ) | ( (! ( ( (tk(P2276)) <= (tk(P2014)) ) | ( (tk(P1878)) <= (tk(P425)) ) )) & ( ( ( (! ( ( 1 ) <= (tk(P166)) )) & ( (tk(P2332)) <= (tk(P2263)) ) ) & (! ( (tk(P1572)) <= (tk(P1682)) )) ) | ( (! ( ( 1 ) <= (tk(P2412)) )) & ( ( 1 ) <= (tk(P491)) ) ) ) ) )) & (! ( ( ( ( ( ( ( (tk(P1317)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P2068)) ) ) | ( ( ( 1 ) <= (tk(P2060)) ) | ( (tk(P689)) <= ( 1 ) ) ) ) & ( (! ( ( 1 ) <= (tk(P1215)) )) | ( ( ( 1 ) <= (tk(P930)) ) | ( (tk(P1060)) <= ( 1 ) ) ) ) ) | (! ( ( ( (tk(P1913)) <= ( 1 ) ) & ( (tk(P661)) <= (tk(P224)) ) ) & ( ( (tk(P856)) <= (tk(P1224)) ) & ( (tk(P2076)) <= (tk(P2274)) ) ) )) ) | (! ( (tk(P231)) <= ( 1 ) )) ) | ( ( 1 ) <= (tk(P209)) ) )) )))
PROPERTY: StigmergyCommit-PT-07b-ReachabilityCardinality-10 (reachable &!potential( ( ( (tk(P557)) <= ( 0 ) ) & ( ( (tk(P2256)) <= ( 0 ) ) | ( ( (! ( (tk(P1759)) <= (tk(P1889)) )) & ( ( ( ( ( ( (tk(P962)) <= (tk(P1402)) ) & ( (tk(P2028)) <= ( 0 ) ) ) & ( ( (tk(P712)) <= ( 1 ) ) & ( (tk(P1323)) <= (tk(P458)) ) ) ) & ( ( 1 ) <= (tk(P491)) ) ) & ( ( (tk(P2327)) <= (tk(P1324)) ) | ( ( (tk(P1302)) <= (tk(P1185)) ) & ( (tk(P1212)) <= ( 0 ) ) ) ) ) & ( ( (tk(P580)) <= ( 1 ) ) & ( ( ( ( 1 ) <= (tk(P1753)) ) | ( ( ( 1 ) <= (tk(P1435)) ) | ( (tk(P350)) <= ( 0 ) ) ) ) & ( ( ( (tk(P1733)) <= ( 0 ) ) | ( (tk(P1799)) <= (tk(P300)) ) ) | ( ( (tk(P1075)) <= ( 0 ) ) | ( (tk(P2017)) <= (tk(P502)) ) ) ) ) ) ) ) | (! ( ( 1 ) <= (tk(P1177)) )) ) ) )))
PROPERTY: StigmergyCommit-PT-07b-ReachabilityCardinality-11 (reachable & potential((! ( (tk(P500)) <= ( 0 ) ))))
PROPERTY: StigmergyCommit-PT-07b-ReachabilityCardinality-12 (reachable &!potential( ( ( ( (tk(P1473)) <= ( 1 ) ) & (! ( (! ( (tk(P2267)) <= ( 1 ) )) & ( ( ( ( ( ( 1 ) <= (tk(P967)) ) & ( ( 1 ) <= (tk(P2428)) ) ) & (! ( ( 1 ) <= (tk(P2430)) )) ) | ( (tk(P2211)) <= (tk(P1319)) ) ) | ( ( 1 ) <= (tk(P485)) ) ) )) ) | (! ( (! ( (! ( ( 1 ) <= (tk(P711)) )) & ( ( 1 ) <= (tk(P1418)) ) )) & (! ( ( (! ( (tk(P494)) <= (tk(P564)) )) & ( ( 1 ) <= (tk(P2057)) ) ) | ( ( ( (tk(P2358)) <= (tk(P449)) ) | ( ( (tk(P2407)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P2365)) ) ) ) & ( (! ( (tk(P413)) <= (tk(P680)) )) & (! ( (tk(P4)) <= ( 1 ) )) ) ) )) )) )))
PROPERTY: StigmergyCommit-PT-07b-ReachabilityCardinality-13 (reachable & potential((! ( (tk(P2260)) <= ( 1 ) ))))
PROPERTY: StigmergyCommit-PT-07b-ReachabilityCardinality-14 (reachable & potential(( ( 1 ) <= (tk(P156)) )))
PROPERTY: StigmergyCommit-PT-07b-ReachabilityCardinality-15 (reachable &!potential( ( ( ( (tk(P1100)) <= ( 0 ) ) | ( ( ( (tk(P1101)) <= (tk(P2045)) ) & (! ( ( ( ( ( (tk(P701)) <= ( 0 ) ) & ( (tk(P1860)) <= (tk(P165)) ) ) | (! ( (tk(P828)) <= ( 1 ) )) ) & ( (! ( ( 1 ) <= (tk(P1088)) )) & ( ( (tk(P72)) <= ( 1 ) ) | ( (tk(P951)) <= (tk(P695)) ) ) ) ) & ( (tk(P746)) <= ( 1 ) ) )) ) | ( (tk(P395)) <= ( 0 ) ) ) ) & (! ( ( 1 ) <= (tk(P923)) )) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 13954168 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16074616 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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
Caught signal 15, terminating.

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="StigmergyCommit-PT-07b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is StigmergyCommit-PT-07b, 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 r459-smll-167912651300486"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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