fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r290-tajo-171654446400110
Last Updated
July 7, 2024

About the Execution of ITS-Tools for PolyORBLF-COL-S02J06T08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2164.804 57088.00 142209.00 81.10 TFFFTFFFTFFTFFFT 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/mcc2024-input.r290-tajo-171654446400110.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBLF-COL-S02J06T08, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446400110
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 8.3K Apr 11 17:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 11 17:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 11 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 11 17:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.9K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 11 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 11 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Apr 11 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K 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 PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-00
FORMULA_NAME PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-01
FORMULA_NAME PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-02
FORMULA_NAME PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-03
FORMULA_NAME PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-04
FORMULA_NAME PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-05
FORMULA_NAME PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-06
FORMULA_NAME PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-07
FORMULA_NAME PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-08
FORMULA_NAME PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-09
FORMULA_NAME PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-10
FORMULA_NAME PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-11
FORMULA_NAME PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-12
FORMULA_NAME PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-13
FORMULA_NAME PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-14
FORMULA_NAME PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716906812221

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J06T08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
ReachabilityCardinality COL
Running Version 202405141337
[2024-05-28 14:33:33] [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-28 14:33:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 14:33:34] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-28 14:33:34] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 14:33:35] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 920 ms
[2024-05-28 14:33:35] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 690 PT places and 1492.0 transition bindings in 37 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 32 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 14:33:35] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-05-28 14:33:35] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
[2024-05-28 14:33:35] [INFO ] Flatten gal took : 121 ms
[2024-05-28 14:33:35] [INFO ] Flatten gal took : 27 ms
[2024-05-28 14:33:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6708374486184436987.gal : 25 ms
[2024-05-28 14:33:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5529280412006960558.prop : 21 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/ReachabilityCardinality6708374486184436987.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5529280412006960558.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/ReachabilityCardinality5529280412006960558.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :8 after 11
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :11 after 21
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :21 after 47
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :47 after 66
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :66 after 117
Invariant property PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-13 does not hold.
Invariant property PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-10 does not hold.
Invariant property PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-05 does not hold.
Invariant property PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-02 does not hold.
Invariant property PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-01 does not hold.
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :117 after 264
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :264 after 548
RANDOM walk for 40000 steps (18 resets) in 2660 ms. (15 steps per ms) remains 11/16 properties
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :548 after 2733
BEST_FIRST walk for 40002 steps (8 resets) in 501 ms. (79 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (8 resets) in 548 ms. (72 steps per ms) remains 11/11 properties
Reachability property PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-08 is true.
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :2733 after 5591
BEST_FIRST walk for 40001 steps (21 resets) in 683 ms. (58 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (12 resets) in 429 ms. (93 steps per ms) remains 11/11 properties
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :5591 after 19088
BEST_FIRST walk for 40001 steps (11 resets) in 284 ms. (140 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (15 resets) in 356 ms. (112 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (12 resets) in 212 ms. (187 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (12 resets) in 368 ms. (108 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 327 ms. (121 steps per ms) remains 11/11 properties
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :41341 after 46868
BEST_FIRST walk for 40001 steps (13 resets) in 316 ms. (126 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (12 resets) in 231 ms. (172 steps per ms) remains 11/11 properties
[2024-05-28 14:33:38] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 14:33:38] [INFO ] Computed 26 invariants in 7 ms
[2024-05-28 14:33:38] [INFO ] State equation strengthened by 8 read => feed constraints.
Problem PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-03 is UNSAT
Problem PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-04 is UNSAT
Problem PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-06 is UNSAT
Problem PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-09 is UNSAT
Problem PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-12 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 8/8 constraints. Problems are: Problem set: 5 solved, 5 unsolved
Problem PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-07 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 11/19 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/19 constraints. Problems are: Problem set: 6 solved, 4 unsolved
Problem PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-00 is UNSAT
Problem PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-14 is UNSAT
At refinement iteration 3 (OVERLAPS) 2/81 variables, 3/22 constraints. Problems are: Problem set: 8 solved, 2 unsolved
Problem PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-15 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 4/26 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/26 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 64/145 variables, 81/107 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 8/115 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 9 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 9 solved, 1 unsolved in 578 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 2/2 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 4/6 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/6 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/72 variables, 8/14 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 2/16 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/16 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/73 variables, 1/17 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/17 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/81 variables, 9/26 constraints. Problems are: Problem set: 9 solved, 1 unsolved
[2024-05-28 14:33:39] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 6 ms to minimize.
SDD proceeding with computation,10 properties remain. new max is 8192
SDD size :92955 after 101105
[2024-05-28 14:33:39] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 2 ms to minimize.
[2024-05-28 14:33:39] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 8 ms to minimize.
[2024-05-28 14:33:39] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
Problem PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-11 is UNSAT
After SMT solving in domain Int declared 81/145 variables, and 30 constraints, problems are : Problem set: 10 solved, 0 unsolved in 638 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 0/81 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 0/10 constraints, Known Traps: 4/4 constraints]
After SMT, in 1360ms problems are : Problem set: 10 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-05-28 14:33:39] [INFO ] Flatten gal took : 8 ms
[2024-05-28 14:33:39] [INFO ] Flatten gal took : 6 ms
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-05-28 14:33:39] [INFO ] Flatten gal took : 5 ms
[2024-05-28 14:33:39] [INFO ] Flatten gal took : 5 ms
[2024-05-28 14:33:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2306466786984175185.gal : 2 ms
[2024-05-28 14:33:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16370207630319608323.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/ReachabilityCardinality2306466786984175185.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16370207630319608323.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 ...329
Loading property file /tmp/ReachabilityCardinality16370207630319608323.prop.
ITS runner timed out or was interrupted.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 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,5,0.009603,4076,2,156,5,310,6,0,419,107,0
Total reachable state count : 5

ITS tools runner thread asked to quit. Dying gracefully.
FORMULA PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-00 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-03 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-04 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-06 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-07 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-09 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-11 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-12 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-14 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-15 TRUE TECHNIQUES CPN_APPROX
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-28 14:33:39] [INFO ] Unfolded HLPN to a Petri net with 690 places and 1434 transitions 6564 arcs in 54 ms.
[2024-05-28 14:33:39] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
RANDOM walk for 40000 steps (10 resets) in 614 ms. (65 steps per ms) remains 1/6 properties
FORMULA PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-28 14:33:39] [INFO ] Flatten gal took : 271 ms
BEST_FIRST walk for 40002 steps (9 resets) in 727 ms. (54 steps per ms) remains 1/1 properties
[2024-05-28 14:33:40] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
// Phase 1: matrix 1290 rows 690 cols
[2024-05-28 14:33:40] [INFO ] Computed 54 invariants in 98 ms
[2024-05-28 14:33:40] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:33:40] [INFO ] Flatten gal took : 302 ms
[2024-05-28 14:33:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3119216972089968257.gal : 73 ms
[2024-05-28 14:33:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14305381612600337379.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/ReachabilityCardinality3119216972089968257.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14305381612600337379.prop' '--nowitness' '--gen-order' 'FOLLOW'
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved

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 ...329
At refinement iteration 1 (OVERLAPS) 209/490 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/490 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/490 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 196/686 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/686 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/688 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/688 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/690 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/690 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Loading property file /tmp/ReachabilityCardinality14305381612600337379.prop.
At refinement iteration 10 (OVERLAPS) 1290/1980 variables, 690/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 11
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :11 after 12
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :12 after 13
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :13 after 41
At refinement iteration 11 (INCLUDED_ONLY) 0/1980 variables, 96/840 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :41 after 83
At refinement iteration 12 (INCLUDED_ONLY) 0/1980 variables, 0/840 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1980 variables, 0/840 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1980/1980 variables, and 840 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1722 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 690/690 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
[2024-05-28 14:33:42] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/281 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 209/490 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/490 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/490 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 196/686 variables, 34/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 14:33:42] [INFO ] Deduced a trap composed of 73 places in 324 ms of which 9 ms to minimize.
[2024-05-28 14:33:42] [INFO ] Deduced a trap composed of 74 places in 274 ms of which 11 ms to minimize.
[2024-05-28 14:33:43] [INFO ] Deduced a trap composed of 69 places in 299 ms of which 4 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :433 after 3513
[2024-05-28 14:33:43] [INFO ] Deduced a trap composed of 315 places in 394 ms of which 13 ms to minimize.
[2024-05-28 14:33:44] [INFO ] Deduced a trap composed of 69 places in 425 ms of which 7 ms to minimize.
[2024-05-28 14:33:44] [INFO ] Deduced a trap composed of 74 places in 113 ms of which 2 ms to minimize.
[2024-05-28 14:33:44] [INFO ] Deduced a trap composed of 74 places in 106 ms of which 2 ms to minimize.
[2024-05-28 14:33:44] [INFO ] Deduced a trap composed of 74 places in 91 ms of which 2 ms to minimize.
[2024-05-28 14:33:44] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 1 ms to minimize.
[2024-05-28 14:33:44] [INFO ] Deduced a trap composed of 73 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/686 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/686 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/688 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/688 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/690 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/690 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3513 after 3849
At refinement iteration 12 (OVERLAPS) 1290/1980 variables, 690/755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1980/1980 variables, and 851 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4288 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 690/690 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 11/11 constraints]
After SMT, in 6268ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 71 ms.
Support contains 281 out of 690 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 688 transition count 1298
Reduce places removed 8 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 1 with 32 rules applied. Total rules applied 42 place count 680 transition count 1274
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 66 place count 656 transition count 1274
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 66 place count 656 transition count 1242
Deduced a syphon composed of 32 places in 2 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 130 place count 624 transition count 1242
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 162 place count 608 transition count 1226
Applied a total of 162 rules in 160 ms. Remains 608 /690 variables (removed 82) and now considering 1226/1306 (removed 80) transitions.
Running 1224 sub problems to find dead transitions.
[2024-05-28 14:33:46] [INFO ] Flow matrix only has 1210 transitions (discarded 16 similar events)
// Phase 1: matrix 1210 rows 608 cols
[2024-05-28 14:33:46] [INFO ] Computed 52 invariants in 47 ms
[2024-05-28 14:33:46] [INFO ] State equation strengthened by 96 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3849 after 4340
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :4340 after 4791
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4791 after 6719
At refinement iteration 0 (INCLUDED_ONLY) 0/606 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/606 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-05-28 14:33:59] [INFO ] Deduced a trap composed of 63 places in 77 ms of which 1 ms to minimize.
[2024-05-28 14:34:01] [INFO ] Deduced a trap composed of 39 places in 225 ms of which 3 ms to minimize.
[2024-05-28 14:34:01] [INFO ] Deduced a trap composed of 63 places in 46 ms of which 0 ms to minimize.
[2024-05-28 14:34:01] [INFO ] Deduced a trap composed of 63 places in 40 ms of which 1 ms to minimize.
[2024-05-28 14:34:01] [INFO ] Deduced a trap composed of 63 places in 41 ms of which 0 ms to minimize.
[2024-05-28 14:34:02] [INFO ] Deduced a trap composed of 63 places in 691 ms of which 1 ms to minimize.
[2024-05-28 14:34:02] [INFO ] Deduced a trap composed of 63 places in 695 ms of which 2 ms to minimize.
[2024-05-28 14:34:02] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:34:02] [INFO ] Deduced a trap composed of 63 places in 47 ms of which 1 ms to minimize.
[2024-05-28 14:34:05] [INFO ] Deduced a trap composed of 318 places in 216 ms of which 3 ms to minimize.
[2024-05-28 14:34:05] [INFO ] Deduced a trap composed of 305 places in 209 ms of which 3 ms to minimize.
[2024-05-28 14:34:06] [INFO ] Deduced a trap composed of 48 places in 217 ms of which 3 ms to minimize.
[2024-05-28 14:34:06] [INFO ] Deduced a trap composed of 396 places in 217 ms of which 3 ms to minimize.
[2024-05-28 14:34:06] [INFO ] Deduced a trap composed of 307 places in 230 ms of which 3 ms to minimize.
[2024-05-28 14:34:06] [INFO ] Deduced a trap composed of 293 places in 212 ms of which 3 ms to minimize.
[2024-05-28 14:34:07] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 606/1818 variables, and 66 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 36/37 constraints, State Equation: 0/608 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1224/1224 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/606 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/606 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/606 variables, 16/66 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-05-28 14:34:12] [INFO ] Deduced a trap composed of 309 places in 214 ms of which 4 ms to minimize.
[2024-05-28 14:34:12] [INFO ] Deduced a trap composed of 307 places in 206 ms of which 4 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :6719 after 10072
[2024-05-28 14:34:20] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 14 ms to minimize.
[2024-05-28 14:34:23] [INFO ] Deduced a trap composed of 289 places in 231 ms of which 3 ms to minimize.
[2024-05-28 14:34:24] [INFO ] Deduced a trap composed of 292 places in 216 ms of which 3 ms to minimize.
[2024-05-28 14:34:25] [INFO ] Deduced a trap composed of 307 places in 266 ms of which 4 ms to minimize.
[2024-05-28 14:34:25] [INFO ] Deduced a trap composed of 46 places in 236 ms of which 3 ms to minimize.
[2024-05-28 14:34:26] [INFO ] Deduced a trap composed of 149 places in 215 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 606/1818 variables, and 74 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 36/37 constraints, State Equation: 0/608 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1224 constraints, Known Traps: 24/24 constraints]
After SMT, in 42018ms problems are : Problem set: 0 solved, 1224 unsolved
Search for dead transitions found 0 dead transitions in 42034ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42213 ms. Remains : 608/690 places, 1226/1306 transitions.
RANDOM walk for 40000 steps (15 resets) in 421 ms. (94 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (9 resets) in 389 ms. (102 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 18726 steps, run visited all 1 properties in 250 ms. (steps per millisecond=74 )
Probabilistic random walk after 18726 steps, saw 11312 distinct states, run finished after 255 ms. (steps per millisecond=73 ) properties seen :1
FORMULA PolyORBLF-COL-S02J06T08-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 55271 ms.

BK_STOP 1716906869309

--------------------
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="PolyORBLF-COL-S02J06T08"
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 PolyORBLF-COL-S02J06T08, 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 r290-tajo-171654446400110"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J06T08.tgz
mv PolyORBLF-COL-S02J06T08 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 ;