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.r171-tall-167838858800598.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 FlexibleBarrier-PT-22b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r171-tall-167838858800598
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 8.0K Feb 25 12:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 25 12:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 12:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 12:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 12:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Feb 25 12:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 12:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 12:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.8M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679485939091

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=FlexibleBarrier-PT-22b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-22 11:52:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 11:52:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 11:52:21] [INFO ] Load time of PNML (sax parser for PT used): 242 ms
[2023-03-22 11:52:21] [INFO ] Transformed 6478 places.
[2023-03-22 11:52:21] [INFO ] Transformed 7469 transitions.
[2023-03-22 11:52:21] [INFO ] Found NUPN structural information;
[2023-03-22 11:52:21] [INFO ] Parsed PT model containing 6478 places and 7469 transitions and 18797 arcs in 357 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 68 resets, run finished after 546 ms. (steps per millisecond=18 ) properties (out of 12) seen :1
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :1
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 7469 rows 6478 cols
[2023-03-22 11:52:22] [INFO ] Computed 24 place invariants in 254 ms
[2023-03-22 11:52:24] [INFO ] After 2103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-22 11:52:26] [INFO ] [Nat]Absence check using 24 positive place invariants in 70 ms returned sat
[2023-03-22 11:52:35] [INFO ] After 7877ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :9
[2023-03-22 11:52:41] [INFO ] Deduced a trap composed of 211 places in 5828 ms of which 13 ms to minimize.
[2023-03-22 11:52:47] [INFO ] Deduced a trap composed of 2363 places in 5423 ms of which 5 ms to minimize.
[2023-03-22 11:52:52] [INFO ] Deduced a trap composed of 2395 places in 5268 ms of which 5 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-22 11:52:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 11:52:52] [INFO ] After 27745ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 9 different solutions.
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 346 ms.
Support contains 120 out of 6478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6478/6478 places, 7469/7469 transitions.
Graph (trivial) has 6157 edges and 6478 vertex of which 122 / 6478 are part of one of the 20 SCC in 19 ms
Free SCC test removed 102 places
Drop transitions removed 123 transitions
Reduce isomorphic transitions removed 123 transitions.
Drop transitions removed 1474 transitions
Trivial Post-agglo rules discarded 1474 transitions
Performed 1474 trivial Post agglomeration. Transition count delta: 1474
Iterating post reduction 0 with 1474 rules applied. Total rules applied 1475 place count 6376 transition count 5872
Reduce places removed 1474 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 1 with 1493 rules applied. Total rules applied 2968 place count 4902 transition count 5853
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 2987 place count 4883 transition count 5853
Performed 466 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 466 Pre rules applied. Total rules applied 2987 place count 4883 transition count 5387
Deduced a syphon composed of 466 places in 5 ms
Reduce places removed 466 places and 0 transitions.
Iterating global reduction 3 with 932 rules applied. Total rules applied 3919 place count 4417 transition count 5387
Discarding 2616 places :
Symmetric choice reduction at 3 with 2616 rule applications. Total rules 6535 place count 1801 transition count 2771
Iterating global reduction 3 with 2616 rules applied. Total rules applied 9151 place count 1801 transition count 2771
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 9151 place count 1801 transition count 2762
Deduced a syphon composed of 9 places in 6 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 9169 place count 1792 transition count 2762
Discarding 398 places :
Symmetric choice reduction at 3 with 398 rule applications. Total rules 9567 place count 1394 transition count 2364
Iterating global reduction 3 with 398 rules applied. Total rules applied 9965 place count 1394 transition count 2364
Ensure Unique test removed 373 transitions
Reduce isomorphic transitions removed 373 transitions.
Iterating post reduction 3 with 373 rules applied. Total rules applied 10338 place count 1394 transition count 1991
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 1 ms
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 4 with 252 rules applied. Total rules applied 10590 place count 1268 transition count 1865
Drop transitions removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 4 with 39 rules applied. Total rules applied 10629 place count 1268 transition count 1826
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 10649 place count 1248 transition count 1806
Iterating global reduction 5 with 20 rules applied. Total rules applied 10669 place count 1248 transition count 1806
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 10673 place count 1246 transition count 1806
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 10677 place count 1246 transition count 1802
Free-agglomeration rule applied 942 times.
Iterating global reduction 5 with 942 rules applied. Total rules applied 11619 place count 1246 transition count 860
Reduce places removed 942 places and 0 transitions.
Drop transitions removed 300 transitions
Reduce isomorphic transitions removed 300 transitions.
Iterating post reduction 5 with 1242 rules applied. Total rules applied 12861 place count 304 transition count 560
Drop transitions removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 6 with 46 rules applied. Total rules applied 12907 place count 304 transition count 514
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 12911 place count 304 transition count 514
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 12913 place count 304 transition count 512
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 12914 place count 303 transition count 511
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 109 edges and 302 vertex of which 28 / 302 are part of one of the 14 SCC in 0 ms
Free SCC test removed 14 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 7 with 6 rules applied. Total rules applied 12920 place count 288 transition count 507
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 8 with 32 rules applied. Total rules applied 12952 place count 284 transition count 479
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 23 Pre rules applied. Total rules applied 12952 place count 284 transition count 456
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 9 with 46 rules applied. Total rules applied 12998 place count 261 transition count 456
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 9 with 21 rules applied. Total rules applied 13019 place count 261 transition count 435
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 10 with 58 rules applied. Total rules applied 13077 place count 232 transition count 406
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 13078 place count 232 transition count 405
Free-agglomeration rule applied 20 times.
Iterating global reduction 11 with 20 rules applied. Total rules applied 13098 place count 232 transition count 385
Reduce places removed 21 places and 0 transitions.
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 11 with 36 rules applied. Total rules applied 13134 place count 211 transition count 370
Drop transitions removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 12 with 45 rules applied. Total rules applied 13179 place count 211 transition count 325
Free-agglomeration rule applied 2 times.
Iterating global reduction 12 with 2 rules applied. Total rules applied 13181 place count 211 transition count 323
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 13183 place count 209 transition count 323
Applied a total of 13183 rules in 1886 ms. Remains 209 /6478 variables (removed 6269) and now considering 323/7469 (removed 7146) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1887 ms. Remains : 209/6478 places, 323/7469 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 8) 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 8) seen :1
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :1
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 323 rows 209 cols
[2023-03-22 11:52:55] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-22 11:52:55] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 11:52:55] [INFO ] [Nat]Absence check using 22 positive place invariants in 4 ms returned sat
[2023-03-22 11:52:55] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 11:52:55] [INFO ] State equation strengthened by 107 read => feed constraints.
[2023-03-22 11:52:55] [INFO ] After 125ms SMT Verify possible using 107 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-22 11:52:56] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2023-03-22 11:52:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-03-22 11:52:56] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 1 ms to minimize.
[2023-03-22 11:52:56] [INFO ] Deduced a trap composed of 58 places in 54 ms of which 2 ms to minimize.
[2023-03-22 11:52:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 149 ms
[2023-03-22 11:52:56] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 0 ms to minimize.
[2023-03-22 11:52:56] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 1 ms to minimize.
[2023-03-22 11:52:56] [INFO ] Deduced a trap composed of 58 places in 55 ms of which 1 ms to minimize.
[2023-03-22 11:52:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 216 ms
[2023-03-22 11:52:56] [INFO ] After 723ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 112 ms.
[2023-03-22 11:52:56] [INFO ] After 1074ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 11 ms.
Support contains 75 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 323/323 transitions.
Graph (trivial) has 85 edges and 209 vertex of which 4 / 209 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 207 transition count 304
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 192 transition count 304
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 31 place count 192 transition count 303
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 33 place count 191 transition count 303
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 55 place count 169 transition count 281
Iterating global reduction 2 with 22 rules applied. Total rules applied 77 place count 169 transition count 281
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 80 place count 169 transition count 278
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 110 place count 154 transition count 263
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 127 place count 154 transition count 246
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 128 place count 153 transition count 245
Iterating global reduction 4 with 1 rules applied. Total rules applied 129 place count 153 transition count 245
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 130 place count 153 transition count 244
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 139 place count 153 transition count 235
Free-agglomeration rule applied 28 times.
Iterating global reduction 5 with 28 rules applied. Total rules applied 167 place count 153 transition count 207
Reduce places removed 28 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 5 with 52 rules applied. Total rules applied 219 place count 125 transition count 183
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 223 place count 125 transition count 179
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 224 place count 124 transition count 178
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 228 place count 120 transition count 178
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 229 place count 120 transition count 177
Applied a total of 229 rules in 36 ms. Remains 120 /209 variables (removed 89) and now considering 177/323 (removed 146) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 120/209 places, 177/323 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :1
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 177 rows 120 cols
[2023-03-22 11:52:56] [INFO ] Computed 18 place invariants in 0 ms
[2023-03-22 11:52:56] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 11:52:56] [INFO ] [Nat]Absence check using 18 positive place invariants in 3 ms returned sat
[2023-03-22 11:52:56] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 11:52:56] [INFO ] After 98ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-22 11:52:56] [INFO ] After 165ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 2 ms.
Support contains 29 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 177/177 transitions.
Graph (trivial) has 69 edges and 120 vertex of which 11 / 120 are part of one of the 5 SCC in 1 ms
Free SCC test removed 6 places
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 114 transition count 150
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 98 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 97 transition count 149
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 53 place count 79 transition count 131
Iterating global reduction 3 with 18 rules applied. Total rules applied 71 place count 79 transition count 131
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 72 place count 79 transition count 130
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 100 place count 64 transition count 117
Drop transitions removed 26 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 4 with 27 rules applied. Total rules applied 127 place count 64 transition count 90
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 131 place count 64 transition count 86
Free-agglomeration rule applied 10 times.
Iterating global reduction 5 with 10 rules applied. Total rules applied 141 place count 64 transition count 76
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 160 place count 53 transition count 68
Applied a total of 160 rules in 15 ms. Remains 53 /120 variables (removed 67) and now considering 68/177 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 53/120 places, 68/177 transitions.
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 36172 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running FlexibleBarrier (PT), instance 22b
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: 6478 places, 7469 transitions, 18797 arcs.
Final Score: 9692373.814
Took : 53 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: FlexibleBarrier-PT-22b-ReachabilityCardinality-00 (reachable &!potential( ( (tk(P1851)) <= ( 0 ) )))
PROPERTY: FlexibleBarrier-PT-22b-ReachabilityCardinality-01 (reachable &!potential( (! ( (! ( ( ( ( 1 ) <= (tk(P4475)) ) & (! ( (! ( ( 1 ) <= (tk(P539)) )) & ( ( ( (tk(P5242)) <= (tk(P1075)) ) | ( (tk(P1475)) <= ( 0 ) ) ) & ( (tk(P978)) <= ( 0 ) ) ) )) ) | ( (tk(P5560)) <= (tk(P3275)) ) )) & ( ( (! ( (tk(P1175)) <= (tk(P4419)) )) & ( ( ( 1 ) <= (tk(P869)) ) | (! ( (tk(P2108)) <= ( 1 ) )) ) ) & ( ( ( ( (! ( ( (tk(P3067)) <= (tk(P4530)) ) | ( ( 1 ) <= (tk(P1259)) ) )) & (! ( (tk(P1833)) <= (tk(P4329)) )) ) | ( (tk(P2097)) <= (tk(P724)) ) ) & ( ( 1 ) <= (tk(P4552)) ) ) | ( ( (tk(P2763)) <= (tk(P4572)) ) & ( ( ( (! ( (tk(P5201)) <= ( 0 ) )) & ( ( ( 1 ) <= (tk(P2500)) ) & ( (tk(P5306)) <= (tk(P5593)) ) ) ) | ( ( (tk(P5466)) <= (tk(P1475)) ) & ( ( ( 1 ) <= (tk(P2708)) ) & ( (tk(P3132)) <= (tk(P2687)) ) ) ) ) & ( ( (tk(P2320)) <= ( 1 ) ) | (! ( (tk(P1605)) <= (tk(P4814)) )) ) ) ) ) ) ))))
PROPERTY: FlexibleBarrier-PT-22b-ReachabilityCardinality-02 (reachable & potential((! ( ( (tk(P593)) <= ( 1 ) ) & ( (tk(P780)) <= ( 1 ) ) ))))
PROPERTY: FlexibleBarrier-PT-22b-ReachabilityCardinality-03 (reachable &!potential( ( ( ( ( 1 ) <= (tk(P5896)) ) | ( ( 1 ) <= (tk(P2422)) ) ) | (! ( ( ( (! ( ( ( ( 1 ) <= (tk(P2266)) ) | ( (tk(P3328)) <= (tk(P2744)) ) ) & ( (tk(P4759)) <= ( 1 ) ) )) & ( ( (! ( ( (tk(P6429)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P2846)) ) )) & ( (tk(P5415)) <= (tk(P5941)) ) ) & ( ( 1 ) <= (tk(P286)) ) ) ) & ( (tk(P3724)) <= (tk(P5841)) ) ) & ( ( ( (tk(P4137)) <= ( 0 ) ) & ( ( ( ( ( (tk(P3295)) <= (tk(P239)) ) & ( ( 1 ) <= (tk(P1010)) ) ) | ( ( ( 1 ) <= (tk(P5286)) ) | ( (tk(P1885)) <= (tk(P5632)) ) ) ) & ( ( 1 ) <= (tk(P3314)) ) ) & (! ( ( (tk(P4426)) <= (tk(P2292)) ) | ( ( (tk(P988)) <= ( 0 ) ) & ( (tk(P5129)) <= (tk(P4178)) ) ) )) ) ) & ( (tk(P942)) <= ( 0 ) ) ) )) )))
PROPERTY: FlexibleBarrier-PT-22b-ReachabilityCardinality-04 (reachable &!potential( (! ( ( ( (! ( (tk(P3300)) <= ( 0 ) )) | ( (tk(P3908)) <= (tk(P1055)) ) ) & (! ( ( ( 1 ) <= (tk(P1561)) ) | ( ( (tk(P1261)) <= (tk(P2527)) ) & (! ( ( ( ( 1 ) <= (tk(P859)) ) | ( (tk(P1863)) <= (tk(P2837)) ) ) & ( (tk(P1937)) <= (tk(P955)) ) )) ) )) ) & ( ( (! ( (tk(P4318)) <= (tk(P5701)) )) & ( ( ( 1 ) <= (tk(P2038)) ) & ( (tk(P2558)) <= (tk(P5572)) ) ) ) | (! ( (tk(P6332)) <= ( 0 ) )) ) ))))
PROPERTY: FlexibleBarrier-PT-22b-ReachabilityCardinality-05 (reachable & potential(( ( 1 ) <= (tk(P646)) )))
PROPERTY: FlexibleBarrier-PT-22b-ReachabilityCardinality-06 (reachable & potential(( (! ( (tk(P4646)) <= ( 1 ) )) & ( ( ( (tk(P2167)) <= ( 1 ) ) | ( ( ( ( 1 ) <= (tk(P5055)) ) & (! ( ( ( (tk(P5399)) <= ( 1 ) ) | ( ( ( 1 ) <= (tk(P1763)) ) | ( (tk(P992)) <= (tk(P3433)) ) ) ) & ( (! ( (tk(P2072)) <= ( 1 ) )) | (! ( ( 1 ) <= (tk(P4426)) )) ) )) ) | ( (! ( ( ( ( ( 1 ) <= (tk(P5522)) ) | ( (tk(P3669)) <= (tk(P743)) ) ) | ( ( (tk(P2995)) <= (tk(P5118)) ) | ( ( 1 ) <= (tk(P1488)) ) ) ) & ( ( ( (tk(P5451)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P3590)) ) ) | ( ( (tk(P6269)) <= (tk(P4861)) ) | ( ( 1 ) <= (tk(P4583)) ) ) ) )) | (! ( ( (tk(P1739)) <= ( 1 ) ) | (! ( ( (tk(P4488)) <= ( 1 ) ) | ( (tk(P3440)) <= ( 1 ) ) )) )) ) ) ) & ( (tk(P5627)) <= (tk(P1190)) ) ) )))
PROPERTY: FlexibleBarrier-PT-22b-ReachabilityCardinality-07 (reachable & potential(( ( (tk(P279)) <= ( 0 ) ) & ( (! ( ( (tk(P4926)) <= (tk(P16)) ) & ( (! ( ( (! ( (tk(P1998)) <= ( 0 ) )) | ( (tk(P2033)) <= ( 1 ) ) ) | ( (! ( (tk(P4636)) <= ( 1 ) )) | (! ( (tk(P5076)) <= ( 1 ) )) ) )) | ( (tk(P724)) <= (tk(P723)) ) ) )) & ( (! ( (! ( (tk(P5861)) <= (tk(P1053)) )) | ( ( ( ( ( ( 1 ) <= (tk(P321)) ) | ( (tk(P1534)) <= (tk(P5526)) ) ) | ( ( (tk(P4925)) <= ( 0 ) ) | ( (tk(P5052)) <= (tk(P2964)) ) ) ) | ( (tk(P1142)) <= ( 0 ) ) ) | (! ( ( (tk(P3829)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P2659)) ) )) ) )) | ( ( 1 ) <= (tk(P4908)) ) ) ) )))
PROPERTY: FlexibleBarrier-PT-22b-ReachabilityCardinality-08 (reachable &!potential( ( (tk(P95)) <= (tk(P385)) )))
PROPERTY: FlexibleBarrier-PT-22b-ReachabilityCardinality-09 (reachable &!potential( (! ( ( ( ( ( (! ( (tk(P5617)) <= ( 1 ) )) & ( ( (tk(P3431)) <= ( 0 ) ) & ( ( ( ( 1 ) <= (tk(P296)) ) & ( (tk(P2513)) <= ( 1 ) ) ) | ( ( (tk(P2248)) <= ( 0 ) ) | ( (tk(P4014)) <= ( 1 ) ) ) ) ) ) & ( ( (tk(P3869)) <= (tk(P2978)) ) | ( ( ( (tk(P4748)) <= (tk(P4250)) ) & ( (tk(P53)) <= ( 0 ) ) ) & ( (tk(P3014)) <= (tk(P3625)) ) ) ) ) | ( ( (tk(P1516)) <= (tk(P3799)) ) & ( ( (tk(P1582)) <= ( 0 ) ) | ( ( ( 1 ) <= (tk(P5243)) ) | ( ( ( (tk(P5399)) <= (tk(P5404)) ) & ( (tk(P2732)) <= ( 1 ) ) ) | (! ( (tk(P57)) <= ( 1 ) )) ) ) ) ) ) | (! ( ( ( ( ( ( (tk(P1401)) <= (tk(P3204)) ) & ( (tk(P3933)) <= (tk(P1175)) ) ) | ( ( 1 ) <= (tk(P2594)) ) ) | ( (tk(P6207)) <= (tk(P4745)) ) ) | (! ( (! ( (tk(P5258)) <= (tk(P4994)) )) & ( ( (tk(P5199)) <= ( 0 ) ) | ( (tk(P1256)) <= ( 1 ) ) ) )) ) | ( (tk(P4726)) <= (tk(P1544)) ) )) ) & ( (! ( ( (tk(P5508)) <= (tk(P2505)) ) | ( (! ( (tk(P5836)) <= ( 0 ) )) & ( ( (! ( (tk(P6325)) <= ( 0 ) )) & (! ( ( 1 ) <= (tk(P2072)) )) ) & ( ( ( (tk(P3351)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P3943)) ) ) & (! ( (tk(P4968)) <= ( 0 ) )) ) ) ) )) | ( ( 1 ) <= (tk(P4762)) ) ) ))))
PROPERTY: FlexibleBarrier-PT-22b-ReachabilityCardinality-10 (reachable & potential(( ( (! ( (! ( ( ( 1 ) <= (tk(P5890)) ) & (! ( (tk(P3486)) <= (tk(P3358)) )) )) & ( ( (tk(P4536)) <= ( 1 ) ) & ( ( (tk(P3023)) <= (tk(P2694)) ) | (! ( (tk(P1423)) <= (tk(P6155)) )) ) ) )) & ( ( ( ( ( ( ( (tk(P5398)) <= ( 1 ) ) & ( (tk(P5816)) <= ( 1 ) ) ) | ( ( 1 ) <= (tk(P2258)) ) ) & ( (! ( ( (tk(P5332)) <= (tk(P493)) ) | ( (tk(P2382)) <= (tk(P5986)) ) )) & ( ( ( (tk(P2252)) <= (tk(P1560)) ) & ( (tk(P4223)) <= ( 1 ) ) ) | ( (tk(P98)) <= (tk(P1413)) ) ) ) ) & ( ( ( ( (tk(P1090)) <= (tk(P5648)) ) | ( ( (tk(P4665)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P1255)) ) ) ) & ( (tk(P3000)) <= ( 0 ) ) ) | ( ( ( ( (tk(P1358)) <= ( 0 ) ) | ( (tk(P2483)) <= (tk(P1209)) ) ) & ( ( (tk(P5320)) <= (tk(P4904)) ) | ( (tk(P4492)) <= (tk(P1072)) ) ) ) & ( (! ( ( 1 ) <= (tk(P3552)) )) & ( ( ( 1 ) <= (tk(P5517)) ) | ( (tk(P2318)) <= ( 1 ) ) ) ) ) ) ) & ( ( ( ( ( ( ( 1 ) <= (tk(P4210)) ) & ( (tk(P1629)) <= ( 1 ) ) ) & ( ( (tk(P572)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P4519)) ) ) ) | ( (tk(P167)) <= ( 1 ) ) ) & ( (! ( (tk(P1987)) <= ( 1 ) )) & (! ( ( (tk(P3453)) <= (tk(P4970)) ) | ( ( 1 ) <= (tk(P1453)) ) )) ) ) & ( (! ( (tk(P5590)) <= (tk(P2559)) )) | ( (tk(P3929)) <= ( 0 ) ) ) ) ) & ( (! ( ( (tk(P4064)) <= (tk(P5232)) ) & ( (tk(P967)) <= (tk(P6026)) ) )) | ( ( ( ( ( 1 ) <= (tk(P815)) ) | (! ( (tk(P5270)) <= ( 1 ) )) ) & ( (! ( ( (tk(P5671)) <= (tk(P3487)) ) | ( ( 1 ) <= (tk(P3344)) ) )) | ( ( (tk(P4512)) <= (tk(P922)) ) & ( (tk(P342)) <= (tk(P3261)) ) ) ) ) & ( ( ( (tk(P180)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P4748)) ) ) | ( ( ( (tk(P2202)) <= (tk(P101)) ) & ( (tk(P4559)) <= (tk(P65)) ) ) & ( (! ( (tk(P3063)) <= ( 1 ) )) & ( ( ( 1 ) <= (tk(P6200)) ) & ( (tk(P4827)) <= ( 1 ) ) ) ) ) ) ) ) ) ) & (! ( ( (tk(P3596)) <= ( 1 ) ) | ( ( ( (tk(P6219)) <= (tk(P878)) ) & ( ( 1 ) <= (tk(P1765)) ) ) | ( ( ( ( ( ( (tk(P438)) <= ( 0 ) ) | ( (tk(P1050)) <= ( 1 ) ) ) | (! ( (tk(P5390)) <= (tk(P5185)) )) ) & ( ( (tk(P5327)) <= (tk(P1093)) ) & ( ( (tk(P520)) <= (tk(P6331)) ) & ( (tk(P3798)) <= ( 0 ) ) ) ) ) | ( ( ( ( (tk(P2039)) <= (tk(P255)) ) & ( ( 1 ) <= (tk(P2790)) ) ) | ( ( (tk(P3439)) <= (tk(P760)) ) | ( (tk(P6477)) <= ( 0 ) ) ) ) & ( (tk(P4417)) <= (tk(P5668)) ) ) ) | ( (! ( ( ( (tk(P6131)) <= ( 1 ) ) & ( (tk(P2527)) <= ( 0 ) ) ) | (! ( ( 1 ) <= (tk(P2588)) )) )) | ( ( 1 ) <= (tk(P582)) ) ) ) ) )) )))
PROPERTY: FlexibleBarrier-PT-22b-ReachabilityCardinality-11 (reachable &!potential( ( (tk(P2858)) <= (tk(P1314)) )))
PROPERTY: FlexibleBarrier-PT-22b-ReachabilityCardinality-12 (reachable &!potential( ( ( (! ( ( ( (tk(P1861)) <= ( 0 ) ) | ( ( (! ( (tk(P1906)) <= ( 0 ) )) & ( ( ( (tk(P5603)) <= (tk(P3044)) ) | ( (tk(P934)) <= ( 0 ) ) ) | (! ( (tk(P4847)) <= ( 1 ) )) ) ) | ( (tk(P5641)) <= ( 0 ) ) ) ) | ( ( ( ( (tk(P5386)) <= ( 1 ) ) & ( ( ( ( 1 ) <= (tk(P5160)) ) & ( (tk(P284)) <= ( 1 ) ) ) & (! ( (tk(P4169)) <= (tk(P5791)) )) ) ) | ( ( ( ( (tk(P6216)) <= ( 0 ) ) & ( (tk(P2258)) <= ( 0 ) ) ) | (! ( (tk(P1044)) <= (tk(P2992)) )) ) | (! ( ( ( 1 ) <= (tk(P1619)) ) | ( ( 1 ) <= (tk(P1561)) ) )) ) ) & ( ( 1 ) <= (tk(P6266)) ) ) )) | ( ( ( ( (! ( ( ( (tk(P3072)) <= ( 0 ) ) | ( (tk(P3100)) <= (tk(P3032)) ) ) & (! ( (tk(P995)) <= ( 0 ) )) )) | (! ( ( (tk(P5578)) <= (tk(P5668)) ) & ( (tk(P79)) <= (tk(P2203)) ) )) ) | ( (tk(P5428)) <= (tk(P5666)) ) ) & ( ( (! ( (! ( (tk(P4003)) <= (tk(P298)) )) | (! ( (tk(P151)) <= (tk(P2680)) )) )) | ( ( ( 1 ) <= (tk(P4835)) ) | ( (tk(P4774)) <= (tk(P5505)) ) ) ) & ( ( (tk(P3878)) <= ( 0 ) ) | ( (! ( ( (tk(P3408)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P1166)) ) )) & ( ( ( (tk(P6395)) <= ( 1 ) ) | ( (tk(P2635)) <= ( 0 ) ) ) | ( (tk(P4533)) <= (tk(P120)) ) ) ) ) ) ) & ( ( ( 1 ) <= (tk(P3115)) ) | (! ( ( (tk(P5474)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P5586)) ) )) ) ) ) | ( (tk(P2824)) <= ( 1 ) ) )))
PROPERTY: FlexibleBarrier-PT-22b-ReachabilityCardinality-13 (reachable &!potential( ( (tk(P4898)) <= (tk(P2640)) )))
PROPERTY: FlexibleBarrier-PT-22b-ReachabilityCardinality-14 (reachable &!potential( ( (! ( (! ( ( ( ( (tk(P4452)) <= (tk(P3763)) ) | ( (! ( (tk(P283)) <= ( 0 ) )) | ( (tk(P2612)) <= ( 0 ) ) ) ) | ( ( ( ( 1 ) <= (tk(P3464)) ) & ( ( (tk(P5581)) <= (tk(P4406)) ) & ( (tk(P5856)) <= ( 1 ) ) ) ) & (! ( (tk(P1717)) <= ( 0 ) )) ) ) & ( ( ( (! ( (tk(P5842)) <= ( 1 ) )) | (! ( (tk(P6407)) <= (tk(P2948)) )) ) & (! ( ( ( 1 ) <= (tk(P6315)) ) & ( (tk(P4685)) <= (tk(P3206)) ) )) ) & ( (tk(P1076)) <= (tk(P2468)) ) ) )) | ( ( ( ( ( 1 ) <= (tk(P6085)) ) & (! ( (! ( (tk(P2922)) <= ( 0 ) )) | ( ( (tk(P2908)) <= (tk(P2122)) ) | ( (tk(P6063)) <= (tk(P1380)) ) ) )) ) & ( (tk(P5425)) <= ( 1 ) ) ) & ( (tk(P2035)) <= ( 1 ) ) ) )) | (! ( ( ( (tk(P2361)) <= ( 1 ) ) & ( ( ( (tk(P3318)) <= (tk(P5360)) ) | ( ( ( 1 ) <= (tk(P1342)) ) & ( (tk(P1962)) <= ( 1 ) ) ) ) & ( (! ( ( ( ( 1 ) <= (tk(P2099)) ) & ( ( 1 ) <= (tk(P555)) ) ) | ( (tk(P855)) <= ( 0 ) ) )) & ( ( ( 1 ) <= (tk(P3152)) ) & ( (tk(P5639)) <= ( 0 ) ) ) ) ) ) & ( ( (tk(P429)) <= ( 1 ) ) | (! ( ( ( (! ( ( 1 ) <= (tk(P3323)) )) | ( (tk(P6278)) <= (tk(P3108)) ) ) & ( (! ( (tk(P2641)) <= ( 0 ) )) & (! ( (tk(P1627)) <= ( 0 ) )) ) ) | (! ( (! ( ( 1 ) <= (tk(P828)) )) | (! ( ( 1 ) <= (tk(P1699)) )) )) )) ) )) )))
PROPERTY: FlexibleBarrier-PT-22b-ReachabilityCardinality-15 (reachable &!potential( ( ( ( ( (tk(P1966)) <= ( 0 ) ) | ( ( ( 1 ) <= (tk(P2549)) ) & ( ( ( (tk(P2474)) <= (tk(P4346)) ) | ( (! ( ( ( 1 ) <= (tk(P2419)) ) | ( (tk(P1877)) <= (tk(P1007)) ) )) | (! ( ( ( 1 ) <= (tk(P3298)) ) | ( (tk(P3465)) <= (tk(P424)) ) )) ) ) & ( (tk(P214)) <= (tk(P5494)) ) ) ) ) | (! ( (! ( ( (! ( ( 1 ) <= (tk(P5564)) )) | (! ( (tk(P2363)) <= (tk(P4471)) )) ) | (! ( ( (tk(P2406)) <= ( 0 ) ) | ( (tk(P3811)) <= ( 1 ) ) )) )) | ( (tk(P3246)) <= (tk(P2179)) ) )) ) & ( ( (! ( ( ( (! ( (tk(P1334)) <= (tk(P2051)) )) | (! ( (tk(P6303)) <= ( 1 ) )) ) & (! ( (tk(P2302)) <= ( 1 ) )) ) | ( ( (! ( (tk(P6207)) <= ( 0 ) )) & ( ( (tk(P2978)) <= (tk(P661)) ) & ( ( 1 ) <= (tk(P5635)) ) ) ) | (! ( ( (tk(P1838)) <= ( 1 ) ) | ( (tk(P917)) <= ( 1 ) ) )) ) )) | ( (! ( ( 1 ) <= (tk(P4902)) )) | (! ( ( ( 1 ) <= (tk(P5203)) ) & ( (! ( ( 1 ) <= (tk(P3997)) )) & ( (tk(P6284)) <= (tk(P5999)) ) ) )) ) ) | ( (tk(P6381)) <= ( 0 ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 15079596 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16102756 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="FlexibleBarrier-PT-22b"
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 FlexibleBarrier-PT-22b, 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 r171-tall-167838858800598"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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