fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r010-tajo-165245701500026
Last Updated
Jun 22, 2022

About the Execution of 2021-gold for ASLink-PT-04b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2095.903 106157.00 153480.00 153.30 FTFTTFFTFTTTTFTT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r010-tajo-165245701500026.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is ASLink-PT-04b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-tajo-165245701500026
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.0K Apr 30 07:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 30 07:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 30 07:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 30 07:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 30 07:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 30 07:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 30 07:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 30 07:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 669K May 10 09:33 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-04b-ReachabilityCardinality-00
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-01
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-02
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-03
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-04
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-05
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-06
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-07
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-08
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-09
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-10
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-11
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-12
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-13
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-14
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655068382807

Running Version 0
[2022-06-12 21:13:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-12 21:13:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:13:05] [INFO ] Load time of PNML (sax parser for PT used): 186 ms
[2022-06-12 21:13:05] [INFO ] Transformed 2034 places.
[2022-06-12 21:13:05] [INFO ] Transformed 2567 transitions.
[2022-06-12 21:13:05] [INFO ] Found NUPN structural information;
[2022-06-12 21:13:05] [INFO ] Parsed PT model containing 2034 places and 2567 transitions in 278 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA ASLink-PT-04b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 22 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 14) seen :6
FORMULA ASLink-PT-04b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2567 rows 2034 cols
[2022-06-12 21:13:05] [INFO ] Computed 199 place invariants in 269 ms
[2022-06-12 21:13:06] [INFO ] [Real]Absence check using 48 positive place invariants in 38 ms returned sat
[2022-06-12 21:13:06] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 44 ms returned sat
[2022-06-12 21:13:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:13:07] [INFO ] [Real]Absence check using state equation in 820 ms returned sat
[2022-06-12 21:13:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:13:08] [INFO ] [Nat]Absence check using 48 positive place invariants in 42 ms returned sat
[2022-06-12 21:13:08] [INFO ] [Nat]Absence check using 48 positive and 151 generalized place invariants in 52 ms returned sat
[2022-06-12 21:13:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:13:12] [INFO ] [Nat]Absence check using state equation in 4271 ms returned unknown
[2022-06-12 21:13:13] [INFO ] [Real]Absence check using 48 positive place invariants in 57 ms returned sat
[2022-06-12 21:13:13] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 189 ms returned sat
[2022-06-12 21:13:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:13:17] [INFO ] [Real]Absence check using state equation in 4332 ms returned unknown
[2022-06-12 21:13:18] [INFO ] [Real]Absence check using 48 positive place invariants in 52 ms returned sat
[2022-06-12 21:13:18] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 77 ms returned sat
[2022-06-12 21:13:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:13:19] [INFO ] [Real]Absence check using state equation in 1527 ms returned sat
[2022-06-12 21:13:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:13:20] [INFO ] [Nat]Absence check using 48 positive place invariants in 60 ms returned sat
[2022-06-12 21:13:20] [INFO ] [Nat]Absence check using 48 positive and 151 generalized place invariants in 79 ms returned sat
[2022-06-12 21:13:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:13:23] [INFO ] [Nat]Absence check using state equation in 2568 ms returned sat
[2022-06-12 21:13:23] [INFO ] Computed and/alt/rep : 2147/4728/2147 causal constraints (skipped 419 transitions) in 284 ms.
[2022-06-12 21:13:25] [INFO ] Added : 10 causal constraints over 2 iterations in 1554 ms. Result :unknown
[2022-06-12 21:13:25] [INFO ] [Real]Absence check using 48 positive place invariants in 82 ms returned sat
[2022-06-12 21:13:25] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 168 ms returned sat
[2022-06-12 21:13:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:13:30] [INFO ] [Real]Absence check using state equation in 4346 ms returned unknown
[2022-06-12 21:13:30] [INFO ] [Real]Absence check using 48 positive place invariants in 50 ms returned sat
[2022-06-12 21:13:30] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 90 ms returned sat
[2022-06-12 21:13:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:13:32] [INFO ] [Real]Absence check using state equation in 1271 ms returned sat
[2022-06-12 21:13:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:13:33] [INFO ] [Real]Absence check using 48 positive place invariants in 49 ms returned sat
[2022-06-12 21:13:33] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 91 ms returned sat
[2022-06-12 21:13:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:13:35] [INFO ] [Real]Absence check using state equation in 1332 ms returned sat
[2022-06-12 21:13:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:13:36] [INFO ] [Real]Absence check using 48 positive place invariants in 36 ms returned sat
[2022-06-12 21:13:36] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 56 ms returned sat
[2022-06-12 21:13:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:13:37] [INFO ] [Real]Absence check using state equation in 1060 ms returned sat
[2022-06-12 21:13:37] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:13:38] [INFO ] [Real]Absence check using 48 positive place invariants in 46 ms returned sat
[2022-06-12 21:13:38] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 74 ms returned sat
[2022-06-12 21:13:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:13:40] [INFO ] [Real]Absence check using state equation in 1809 ms returned sat
[2022-06-12 21:13:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:13:40] [INFO ] [Nat]Absence check using 48 positive place invariants in 53 ms returned sat
[2022-06-12 21:13:40] [INFO ] [Nat]Absence check using 48 positive and 151 generalized place invariants in 67 ms returned sat
[2022-06-12 21:13:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:13:44] [INFO ] [Nat]Absence check using state equation in 3956 ms returned sat
[2022-06-12 21:13:46] [INFO ] Deduced a trap composed of 63 places in 1852 ms of which 8 ms to minimize.
[2022-06-12 21:13:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
FORMULA ASLink-PT-04b-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-04b-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-04b-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 20000 steps, including 190 resets, run finished after 112 ms. (steps per millisecond=178 ) properties (out of 5) seen :1 could not realise parikh vector
FORMULA ASLink-PT-04b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 52 out of 2034 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2034/2034 places, 2567/2567 transitions.
Drop transitions removed 431 transitions
Trivial Post-agglo rules discarded 431 transitions
Performed 431 trivial Post agglomeration. Transition count delta: 431
Iterating post reduction 0 with 431 rules applied. Total rules applied 431 place count 2034 transition count 2136
Reduce places removed 431 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 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 453 rules applied. Total rules applied 884 place count 1603 transition count 2114
Reduce places removed 6 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 16 rules applied. Total rules applied 900 place count 1597 transition count 2104
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 910 place count 1587 transition count 2104
Performed 448 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 448 Pre rules applied. Total rules applied 910 place count 1587 transition count 1656
Deduced a syphon composed of 448 places in 18 ms
Ensure Unique test removed 40 places
Reduce places removed 488 places and 0 transitions.
Iterating global reduction 4 with 936 rules applied. Total rules applied 1846 place count 1099 transition count 1656
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 4 with 30 rules applied. Total rules applied 1876 place count 1094 transition count 1631
Reduce places removed 25 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 27 rules applied. Total rules applied 1903 place count 1069 transition count 1629
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1905 place count 1067 transition count 1629
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 13 Pre rules applied. Total rules applied 1905 place count 1067 transition count 1616
Deduced a syphon composed of 13 places in 4 ms
Ensure Unique test removed 11 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 7 with 37 rules applied. Total rules applied 1942 place count 1043 transition count 1616
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 11 Pre rules applied. Total rules applied 1942 place count 1043 transition count 1605
Deduced a syphon composed of 11 places in 8 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 1964 place count 1032 transition count 1605
Discarding 62 places :
Symmetric choice reduction at 7 with 62 rule applications. Total rules 2026 place count 970 transition count 1543
Iterating global reduction 7 with 62 rules applied. Total rules applied 2088 place count 970 transition count 1543
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2089 place count 970 transition count 1542
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 20 Pre rules applied. Total rules applied 2089 place count 970 transition count 1522
Deduced a syphon composed of 20 places in 7 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 8 with 41 rules applied. Total rules applied 2130 place count 949 transition count 1522
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2130 place count 949 transition count 1521
Deduced a syphon composed of 1 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 2133 place count 947 transition count 1521
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 2137 place count 943 transition count 1497
Iterating global reduction 8 with 4 rules applied. Total rules applied 2141 place count 943 transition count 1497
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 3 Pre rules applied. Total rules applied 2141 place count 943 transition count 1494
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 2147 place count 940 transition count 1494
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 3 ms
Ensure Unique test removed 2 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 8 with 228 rules applied. Total rules applied 2375 place count 825 transition count 1381
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2376 place count 824 transition count 1380
Ensure Unique test removed 1 places
Iterating global reduction 8 with 2 rules applied. Total rules applied 2378 place count 823 transition count 1380
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2379 place count 822 transition count 1379
Iterating global reduction 8 with 1 rules applied. Total rules applied 2380 place count 822 transition count 1379
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 2382 place count 822 transition count 1377
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2383 place count 821 transition count 1377
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2385 place count 820 transition count 1386
Free-agglomeration rule applied 6 times.
Iterating global reduction 10 with 6 rules applied. Total rules applied 2391 place count 820 transition count 1380
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 2397 place count 814 transition count 1380
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 2401 place count 814 transition count 1376
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 2405 place count 810 transition count 1376
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 2407 place count 810 transition count 1376
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 2408 place count 809 transition count 1375
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 12 with 4 rules applied. Total rules applied 2412 place count 806 transition count 1374
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 2413 place count 805 transition count 1374
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 4 Pre rules applied. Total rules applied 2413 place count 805 transition count 1370
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 14 with 8 rules applied. Total rules applied 2421 place count 801 transition count 1370
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 14 with 2 rules applied. Total rules applied 2423 place count 799 transition count 1370
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 15 with 8 rules applied. Total rules applied 2431 place count 795 transition count 1366
Discarding 2 places :
Symmetric choice reduction at 15 with 2 rule applications. Total rules 2433 place count 793 transition count 1364
Iterating global reduction 15 with 2 rules applied. Total rules applied 2435 place count 793 transition count 1364
Free-agglomeration rule applied 2 times.
Iterating global reduction 15 with 2 rules applied. Total rules applied 2437 place count 793 transition count 1362
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 2439 place count 791 transition count 1362
Applied a total of 2439 rules in 1559 ms. Remains 791 /2034 variables (removed 1243) and now considering 1362/2567 (removed 1205) transitions.
Finished structural reductions, in 1 iterations. Remains : 791/2034 places, 1362/2567 transitions.
[2022-06-12 21:13:48] [INFO ] Flatten gal took : 240 ms
[2022-06-12 21:13:48] [INFO ] Flatten gal took : 113 ms
[2022-06-12 21:13:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6704615672449864144.gal : 46 ms
[2022-06-12 21:13:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3534030190299225271.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality6704615672449864144.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality3534030190299225271.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality6704615672449864144.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality3534030190299225271.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality3534030190299225271.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :8 after 15
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :15 after 37
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :37 after 121
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :121 after 125524
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :125524 after 9.42873e+07
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :9.42873e+07 after 2.17779e+08
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :2.17779e+08 after 2.17832e+08
Reachability property ASLink-PT-04b-ReachabilityCardinality-15 is true.
FORMULA ASLink-PT-04b-ReachabilityCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Detected timeout of ITS tools.
[2022-06-12 21:14:04] [INFO ] Flatten gal took : 86 ms
[2022-06-12 21:14:04] [INFO ] Applying decomposition
[2022-06-12 21:14:04] [INFO ] Flatten gal took : 66 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph3016498415654754907.txt, -o, /tmp/graph3016498415654754907.bin, -w, /tmp/graph3016498415654754907.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph3016498415654754907.bin, -l, -1, -v, -w, /tmp/graph3016498415654754907.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:14:05] [INFO ] Decomposing Gal with order
[2022-06-12 21:14:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:14:05] [INFO ] Removed a total of 2121 redundant transitions.
[2022-06-12 21:14:05] [INFO ] Flatten gal took : 248 ms
[2022-06-12 21:14:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 49 labels/synchronizations in 60 ms.
[2022-06-12 21:14:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17630401834583872979.gal : 24 ms
[2022-06-12 21:14:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3839087908742178326.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality17630401834583872979.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality3839087908742178326.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality17630401834583872979.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality3839087908742178326.prop --nowitness
Loading property file /tmp/ReachabilityCardinality3839087908742178326.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 2
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :2 after 9
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :9 after 24
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :24 after 643
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :643 after 47985
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :47985 after 2.99124e+08
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :8.72311e+08 after 1.31964e+11
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15776177828433026291
[2022-06-12 21:14:20] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15776177828433026291
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15776177828433026291]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15776177828433026291] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15776177828433026291] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 9811 resets, run finished after 3910 ms. (steps per millisecond=255 ) properties (out of 3) seen :1
FORMULA ASLink-PT-04b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 2393 resets, run finished after 924 ms. (steps per millisecond=1082 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2265 resets, run finished after 1761 ms. (steps per millisecond=567 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1362 rows 791 cols
[2022-06-12 21:14:28] [INFO ] Computed 133 place invariants in 135 ms
[2022-06-12 21:14:28] [INFO ] [Real]Absence check using 32 positive place invariants in 17 ms returned sat
[2022-06-12 21:14:28] [INFO ] [Real]Absence check using 32 positive and 101 generalized place invariants in 90 ms returned sat
[2022-06-12 21:14:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:29] [INFO ] [Real]Absence check using state equation in 676 ms returned sat
[2022-06-12 21:14:29] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:14:29] [INFO ] [Nat]Absence check using 32 positive place invariants in 16 ms returned sat
[2022-06-12 21:14:29] [INFO ] [Nat]Absence check using 32 positive and 101 generalized place invariants in 27 ms returned sat
[2022-06-12 21:14:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:30] [INFO ] [Nat]Absence check using state equation in 607 ms returned sat
[2022-06-12 21:14:30] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-06-12 21:14:30] [INFO ] [Nat]Added 16 Read/Feed constraints in 185 ms returned sat
[2022-06-12 21:14:30] [INFO ] Computed and/alt/rep : 553/2556/553 causal constraints (skipped 793 transitions) in 144 ms.
[2022-06-12 21:14:41] [INFO ] Added : 392 causal constraints over 79 iterations in 10985 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 37 ms.
[2022-06-12 21:14:42] [INFO ] [Real]Absence check using 32 positive place invariants in 15 ms returned sat
[2022-06-12 21:14:42] [INFO ] [Real]Absence check using 32 positive and 101 generalized place invariants in 29 ms returned sat
[2022-06-12 21:14:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:43] [INFO ] [Real]Absence check using state equation in 1121 ms returned sat
[2022-06-12 21:14:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:14:43] [INFO ] [Nat]Absence check using 32 positive place invariants in 15 ms returned sat
[2022-06-12 21:14:43] [INFO ] [Nat]Absence check using 32 positive and 101 generalized place invariants in 9 ms returned unsat
FORMULA ASLink-PT-04b-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 2 Parikh solutions to 1 different solutions.
Incomplete Parikh walk after 538300 steps, including 3610 resets, run finished after 1164 ms. (steps per millisecond=462 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 791 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 791/791 places, 1362/1362 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 791 transition count 1345
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 774 transition count 1345
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 34 place count 774 transition count 1313
Deduced a syphon composed of 32 places in 3 ms
Ensure Unique test removed 5 places
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 69 rules applied. Total rules applied 103 place count 737 transition count 1313
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 103 place count 737 transition count 1312
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 105 place count 736 transition count 1312
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 106 place count 735 transition count 1303
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 735 transition count 1303
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 734 transition count 1295
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 734 transition count 1295
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 110 place count 733 transition count 1287
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 733 transition count 1287
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 112 place count 732 transition count 1279
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 732 transition count 1279
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 114 place count 731 transition count 1271
Iterating global reduction 2 with 1 rules applied. Total rules applied 115 place count 731 transition count 1271
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 116 place count 730 transition count 1263
Iterating global reduction 2 with 1 rules applied. Total rules applied 117 place count 730 transition count 1263
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 118 place count 729 transition count 1255
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 729 transition count 1255
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 120 place count 728 transition count 1247
Iterating global reduction 2 with 1 rules applied. Total rules applied 121 place count 728 transition count 1247
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 122 place count 727 transition count 1239
Iterating global reduction 2 with 1 rules applied. Total rules applied 123 place count 727 transition count 1239
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 124 place count 726 transition count 1231
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 726 transition count 1231
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 126 place count 725 transition count 1223
Iterating global reduction 2 with 1 rules applied. Total rules applied 127 place count 725 transition count 1223
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 128 place count 724 transition count 1215
Iterating global reduction 2 with 1 rules applied. Total rules applied 129 place count 724 transition count 1215
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 130 place count 723 transition count 1207
Iterating global reduction 2 with 1 rules applied. Total rules applied 131 place count 723 transition count 1207
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 132 place count 722 transition count 1199
Iterating global reduction 2 with 1 rules applied. Total rules applied 133 place count 722 transition count 1199
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 134 place count 721 transition count 1191
Iterating global reduction 2 with 1 rules applied. Total rules applied 135 place count 721 transition count 1191
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 136 place count 720 transition count 1183
Iterating global reduction 2 with 1 rules applied. Total rules applied 137 place count 720 transition count 1183
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 138 place count 719 transition count 1175
Iterating global reduction 2 with 1 rules applied. Total rules applied 139 place count 719 transition count 1175
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 21 rules applied. Total rules applied 160 place count 708 transition count 1165
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 160 place count 708 transition count 1163
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 164 place count 706 transition count 1163
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 166 place count 705 transition count 1162
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 167 place count 705 transition count 1161
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 168 place count 704 transition count 1161
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 169 place count 703 transition count 1160
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 170 place count 702 transition count 1159
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 176 place count 698 transition count 1157
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 178 place count 696 transition count 1157
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 178 place count 696 transition count 1151
Deduced a syphon composed of 6 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 13 rules applied. Total rules applied 191 place count 689 transition count 1151
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 194 place count 686 transition count 1151
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 194 place count 686 transition count 1150
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 196 place count 685 transition count 1150
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 206 place count 680 transition count 1145
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 208 place count 678 transition count 1143
Iterating global reduction 6 with 2 rules applied. Total rules applied 210 place count 678 transition count 1143
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 212 place count 678 transition count 1141
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 214 place count 676 transition count 1141
Applied a total of 214 rules in 961 ms. Remains 676 /791 variables (removed 115) and now considering 1141/1362 (removed 221) transitions.
Finished structural reductions, in 1 iterations. Remains : 676/791 places, 1141/1362 transitions.
[2022-06-12 21:14:45] [INFO ] Flatten gal took : 41 ms
[2022-06-12 21:14:45] [INFO ] Flatten gal took : 42 ms
[2022-06-12 21:14:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5392695055364630959.gal : 7 ms
[2022-06-12 21:14:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12834547804596723578.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality5392695055364630959.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality12834547804596723578.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality5392695055364630959.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality12834547804596723578.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality12834547804596723578.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3 after 6
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :6 after 9
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :9 after 93
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :93 after 1071
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1071 after 189105
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :189105 after 1.27417e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.27417e+07 after 1.29012e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.29012e+07 after 1.32717e+07
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.32717e+07 after 1.93132e+08
Invariant property ASLink-PT-04b-ReachabilityCardinality-00 does not hold.
FORMULA ASLink-PT-04b-ReachabilityCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 4097 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.91164e+09,2.96209,71136,2,48382,17,174637,6,0,3848,128308,0
Total reachable state count : 1911644912

Verifying 1 reachability properties.
Invariant property ASLink-PT-04b-ReachabilityCardinality-00 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ASLink-PT-04b-ReachabilityCardinality-00,1,2.97991,71136,2,677,17,174637,7,0,3851,128308,0
All properties solved without resorting to model-checking.

BK_STOP 1655068488964

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-04b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is ASLink-PT-04b, 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 r010-tajo-165245701500026"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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