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.r165-tall-167838850600582.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 itstools
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 r165-tall-167838850600582
=====================================================================

--------------------
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 1679515257884

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=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-20b
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-22 20:00:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-22 20:00:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 20:00:59] [INFO ] Load time of PNML (sax parser for PT used): 198 ms
[2023-03-22 20:00:59] [INFO ] Transformed 5372 places.
[2023-03-22 20:00:59] [INFO ] Transformed 6193 transitions.
[2023-03-22 20:00:59] [INFO ] Found NUPN structural information;
[2023-03-22 20:00:59] [INFO ] Parsed PT model containing 5372 places and 6193 transitions and 15575 arcs in 307 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 35 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 74 resets, run finished after 694 ms. (steps per millisecond=14 ) properties (out of 16) seen :1
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 1 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
[2023-03-22 20:01:00] [INFO ] Flatten gal took : 567 ms
[2023-03-22 20:01:01] [INFO ] Flatten gal took : 282 ms
[2023-03-22 20:01:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16119932521295683255.gal : 95 ms
[2023-03-22 20:01:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13545069164527806088.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16119932521295683255.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13545069164527806088.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality13545069164527806088.prop.
Interrupted probabilistic random walk after 113873 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{4=1, 14=1}
Probabilistic random walk after 113873 steps, saw 67128 distinct states, run finished after 3003 ms. (steps per millisecond=37 ) properties seen :2
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 13 properties.
// Phase 1: matrix 6193 rows 5372 cols
[2023-03-22 20:01:04] [INFO ] Computed 22 place invariants in 218 ms
[2023-03-22 20:01:07] [INFO ] After 3333ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-22 20:01:09] [INFO ] [Nat]Absence check using 22 positive place invariants in 54 ms returned sat
[2023-03-22 20:01:17] [INFO ] After 7117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :19 after 68
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :68 after 2324
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :2324 after 110659
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :110659 after 2.54917e+08
Reachability property FlexibleBarrier-PT-20b-ReachabilityCardinality-14 is true.
[2023-03-22 20:01:22] [INFO ] Deduced a trap composed of 2080 places in 4557 ms of which 31 ms to minimize.
[2023-03-22 20:01:27] [INFO ] Deduced a trap composed of 2059 places in 4213 ms of which 5 ms to minimize.
[2023-03-22 20:01:31] [INFO ] Deduced a trap composed of 2043 places in 4180 ms of which 6 ms to minimize.
[2023-03-22 20:01:35] [INFO ] Deduced a trap composed of 1949 places in 3777 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-22 20:01:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 20:01:35] [INFO ] After 27931ms 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 326 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 17 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 4 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 2 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 1 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 1848 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 1849 ms. Remains : 469/5372 places, 774/6193 transitions.
Incomplete random walk after 10000 steps, including 125 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :1
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 159874 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{2=1}
Probabilistic random walk after 159874 steps, saw 146563 distinct states, run finished after 3002 ms. (steps per millisecond=53 ) properties seen :1
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 10 properties.
[2023-03-22 20:01:41] [INFO ] Flow matrix only has 762 transitions (discarded 12 similar events)
// Phase 1: matrix 762 rows 469 cols
[2023-03-22 20:01:41] [INFO ] Computed 22 place invariants in 3 ms
[2023-03-22 20:01:41] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-22 20:01:41] [INFO ] [Nat]Absence check using 22 positive place invariants in 7 ms returned sat
[2023-03-22 20:01:42] [INFO ] After 459ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-22 20:01:42] [INFO ] State equation strengthened by 369 read => feed constraints.
[2023-03-22 20:01:42] [INFO ] After 418ms SMT Verify possible using 369 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-22 20:01:42] [INFO ] Deduced a trap composed of 58 places in 50 ms of which 1 ms to minimize.
[2023-03-22 20:01:42] [INFO ] Deduced a trap composed of 78 places in 43 ms of which 0 ms to minimize.
[2023-03-22 20:01:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 168 ms
[2023-03-22 20:01:42] [INFO ] Deduced a trap composed of 58 places in 52 ms of which 1 ms to minimize.
[2023-03-22 20:01:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-03-22 20:01:43] [INFO ] Deduced a trap composed of 102 places in 124 ms of which 1 ms to minimize.
[2023-03-22 20:01:43] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 1 ms to minimize.
[2023-03-22 20:01:43] [INFO ] Deduced a trap composed of 102 places in 107 ms of which 0 ms to minimize.
[2023-03-22 20:01:43] [INFO ] Deduced a trap composed of 110 places in 102 ms of which 1 ms to minimize.
[2023-03-22 20:01:43] [INFO ] Deduced a trap composed of 104 places in 96 ms of which 0 ms to minimize.
[2023-03-22 20:01:43] [INFO ] Deduced a trap composed of 102 places in 101 ms of which 0 ms to minimize.
[2023-03-22 20:01:43] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 819 ms
[2023-03-22 20:01:44] [INFO ] After 1953ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 376 ms.
[2023-03-22 20:01:44] [INFO ] After 3005ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 92 ms.
Support contains 172 out of 469 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 774/774 transitions.
Graph (trivial) has 124 edges and 469 vertex of which 7 / 469 are part of one of the 3 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 465 transition count 747
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 445 transition count 747
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 41 place count 445 transition count 745
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 45 place count 443 transition count 745
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 61 place count 427 transition count 729
Iterating global reduction 2 with 16 rules applied. Total rules applied 77 place count 427 transition count 729
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 78 place count 427 transition count 728
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 116 place count 408 transition count 709
Drop transitions removed 20 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 137 place count 408 transition count 688
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 4 with 22 rules applied. Total rules applied 159 place count 408 transition count 666
Free-agglomeration rule applied 55 times with reduction of 1 identical transitions.
Iterating global reduction 4 with 55 rules applied. Total rules applied 214 place count 408 transition count 610
Reduce places removed 55 places and 0 transitions.
Drop transitions removed 27 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 83 rules applied. Total rules applied 297 place count 353 transition count 582
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 306 place count 353 transition count 573
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 307 place count 353 transition count 573
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 308 place count 352 transition count 572
Applied a total of 308 rules in 135 ms. Remains 352 /469 variables (removed 117) and now considering 572/774 (removed 202) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 352/469 places, 572/774 transitions.
Incomplete random walk after 10000 steps, including 121 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 151376 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 151376 steps, saw 136317 distinct states, run finished after 3005 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-22 20:01:48] [INFO ] Flow matrix only has 560 transitions (discarded 12 similar events)
// Phase 1: matrix 560 rows 352 cols
[2023-03-22 20:01:48] [INFO ] Computed 22 place invariants in 3 ms
[2023-03-22 20:01:48] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-22 20:01:48] [INFO ] [Nat]Absence check using 22 positive place invariants in 6 ms returned sat
[2023-03-22 20:01:48] [INFO ] After 326ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-22 20:01:48] [INFO ] State equation strengthened by 297 read => feed constraints.
[2023-03-22 20:01:48] [INFO ] After 269ms SMT Verify possible using 297 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-22 20:01:49] [INFO ] Deduced a trap composed of 79 places in 91 ms of which 1 ms to minimize.
[2023-03-22 20:01:49] [INFO ] Deduced a trap composed of 109 places in 86 ms of which 0 ms to minimize.
[2023-03-22 20:01:49] [INFO ] Deduced a trap composed of 78 places in 85 ms of which 0 ms to minimize.
[2023-03-22 20:01:49] [INFO ] Deduced a trap composed of 80 places in 79 ms of which 1 ms to minimize.
[2023-03-22 20:01:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 431 ms
[2023-03-22 20:01:49] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
[2023-03-22 20:01:49] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2023-03-22 20:01:49] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2023-03-22 20:01:49] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 1 ms to minimize.
[2023-03-22 20:01:49] [INFO ] Deduced a trap composed of 82 places in 75 ms of which 1 ms to minimize.
[2023-03-22 20:01:50] [INFO ] Deduced a trap composed of 78 places in 78 ms of which 1 ms to minimize.
[2023-03-22 20:01:50] [INFO ] Deduced a trap composed of 82 places in 81 ms of which 1 ms to minimize.
[2023-03-22 20:01:50] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 715 ms
[2023-03-22 20:01:50] [INFO ] Deduced a trap composed of 82 places in 84 ms of which 0 ms to minimize.
[2023-03-22 20:01:50] [INFO ] Deduced a trap composed of 93 places in 82 ms of which 1 ms to minimize.
[2023-03-22 20:01:50] [INFO ] Deduced a trap composed of 89 places in 85 ms of which 1 ms to minimize.
[2023-03-22 20:01:50] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 0 ms to minimize.
[2023-03-22 20:01:50] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 1 ms to minimize.
[2023-03-22 20:01:50] [INFO ] Deduced a trap composed of 88 places in 80 ms of which 1 ms to minimize.
[2023-03-22 20:01:51] [INFO ] Deduced a trap composed of 80 places in 77 ms of which 0 ms to minimize.
[2023-03-22 20:01:51] [INFO ] Deduced a trap composed of 84 places in 79 ms of which 0 ms to minimize.
[2023-03-22 20:01:51] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 854 ms
[2023-03-22 20:01:51] [INFO ] Deduced a trap composed of 79 places in 92 ms of which 1 ms to minimize.
[2023-03-22 20:01:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2023-03-22 20:01:51] [INFO ] After 2671ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 241 ms.
[2023-03-22 20:01:51] [INFO ] After 3395ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 52 ms.
Support contains 172 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 572/572 transitions.
Applied a total of 0 rules in 15 ms. Remains 352 /352 variables (removed 0) and now considering 572/572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 352/352 places, 572/572 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 572/572 transitions.
Applied a total of 0 rules in 22 ms. Remains 352 /352 variables (removed 0) and now considering 572/572 (removed 0) transitions.
[2023-03-22 20:01:51] [INFO ] Flow matrix only has 560 transitions (discarded 12 similar events)
[2023-03-22 20:01:51] [INFO ] Invariant cache hit.
[2023-03-22 20:01:51] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-22 20:01:51] [INFO ] Flow matrix only has 560 transitions (discarded 12 similar events)
[2023-03-22 20:01:51] [INFO ] Invariant cache hit.
[2023-03-22 20:01:51] [INFO ] State equation strengthened by 297 read => feed constraints.
[2023-03-22 20:01:52] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
[2023-03-22 20:01:52] [INFO ] Redundant transitions in 76 ms returned [391]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
[2023-03-22 20:01:52] [INFO ] Flow matrix only has 559 transitions (discarded 12 similar events)
// Phase 1: matrix 559 rows 352 cols
[2023-03-22 20:01:52] [INFO ] Computed 22 place invariants in 3 ms
[2023-03-22 20:01:52] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 352/352 places, 571/572 transitions.
Applied a total of 0 rules in 14 ms. Remains 352 /352 variables (removed 0) and now considering 571/571 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 774 ms. Remains : 352/352 places, 571/572 transitions.
Incomplete random walk after 10000 steps, including 127 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 8) seen :1
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-08 FALSE 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-22 20:01:52] [INFO ] Flow matrix only has 559 transitions (discarded 12 similar events)
[2023-03-22 20:01:52] [INFO ] Invariant cache hit.
[2023-03-22 20:01:53] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 20:01:53] [INFO ] [Nat]Absence check using 22 positive place invariants in 5 ms returned sat
[2023-03-22 20:01:53] [INFO ] After 296ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 20:01:53] [INFO ] State equation strengthened by 296 read => feed constraints.
[2023-03-22 20:01:53] [INFO ] After 248ms SMT Verify possible using 296 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-22 20:01:53] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 1 ms to minimize.
[2023-03-22 20:01:53] [INFO ] Deduced a trap composed of 80 places in 88 ms of which 0 ms to minimize.
[2023-03-22 20:01:54] [INFO ] Deduced a trap composed of 79 places in 75 ms of which 0 ms to minimize.
[2023-03-22 20:01:54] [INFO ] Deduced a trap composed of 80 places in 75 ms of which 0 ms to minimize.
[2023-03-22 20:01:54] [INFO ] Deduced a trap composed of 85 places in 75 ms of which 1 ms to minimize.
[2023-03-22 20:01:54] [INFO ] Deduced a trap composed of 83 places in 73 ms of which 1 ms to minimize.
[2023-03-22 20:01:54] [INFO ] Deduced a trap composed of 80 places in 74 ms of which 0 ms to minimize.
[2023-03-22 20:01:54] [INFO ] Deduced a trap composed of 78 places in 73 ms of which 1 ms to minimize.
[2023-03-22 20:01:54] [INFO ] Deduced a trap composed of 81 places in 73 ms of which 1 ms to minimize.
[2023-03-22 20:01:54] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 897 ms
[2023-03-22 20:01:54] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2023-03-22 20:01:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-22 20:01:54] [INFO ] Deduced a trap composed of 81 places in 79 ms of which 1 ms to minimize.
[2023-03-22 20:01:54] [INFO ] Deduced a trap composed of 80 places in 79 ms of which 0 ms to minimize.
[2023-03-22 20:01:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 222 ms
[2023-03-22 20:01:55] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 0 ms to minimize.
[2023-03-22 20:01:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-03-22 20:01:55] [INFO ] After 1743ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 208 ms.
[2023-03-22 20:01:55] [INFO ] After 2381ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 50 ms.
Support contains 154 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 571/571 transitions.
Graph (trivial) has 30 edges and 352 vertex of which 2 / 352 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 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 351 transition count 560
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 342 transition count 560
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 23 place count 338 transition count 556
Iterating global reduction 2 with 4 rules applied. Total rules applied 27 place count 338 transition count 556
Performed 6 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 39 place count 332 transition count 549
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 42 place count 332 transition count 546
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 56 place count 332 transition count 532
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 61 place count 332 transition count 527
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 66 place count 327 transition count 527
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 68 place count 327 transition count 525
Applied a total of 68 rules in 66 ms. Remains 327 /352 variables (removed 25) and now considering 525/571 (removed 46) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 327/352 places, 525/571 transitions.
Incomplete random walk after 10000 steps, including 121 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 179836 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 179836 steps, saw 159809 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 7 properties.
[2023-03-22 20:01:58] [INFO ] Flow matrix only has 521 transitions (discarded 4 similar events)
// Phase 1: matrix 521 rows 327 cols
[2023-03-22 20:01:58] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-22 20:01:59] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 20:01:59] [INFO ] [Nat]Absence check using 22 positive place invariants in 6 ms returned sat
[2023-03-22 20:01:59] [INFO ] After 266ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 20:01:59] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-03-22 20:01:59] [INFO ] After 231ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-22 20:01:59] [INFO ] Deduced a trap composed of 53 places in 77 ms of which 1 ms to minimize.
[2023-03-22 20:01:59] [INFO ] Deduced a trap composed of 69 places in 74 ms of which 2 ms to minimize.
[2023-03-22 20:01:59] [INFO ] Deduced a trap composed of 70 places in 80 ms of which 1 ms to minimize.
[2023-03-22 20:02:00] [INFO ] Deduced a trap composed of 73 places in 77 ms of which 1 ms to minimize.
[2023-03-22 20:02:00] [INFO ] Deduced a trap composed of 71 places in 75 ms of which 0 ms to minimize.
[2023-03-22 20:02:00] [INFO ] Deduced a trap composed of 70 places in 81 ms of which 1 ms to minimize.
[2023-03-22 20:02:00] [INFO ] Deduced a trap composed of 71 places in 79 ms of which 0 ms to minimize.
[2023-03-22 20:02:00] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 686 ms
[2023-03-22 20:02:00] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 10 ms to minimize.
[2023-03-22 20:02:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-22 20:02:00] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 1 ms to minimize.
[2023-03-22 20:02:00] [INFO ] Deduced a trap composed of 67 places in 67 ms of which 1 ms to minimize.
[2023-03-22 20:02:00] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 1 ms to minimize.
[2023-03-22 20:02:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 289 ms
[2023-03-22 20:02:01] [INFO ] Deduced a trap composed of 70 places in 78 ms of which 0 ms to minimize.
[2023-03-22 20:02:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-03-22 20:02:01] [INFO ] After 1609ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 205 ms.
[2023-03-22 20:02:01] [INFO ] After 2205ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 33 ms.
Support contains 99 out of 327 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 327/327 places, 525/525 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 327 transition count 512
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 314 transition count 512
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 52 place count 288 transition count 486
Iterating global reduction 2 with 26 rules applied. Total rules applied 78 place count 288 transition count 486
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 81 place count 288 transition count 483
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 121 place count 268 transition count 463
Drop transitions removed 17 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 140 place count 268 transition count 444
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 142 place count 266 transition count 442
Iterating global reduction 4 with 2 rules applied. Total rules applied 144 place count 266 transition count 442
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 152 place count 266 transition count 434
Free-agglomeration rule applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 160 place count 266 transition count 426
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 173 place count 258 transition count 421
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 175 place count 258 transition count 419
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 176 place count 257 transition count 418
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 105 edges and 256 vertex of which 27 / 256 are part of one of the 13 SCC in 0 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 180 place count 242 transition count 416
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 209 place count 240 transition count 389
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 19 Pre rules applied. Total rules applied 209 place count 240 transition count 370
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 247 place count 221 transition count 370
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 265 place count 221 transition count 352
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 321 place count 193 transition count 324
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 324 place count 193 transition count 321
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 332 place count 193 transition count 313
Free-agglomeration rule applied 17 times.
Iterating global reduction 9 with 17 rules applied. Total rules applied 349 place count 193 transition count 296
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 9 with 31 rules applied. Total rules applied 380 place count 175 transition count 283
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 10 with 8 rules applied. Total rules applied 388 place count 175 transition count 275
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 391 place count 175 transition count 275
Applied a total of 391 rules in 83 ms. Remains 175 /327 variables (removed 152) and now considering 275/525 (removed 250) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 175/327 places, 275/525 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 353597 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :{}
Probabilistic random walk after 353597 steps, saw 183449 distinct states, run finished after 3003 ms. (steps per millisecond=117 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 275 rows 175 cols
[2023-03-22 20:02:04] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-22 20:02:05] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 20:02:05] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2023-03-22 20:02:05] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 20:02:05] [INFO ] State equation strengthened by 85 read => feed constraints.
[2023-03-22 20:02:05] [INFO ] After 90ms SMT Verify possible using 85 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-22 20:02:05] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2023-03-22 20:02:05] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2023-03-22 20:02:05] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 2 ms to minimize.
[2023-03-22 20:02:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 205 ms
[2023-03-22 20:02:05] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2023-03-22 20:02:05] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 0 ms to minimize.
[2023-03-22 20:02:05] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 2 ms to minimize.
[2023-03-22 20:02:05] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 8 ms to minimize.
[2023-03-22 20:02:05] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2023-03-22 20:02:05] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 0 ms to minimize.
[2023-03-22 20:02:05] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 397 ms
[2023-03-22 20:02:06] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2023-03-22 20:02:06] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2023-03-22 20:02:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 118 ms
[2023-03-22 20:02:06] [INFO ] After 905ms 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-22 20:02:06] [INFO ] After 1197ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 25 ms.
Support contains 62 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 275/275 transitions.
Graph (trivial) has 57 edges and 175 vertex of which 9 / 175 are part of one of the 4 SCC in 1 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 256
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 256
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 35 place count 146 transition count 242
Iterating global reduction 2 with 14 rules applied. Total rules applied 49 place count 146 transition count 242
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 241
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 230
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 214
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 214
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 212
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 100 place count 134 transition count 204
Free-agglomeration rule applied 10 times.
Iterating global reduction 5 with 10 rules applied. Total rules applied 110 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 128 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 129 place count 124 transition count 185
Applied a total of 129 rules in 40 ms. Remains 124 /175 variables (removed 51) and now considering 185/275 (removed 90) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 124/175 places, 185/275 transitions.
Incomplete random walk after 10000 steps, including 287 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 512834 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :{}
Probabilistic random walk after 512834 steps, saw 296248 distinct states, run finished after 3004 ms. (steps per millisecond=170 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 185 rows 124 cols
[2023-03-22 20:02:09] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-22 20:02:09] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 20:02:09] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2023-03-22 20:02:09] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 20:02:09] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-22 20:02:09] [INFO ] After 38ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 20:02:09] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 0 ms to minimize.
[2023-03-22 20:02:09] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2023-03-22 20:02:09] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2023-03-22 20:02:09] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2023-03-22 20:02:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 180 ms
[2023-03-22 20:02:09] [INFO ] After 265ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-22 20:02:09] [INFO ] After 427ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 62 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 185/185 transitions.
Applied a total of 0 rules in 4 ms. Remains 124 /124 variables (removed 0) and now considering 185/185 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 124/124 places, 185/185 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 185/185 transitions.
Applied a total of 0 rules in 3 ms. Remains 124 /124 variables (removed 0) and now considering 185/185 (removed 0) transitions.
[2023-03-22 20:02:09] [INFO ] Invariant cache hit.
[2023-03-22 20:02:09] [INFO ] Implicit Places using invariants in 48 ms returned [71]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 50 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 123/124 places, 185/185 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 122 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 122 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 122 transition count 183
Applied a total of 3 rules in 4 ms. Remains 122 /123 variables (removed 1) and now considering 183/185 (removed 2) transitions.
// Phase 1: matrix 183 rows 122 cols
[2023-03-22 20:02:09] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-22 20:02:10] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-22 20:02:10] [INFO ] Invariant cache hit.
[2023-03-22 20:02:10] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-22 20:02:10] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 122/124 places, 183/185 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 212 ms. Remains : 122/124 places, 183/185 transitions.
Incomplete random walk after 10000 steps, including 291 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :1
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 20:02:10] [INFO ] Invariant cache hit.
[2023-03-22 20:02:10] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 20:02:10] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2023-03-22 20:02:10] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 20:02:10] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-22 20:02:10] [INFO ] After 21ms SMT Verify possible using 59 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 20:02:10] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-22 20:02:10] [INFO ] After 152ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 37 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 183/183 transitions.
Graph (trivial) has 57 edges and 122 vertex of which 2 / 122 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 121 transition count 173
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 113 transition count 173
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 27 place count 103 transition count 163
Iterating global reduction 2 with 10 rules applied. Total rules applied 37 place count 103 transition count 163
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 103 transition count 162
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 93 transition count 152
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 93 transition count 137
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 93 transition count 133
Free-agglomeration rule applied 25 times.
Iterating global reduction 4 with 25 rules applied. Total rules applied 102 place count 93 transition count 108
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 45 rules applied. Total rules applied 147 place count 68 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 150 place count 68 transition count 85
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 151 place count 67 transition count 84
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 154 place count 64 transition count 84
Applied a total of 154 rules in 17 ms. Remains 64 /122 variables (removed 58) and now considering 84/183 (removed 99) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 64/122 places, 84/183 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2127710 steps, run timeout after 3001 ms. (steps per millisecond=709 ) properties seen :{}
Probabilistic random walk after 2127710 steps, saw 860269 distinct states, run finished after 3005 ms. (steps per millisecond=708 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 84 rows 64 cols
[2023-03-22 20:02:13] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-22 20:02:13] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 20:02:13] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 20:02:13] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 20:02:13] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 20:02:13] [INFO ] After 20ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 20:02:13] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-22 20:02:13] [INFO ] After 113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 34 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=34 )
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 0 ms.
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
All properties solved without resorting to model-checking.
Total runtime 74255 ms.

BK_STOP 1679515334775

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
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 itstools"
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 r165-tall-167838850600582"
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 ;