Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r444-smll-171701110500006.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is UtahNoC-PT-none, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r444-smll-171701110500006
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 23 08:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 08:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 08:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 10:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 10:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 12 10:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 12 10:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 205K May 18 16:43 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 UtahNoC-PT-none-ReachabilityCardinality-2024-00
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-2024-01
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-2024-02
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-2024-03
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-2024-04
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-2024-05
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-2024-06
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-2024-07
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-2024-08
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-2024-09
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-2024-10
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-2024-11
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-2024-12
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-2024-13
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-2024-14
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717071140416

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtahNoC-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-30 12:12:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 12:12:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 12:12:23] [INFO ] Load time of PNML (sax parser for PT used): 309 ms
[2024-05-30 12:12:23] [INFO ] Transformed 216 places.
[2024-05-30 12:12:23] [INFO ] Transformed 977 transitions.
[2024-05-30 12:12:23] [INFO ] Found NUPN structural information;
[2024-05-30 12:12:23] [INFO ] Parsed PT model containing 216 places and 977 transitions and 2905 arcs in 514 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 31 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 148 transitions
Reduce redundant transitions removed 148 transitions.
FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2691 ms. (14 steps per ms) remains 4/12 properties
FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 339 ms. (117 steps per ms) remains 4/4 properties
[2024-05-30 12:12:24] [INFO ] Flatten gal took : 273 ms
BEST_FIRST walk for 40003 steps (8 resets) in 768 ms. (52 steps per ms) remains 4/4 properties
[2024-05-30 12:12:24] [INFO ] Flatten gal took : 248 ms
BEST_FIRST walk for 40004 steps (8 resets) in 304 ms. (131 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 525 ms. (76 steps per ms) remains 4/4 properties
[2024-05-30 12:12:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4776128380555214007.gal : 129 ms
[2024-05-30 12:12:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6169863455682815973.prop : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4776128380555214007.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6169863455682815973.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
[2024-05-30 12:12:25] [INFO ] Flow matrix only has 427 transitions (discarded 402 similar events)
// Phase 1: matrix 427 rows 216 cols
[2024-05-30 12:12:25] [INFO ] Computed 8 invariants in 32 ms
Loading property file /tmp/ReachabilityCardinality6169863455682815973.prop.
[2024-05-30 12:12:25] [INFO ] State equation strengthened by 43 read => feed constraints.
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 5
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :5 after 12
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :12 after 20
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :20 after 478
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :478 after 489
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :489 after 692
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :692 after 10882
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :10882 after 116923
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 145/216 variables, 8/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :116923 after 486685
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 145/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :486685 after 1.01316e+06
At refinement iteration 5 (OVERLAPS) 426/642 variables, 216/440 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 42/482 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/642 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/643 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/643 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/643 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 643/643 variables, and 483 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1129 ms.
Refiners :[Domain max(s): 216/216 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 216/216 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem UtahNoC-PT-none-ReachabilityCardinality-2024-04 is UNSAT
FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 145/216 variables, 8/79 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 145/224 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/224 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 426/642 variables, 216/440 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 42/482 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/642 variables, 3/485 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/642 variables, 0/485 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/643 variables, 1/486 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/643 variables, 0/486 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-30 12:12:28] [INFO ] Deduced a trap composed of 117 places in 209 ms of which 31 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/643 variables, 1/487 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/643 variables, 0/487 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/643 variables, 0/487 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 643/643 variables, and 487 constraints, problems are : Problem set: 1 solved, 3 unsolved in 2049 ms.
Refiners :[Domain max(s): 216/216 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 216/216 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 3462ms problems are : Problem set: 1 solved, 3 unsolved
FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-03 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 915 ms.
Support contains 60 out of 216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 829/829 transitions.
Graph (trivial) has 224 edges and 216 vertex of which 46 / 216 are part of one of the 13 SCC in 13 ms
Free SCC test removed 33 places
Drop transitions (Empty/Sink Transition effects.) removed 178 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 196 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 183 transition count 631
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 181 transition count 631
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 181 transition count 630
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 7 place count 180 transition count 630
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 33 place count 154 transition count 529
Iterating global reduction 2 with 26 rules applied. Total rules applied 59 place count 154 transition count 529
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 81 place count 154 transition count 507
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 85 place count 150 transition count 494
Iterating global reduction 3 with 4 rules applied. Total rules applied 89 place count 150 transition count 494
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 92 place count 150 transition count 491
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 4 with 6 rules applied. Total rules applied 98 place count 147 transition count 488
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 102 place count 147 transition count 484
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 103 place count 146 transition count 482
Iterating global reduction 5 with 1 rules applied. Total rules applied 104 place count 146 transition count 482
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 105 place count 146 transition count 481
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 109 place count 144 transition count 489
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 6 with 12 rules applied. Total rules applied 121 place count 144 transition count 477
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 125 place count 144 transition count 473
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 129 place count 140 transition count 473
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 132 place count 140 transition count 473
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 133 place count 140 transition count 472
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 134 place count 140 transition count 471
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 135 place count 139 transition count 471
Applied a total of 135 rules in 263 ms. Remains 139 /216 variables (removed 77) and now considering 471/829 (removed 358) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 284 ms. Remains : 139/216 places, 471/829 transitions.
RANDOM walk for 40000 steps (8 resets) in 611 ms. (65 steps per ms) remains 1/2 properties
FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 1/1 properties
[2024-05-30 12:12:30] [INFO ] Flow matrix only has 278 transitions (discarded 193 similar events)
// Phase 1: matrix 278 rows 139 cols
[2024-05-30 12:12:30] [INFO ] Computed 8 invariants in 11 ms
[2024-05-30 12:12:30] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 92/136 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/139 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 278/417 variables, 139/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/417 variables, 45/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/417 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 192 constraints, problems are : Problem set: 0 solved, 1 unsolved in 302 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 139/139 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 92/136 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/139 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 278/417 variables, 139/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/417 variables, 45/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/417 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 417/417 variables, and 193 constraints, problems are : Problem set: 0 solved, 1 unsolved in 512 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 139/139 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 869ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 44 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 471/471 transitions.
Graph (trivial) has 61 edges and 139 vertex of which 13 / 139 are part of one of the 3 SCC in 0 ms
Free SCC test removed 10 places
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 33 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 129 transition count 437
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 128 transition count 437
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 6 rules applied. Total rules applied 9 place count 128 transition count 431
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 127 transition count 431
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 14 place count 123 transition count 419
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 123 transition count 419
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 23 place count 123 transition count 414
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 25 place count 122 transition count 413
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 27 place count 122 transition count 411
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 29 place count 121 transition count 410
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 30 place count 121 transition count 409
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 34 place count 121 transition count 409
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 35 place count 121 transition count 408
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 36 place count 120 transition count 407
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 56 edges and 118 vertex of which 11 / 118 are part of one of the 4 SCC in 0 ms
Free SCC test removed 7 places
Iterating post reduction 6 with 3 rules applied. Total rules applied 39 place count 111 transition count 407
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 57 place count 111 transition count 389
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 61 place count 107 transition count 373
Iterating global reduction 8 with 4 rules applied. Total rules applied 65 place count 107 transition count 373
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 69 place count 107 transition count 369
Free-agglomeration rule applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 73 place count 107 transition count 365
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 84 place count 103 transition count 358
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 85 place count 102 transition count 357
Applied a total of 85 rules in 190 ms. Remains 102 /139 variables (removed 37) and now considering 357/471 (removed 114) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 102/139 places, 357/471 transitions.
RANDOM walk for 40000 steps (8 resets) in 204 ms. (195 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1212779 steps, run timeout after 3001 ms. (steps per millisecond=404 ) properties seen :0 out of 1
Probabilistic random walk after 1212779 steps, saw 653617 distinct states, run finished after 3009 ms. (steps per millisecond=403 ) properties seen :0
[2024-05-30 12:12:34] [INFO ] Flow matrix only has 210 transitions (discarded 147 similar events)
// Phase 1: matrix 210 rows 102 cols
[2024-05-30 12:12:34] [INFO ] Computed 6 invariants in 1 ms
[2024-05-30 12:12:34] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 58/102 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 210/312 variables, 102/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/312 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 312/312 variables, and 128 constraints, problems are : Problem set: 0 solved, 1 unsolved in 168 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 102/102 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 58/102 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 210/312 variables, 102/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/312 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 312/312 variables, and 129 constraints, problems are : Problem set: 0 solved, 1 unsolved in 239 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 102/102 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 494ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 44 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 357/357 transitions.
Applied a total of 0 rules in 11 ms. Remains 102 /102 variables (removed 0) and now considering 357/357 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 102/102 places, 357/357 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 357/357 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 357/357 (removed 0) transitions.
[2024-05-30 12:12:34] [INFO ] Flow matrix only has 210 transitions (discarded 147 similar events)
[2024-05-30 12:12:34] [INFO ] Invariant cache hit.
[2024-05-30 12:12:34] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-30 12:12:34] [INFO ] Flow matrix only has 210 transitions (discarded 147 similar events)
[2024-05-30 12:12:34] [INFO ] Invariant cache hit.
[2024-05-30 12:12:34] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-30 12:12:34] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2024-05-30 12:12:35] [INFO ] Redundant transitions in 26 ms returned []
Running 342 sub problems to find dead transitions.
[2024-05-30 12:12:35] [INFO ] Flow matrix only has 210 transitions (discarded 147 similar events)
[2024-05-30 12:12:35] [INFO ] Invariant cache hit.
[2024-05-30 12:12:35] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-05-30 12:12:36] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 5 (OVERLAPS) 210/312 variables, 102/109 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 20/129 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 8 (OVERLAPS) 0/312 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 342 unsolved
No progress, stopping.
After SMT solving in domain Real declared 312/312 variables, and 129 constraints, problems are : Problem set: 0 solved, 342 unsolved in 12720 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 102/102 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 342/342 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 342 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 5 (OVERLAPS) 210/312 variables, 102/109 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 20/129 constraints. Problems are: Problem set: 0 solved, 342 unsolved
Invariant property UtahNoC-PT-none-ReachabilityCardinality-2024-06 does not hold.
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :1.01316e+06 after 1.13643e+07
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 342/471 constraints. Problems are: Problem set: 0 solved, 342 unsolved
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :1.13643e+07 after 1.94562e+07
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 9 (OVERLAPS) 0/312 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 342 unsolved
No progress, stopping.
After SMT solving in domain Int declared 312/312 variables, and 471 constraints, problems are : Problem set: 0 solved, 342 unsolved in 13560 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 102/102 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 342/342 constraints, Known Traps: 1/1 constraints]
After SMT, in 26595ms problems are : Problem set: 0 solved, 342 unsolved
Search for dead transitions found 0 dead transitions in 26605ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26865 ms. Remains : 102/102 places, 357/357 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 115 edges and 102 vertex of which 20 / 102 are part of one of the 7 SCC in 1 ms
Free SCC test removed 13 places
Drop transitions (Empty/Sink Transition effects.) removed 91 transitions
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 175 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 89 transition count 180
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 87 transition count 178
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 85 transition count 178
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 9 place count 85 transition count 176
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 13 place count 83 transition count 176
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 16 place count 80 transition count 173
Iterating global reduction 3 with 3 rules applied. Total rules applied 19 place count 80 transition count 173
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 31 place count 74 transition count 167
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 35 place count 74 transition count 163
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 36 place count 73 transition count 163
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 49 place count 73 transition count 150
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 51 place count 73 transition count 148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 53 place count 71 transition count 148
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 54 place count 71 transition count 148
Applied a total of 54 rules in 32 ms. Remains 71 /102 variables (removed 31) and now considering 148/357 (removed 209) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 148 rows 71 cols
[2024-05-30 12:13:01] [INFO ] Computed 6 invariants in 1 ms
[2024-05-30 12:13:01] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-30 12:13:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-30 12:13:01] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-30 12:13:01] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-30 12:13:01] [INFO ] After 36ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-30 12:13:01] [INFO ] After 74ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-30 12:13:01] [INFO ] After 245ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-30 12:13:02] [INFO ] Flatten gal took : 16 ms
[2024-05-30 12:13:02] [INFO ] Flatten gal took : 12 ms
[2024-05-30 12:13:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1269786782519920910.gal : 2 ms
[2024-05-30 12:13:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1966296077623743757.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1269786782519920910.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1966296077623743757.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality1966296077623743757.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 24
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :24 after 354
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :354 after 473
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :473 after 8424
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :8424 after 19656
Invariant property UtahNoC-PT-none-ReachabilityCardinality-2024-12 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 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,529686,0.217308,5280,2,676,13,8288,6,0,435,4360,0
Total reachable state count : 529686

Verifying 1 reachability properties.
Invariant property UtahNoC-PT-none-ReachabilityCardinality-2024-12 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
UtahNoC-PT-none-ReachabilityCardinality-2024-12,6,0.308647,5540,2,88,13,8288,7,0,565,4360,0
ITS tools runner thread asked to quit. Dying gracefully.
Over-approximation ignoring read arcs solved 0 properties in 708 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-30 12:13:02] [INFO ] Flatten gal took : 55 ms
[2024-05-30 12:13:02] [INFO ] Applying decomposition
[2024-05-30 12:13:02] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5831286106534218928.txt' '-o' '/tmp/graph5831286106534218928.bin' '-w' '/tmp/graph5831286106534218928.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5831286106534218928.bin' '-l' '-1' '-v' '-w' '/tmp/graph5831286106534218928.weights' '-q' '0' '-e' '0.001'
[2024-05-30 12:13:02] [INFO ] Decomposing Gal with order
[2024-05-30 12:13:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 12:13:02] [INFO ] Removed a total of 816 redundant transitions.
[2024-05-30 12:13:02] [INFO ] Flatten gal took : 139 ms
[2024-05-30 12:13:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 328 labels/synchronizations in 34 ms.
[2024-05-30 12:13:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13252324822291764058.gal : 11 ms
[2024-05-30 12:13:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16829960568689469041.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13252324822291764058.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16829960568689469041.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality16829960568689469041.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1225
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1225 after 2485
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2485 after 5.79516e+06
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\_mod\_flat,4.75992e+09,0.34486,13260,718,40,18976,641,892,26767,110,2077,0
Total reachable state count : 4759924249

Verifying 1 reachability properties.
Invariant property UtahNoC-PT-none-ReachabilityCardinality-2024-12 does not hold.
FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
UtahNoC-PT-none-ReachabilityCardinality-2024-12,1845,0.372843,13260,107,24,18976,641,963,26767,122,2077,8764
All properties solved without resorting to model-checking.
Total runtime 40579 ms.

BK_STOP 1717071183503

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="UtahNoC-PT-none"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is UtahNoC-PT-none, 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 r444-smll-171701110500006"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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