fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r009-oct2-167813597400089
Last Updated
May 14, 2023

About the Execution of LTSMin+red for ASLink-PT-06a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3394.111 3600000.00 14062326.00 77.00 ?????F?TT?T???F? normal

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.r009-oct2-167813597400089.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ASLink-PT-06a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813597400089
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.1K Feb 26 13:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 13:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 13:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 13:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 13:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 26 13:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 13:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 13:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 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 597K 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 ASLink-PT-06a-CTLCardinality-00
FORMULA_NAME ASLink-PT-06a-CTLCardinality-01
FORMULA_NAME ASLink-PT-06a-CTLCardinality-02
FORMULA_NAME ASLink-PT-06a-CTLCardinality-03
FORMULA_NAME ASLink-PT-06a-CTLCardinality-04
FORMULA_NAME ASLink-PT-06a-CTLCardinality-05
FORMULA_NAME ASLink-PT-06a-CTLCardinality-06
FORMULA_NAME ASLink-PT-06a-CTLCardinality-07
FORMULA_NAME ASLink-PT-06a-CTLCardinality-08
FORMULA_NAME ASLink-PT-06a-CTLCardinality-09
FORMULA_NAME ASLink-PT-06a-CTLCardinality-10
FORMULA_NAME ASLink-PT-06a-CTLCardinality-11
FORMULA_NAME ASLink-PT-06a-CTLCardinality-12
FORMULA_NAME ASLink-PT-06a-CTLCardinality-13
FORMULA_NAME ASLink-PT-06a-CTLCardinality-14
FORMULA_NAME ASLink-PT-06a-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678609679671

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=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-06a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 08:28:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 08:28:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 08:28:04] [INFO ] Load time of PNML (sax parser for PT used): 201 ms
[2023-03-12 08:28:04] [INFO ] Transformed 1406 places.
[2023-03-12 08:28:04] [INFO ] Transformed 2100 transitions.
[2023-03-12 08:28:04] [INFO ] Found NUPN structural information;
[2023-03-12 08:28:04] [INFO ] Parsed PT model containing 1406 places and 2100 transitions and 7896 arcs in 403 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 11 ms.
Ensure Unique test removed 22 transitions
Reduce redundant transitions removed 22 transitions.
FORMULA ASLink-PT-06a-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 110 out of 1406 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1406/1406 places, 2078/2078 transitions.
Ensure Unique test removed 23 places
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 1372 transition count 2078
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 45 place count 1361 transition count 2029
Ensure Unique test removed 1 places
Iterating global reduction 1 with 12 rules applied. Total rules applied 57 place count 1360 transition count 2029
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 59 place count 1360 transition count 2027
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 1359 transition count 2019
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 1359 transition count 2019
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 1358 transition count 2011
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 1358 transition count 2011
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 1357 transition count 2003
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 1357 transition count 2003
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 1356 transition count 1995
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 1356 transition count 1995
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 68 place count 1355 transition count 1987
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 1355 transition count 1987
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 1354 transition count 1979
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 1354 transition count 1979
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 1353 transition count 1971
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 1353 transition count 1971
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 74 place count 1352 transition count 1963
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 1352 transition count 1963
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 1351 transition count 1955
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 1351 transition count 1955
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 78 place count 1350 transition count 1947
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 1350 transition count 1947
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 80 place count 1349 transition count 1939
Iterating global reduction 2 with 1 rules applied. Total rules applied 81 place count 1349 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 82 place count 1348 transition count 1931
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 1348 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 84 place count 1347 transition count 1923
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 1347 transition count 1923
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 86 place count 1346 transition count 1915
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 1346 transition count 1915
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 1345 transition count 1907
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 1345 transition count 1907
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 90 place count 1344 transition count 1899
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 1344 transition count 1899
Applied a total of 91 rules in 1207 ms. Remains 1344 /1406 variables (removed 62) and now considering 1899/2078 (removed 179) transitions.
// Phase 1: matrix 1899 rows 1344 cols
[2023-03-12 08:28:05] [INFO ] Computed 235 place invariants in 130 ms
[2023-03-12 08:28:07] [INFO ] Implicit Places using invariants in 2418 ms returned [1, 19, 23, 33, 51, 69, 220, 221, 239, 408, 409, 427, 445, 575, 591, 596, 597, 615, 633, 762, 785, 786, 822, 951, 967, 973, 974, 1010, 1144, 1162, 1183, 1186, 1204, 1207]
Discarding 34 places :
Implicit Place search using SMT only with invariants took 2457 ms to find 34 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1310/1406 places, 1899/2078 transitions.
Applied a total of 0 rules in 31 ms. Remains 1310 /1310 variables (removed 0) and now considering 1899/1899 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3696 ms. Remains : 1310/1406 places, 1899/2078 transitions.
Support contains 110 out of 1310 places after structural reductions.
[2023-03-12 08:28:08] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-12 08:28:08] [INFO ] Flatten gal took : 173 ms
[2023-03-12 08:28:08] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ASLink-PT-06a-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 08:28:08] [INFO ] Flatten gal took : 93 ms
[2023-03-12 08:28:08] [INFO ] Input system was already deterministic with 1899 transitions.
Support contains 99 out of 1310 places (down from 110) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 60 resets, run finished after 481 ms. (steps per millisecond=20 ) properties (out of 58) seen :33
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) 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 25) 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 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) 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 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) 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 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) 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 25) 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 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Running SMT prover for 25 properties.
// Phase 1: matrix 1899 rows 1310 cols
[2023-03-12 08:28:09] [INFO ] Computed 201 place invariants in 54 ms
[2023-03-12 08:28:10] [INFO ] After 1168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:25
[2023-03-12 08:28:11] [INFO ] [Nat]Absence check using 40 positive place invariants in 20 ms returned sat
[2023-03-12 08:28:11] [INFO ] [Nat]Absence check using 40 positive and 161 generalized place invariants in 51 ms returned sat
[2023-03-12 08:28:35] [INFO ] After 23357ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :22
[2023-03-12 08:28:35] [INFO ] After 23378ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :22
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-12 08:28:35] [INFO ] After 25066ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :22
Fused 25 Parikh solutions to 14 different solutions.
Parikh walk visited 1 properties in 864 ms.
Support contains 38 out of 1310 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1310/1310 places, 1899/1899 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 1308 transition count 1702
Reduce places removed 197 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 205 rules applied. Total rules applied 404 place count 1111 transition count 1694
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 412 place count 1103 transition count 1694
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 123 Pre rules applied. Total rules applied 412 place count 1103 transition count 1571
Deduced a syphon composed of 123 places in 1 ms
Ensure Unique test removed 46 places
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 3 with 292 rules applied. Total rules applied 704 place count 934 transition count 1571
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 707 place count 932 transition count 1570
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 708 place count 931 transition count 1570
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 2 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 5 with 134 rules applied. Total rules applied 842 place count 864 transition count 1503
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 844 place count 864 transition count 1501
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 846 place count 862 transition count 1501
Free-agglomeration rule (complex) applied 52 times.
Iterating global reduction 6 with 52 rules applied. Total rules applied 898 place count 862 transition count 1449
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 6 with 52 rules applied. Total rules applied 950 place count 810 transition count 1449
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 962 place count 810 transition count 1449
Applied a total of 962 rules in 489 ms. Remains 810 /1310 variables (removed 500) and now considering 1449/1899 (removed 450) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 490 ms. Remains : 810/1310 places, 1449/1899 transitions.
Incomplete random walk after 10000 steps, including 106 resets, run finished after 516 ms. (steps per millisecond=19 ) properties (out of 23) seen :3
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) 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 20) seen :0
Running SMT prover for 20 properties.
// Phase 1: matrix 1449 rows 810 cols
[2023-03-12 08:28:37] [INFO ] Computed 151 place invariants in 11 ms
[2023-03-12 08:28:38] [INFO ] After 655ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-12 08:28:39] [INFO ] [Nat]Absence check using 45 positive place invariants in 79 ms returned sat
[2023-03-12 08:28:39] [INFO ] [Nat]Absence check using 45 positive and 106 generalized place invariants in 152 ms returned sat
[2023-03-12 08:29:01] [INFO ] After 21657ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-03-12 08:29:01] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-12 08:29:03] [INFO ] After 2173ms SMT Verify possible using 32 Read/Feed constraints in natural domain returned unsat :0 sat :18
[2023-03-12 08:29:03] [INFO ] After 2197ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-12 08:29:03] [INFO ] After 25043ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Parikh walk visited 0 properties in 549 ms.
Support contains 35 out of 810 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 810/810 places, 1449/1449 transitions.
Applied a total of 0 rules in 57 ms. Remains 810 /810 variables (removed 0) and now considering 1449/1449 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 810/810 places, 1449/1449 transitions.
Incomplete random walk after 10000 steps, including 110 resets, run finished after 317 ms. (steps per millisecond=31 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Interrupted probabilistic random walk after 102839 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{0=1, 5=1, 6=1, 8=1, 10=1, 15=1, 17=1, 18=1}
Probabilistic random walk after 102839 steps, saw 23334 distinct states, run finished after 3003 ms. (steps per millisecond=34 ) properties seen :8
Running SMT prover for 11 properties.
[2023-03-12 08:29:07] [INFO ] Invariant cache hit.
[2023-03-12 08:29:07] [INFO ] After 256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-12 08:29:08] [INFO ] [Nat]Absence check using 45 positive place invariants in 17 ms returned sat
[2023-03-12 08:29:08] [INFO ] [Nat]Absence check using 45 positive and 106 generalized place invariants in 40 ms returned sat
[2023-03-12 08:29:16] [INFO ] After 7860ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-12 08:29:16] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-12 08:29:29] [INFO ] After 13487ms SMT Verify possible using 32 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-12 08:29:30] [INFO ] Deduced a trap composed of 98 places in 441 ms of which 29 ms to minimize.
[2023-03-12 08:29:32] [INFO ] Deduced a trap composed of 88 places in 1274 ms of which 1 ms to minimize.
[2023-03-12 08:29:32] [INFO ] Deduced a trap composed of 92 places in 443 ms of which 1 ms to minimize.
[2023-03-12 08:29:33] [INFO ] Deduced a trap composed of 80 places in 349 ms of which 0 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.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 08:29:33] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 08:29:33] [INFO ] After 25191ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Parikh walk visited 0 properties in 252 ms.
Support contains 22 out of 810 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 810/810 places, 1449/1449 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 810 transition count 1446
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 807 transition count 1446
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 807 transition count 1445
Deduced a syphon composed of 1 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 9 place count 805 transition count 1445
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 802 transition count 1442
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 802 transition count 1440
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 802 transition count 1439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 801 transition count 1439
Applied a total of 19 rules in 172 ms. Remains 801 /810 variables (removed 9) and now considering 1439/1449 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 801/810 places, 1439/1449 transitions.
Incomplete random walk after 10000 steps, including 107 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 226116 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :{}
Probabilistic random walk after 226116 steps, saw 50687 distinct states, run finished after 3003 ms. (steps per millisecond=75 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 1439 rows 801 cols
[2023-03-12 08:29:37] [INFO ] Computed 150 place invariants in 12 ms
[2023-03-12 08:29:37] [INFO ] After 467ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-12 08:29:38] [INFO ] [Nat]Absence check using 42 positive place invariants in 28 ms returned sat
[2023-03-12 08:29:38] [INFO ] [Nat]Absence check using 42 positive and 108 generalized place invariants in 65 ms returned sat
[2023-03-12 08:29:46] [INFO ] After 7936ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-12 08:29:46] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-12 08:29:56] [INFO ] After 10679ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-12 08:30:02] [INFO ] After 16462ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-12 08:30:02] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 1 properties in 160 ms.
Support contains 21 out of 801 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 801/801 places, 1439/1439 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 801 transition count 1438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 800 transition count 1438
Applied a total of 2 rules in 47 ms. Remains 800 /801 variables (removed 1) and now considering 1438/1439 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 800/801 places, 1438/1439 transitions.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
[2023-03-12 08:30:03] [INFO ] Flatten gal took : 71 ms
[2023-03-12 08:30:03] [INFO ] Flatten gal took : 75 ms
[2023-03-12 08:30:03] [INFO ] Input system was already deterministic with 1899 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 1310/1310 places, 1899/1899 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 224 transitions
Trivial Post-agglo rules discarded 224 transitions
Performed 224 trivial Post agglomeration. Transition count delta: 224
Iterating post reduction 0 with 225 rules applied. Total rules applied 225 place count 1307 transition count 1674
Reduce places removed 235 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 241 rules applied. Total rules applied 466 place count 1072 transition count 1668
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 473 place count 1066 transition count 1667
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 474 place count 1065 transition count 1667
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 150 Pre rules applied. Total rules applied 474 place count 1065 transition count 1517
Deduced a syphon composed of 150 places in 2 ms
Ensure Unique test removed 51 places
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 4 with 351 rules applied. Total rules applied 825 place count 864 transition count 1517
Discarding 16 places :
Implicit places reduction removed 16 places
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 4 with 27 rules applied. Total rules applied 852 place count 848 transition count 1506
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 863 place count 837 transition count 1506
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 863 place count 837 transition count 1505
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 865 place count 836 transition count 1505
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 872 place count 829 transition count 1498
Iterating global reduction 6 with 7 rules applied. Total rules applied 879 place count 829 transition count 1498
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 884 place count 829 transition count 1493
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 886 place count 827 transition count 1491
Iterating global reduction 7 with 2 rules applied. Total rules applied 888 place count 827 transition count 1491
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 890 place count 825 transition count 1489
Iterating global reduction 7 with 2 rules applied. Total rules applied 892 place count 825 transition count 1489
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 894 place count 825 transition count 1487
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 8 with 116 rules applied. Total rules applied 1010 place count 767 transition count 1429
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1011 place count 766 transition count 1428
Iterating global reduction 8 with 1 rules applied. Total rules applied 1012 place count 766 transition count 1428
Applied a total of 1012 rules in 206 ms. Remains 766 /1310 variables (removed 544) and now considering 1428/1899 (removed 471) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 206 ms. Remains : 766/1310 places, 1428/1899 transitions.
[2023-03-12 08:30:03] [INFO ] Flatten gal took : 51 ms
[2023-03-12 08:30:03] [INFO ] Flatten gal took : 54 ms
[2023-03-12 08:30:03] [INFO ] Input system was already deterministic with 1428 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1310/1310 places, 1899/1899 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1308 transition count 1899
Applied a total of 2 rules in 30 ms. Remains 1308 /1310 variables (removed 2) and now considering 1899/1899 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 1308/1310 places, 1899/1899 transitions.
[2023-03-12 08:30:03] [INFO ] Flatten gal took : 59 ms
[2023-03-12 08:30:03] [INFO ] Flatten gal took : 62 ms
[2023-03-12 08:30:03] [INFO ] Input system was already deterministic with 1899 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1310/1310 places, 1899/1899 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1308 transition count 1899
Applied a total of 2 rules in 30 ms. Remains 1308 /1310 variables (removed 2) and now considering 1899/1899 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 1308/1310 places, 1899/1899 transitions.
[2023-03-12 08:30:04] [INFO ] Flatten gal took : 69 ms
[2023-03-12 08:30:04] [INFO ] Flatten gal took : 73 ms
[2023-03-12 08:30:04] [INFO ] Input system was already deterministic with 1899 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1310/1310 places, 1899/1899 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1308 transition count 1899
Applied a total of 2 rules in 42 ms. Remains 1308 /1310 variables (removed 2) and now considering 1899/1899 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42 ms. Remains : 1308/1310 places, 1899/1899 transitions.
[2023-03-12 08:30:04] [INFO ] Flatten gal took : 82 ms
[2023-03-12 08:30:04] [INFO ] Flatten gal took : 56 ms
[2023-03-12 08:30:04] [INFO ] Input system was already deterministic with 1899 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1310/1310 places, 1899/1899 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1308 transition count 1899
Applied a total of 2 rules in 98 ms. Remains 1308 /1310 variables (removed 2) and now considering 1899/1899 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 98 ms. Remains : 1308/1310 places, 1899/1899 transitions.
[2023-03-12 08:30:04] [INFO ] Flatten gal took : 143 ms
[2023-03-12 08:30:04] [INFO ] Flatten gal took : 81 ms
[2023-03-12 08:30:05] [INFO ] Input system was already deterministic with 1899 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1310/1310 places, 1899/1899 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 227 transitions
Trivial Post-agglo rules discarded 227 transitions
Performed 227 trivial Post agglomeration. Transition count delta: 227
Iterating post reduction 0 with 228 rules applied. Total rules applied 228 place count 1307 transition count 1671
Reduce places removed 237 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 242 rules applied. Total rules applied 470 place count 1070 transition count 1666
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 475 place count 1065 transition count 1666
Performed 148 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 148 Pre rules applied. Total rules applied 475 place count 1065 transition count 1518
Deduced a syphon composed of 148 places in 2 ms
Ensure Unique test removed 52 places
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 348 rules applied. Total rules applied 823 place count 865 transition count 1518
Discarding 15 places :
Implicit places reduction removed 15 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 24 rules applied. Total rules applied 847 place count 850 transition count 1509
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 856 place count 841 transition count 1509
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 856 place count 841 transition count 1508
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 858 place count 840 transition count 1508
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 864 place count 834 transition count 1502
Iterating global reduction 5 with 6 rules applied. Total rules applied 870 place count 834 transition count 1502
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 874 place count 834 transition count 1498
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 876 place count 832 transition count 1496
Iterating global reduction 6 with 2 rules applied. Total rules applied 878 place count 832 transition count 1496
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 880 place count 830 transition count 1494
Iterating global reduction 6 with 2 rules applied. Total rules applied 882 place count 830 transition count 1494
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 884 place count 830 transition count 1492
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 2 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 7 with 118 rules applied. Total rules applied 1002 place count 771 transition count 1433
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1003 place count 770 transition count 1432
Iterating global reduction 7 with 1 rules applied. Total rules applied 1004 place count 770 transition count 1432
Applied a total of 1004 rules in 325 ms. Remains 770 /1310 variables (removed 540) and now considering 1432/1899 (removed 467) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 325 ms. Remains : 770/1310 places, 1432/1899 transitions.
[2023-03-12 08:30:05] [INFO ] Flatten gal took : 43 ms
[2023-03-12 08:30:05] [INFO ] Flatten gal took : 55 ms
[2023-03-12 08:30:05] [INFO ] Input system was already deterministic with 1432 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1310/1310 places, 1899/1899 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1308 transition count 1899
Applied a total of 2 rules in 30 ms. Remains 1308 /1310 variables (removed 2) and now considering 1899/1899 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 1308/1310 places, 1899/1899 transitions.
[2023-03-12 08:30:05] [INFO ] Flatten gal took : 72 ms
[2023-03-12 08:30:06] [INFO ] Flatten gal took : 64 ms
[2023-03-12 08:30:06] [INFO ] Input system was already deterministic with 1899 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1310/1310 places, 1899/1899 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1308 transition count 1899
Applied a total of 2 rules in 33 ms. Remains 1308 /1310 variables (removed 2) and now considering 1899/1899 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 1308/1310 places, 1899/1899 transitions.
[2023-03-12 08:30:06] [INFO ] Flatten gal took : 86 ms
[2023-03-12 08:30:06] [INFO ] Flatten gal took : 89 ms
[2023-03-12 08:30:06] [INFO ] Input system was already deterministic with 1899 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1310/1310 places, 1899/1899 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1309 transition count 1899
Applied a total of 1 rules in 29 ms. Remains 1309 /1310 variables (removed 1) and now considering 1899/1899 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 1309/1310 places, 1899/1899 transitions.
[2023-03-12 08:30:06] [INFO ] Flatten gal took : 47 ms
[2023-03-12 08:30:06] [INFO ] Flatten gal took : 56 ms
[2023-03-12 08:30:06] [INFO ] Input system was already deterministic with 1899 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1310/1310 places, 1899/1899 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 227 transitions
Trivial Post-agglo rules discarded 227 transitions
Performed 227 trivial Post agglomeration. Transition count delta: 227
Iterating post reduction 0 with 228 rules applied. Total rules applied 228 place count 1307 transition count 1671
Reduce places removed 237 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 242 rules applied. Total rules applied 470 place count 1070 transition count 1666
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 475 place count 1065 transition count 1666
Performed 148 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 148 Pre rules applied. Total rules applied 475 place count 1065 transition count 1518
Deduced a syphon composed of 148 places in 2 ms
Ensure Unique test removed 52 places
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 348 rules applied. Total rules applied 823 place count 865 transition count 1518
Discarding 15 places :
Implicit places reduction removed 15 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 24 rules applied. Total rules applied 847 place count 850 transition count 1509
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 856 place count 841 transition count 1509
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 856 place count 841 transition count 1508
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 858 place count 840 transition count 1508
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 864 place count 834 transition count 1502
Iterating global reduction 5 with 6 rules applied. Total rules applied 870 place count 834 transition count 1502
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 874 place count 834 transition count 1498
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 876 place count 832 transition count 1496
Iterating global reduction 6 with 2 rules applied. Total rules applied 878 place count 832 transition count 1496
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 880 place count 830 transition count 1494
Iterating global reduction 6 with 2 rules applied. Total rules applied 882 place count 830 transition count 1494
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 884 place count 830 transition count 1492
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 2 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 7 with 118 rules applied. Total rules applied 1002 place count 771 transition count 1433
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1003 place count 770 transition count 1432
Iterating global reduction 7 with 1 rules applied. Total rules applied 1004 place count 770 transition count 1432
Applied a total of 1004 rules in 306 ms. Remains 770 /1310 variables (removed 540) and now considering 1432/1899 (removed 467) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 307 ms. Remains : 770/1310 places, 1432/1899 transitions.
[2023-03-12 08:30:07] [INFO ] Flatten gal took : 55 ms
[2023-03-12 08:30:07] [INFO ] Flatten gal took : 40 ms
[2023-03-12 08:30:07] [INFO ] Input system was already deterministic with 1432 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1310/1310 places, 1899/1899 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1308 transition count 1899
Applied a total of 2 rules in 33 ms. Remains 1308 /1310 variables (removed 2) and now considering 1899/1899 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 1308/1310 places, 1899/1899 transitions.
[2023-03-12 08:30:07] [INFO ] Flatten gal took : 52 ms
[2023-03-12 08:30:07] [INFO ] Flatten gal took : 71 ms
[2023-03-12 08:30:07] [INFO ] Input system was already deterministic with 1899 transitions.
[2023-03-12 08:30:07] [INFO ] Flatten gal took : 57 ms
[2023-03-12 08:30:07] [INFO ] Flatten gal took : 64 ms
[2023-03-12 08:30:07] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 24 ms.
[2023-03-12 08:30:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1310 places, 1899 transitions and 6774 arcs took 7 ms.
Total runtime 124416 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/527/ctl_0_ --ctl=/tmp/527/ctl_1_ --ctl=/tmp/527/ctl_2_ --ctl=/tmp/527/ctl_3_ --ctl=/tmp/527/ctl_4_ --ctl=/tmp/527/ctl_5_ --ctl=/tmp/527/ctl_6_ --ctl=/tmp/527/ctl_7_ --ctl=/tmp/527/ctl_8_ --ctl=/tmp/527/ctl_9_ --ctl=/tmp/527/ctl_10_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 12752000 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16096332 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2023

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="ASLink-PT-06a"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ASLink-PT-06a, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r009-oct2-167813597400089"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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