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.r170-tall-167838857400582.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is FlexibleBarrier-PT-20b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857400582
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.1K Feb 25 12:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 12:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 12:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 12:31 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.7K Feb 25 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 12:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Feb 25 12:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 12:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 12:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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.5M 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-20b-ReachabilityCardinality-00
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-01
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-02
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-03
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-04
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-05
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-06
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-07
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-08
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-09
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-10
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-11
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-12
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-13
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-14
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678580063117

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-20b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 00:14:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 00:14:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 00:14:24] [INFO ] Load time of PNML (sax parser for PT used): 194 ms
[2023-03-12 00:14:24] [INFO ] Transformed 5372 places.
[2023-03-12 00:14:25] [INFO ] Transformed 6193 transitions.
[2023-03-12 00:14:25] [INFO ] Found NUPN structural information;
[2023-03-12 00:14:25] [INFO ] Parsed PT model containing 5372 places and 6193 transitions and 15575 arcs in 471 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 74 resets, run finished after 436 ms. (steps per millisecond=22 ) properties (out of 16) seen :2
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :1
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 13 properties.
// Phase 1: matrix 6193 rows 5372 cols
[2023-03-12 00:14:26] [INFO ] Computed 22 place invariants in 181 ms
[2023-03-12 00:14:28] [INFO ] After 1941ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-12 00:14:30] [INFO ] [Nat]Absence check using 22 positive place invariants in 50 ms returned sat
[2023-03-12 00:14:37] [INFO ] After 6593ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-12 00:14:42] [INFO ] Deduced a trap composed of 2080 places in 4454 ms of which 10 ms to minimize.
[2023-03-12 00:14:46] [INFO ] Deduced a trap composed of 2059 places in 3865 ms of which 7 ms to minimize.
[2023-03-12 00:14:50] [INFO ] Deduced a trap composed of 2043 places in 3836 ms of which 4 ms to minimize.
[2023-03-12 00:14:54] [INFO ] Deduced a trap composed of 1949 places in 3856 ms of which 6 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-12 00:14:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 00:14:54] [INFO ] After 26411ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 267 ms.
Support contains 222 out of 5372 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5372/5372 places, 6193/6193 transitions.
Graph (trivial) has 4892 edges and 5372 vertex of which 66 / 5372 are part of one of the 11 SCC in 16 ms
Free SCC test removed 55 places
Drop transitions removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Drop transitions removed 1199 transitions
Trivial Post-agglo rules discarded 1199 transitions
Performed 1199 trivial Post agglomeration. Transition count delta: 1199
Iterating post reduction 0 with 1199 rules applied. Total rules applied 1200 place count 5317 transition count 4928
Reduce places removed 1199 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Iterating post reduction 1 with 1256 rules applied. Total rules applied 2456 place count 4118 transition count 4871
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 2 with 56 rules applied. Total rules applied 2512 place count 4062 transition count 4871
Performed 334 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 334 Pre rules applied. Total rules applied 2512 place count 4062 transition count 4537
Deduced a syphon composed of 334 places in 5 ms
Reduce places removed 334 places and 0 transitions.
Iterating global reduction 3 with 668 rules applied. Total rules applied 3180 place count 3728 transition count 4537
Discarding 2048 places :
Symmetric choice reduction at 3 with 2048 rule applications. Total rules 5228 place count 1680 transition count 2489
Iterating global reduction 3 with 2048 rules applied. Total rules applied 7276 place count 1680 transition count 2489
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 7276 place count 1680 transition count 2486
Deduced a syphon composed of 3 places in 6 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 7282 place count 1677 transition count 2486
Discarding 259 places :
Symmetric choice reduction at 3 with 259 rule applications. Total rules 7541 place count 1418 transition count 2227
Iterating global reduction 3 with 259 rules applied. Total rules applied 7800 place count 1418 transition count 2227
Ensure Unique test removed 234 transitions
Reduce isomorphic transitions removed 234 transitions.
Iterating post reduction 3 with 234 rules applied. Total rules applied 8034 place count 1418 transition count 1993
Performed 145 Post agglomeration using F-continuation condition.Transition count delta: 145
Deduced a syphon composed of 145 places in 1 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 4 with 290 rules applied. Total rules applied 8324 place count 1273 transition count 1848
Drop transitions removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 4 with 29 rules applied. Total rules applied 8353 place count 1273 transition count 1819
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 8370 place count 1256 transition count 1802
Iterating global reduction 5 with 17 rules applied. Total rules applied 8387 place count 1256 transition count 1802
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 8399 place count 1250 transition count 1802
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 8413 place count 1250 transition count 1788
Free-agglomeration rule applied 780 times.
Iterating global reduction 5 with 780 rules applied. Total rules applied 9193 place count 1250 transition count 1008
Reduce places removed 780 places and 0 transitions.
Drop transitions removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 5 with 877 rules applied. Total rules applied 10070 place count 470 transition count 911
Drop transitions removed 120 transitions
Redundant transition composition rules discarded 120 transitions
Iterating global reduction 6 with 120 rules applied. Total rules applied 10190 place count 470 transition count 791
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 10196 place count 470 transition count 791
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 6 with 16 rules applied. Total rules applied 10212 place count 470 transition count 775
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 10213 place count 469 transition count 774
Applied a total of 10213 rules in 1773 ms. Remains 469 /5372 variables (removed 4903) and now considering 774/6193 (removed 5419) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1774 ms. Remains : 469/5372 places, 774/6193 transitions.
Incomplete random walk after 10000 steps, including 125 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 12) seen :2
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 8 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 9 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :1
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-12 00:14:57] [INFO ] Flow matrix only has 762 transitions (discarded 12 similar events)
// Phase 1: matrix 762 rows 469 cols
[2023-03-12 00:14:57] [INFO ] Computed 22 place invariants in 3 ms
[2023-03-12 00:14:57] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-12 00:14:57] [INFO ] [Nat]Absence check using 22 positive place invariants in 8 ms returned sat
[2023-03-12 00:14:57] [INFO ] After 413ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-12 00:14:57] [INFO ] State equation strengthened by 369 read => feed constraints.
[2023-03-12 00:14:58] [INFO ] After 315ms SMT Verify possible using 369 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-12 00:14:58] [INFO ] Deduced a trap composed of 125 places in 123 ms of which 1 ms to minimize.
[2023-03-12 00:14:58] [INFO ] Deduced a trap composed of 102 places in 111 ms of which 1 ms to minimize.
[2023-03-12 00:14:58] [INFO ] Deduced a trap composed of 125 places in 105 ms of which 0 ms to minimize.
[2023-03-12 00:14:58] [INFO ] Deduced a trap composed of 127 places in 101 ms of which 0 ms to minimize.
[2023-03-12 00:14:58] [INFO ] Deduced a trap composed of 102 places in 96 ms of which 1 ms to minimize.
[2023-03-12 00:14:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 692 ms
[2023-03-12 00:14:59] [INFO ] Deduced a trap composed of 98 places in 119 ms of which 1 ms to minimize.
[2023-03-12 00:14:59] [INFO ] Deduced a trap composed of 102 places in 112 ms of which 0 ms to minimize.
[2023-03-12 00:14:59] [INFO ] Deduced a trap composed of 58 places in 48 ms of which 0 ms to minimize.
[2023-03-12 00:14:59] [INFO ] Deduced a trap composed of 78 places in 39 ms of which 0 ms to minimize.
[2023-03-12 00:14:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 433 ms
[2023-03-12 00:14:59] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 1 ms to minimize.
[2023-03-12 00:14:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2023-03-12 00:14:59] [INFO ] Deduced a trap composed of 53 places in 37 ms of which 1 ms to minimize.
[2023-03-12 00:14:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-12 00:15:00] [INFO ] Deduced a trap composed of 59 places in 84 ms of which 0 ms to minimize.
[2023-03-12 00:15:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2023-03-12 00:15:00] [INFO ] Deduced a trap composed of 99 places in 118 ms of which 0 ms to minimize.
[2023-03-12 00:15:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2023-03-12 00:15:00] [INFO ] After 2315ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 307 ms.
[2023-03-12 00:15:00] [INFO ] After 3234ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 50 ms.
Support contains 189 out of 469 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 774/774 transitions.
Graph (trivial) has 72 edges and 469 vertex of which 2 / 469 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 468 transition count 761
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 457 transition count 761
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 32 place count 448 transition count 752
Iterating global reduction 2 with 9 rules applied. Total rules applied 41 place count 448 transition count 752
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 448 transition count 751
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 70 place count 434 transition count 737
Drop transitions removed 5 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 77 place count 434 transition count 730
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 84 place count 434 transition count 723
Free-agglomeration rule applied 31 times.
Iterating global reduction 4 with 31 rules applied. Total rules applied 115 place count 434 transition count 692
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 157 place count 403 transition count 681
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 164 place count 403 transition count 674
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 165 place count 402 transition count 673
Applied a total of 165 rules in 114 ms. Remains 402 /469 variables (removed 67) and now considering 673/774 (removed 101) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 402/469 places, 673/774 transitions.
Incomplete random walk after 10000 steps, including 117 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 9) seen :1
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :1
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :1
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-12 00:15:01] [INFO ] Flow matrix only has 652 transitions (discarded 21 similar events)
// Phase 1: matrix 652 rows 402 cols
[2023-03-12 00:15:01] [INFO ] Computed 22 place invariants in 3 ms
[2023-03-12 00:15:01] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 00:15:01] [INFO ] [Nat]Absence check using 22 positive place invariants in 5 ms returned sat
[2023-03-12 00:15:01] [INFO ] After 262ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 00:15:01] [INFO ] State equation strengthened by 329 read => feed constraints.
[2023-03-12 00:15:01] [INFO ] After 195ms SMT Verify possible using 329 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 00:15:01] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 0 ms to minimize.
[2023-03-12 00:15:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2023-03-12 00:15:02] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 0 ms to minimize.
[2023-03-12 00:15:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2023-03-12 00:15:02] [INFO ] After 668ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 169 ms.
[2023-03-12 00:15:02] [INFO ] After 1237ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 24 ms.
Support contains 111 out of 402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 673/673 transitions.
Graph (trivial) has 133 edges and 402 vertex of which 7 / 402 are part of one of the 3 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 398 transition count 639
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 371 transition count 639
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 55 place count 371 transition count 637
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 59 place count 369 transition count 637
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 93 place count 335 transition count 603
Iterating global reduction 2 with 34 rules applied. Total rules applied 127 place count 335 transition count 603
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 130 place count 335 transition count 600
Performed 23 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 176 place count 312 transition count 576
Drop transitions removed 32 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 3 with 33 rules applied. Total rules applied 209 place count 312 transition count 543
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 211 place count 310 transition count 541
Iterating global reduction 4 with 2 rules applied. Total rules applied 213 place count 310 transition count 541
Drop transitions removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 4 with 34 rules applied. Total rules applied 247 place count 310 transition count 507
Free-agglomeration rule applied 36 times.
Iterating global reduction 4 with 36 rules applied. Total rules applied 283 place count 310 transition count 471
Reduce places removed 36 places and 0 transitions.
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 4 with 53 rules applied. Total rules applied 336 place count 274 transition count 454
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 345 place count 274 transition count 445
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 346 place count 274 transition count 445
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 347 place count 273 transition count 444
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 105 edges and 272 vertex of which 27 / 272 are part of one of the 13 SCC in 1 ms
Free SCC test removed 14 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 351 place count 258 transition count 442
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 6 with 29 rules applied. Total rules applied 380 place count 256 transition count 415
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 19 Pre rules applied. Total rules applied 380 place count 256 transition count 396
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 7 with 38 rules applied. Total rules applied 418 place count 237 transition count 396
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 436 place count 237 transition count 378
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 8 with 56 rules applied. Total rules applied 492 place count 209 transition count 350
Drop transitions removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 495 place count 209 transition count 347
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 503 place count 209 transition count 339
Free-agglomeration rule applied 17 times.
Iterating global reduction 9 with 17 rules applied. Total rules applied 520 place count 209 transition count 322
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 9 with 30 rules applied. Total rules applied 550 place count 192 transition count 309
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 553 place count 192 transition count 306
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 556 place count 192 transition count 306
Applied a total of 556 rules in 143 ms. Remains 192 /402 variables (removed 210) and now considering 306/673 (removed 367) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 192/402 places, 306/673 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 854209 steps, run timeout after 3001 ms. (steps per millisecond=284 ) properties seen :{}
Probabilistic random walk after 854209 steps, saw 139748 distinct states, run finished after 3002 ms. (steps per millisecond=284 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-12 00:15:05] [INFO ] Flow matrix only has 301 transitions (discarded 5 similar events)
// Phase 1: matrix 301 rows 192 cols
[2023-03-12 00:15:05] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-12 00:15:05] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 00:15:06] [INFO ] [Nat]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-03-12 00:15:06] [INFO ] After 138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 00:15:06] [INFO ] State equation strengthened by 91 read => feed constraints.
[2023-03-12 00:15:06] [INFO ] After 116ms SMT Verify possible using 91 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 00:15:06] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2023-03-12 00:15:06] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
[2023-03-12 00:15:06] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2023-03-12 00:15:06] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2023-03-12 00:15:06] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 0 ms to minimize.
[2023-03-12 00:15:06] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 0 ms to minimize.
[2023-03-12 00:15:06] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 309 ms
[2023-03-12 00:15:06] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2023-03-12 00:15:06] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 0 ms to minimize.
[2023-03-12 00:15:06] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2023-03-12 00:15:06] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 0 ms to minimize.
[2023-03-12 00:15:06] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 0 ms to minimize.
[2023-03-12 00:15:06] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2023-03-12 00:15:07] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2023-03-12 00:15:07] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 2 ms to minimize.
[2023-03-12 00:15:07] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 427 ms
[2023-03-12 00:15:07] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2023-03-12 00:15:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-12 00:15:07] [INFO ] After 1014ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 97 ms.
[2023-03-12 00:15:07] [INFO ] After 1324ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 44 ms.
Support contains 99 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 306/306 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 192 transition count 302
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 188 transition count 302
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 11 place count 185 transition count 299
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 185 transition count 299
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 17 rules applied. Total rules applied 31 place count 176 transition count 291
Drop transitions removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 38 place count 176 transition count 284
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 44 place count 176 transition count 278
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 45 place count 176 transition count 277
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 46 place count 175 transition count 277
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 47 place count 175 transition count 276
Applied a total of 47 rules in 22 ms. Remains 175 /192 variables (removed 17) and now considering 276/306 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 175/192 places, 276/306 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 446238 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :{}
Probabilistic random walk after 446238 steps, saw 260983 distinct states, run finished after 3001 ms. (steps per millisecond=148 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 276 rows 175 cols
[2023-03-12 00:15:11] [INFO ] Computed 20 place invariants in 9 ms
[2023-03-12 00:15:11] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 00:15:11] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2023-03-12 00:15:11] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 00:15:11] [INFO ] State equation strengthened by 85 read => feed constraints.
[2023-03-12 00:15:11] [INFO ] After 80ms SMT Verify possible using 85 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 00:15:11] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 0 ms to minimize.
[2023-03-12 00:15:11] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 0 ms to minimize.
[2023-03-12 00:15:11] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 4 ms to minimize.
[2023-03-12 00:15:11] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 1 ms to minimize.
[2023-03-12 00:15:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 229 ms
[2023-03-12 00:15:11] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 0 ms to minimize.
[2023-03-12 00:15:11] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 0 ms to minimize.
[2023-03-12 00:15:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 105 ms
[2023-03-12 00:15:11] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 0 ms to minimize.
[2023-03-12 00:15:11] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 0 ms to minimize.
[2023-03-12 00:15:11] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 0 ms to minimize.
[2023-03-12 00:15:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 139 ms
[2023-03-12 00:15:11] [INFO ] After 635ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 82 ms.
[2023-03-12 00:15:11] [INFO ] After 911ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 14 ms.
Support contains 62 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 276/276 transitions.
Graph (trivial) has 57 edges and 175 vertex of which 9 / 175 are part of one of the 4 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 170 transition count 257
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 160 transition count 257
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 35 place count 146 transition count 243
Iterating global reduction 2 with 14 rules applied. Total rules applied 49 place count 146 transition count 243
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 146 transition count 242
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 72 place count 135 transition count 231
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 88 place count 135 transition count 215
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 90 place count 134 transition count 215
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 92 place count 134 transition count 213
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 101 place count 134 transition count 204
Free-agglomeration rule applied 10 times.
Iterating global reduction 5 with 10 rules applied. Total rules applied 111 place count 134 transition count 194
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 129 place count 124 transition count 186
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 130 place count 124 transition count 185
Applied a total of 130 rules in 20 ms. Remains 124 /175 variables (removed 51) and now considering 185/276 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 124/175 places, 185/276 transitions.
Incomplete random walk after 10000 steps, including 272 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :1
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 124 cols
[2023-03-12 00:15:12] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-12 00:15:12] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 00:15:12] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2023-03-12 00:15:12] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 00:15:12] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-12 00:15:12] [INFO ] After 21ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 00:15:12] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2023-03-12 00:15:12] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2023-03-12 00:15:12] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2023-03-12 00:15:12] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2023-03-12 00:15:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 161 ms
[2023-03-12 00:15:12] [INFO ] After 199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-12 00:15:12] [INFO ] After 296ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 37 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 185/185 transitions.
Graph (trivial) has 58 edges and 124 vertex of which 2 / 124 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 123 transition count 175
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 115 transition count 175
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 27 place count 105 transition count 165
Iterating global reduction 2 with 10 rules applied. Total rules applied 37 place count 105 transition count 165
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 105 transition count 164
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 58 place count 95 transition count 154
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 73 place count 95 transition count 139
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 77 place count 95 transition count 135
Free-agglomeration rule applied 26 times.
Iterating global reduction 4 with 26 rules applied. Total rules applied 103 place count 95 transition count 109
Reduce places removed 26 places and 0 transitions.
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 4 with 47 rules applied. Total rules applied 150 place count 69 transition count 88
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 153 place count 69 transition count 85
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 154 place count 68 transition count 84
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 158 place count 64 transition count 84
Applied a total of 158 rules in 18 ms. Remains 64 /124 variables (removed 60) and now considering 84/185 (removed 101) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 64/124 places, 84/185 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Finished Best-First random walk after 7916 steps, including 2 resets, run visited all 1 properties in 10 ms. (steps per millisecond=791 )
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 48000 ms.
timeout --kill-after=10s --signal=SIGINT 1m for testing only

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

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

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

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

parse successfull
net created successfully

Net: FlexibleBarrier_PT_20b
(NrP: 5372 NrTr: 6193 NrArc: 15575)

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

net check time: 0m 0.002sec

init dd package: 0m 2.692sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6371656 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16097648 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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.077sec

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-20b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is FlexibleBarrier-PT-20b, 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 r170-tall-167838857400582"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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