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

About the Execution of 2023-gold for PolyORBLF-PT-S02J04T10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1118.928 194201.00 237590.00 160.10 FFFFFTFTTFFFFFFF 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.r307-tajo-171654460500148.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 gold2023
Input is PolyORBLF-PT-S02J04T10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r307-tajo-171654460500148
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 25K Apr 11 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 11 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 46K Apr 11 16:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 243K Apr 11 16:46 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 9.5K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 58K Apr 11 16:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 293K Apr 11 16:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 93K Apr 11 16:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 478K Apr 11 16:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.0K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 906K 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-PT-S02J04T10-LTLFireability-00
FORMULA_NAME PolyORBLF-PT-S02J04T10-LTLFireability-01
FORMULA_NAME PolyORBLF-PT-S02J04T10-LTLFireability-02
FORMULA_NAME PolyORBLF-PT-S02J04T10-LTLFireability-03
FORMULA_NAME PolyORBLF-PT-S02J04T10-LTLFireability-04
FORMULA_NAME PolyORBLF-PT-S02J04T10-LTLFireability-05
FORMULA_NAME PolyORBLF-PT-S02J04T10-LTLFireability-06
FORMULA_NAME PolyORBLF-PT-S02J04T10-LTLFireability-07
FORMULA_NAME PolyORBLF-PT-S02J04T10-LTLFireability-08
FORMULA_NAME PolyORBLF-PT-S02J04T10-LTLFireability-09
FORMULA_NAME PolyORBLF-PT-S02J04T10-LTLFireability-10
FORMULA_NAME PolyORBLF-PT-S02J04T10-LTLFireability-11
FORMULA_NAME PolyORBLF-PT-S02J04T10-LTLFireability-12
FORMULA_NAME PolyORBLF-PT-S02J04T10-LTLFireability-13
FORMULA_NAME PolyORBLF-PT-S02J04T10-LTLFireability-14
FORMULA_NAME PolyORBLF-PT-S02J04T10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717116087056

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J04T10
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-31 00:41:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 00:41:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 00:41:28] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2024-05-31 00:41:28] [INFO ] Transformed 752 places.
[2024-05-31 00:41:28] [INFO ] Transformed 1572 transitions.
[2024-05-31 00:41:28] [INFO ] Parsed PT model containing 752 places and 1572 transitions and 7262 arcs in 168 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
[2024-05-31 00:41:28] [INFO ] Reduced 40 identical enabling conditions.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
FORMULA PolyORBLF-PT-S02J04T10-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T10-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T10-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 164 out of 752 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 742 transition count 1404
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 742 transition count 1404
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 25 place count 735 transition count 1397
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 735 transition count 1397
Applied a total of 32 rules in 113 ms. Remains 735 /752 variables (removed 17) and now considering 1397/1412 (removed 15) transitions.
[2024-05-31 00:41:28] [INFO ] Flow matrix only has 1377 transitions (discarded 20 similar events)
// Phase 1: matrix 1377 rows 735 cols
[2024-05-31 00:41:29] [INFO ] Computed 52 invariants in 73 ms
[2024-05-31 00:41:30] [INFO ] Dead Transitions using invariants and state equation in 1651 ms found 110 transitions.
Found 110 dead transitions using SMT.
Drop transitions removed 110 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 110 transitions.
[2024-05-31 00:41:30] [INFO ] Flow matrix only has 1267 transitions (discarded 20 similar events)
// Phase 1: matrix 1267 rows 735 cols
[2024-05-31 00:41:30] [INFO ] Computed 52 invariants in 42 ms
[2024-05-31 00:41:31] [INFO ] Implicit Places using invariants in 575 ms returned []
[2024-05-31 00:41:31] [INFO ] Flow matrix only has 1267 transitions (discarded 20 similar events)
[2024-05-31 00:41:31] [INFO ] Invariant cache hit.
[2024-05-31 00:41:31] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 00:41:39] [INFO ] Implicit Places using invariants and state equation in 8083 ms returned []
Implicit Place search using SMT with State Equation took 8660 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 735/752 places, 1287/1412 transitions.
Reduce places removed 1 places and 20 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 734 transition count 1267
Reduce places removed 10 places and 20 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 11 place count 724 transition count 1247
Deduced a syphon composed of 11 places in 2 ms
Applied a total of 11 rules in 23 ms. Remains 724 /735 variables (removed 11) and now considering 1247/1287 (removed 40) transitions.
[2024-05-31 00:41:39] [INFO ] Flow matrix only has 1227 transitions (discarded 20 similar events)
// Phase 1: matrix 1227 rows 724 cols
[2024-05-31 00:41:39] [INFO ] Computed 63 invariants in 24 ms
[2024-05-31 00:41:39] [INFO ] Implicit Places using invariants in 394 ms returned []
[2024-05-31 00:41:39] [INFO ] Flow matrix only has 1227 transitions (discarded 20 similar events)
[2024-05-31 00:41:39] [INFO ] Invariant cache hit.
[2024-05-31 00:41:40] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 00:41:42] [INFO ] Implicit Places using invariants and state equation in 2294 ms returned []
Implicit Place search using SMT with State Equation took 2691 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 724/752 places, 1247/1412 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 13166 ms. Remains : 724/752 places, 1247/1412 transitions.
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Support contains 152 out of 713 places after structural reductions.
[2024-05-31 00:41:42] [INFO ] Flatten gal took : 154 ms
[2024-05-31 00:41:42] [INFO ] Flatten gal took : 82 ms
[2024-05-31 00:41:42] [INFO ] Input system was already deterministic with 1247 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 22) seen :20
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2024-05-31 00:41:43] [INFO ] Flow matrix only has 1227 transitions (discarded 20 similar events)
// Phase 1: matrix 1227 rows 713 cols
[2024-05-31 00:41:43] [INFO ] Computed 52 invariants in 17 ms
[2024-05-31 00:41:43] [INFO ] [Real]Absence check using 14 positive place invariants in 18 ms returned sat
[2024-05-31 00:41:43] [INFO ] [Real]Absence check using 14 positive and 38 generalized place invariants in 24 ms returned sat
[2024-05-31 00:41:43] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA PolyORBLF-PT-S02J04T10-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U p1)))'
Support contains 21 out of 713 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 713/713 places, 1247/1247 transitions.
Drop transitions removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 713 transition count 1173
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 148 place count 639 transition count 1173
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 148 place count 639 transition count 1093
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 308 place count 559 transition count 1093
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 430 place count 498 transition count 1032
Applied a total of 430 rules in 135 ms. Remains 498 /713 variables (removed 215) and now considering 1032/1247 (removed 215) transitions.
[2024-05-31 00:41:43] [INFO ] Flow matrix only has 1012 transitions (discarded 20 similar events)
// Phase 1: matrix 1012 rows 498 cols
[2024-05-31 00:41:43] [INFO ] Computed 52 invariants in 10 ms
[2024-05-31 00:41:44] [INFO ] Dead Transitions using invariants and state equation in 742 ms found 0 transitions.
[2024-05-31 00:41:44] [INFO ] Flow matrix only has 1012 transitions (discarded 20 similar events)
[2024-05-31 00:41:44] [INFO ] Invariant cache hit.
[2024-05-31 00:41:45] [INFO ] Implicit Places using invariants in 604 ms returned [3, 61, 123, 176, 258, 285, 343, 376, 384, 443]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 607 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 488/713 places, 1032/1247 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 479 transition count 1023
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 479 transition count 1023
Applied a total of 18 rules in 68 ms. Remains 479 /488 variables (removed 9) and now considering 1023/1032 (removed 9) transitions.
[2024-05-31 00:41:45] [INFO ] Flow matrix only has 1003 transitions (discarded 20 similar events)
// Phase 1: matrix 1003 rows 479 cols
[2024-05-31 00:41:45] [INFO ] Computed 42 invariants in 15 ms
[2024-05-31 00:41:45] [INFO ] Implicit Places using invariants in 519 ms returned []
[2024-05-31 00:41:45] [INFO ] Flow matrix only has 1003 transitions (discarded 20 similar events)
[2024-05-31 00:41:45] [INFO ] Invariant cache hit.
[2024-05-31 00:41:46] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 00:41:51] [INFO ] Implicit Places using invariants and state equation in 5897 ms returned []
Implicit Place search using SMT with State Equation took 6419 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 479/713 places, 1023/1247 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7976 ms. Remains : 479/713 places, 1023/1247 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 234 ms :[(NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S02J04T10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s71 1) (GEQ s163 1)) (AND (GEQ s71 1) (GEQ s428 1)) (AND (GEQ s71 1) (GEQ s302 1)) (AND (GEQ s71 1) (GEQ s443 1)) (AND (GEQ s71 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 17367 steps with 357 reset in 225 ms.
FORMULA PolyORBLF-PT-S02J04T10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J04T10-LTLFireability-00 finished in 8509 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 21 out of 713 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 713/713 places, 1247/1247 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 713 transition count 1193
Reduce places removed 54 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 64 rules applied. Total rules applied 118 place count 659 transition count 1183
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 128 place count 649 transition count 1183
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 128 place count 649 transition count 1093
Deduced a syphon composed of 90 places in 4 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 308 place count 559 transition count 1093
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 2 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 410 place count 508 transition count 1042
Applied a total of 410 rules in 124 ms. Remains 508 /713 variables (removed 205) and now considering 1042/1247 (removed 205) transitions.
[2024-05-31 00:41:52] [INFO ] Flow matrix only has 1022 transitions (discarded 20 similar events)
// Phase 1: matrix 1022 rows 508 cols
[2024-05-31 00:41:52] [INFO ] Computed 52 invariants in 14 ms
[2024-05-31 00:41:53] [INFO ] Dead Transitions using invariants and state equation in 846 ms found 0 transitions.
[2024-05-31 00:41:53] [INFO ] Flow matrix only has 1022 transitions (discarded 20 similar events)
[2024-05-31 00:41:53] [INFO ] Invariant cache hit.
[2024-05-31 00:41:53] [INFO ] Implicit Places using invariants in 530 ms returned []
[2024-05-31 00:41:53] [INFO ] Flow matrix only has 1022 transitions (discarded 20 similar events)
[2024-05-31 00:41:53] [INFO ] Invariant cache hit.
[2024-05-31 00:41:54] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 00:42:00] [INFO ] Implicit Places using invariants and state equation in 6506 ms returned []
Implicit Place search using SMT with State Equation took 7042 ms to find 0 implicit places.
[2024-05-31 00:42:00] [INFO ] Redundant transitions in 95 ms returned []
[2024-05-31 00:42:00] [INFO ] Flow matrix only has 1022 transitions (discarded 20 similar events)
[2024-05-31 00:42:00] [INFO ] Invariant cache hit.
[2024-05-31 00:42:01] [INFO ] Dead Transitions using invariants and state equation in 825 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 508/713 places, 1042/1247 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8946 ms. Remains : 508/713 places, 1042/1247 transitions.
Stuttering acceptance computed with spot in 35 ms :[p0]
Running random walk in product with property : PolyORBLF-PT-S02J04T10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s30 1) (GEQ s161 1) (GEQ s263 1)) (AND (GEQ s30 1) (GEQ s312 1) (GEQ s394 1)) (AND (GEQ s30 1) (GEQ s354 1) (GEQ s389 1)) (AND (GEQ s30 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 33 reset in 604 ms.
Stack based approach found an accepted trace after 1108 steps with 1 reset with depth 884 and stack size 884 in 7 ms.
FORMULA PolyORBLF-PT-S02J04T10-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-PT-S02J04T10-LTLFireability-03 finished in 9620 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 10 out of 713 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 713/713 places, 1247/1247 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 710 transition count 1244
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 710 transition count 1244
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 708 transition count 1242
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 708 transition count 1242
Applied a total of 10 rules in 30 ms. Remains 708 /713 variables (removed 5) and now considering 1242/1247 (removed 5) transitions.
[2024-05-31 00:42:01] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 708 cols
[2024-05-31 00:42:01] [INFO ] Computed 52 invariants in 15 ms
[2024-05-31 00:42:02] [INFO ] Dead Transitions using invariants and state equation in 1127 ms found 0 transitions.
[2024-05-31 00:42:02] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
[2024-05-31 00:42:02] [INFO ] Invariant cache hit.
[2024-05-31 00:42:03] [INFO ] Implicit Places using invariants in 715 ms returned [4, 100, 184, 266, 375, 412, 498, 547, 556, 633]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 718 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 698/713 places, 1242/1247 transitions.
Applied a total of 0 rules in 10 ms. Remains 698 /698 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1888 ms. Remains : 698/713 places, 1242/1247 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J04T10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (LT s601 1) (LT s437 1) (LT s662 1) (LT s668 1) (LT s592 1) (LT s68 1) (LT s506 1) (LT s358 1) (LT s443 1) (LT s385 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S02J04T10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J04T10-LTLFireability-06 finished in 2024 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 15 out of 713 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 713/713 places, 1247/1247 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 713 transition count 1193
Reduce places removed 54 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 64 rules applied. Total rules applied 118 place count 659 transition count 1183
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 128 place count 649 transition count 1183
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 128 place count 649 transition count 1093
Deduced a syphon composed of 90 places in 2 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 308 place count 559 transition count 1093
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 410 place count 508 transition count 1042
Applied a total of 410 rules in 91 ms. Remains 508 /713 variables (removed 205) and now considering 1042/1247 (removed 205) transitions.
[2024-05-31 00:42:03] [INFO ] Flow matrix only has 1022 transitions (discarded 20 similar events)
// Phase 1: matrix 1022 rows 508 cols
[2024-05-31 00:42:03] [INFO ] Computed 52 invariants in 13 ms
[2024-05-31 00:42:04] [INFO ] Dead Transitions using invariants and state equation in 688 ms found 0 transitions.
[2024-05-31 00:42:04] [INFO ] Flow matrix only has 1022 transitions (discarded 20 similar events)
[2024-05-31 00:42:04] [INFO ] Invariant cache hit.
[2024-05-31 00:42:04] [INFO ] Implicit Places using invariants in 416 ms returned [3, 64, 127, 182, 263, 291, 354, 387, 394, 454]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 418 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 498/713 places, 1042/1247 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 489 transition count 1033
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 489 transition count 1033
Applied a total of 18 rules in 28 ms. Remains 489 /498 variables (removed 9) and now considering 1033/1042 (removed 9) transitions.
[2024-05-31 00:42:04] [INFO ] Flow matrix only has 1013 transitions (discarded 20 similar events)
// Phase 1: matrix 1013 rows 489 cols
[2024-05-31 00:42:04] [INFO ] Computed 42 invariants in 13 ms
[2024-05-31 00:42:05] [INFO ] Implicit Places using invariants in 378 ms returned []
[2024-05-31 00:42:05] [INFO ] Flow matrix only has 1013 transitions (discarded 20 similar events)
[2024-05-31 00:42:05] [INFO ] Invariant cache hit.
[2024-05-31 00:42:05] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 00:42:08] [INFO ] Implicit Places using invariants and state equation in 3120 ms returned []
Implicit Place search using SMT with State Equation took 3501 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 489/713 places, 1033/1247 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4730 ms. Remains : 489/713 places, 1033/1247 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J04T10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s29 1) (GEQ s120 1) (GEQ s162 1) (GEQ s230 1) (GEQ s423 10)) (AND (GEQ s29 1) (GEQ s36 1) (GEQ s116 1) (GEQ s162 1) (GEQ s423 10)) (AND (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2425 reset in 541 ms.
Product exploration explored 100000 steps with 2427 reset in 472 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 39 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=19 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2024-05-31 00:42:09] [INFO ] Flow matrix only has 1013 transitions (discarded 20 similar events)
[2024-05-31 00:42:09] [INFO ] Invariant cache hit.
[2024-05-31 00:42:10] [INFO ] [Real]Absence check using 15 positive place invariants in 20 ms returned sat
[2024-05-31 00:42:10] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 133 ms returned sat
[2024-05-31 00:42:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:42:12] [INFO ] [Real]Absence check using state equation in 1760 ms returned sat
[2024-05-31 00:42:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:42:13] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2024-05-31 00:42:13] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 48 ms returned sat
[2024-05-31 00:42:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:42:14] [INFO ] [Nat]Absence check using state equation in 1776 ms returned sat
[2024-05-31 00:42:14] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 00:42:15] [INFO ] [Nat]Added 120 Read/Feed constraints in 290 ms returned sat
[2024-05-31 00:42:15] [INFO ] Deduced a trap composed of 41 places in 181 ms of which 3 ms to minimize.
[2024-05-31 00:42:15] [INFO ] Deduced a trap composed of 42 places in 178 ms of which 1 ms to minimize.
[2024-05-31 00:42:16] [INFO ] Deduced a trap composed of 41 places in 167 ms of which 1 ms to minimize.
[2024-05-31 00:42:16] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 1 ms to minimize.
[2024-05-31 00:42:16] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 2 ms to minimize.
[2024-05-31 00:42:16] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2024-05-31 00:42:16] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 0 ms to minimize.
[2024-05-31 00:42:16] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 2 ms to minimize.
[2024-05-31 00:42:16] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1466 ms
[2024-05-31 00:42:16] [INFO ] Computed and/alt/rep : 371/749/361 causal constraints (skipped 650 transitions) in 114 ms.
[2024-05-31 00:42:19] [INFO ] Added : 132 causal constraints over 27 iterations in 2566 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 15 out of 489 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 489/489 places, 1033/1033 transitions.
Applied a total of 0 rules in 25 ms. Remains 489 /489 variables (removed 0) and now considering 1033/1033 (removed 0) transitions.
[2024-05-31 00:42:19] [INFO ] Flow matrix only has 1013 transitions (discarded 20 similar events)
[2024-05-31 00:42:19] [INFO ] Invariant cache hit.
[2024-05-31 00:42:20] [INFO ] Dead Transitions using invariants and state equation in 664 ms found 0 transitions.
[2024-05-31 00:42:20] [INFO ] Flow matrix only has 1013 transitions (discarded 20 similar events)
[2024-05-31 00:42:20] [INFO ] Invariant cache hit.
[2024-05-31 00:42:20] [INFO ] Implicit Places using invariants in 396 ms returned []
[2024-05-31 00:42:20] [INFO ] Flow matrix only has 1013 transitions (discarded 20 similar events)
[2024-05-31 00:42:20] [INFO ] Invariant cache hit.
[2024-05-31 00:42:20] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 00:42:23] [INFO ] Implicit Places using invariants and state equation in 2965 ms returned []
Implicit Place search using SMT with State Equation took 3363 ms to find 0 implicit places.
[2024-05-31 00:42:23] [INFO ] Redundant transitions in 25 ms returned []
[2024-05-31 00:42:23] [INFO ] Flow matrix only has 1013 transitions (discarded 20 similar events)
[2024-05-31 00:42:23] [INFO ] Invariant cache hit.
[2024-05-31 00:42:24] [INFO ] Dead Transitions using invariants and state equation in 644 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4729 ms. Remains : 489/489 places, 1033/1033 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 39 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=19 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
[2024-05-31 00:42:24] [INFO ] Flow matrix only has 1013 transitions (discarded 20 similar events)
[2024-05-31 00:42:24] [INFO ] Invariant cache hit.
[2024-05-31 00:42:24] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-05-31 00:42:24] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 70 ms returned sat
[2024-05-31 00:42:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:42:26] [INFO ] [Real]Absence check using state equation in 1396 ms returned sat
[2024-05-31 00:42:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:42:27] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-05-31 00:42:27] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 55 ms returned sat
[2024-05-31 00:42:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:42:29] [INFO ] [Nat]Absence check using state equation in 1908 ms returned sat
[2024-05-31 00:42:29] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 00:42:29] [INFO ] [Nat]Added 120 Read/Feed constraints in 286 ms returned sat
[2024-05-31 00:42:29] [INFO ] Deduced a trap composed of 41 places in 180 ms of which 1 ms to minimize.
[2024-05-31 00:42:29] [INFO ] Deduced a trap composed of 42 places in 159 ms of which 1 ms to minimize.
[2024-05-31 00:42:29] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 0 ms to minimize.
[2024-05-31 00:42:30] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 0 ms to minimize.
[2024-05-31 00:42:30] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 0 ms to minimize.
[2024-05-31 00:42:30] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 0 ms to minimize.
[2024-05-31 00:42:30] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2024-05-31 00:42:30] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-05-31 00:42:30] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1337 ms
[2024-05-31 00:42:30] [INFO ] Computed and/alt/rep : 371/749/361 causal constraints (skipped 650 transitions) in 99 ms.
[2024-05-31 00:42:32] [INFO ] Added : 132 causal constraints over 27 iterations in 1926 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2430 reset in 612 ms.
Product exploration explored 100000 steps with 2430 reset in 507 ms.
Built C files in :
/tmp/ltsmin6276182492917535252
[2024-05-31 00:42:33] [INFO ] Computing symmetric may disable matrix : 1033 transitions.
[2024-05-31 00:42:33] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 00:42:33] [INFO ] Computing symmetric may enable matrix : 1033 transitions.
[2024-05-31 00:42:33] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 00:42:34] [INFO ] Computing Do-Not-Accords matrix : 1033 transitions.
[2024-05-31 00:42:34] [INFO ] Computation of Completed DNA matrix. took 36 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 00:42:34] [INFO ] Built C files in 234ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6276182492917535252
Running compilation step : cd /tmp/ltsmin6276182492917535252;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6276182492917535252;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6276182492917535252;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 15 out of 489 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 489/489 places, 1033/1033 transitions.
Applied a total of 0 rules in 25 ms. Remains 489 /489 variables (removed 0) and now considering 1033/1033 (removed 0) transitions.
[2024-05-31 00:42:37] [INFO ] Flow matrix only has 1013 transitions (discarded 20 similar events)
[2024-05-31 00:42:37] [INFO ] Invariant cache hit.
[2024-05-31 00:42:37] [INFO ] Dead Transitions using invariants and state equation in 747 ms found 0 transitions.
[2024-05-31 00:42:37] [INFO ] Flow matrix only has 1013 transitions (discarded 20 similar events)
[2024-05-31 00:42:37] [INFO ] Invariant cache hit.
[2024-05-31 00:42:38] [INFO ] Implicit Places using invariants in 407 ms returned []
[2024-05-31 00:42:38] [INFO ] Flow matrix only has 1013 transitions (discarded 20 similar events)
[2024-05-31 00:42:38] [INFO ] Invariant cache hit.
[2024-05-31 00:42:38] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 00:42:41] [INFO ] Implicit Places using invariants and state equation in 3046 ms returned []
Implicit Place search using SMT with State Equation took 3454 ms to find 0 implicit places.
[2024-05-31 00:42:41] [INFO ] Redundant transitions in 75 ms returned []
[2024-05-31 00:42:41] [INFO ] Flow matrix only has 1013 transitions (discarded 20 similar events)
[2024-05-31 00:42:41] [INFO ] Invariant cache hit.
[2024-05-31 00:42:42] [INFO ] Dead Transitions using invariants and state equation in 865 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5173 ms. Remains : 489/489 places, 1033/1033 transitions.
Built C files in :
/tmp/ltsmin2044774994679249673
[2024-05-31 00:42:42] [INFO ] Computing symmetric may disable matrix : 1033 transitions.
[2024-05-31 00:42:42] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 00:42:42] [INFO ] Computing symmetric may enable matrix : 1033 transitions.
[2024-05-31 00:42:42] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 00:42:42] [INFO ] Computing Do-Not-Accords matrix : 1033 transitions.
[2024-05-31 00:42:42] [INFO ] Computation of Completed DNA matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 00:42:42] [INFO ] Built C files in 196ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2044774994679249673
Running compilation step : cd /tmp/ltsmin2044774994679249673;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2044774994679249673;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2044774994679249673;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-31 00:42:45] [INFO ] Flatten gal took : 67 ms
[2024-05-31 00:42:45] [INFO ] Flatten gal took : 53 ms
[2024-05-31 00:42:45] [INFO ] Time to serialize gal into /tmp/LTL10844625523786925979.gal : 10 ms
[2024-05-31 00:42:45] [INFO ] Time to serialize properties into /tmp/LTL15815876477488834680.prop : 0 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10844625523786925979.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3378994407698453070.hoa' '-atoms' '/tmp/LTL15815876477488834680.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15815876477488834680.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3378994407698453070.hoa
Detected timeout of ITS tools.
[2024-05-31 00:43:00] [INFO ] Flatten gal took : 43 ms
[2024-05-31 00:43:00] [INFO ] Flatten gal took : 40 ms
[2024-05-31 00:43:00] [INFO ] Time to serialize gal into /tmp/LTL17833735263555433852.gal : 6 ms
[2024-05-31 00:43:00] [INFO ] Time to serialize properties into /tmp/LTL4366705388808050806.ltl : 2 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17833735263555433852.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4366705388808050806.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F("(((((((((ORB_Lock>=1)&&(AbourtToModifySrc_1>=1))&&((PollingAbort>=1)&&(Abort_Check_Sources_E_1>=1)))&&(cBlockedTasks>=10))||((((...2449
Formula 0 simplified : G!"(((((((((ORB_Lock>=1)&&(AbourtToModifySrc_1>=1))&&((PollingAbort>=1)&&(Abort_Check_Sources_E_1>=1)))&&(cBlockedTasks>=10))||((((O...2445
Detected timeout of ITS tools.
[2024-05-31 00:43:16] [INFO ] Flatten gal took : 59 ms
[2024-05-31 00:43:16] [INFO ] Applying decomposition
[2024-05-31 00:43:16] [INFO ] Flatten gal took : 41 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12568860849443231166.txt' '-o' '/tmp/graph12568860849443231166.bin' '-w' '/tmp/graph12568860849443231166.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12568860849443231166.bin' '-l' '-1' '-v' '-w' '/tmp/graph12568860849443231166.weights' '-q' '0' '-e' '0.001'
[2024-05-31 00:43:16] [INFO ] Decomposing Gal with order
[2024-05-31 00:43:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 00:43:16] [INFO ] Removed a total of 943 redundant transitions.
[2024-05-31 00:43:16] [INFO ] Flatten gal took : 243 ms
[2024-05-31 00:43:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 378 labels/synchronizations in 39 ms.
[2024-05-31 00:43:16] [INFO ] Time to serialize gal into /tmp/LTL17194211436914878136.gal : 13 ms
[2024-05-31 00:43:16] [INFO ] Time to serialize properties into /tmp/LTL2027535094683634348.ltl : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17194211436914878136.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2027535094683634348.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F("(((((((((i5.u35.ORB_Lock>=1)&&(i5.u35.AbourtToModifySrc_1>=1))&&((i5.u35.PollingAbort>=1)&&(i5.u35.Abort_Check_Sources_E_1>=1)))...3149
Formula 0 simplified : G!"(((((((((i5.u35.ORB_Lock>=1)&&(i5.u35.AbourtToModifySrc_1>=1))&&((i5.u35.PollingAbort>=1)&&(i5.u35.Abort_Check_Sources_E_1>=1)))&...3145
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13253977179083447812
[2024-05-31 00:43:31] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13253977179083447812
Running compilation step : cd /tmp/ltsmin13253977179083447812;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2120 ms.
Running link step : cd /tmp/ltsmin13253977179083447812;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin13253977179083447812;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
LTSmin run took 2209 ms.
FORMULA PolyORBLF-PT-S02J04T10-LTLFireability-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBLF-PT-S02J04T10-LTLFireability-07 finished in 92447 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(p1))))'
Support contains 7 out of 713 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 713/713 places, 1247/1247 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 711 transition count 1245
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 711 transition count 1245
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 710 transition count 1244
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 710 transition count 1244
Applied a total of 6 rules in 37 ms. Remains 710 /713 variables (removed 3) and now considering 1244/1247 (removed 3) transitions.
[2024-05-31 00:43:36] [INFO ] Flow matrix only has 1224 transitions (discarded 20 similar events)
// Phase 1: matrix 1224 rows 710 cols
[2024-05-31 00:43:36] [INFO ] Computed 52 invariants in 27 ms
[2024-05-31 00:43:37] [INFO ] Dead Transitions using invariants and state equation in 1224 ms found 0 transitions.
[2024-05-31 00:43:37] [INFO ] Flow matrix only has 1224 transitions (discarded 20 similar events)
[2024-05-31 00:43:37] [INFO ] Invariant cache hit.
[2024-05-31 00:43:37] [INFO ] Implicit Places using invariants in 544 ms returned [4, 184, 266, 376, 413, 499, 548, 557, 634]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 546 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 701/713 places, 1244/1247 transitions.
Applied a total of 0 rules in 10 ms. Remains 701 /701 variables (removed 0) and now considering 1244/1244 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1817 ms. Remains : 701/713 places, 1244/1247 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S02J04T10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s94 9) (GEQ s119 1) (GEQ s541 1)), p1:(AND (OR (LT s94 9) (LT s119 1) (LT s541 1) (LT s214 1)) (OR (LT s38 1) (LT s99 1) (LT s470 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 736 ms.
Product exploration explored 100000 steps with 50000 reset in 820 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 28 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S02J04T10-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S02J04T10-LTLFireability-08 finished in 3529 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((G(F(!p0))||(F(!p0)&&X(F(!p1)))) U p1)))'
Support contains 5 out of 713 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 713/713 places, 1247/1247 transitions.
Drop transitions removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 713 transition count 1173
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 148 place count 639 transition count 1173
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 148 place count 639 transition count 1093
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 308 place count 559 transition count 1093
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 468 place count 479 transition count 1013
Applied a total of 468 rules in 88 ms. Remains 479 /713 variables (removed 234) and now considering 1013/1247 (removed 234) transitions.
[2024-05-31 00:43:39] [INFO ] Flow matrix only has 993 transitions (discarded 20 similar events)
// Phase 1: matrix 993 rows 479 cols
[2024-05-31 00:43:39] [INFO ] Computed 52 invariants in 21 ms
[2024-05-31 00:43:40] [INFO ] Dead Transitions using invariants and state equation in 877 ms found 0 transitions.
[2024-05-31 00:43:40] [INFO ] Flow matrix only has 993 transitions (discarded 20 similar events)
[2024-05-31 00:43:40] [INFO ] Invariant cache hit.
[2024-05-31 00:43:41] [INFO ] Implicit Places using invariants in 507 ms returned [3, 58, 119, 170, 246, 273, 331, 363, 370, 427]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 508 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 469/713 places, 1013/1247 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 460 transition count 1004
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 460 transition count 1004
Applied a total of 18 rules in 22 ms. Remains 460 /469 variables (removed 9) and now considering 1004/1013 (removed 9) transitions.
[2024-05-31 00:43:41] [INFO ] Flow matrix only has 984 transitions (discarded 20 similar events)
// Phase 1: matrix 984 rows 460 cols
[2024-05-31 00:43:41] [INFO ] Computed 42 invariants in 13 ms
[2024-05-31 00:43:41] [INFO ] Implicit Places using invariants in 546 ms returned []
[2024-05-31 00:43:41] [INFO ] Flow matrix only has 984 transitions (discarded 20 similar events)
[2024-05-31 00:43:41] [INFO ] Invariant cache hit.
[2024-05-31 00:43:42] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 00:43:45] [INFO ] Implicit Places using invariants and state equation in 3652 ms returned []
Implicit Place search using SMT with State Equation took 4199 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 460/713 places, 1004/1247 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5699 ms. Remains : 460/713 places, 1004/1247 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), p0, (NOT p1), (AND p1 p0), (AND p1 p0)]
Running random walk in product with property : PolyORBLF-PT-S02J04T10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s17 1) (GEQ s306 1)), p0:(AND (GEQ s236 1) (GEQ s304 1) (GEQ s370 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 28519 reset in 504 ms.
Product exploration explored 100000 steps with 28522 reset in 443 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 160 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 246 ms :[(NOT p1), p0, (NOT p1), (AND p1 p0), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 00:43:47] [INFO ] Flow matrix only has 984 transitions (discarded 20 similar events)
[2024-05-31 00:43:47] [INFO ] Invariant cache hit.
[2024-05-31 00:43:47] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-31 00:43:47] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 22 ms returned sat
[2024-05-31 00:43:47] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (G (NOT (AND p1 p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F p0), (F p1)]
Knowledge based reduction with 10 factoid took 274 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1)]
[2024-05-31 00:43:47] [INFO ] Flow matrix only has 984 transitions (discarded 20 similar events)
[2024-05-31 00:43:47] [INFO ] Invariant cache hit.
[2024-05-31 00:43:48] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-31 00:43:48] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 61 ms returned sat
[2024-05-31 00:43:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:43:49] [INFO ] [Real]Absence check using state equation in 1150 ms returned sat
[2024-05-31 00:43:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:43:49] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-31 00:43:49] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 96 ms returned sat
[2024-05-31 00:43:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:43:50] [INFO ] [Nat]Absence check using state equation in 1032 ms returned sat
[2024-05-31 00:43:50] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 00:43:51] [INFO ] [Nat]Added 120 Read/Feed constraints in 589 ms returned sat
[2024-05-31 00:43:51] [INFO ] Deduced a trap composed of 145 places in 210 ms of which 1 ms to minimize.
[2024-05-31 00:43:51] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 2 ms to minimize.
[2024-05-31 00:43:52] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 1 ms to minimize.
[2024-05-31 00:43:52] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 1 ms to minimize.
[2024-05-31 00:43:52] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-05-31 00:43:52] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2024-05-31 00:43:53] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1681 ms
[2024-05-31 00:43:53] [INFO ] Computed and/alt/rep : 342/711/332 causal constraints (skipped 650 transitions) in 107 ms.
[2024-05-31 00:43:55] [INFO ] Added : 86 causal constraints over 18 iterations in 2011 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 460 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 460/460 places, 1004/1004 transitions.
Applied a total of 0 rules in 23 ms. Remains 460 /460 variables (removed 0) and now considering 1004/1004 (removed 0) transitions.
[2024-05-31 00:43:55] [INFO ] Flow matrix only has 984 transitions (discarded 20 similar events)
[2024-05-31 00:43:55] [INFO ] Invariant cache hit.
[2024-05-31 00:43:56] [INFO ] Dead Transitions using invariants and state equation in 775 ms found 0 transitions.
[2024-05-31 00:43:56] [INFO ] Flow matrix only has 984 transitions (discarded 20 similar events)
[2024-05-31 00:43:56] [INFO ] Invariant cache hit.
[2024-05-31 00:43:56] [INFO ] Implicit Places using invariants in 534 ms returned []
[2024-05-31 00:43:56] [INFO ] Flow matrix only has 984 transitions (discarded 20 similar events)
[2024-05-31 00:43:56] [INFO ] Invariant cache hit.
[2024-05-31 00:43:57] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 00:44:02] [INFO ] Implicit Places using invariants and state equation in 5647 ms returned []
Implicit Place search using SMT with State Equation took 6183 ms to find 0 implicit places.
[2024-05-31 00:44:02] [INFO ] Redundant transitions in 30 ms returned []
[2024-05-31 00:44:02] [INFO ] Flow matrix only has 984 transitions (discarded 20 similar events)
[2024-05-31 00:44:02] [INFO ] Invariant cache hit.
[2024-05-31 00:44:02] [INFO ] Dead Transitions using invariants and state equation in 617 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7636 ms. Remains : 460/460 places, 1004/1004 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1)]
Finished random walk after 2473 steps, including 1 resets, run visited all 1 properties in 14 ms. (steps per millisecond=176 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1)]
[2024-05-31 00:44:03] [INFO ] Flow matrix only has 984 transitions (discarded 20 similar events)
[2024-05-31 00:44:03] [INFO ] Invariant cache hit.
[2024-05-31 00:44:03] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-31 00:44:03] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 61 ms returned sat
[2024-05-31 00:44:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:44:04] [INFO ] [Real]Absence check using state equation in 990 ms returned sat
[2024-05-31 00:44:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:44:05] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-31 00:44:05] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 132 ms returned sat
[2024-05-31 00:44:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:44:06] [INFO ] [Nat]Absence check using state equation in 1033 ms returned sat
[2024-05-31 00:44:06] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 00:44:07] [INFO ] [Nat]Added 120 Read/Feed constraints in 541 ms returned sat
[2024-05-31 00:44:07] [INFO ] Deduced a trap composed of 145 places in 203 ms of which 0 ms to minimize.
[2024-05-31 00:44:07] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 2 ms to minimize.
[2024-05-31 00:44:07] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 1 ms to minimize.
[2024-05-31 00:44:08] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
[2024-05-31 00:44:08] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-05-31 00:44:08] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 0 ms to minimize.
[2024-05-31 00:44:09] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1731 ms
[2024-05-31 00:44:09] [INFO ] Computed and/alt/rep : 342/711/332 causal constraints (skipped 650 transitions) in 80 ms.
[2024-05-31 00:44:10] [INFO ] Added : 86 causal constraints over 18 iterations in 1814 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1)]
Stuttering criterion allowed to conclude after 150 steps with 0 reset in 2 ms.
FORMULA PolyORBLF-PT-S02J04T10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J04T10-LTLFireability-09 finished in 31280 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 713 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 713/713 places, 1247/1247 transitions.
Drop transitions removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 713 transition count 1173
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 148 place count 639 transition count 1173
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 148 place count 639 transition count 1094
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 306 place count 560 transition count 1094
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 1 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 468 place count 479 transition count 1013
Applied a total of 468 rules in 69 ms. Remains 479 /713 variables (removed 234) and now considering 1013/1247 (removed 234) transitions.
[2024-05-31 00:44:11] [INFO ] Flow matrix only has 993 transitions (discarded 20 similar events)
// Phase 1: matrix 993 rows 479 cols
[2024-05-31 00:44:11] [INFO ] Computed 52 invariants in 27 ms
[2024-05-31 00:44:11] [INFO ] Dead Transitions using invariants and state equation in 852 ms found 0 transitions.
[2024-05-31 00:44:11] [INFO ] Flow matrix only has 993 transitions (discarded 20 similar events)
[2024-05-31 00:44:11] [INFO ] Invariant cache hit.
[2024-05-31 00:44:12] [INFO ] Implicit Places using invariants in 424 ms returned [3, 57, 118, 169, 245, 272, 331, 363, 370, 427]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 426 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 469/713 places, 1013/1247 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 460 transition count 1004
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 460 transition count 1004
Applied a total of 18 rules in 21 ms. Remains 460 /469 variables (removed 9) and now considering 1004/1013 (removed 9) transitions.
[2024-05-31 00:44:12] [INFO ] Flow matrix only has 984 transitions (discarded 20 similar events)
// Phase 1: matrix 984 rows 460 cols
[2024-05-31 00:44:12] [INFO ] Computed 42 invariants in 10 ms
[2024-05-31 00:44:12] [INFO ] Implicit Places using invariants in 477 ms returned []
[2024-05-31 00:44:12] [INFO ] Flow matrix only has 984 transitions (discarded 20 similar events)
[2024-05-31 00:44:12] [INFO ] Invariant cache hit.
[2024-05-31 00:44:13] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 00:44:19] [INFO ] Implicit Places using invariants and state equation in 6904 ms returned []
Implicit Place search using SMT with State Equation took 7383 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 460/713 places, 1004/1247 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8751 ms. Remains : 460/713 places, 1004/1247 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J04T10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s94 1) (LT s436 1)) (OR (LT s292 1) (LT s397 10)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 29 reset in 669 ms.
Stack based approach found an accepted trace after 1621 steps with 1 reset with depth 346 and stack size 346 in 11 ms.
FORMULA PolyORBLF-PT-S02J04T10-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-PT-S02J04T10-LTLFireability-10 finished in 9512 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 713 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 713/713 places, 1247/1247 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 710 transition count 1244
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 710 transition count 1244
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 708 transition count 1242
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 708 transition count 1242
Applied a total of 10 rules in 36 ms. Remains 708 /713 variables (removed 5) and now considering 1242/1247 (removed 5) transitions.
[2024-05-31 00:44:20] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 708 cols
[2024-05-31 00:44:20] [INFO ] Computed 52 invariants in 24 ms
[2024-05-31 00:44:21] [INFO ] Dead Transitions using invariants and state equation in 1176 ms found 0 transitions.
[2024-05-31 00:44:21] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
[2024-05-31 00:44:21] [INFO ] Invariant cache hit.
[2024-05-31 00:44:22] [INFO ] Implicit Places using invariants in 531 ms returned [4, 100, 184, 266, 375, 412, 498, 547, 556, 633]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 532 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 698/713 places, 1242/1247 transitions.
Applied a total of 0 rules in 8 ms. Remains 698 /698 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1754 ms. Remains : 698/713 places, 1242/1247 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J04T10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GEQ s375 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S02J04T10-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J04T10-LTLFireability-11 finished in 1914 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((F(p0)||G(p1)))&&(!p1||X(p2)))))'
Support contains 8 out of 713 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 713/713 places, 1247/1247 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 711 transition count 1245
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 711 transition count 1245
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 709 transition count 1243
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 709 transition count 1243
Applied a total of 8 rules in 39 ms. Remains 709 /713 variables (removed 4) and now considering 1243/1247 (removed 4) transitions.
[2024-05-31 00:44:22] [INFO ] Flow matrix only has 1223 transitions (discarded 20 similar events)
// Phase 1: matrix 1223 rows 709 cols
[2024-05-31 00:44:22] [INFO ] Computed 52 invariants in 21 ms
[2024-05-31 00:44:23] [INFO ] Dead Transitions using invariants and state equation in 1368 ms found 0 transitions.
[2024-05-31 00:44:23] [INFO ] Flow matrix only has 1223 transitions (discarded 20 similar events)
[2024-05-31 00:44:23] [INFO ] Invariant cache hit.
[2024-05-31 00:44:24] [INFO ] Implicit Places using invariants in 543 ms returned [4, 100, 184, 266, 375, 412, 498, 548, 557, 634]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 545 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 699/713 places, 1243/1247 transitions.
Applied a total of 0 rules in 11 ms. Remains 699 /699 variables (removed 0) and now considering 1243/1243 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1965 ms. Remains : 699/713 places, 1243/1247 transitions.
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND p1 (NOT p2)))]
Running random walk in product with property : PolyORBLF-PT-S02J04T10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 2}, { cond=p1, acceptance={} source=5 dest: 3}]], initial=4, aps=[p0:(GEQ s71 1), p1:(OR (LT s94 8) (LT s540 1) (LT s574 1) (LT s630 1)), p2:(AND (GEQ s302 1) (GEQ s338 1) (GEQ s634 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S02J04T10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J04T10-LTLFireability-12 finished in 2167 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(!p0))))'
Support contains 3 out of 713 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 713/713 places, 1247/1247 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 710 transition count 1244
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 710 transition count 1244
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 708 transition count 1242
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 708 transition count 1242
Applied a total of 10 rules in 34 ms. Remains 708 /713 variables (removed 5) and now considering 1242/1247 (removed 5) transitions.
[2024-05-31 00:44:24] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 708 cols
[2024-05-31 00:44:24] [INFO ] Computed 52 invariants in 22 ms
[2024-05-31 00:44:26] [INFO ] Dead Transitions using invariants and state equation in 1503 ms found 0 transitions.
[2024-05-31 00:44:26] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
[2024-05-31 00:44:26] [INFO ] Invariant cache hit.
[2024-05-31 00:44:26] [INFO ] Implicit Places using invariants in 583 ms returned [4, 100, 184, 266, 375, 412, 498, 547, 556, 633]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 584 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 698/713 places, 1242/1247 transitions.
Applied a total of 0 rules in 8 ms. Remains 698 /698 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2132 ms. Remains : 698/713 places, 1242/1247 transitions.
Stuttering acceptance computed with spot in 118 ms :[p0, (NOT p0), true, true]
Running random walk in product with property : PolyORBLF-PT-S02J04T10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s124 1) (GEQ s338 1) (GEQ s390 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 3267 steps with 1 reset in 12 ms.
FORMULA PolyORBLF-PT-S02J04T10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J04T10-LTLFireability-13 finished in 2276 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F((X(F(p0))||G(p1))) U p2))))'
Support contains 7 out of 713 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 713/713 places, 1247/1247 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 713 transition count 1175
Reduce places removed 72 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 73 rules applied. Total rules applied 145 place count 641 transition count 1174
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 146 place count 640 transition count 1174
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 79 Pre rules applied. Total rules applied 146 place count 640 transition count 1095
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 304 place count 561 transition count 1095
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 1 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 162 rules applied. Total rules applied 466 place count 480 transition count 1014
Applied a total of 466 rules in 64 ms. Remains 480 /713 variables (removed 233) and now considering 1014/1247 (removed 233) transitions.
[2024-05-31 00:44:26] [INFO ] Flow matrix only has 994 transitions (discarded 20 similar events)
// Phase 1: matrix 994 rows 480 cols
[2024-05-31 00:44:26] [INFO ] Computed 52 invariants in 12 ms
[2024-05-31 00:44:27] [INFO ] Dead Transitions using invariants and state equation in 697 ms found 0 transitions.
[2024-05-31 00:44:27] [INFO ] Flow matrix only has 994 transitions (discarded 20 similar events)
[2024-05-31 00:44:27] [INFO ] Invariant cache hit.
[2024-05-31 00:44:28] [INFO ] Implicit Places using invariants in 449 ms returned [3, 58, 119, 170, 246, 274, 332, 364, 371, 428]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 451 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 470/713 places, 1014/1247 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 461 transition count 1005
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 461 transition count 1005
Applied a total of 18 rules in 27 ms. Remains 461 /470 variables (removed 9) and now considering 1005/1014 (removed 9) transitions.
[2024-05-31 00:44:28] [INFO ] Flow matrix only has 985 transitions (discarded 20 similar events)
// Phase 1: matrix 985 rows 461 cols
[2024-05-31 00:44:28] [INFO ] Computed 42 invariants in 14 ms
[2024-05-31 00:44:28] [INFO ] Implicit Places using invariants in 436 ms returned []
[2024-05-31 00:44:28] [INFO ] Flow matrix only has 985 transitions (discarded 20 similar events)
[2024-05-31 00:44:28] [INFO ] Invariant cache hit.
[2024-05-31 00:44:28] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 00:44:32] [INFO ] Implicit Places using invariants and state equation in 4095 ms returned []
Implicit Place search using SMT with State Equation took 4532 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 461/713 places, 1005/1247 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5772 ms. Remains : 461/713 places, 1005/1247 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : PolyORBLF-PT-S02J04T10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND p2 p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s270 1) (GEQ s443 1)), p1:(AND (GEQ s107 1) (GEQ s300 1)), p0:(AND (GEQ s28 1) (GEQ s151 1) (GEQ s371 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 10819 steps with 4 reset in 66 ms.
FORMULA PolyORBLF-PT-S02J04T10-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J04T10-LTLFireability-14 finished in 5966 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 713 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 713/713 places, 1247/1247 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 713 transition count 1175
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 641 transition count 1175
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 144 place count 641 transition count 1095
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 304 place count 561 transition count 1095
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 1 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 466 place count 480 transition count 1014
Applied a total of 466 rules in 57 ms. Remains 480 /713 variables (removed 233) and now considering 1014/1247 (removed 233) transitions.
[2024-05-31 00:44:32] [INFO ] Flow matrix only has 994 transitions (discarded 20 similar events)
// Phase 1: matrix 994 rows 480 cols
[2024-05-31 00:44:32] [INFO ] Computed 52 invariants in 28 ms
[2024-05-31 00:44:33] [INFO ] Dead Transitions using invariants and state equation in 880 ms found 0 transitions.
[2024-05-31 00:44:33] [INFO ] Flow matrix only has 994 transitions (discarded 20 similar events)
[2024-05-31 00:44:33] [INFO ] Invariant cache hit.
[2024-05-31 00:44:34] [INFO ] Implicit Places using invariants in 456 ms returned [3, 57, 118, 170, 246, 273, 331, 363, 370, 428]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 459 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 470/713 places, 1014/1247 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 462 transition count 1006
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 462 transition count 1006
Applied a total of 16 rules in 28 ms. Remains 462 /470 variables (removed 8) and now considering 1006/1014 (removed 8) transitions.
[2024-05-31 00:44:34] [INFO ] Flow matrix only has 986 transitions (discarded 20 similar events)
// Phase 1: matrix 986 rows 462 cols
[2024-05-31 00:44:34] [INFO ] Computed 42 invariants in 12 ms
[2024-05-31 00:44:34] [INFO ] Implicit Places using invariants in 433 ms returned []
[2024-05-31 00:44:34] [INFO ] Flow matrix only has 986 transitions (discarded 20 similar events)
[2024-05-31 00:44:34] [INFO ] Invariant cache hit.
[2024-05-31 00:44:35] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 00:44:41] [INFO ] Implicit Places using invariants and state equation in 6351 ms returned []
Implicit Place search using SMT with State Equation took 6787 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 462/713 places, 1006/1247 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8212 ms. Remains : 462/713 places, 1006/1247 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J04T10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s143 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1648 steps with 5 reset in 17 ms.
FORMULA PolyORBLF-PT-S02J04T10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J04T10-LTLFireability-15 finished in 8289 ms.
All properties solved by simple procedures.
Total runtime 192573 ms.

BK_STOP 1717116281257

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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-PT-S02J04T10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is PolyORBLF-PT-S02J04T10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r307-tajo-171654460500148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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