Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 14:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 12 14:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 14:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 12 14:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 19K May 18 16:42 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 CircularTrains-PT-024-LTLCardinality-00
FORMULA_NAME CircularTrains-PT-024-LTLCardinality-01
FORMULA_NAME CircularTrains-PT-024-LTLCardinality-02
FORMULA_NAME CircularTrains-PT-024-LTLCardinality-03
FORMULA_NAME CircularTrains-PT-024-LTLCardinality-04
FORMULA_NAME CircularTrains-PT-024-LTLCardinality-05
FORMULA_NAME CircularTrains-PT-024-LTLCardinality-06
FORMULA_NAME CircularTrains-PT-024-LTLCardinality-07
FORMULA_NAME CircularTrains-PT-024-LTLCardinality-08
FORMULA_NAME CircularTrains-PT-024-LTLCardinality-09
FORMULA_NAME CircularTrains-PT-024-LTLCardinality-10
FORMULA_NAME CircularTrains-PT-024-LTLCardinality-11
FORMULA_NAME CircularTrains-PT-024-LTLCardinality-12
FORMULA_NAME CircularTrains-PT-024-LTLCardinality-13
FORMULA_NAME CircularTrains-PT-024-LTLCardinality-14
FORMULA_NAME CircularTrains-PT-024-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716429715981

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircularTrains-PT-024
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 02:01:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 02:01:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 02:01:57] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2024-05-23 02:01:57] [INFO ] Transformed 48 places.
[2024-05-23 02:01:57] [INFO ] Transformed 24 transitions.
[2024-05-23 02:01:57] [INFO ] Parsed PT model containing 48 places and 24 transitions and 96 arcs in 132 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CircularTrains-PT-024-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-024-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-024-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 24/24 transitions.
Applied a total of 0 rules in 10 ms. Remains 48 /48 variables (removed 0) and now considering 24/24 (removed 0) transitions.
// Phase 1: matrix 24 rows 48 cols
[2024-05-23 02:01:57] [INFO ] Computed 25 invariants in 5 ms
[2024-05-23 02:01:57] [INFO ] Implicit Places using invariants in 167 ms returned [4, 6, 39, 47]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 197 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 44/48 places, 24/24 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 223 ms. Remains : 44/48 places, 24/24 transitions.
Support contains 28 out of 44 places after structural reductions.
[2024-05-23 02:01:57] [INFO ] Flatten gal took : 19 ms
[2024-05-23 02:01:57] [INFO ] Flatten gal took : 7 ms
[2024-05-23 02:01:57] [INFO ] Input system was already deterministic with 24 transitions.
RANDOM walk for 40000 steps (8 resets) in 1604 ms. (24 steps per ms) remains 9/25 properties
BEST_FIRST walk for 40003 steps (8 resets) in 247 ms. (161 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (8 resets) in 172 ms. (231 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 105 ms. (377 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 272 ms. (146 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 114 ms. (347 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 90 ms. (439 steps per ms) remains 9/9 properties
// Phase 1: matrix 24 rows 44 cols
[2024-05-23 02:01:58] [INFO ] Computed 21 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 1 (OVERLAPS) 13/25 variables, 8/8 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/29 variables, 2/10 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/10 constraints. Problems are: Problem set: 7 solved, 2 unsolved
Problem AtomicPropp18 is UNSAT
At refinement iteration 5 (OVERLAPS) 10/39 variables, 7/17 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/17 constraints. Problems are: Problem set: 8 solved, 1 unsolved
Problem AtomicPropp12 is UNSAT
After SMT solving in domain Real declared 44/68 variables, and 21 constraints, problems are : Problem set: 9 solved, 0 unsolved in 125 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/44 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 171ms problems are : Problem set: 9 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA CircularTrains-PT-024-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 9 atomic propositions for a total of 12 simplifications.
FORMULA CircularTrains-PT-024-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-024-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-024-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-024-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA CircularTrains-PT-024-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 24/24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 44 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 43 transition count 23
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 43 transition count 21
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 41 transition count 21
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 38 transition count 18
Applied a total of 12 rules in 19 ms. Remains 38 /44 variables (removed 6) and now considering 18/24 (removed 6) transitions.
// Phase 1: matrix 18 rows 38 cols
[2024-05-23 02:01:59] [INFO ] Computed 21 invariants in 1 ms
[2024-05-23 02:01:59] [INFO ] Implicit Places using invariants in 64 ms returned [6, 26, 35, 37]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 65 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/44 places, 18/24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 34 transition count 17
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 33 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 32 transition count 16
Applied a total of 4 rules in 4 ms. Remains 32 /34 variables (removed 2) and now considering 16/18 (removed 2) transitions.
// Phase 1: matrix 16 rows 32 cols
[2024-05-23 02:01:59] [INFO ] Computed 17 invariants in 1 ms
[2024-05-23 02:01:59] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-23 02:01:59] [INFO ] Invariant cache hit.
[2024-05-23 02:01:59] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/44 places, 16/24 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 189 ms. Remains : 32/44 places, 16/24 transitions.
Initial state reduction rules removed 1 formulas.
Stuttering acceptance computed with spot in 158 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-024-LTLCardinality-00
Initial state of product has no viable successors after 0 steps with 0 reset in 1 ms.
FORMULA CircularTrains-PT-024-LTLCardinality-00 TRUE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-024-LTLCardinality-00 finished in 405 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0&&F(p1)))'
Support contains 2 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 24/24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 44 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 43 transition count 23
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 43 transition count 21
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 41 transition count 21
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 39 transition count 19
Applied a total of 10 rules in 9 ms. Remains 39 /44 variables (removed 5) and now considering 19/24 (removed 5) transitions.
// Phase 1: matrix 19 rows 39 cols
[2024-05-23 02:01:59] [INFO ] Computed 21 invariants in 1 ms
[2024-05-23 02:01:59] [INFO ] Implicit Places using invariants in 64 ms returned [7, 27, 35, 38]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 65 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/44 places, 19/24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 35 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 34 transition count 18
Applied a total of 2 rules in 2 ms. Remains 34 /35 variables (removed 1) and now considering 18/19 (removed 1) transitions.
// Phase 1: matrix 18 rows 34 cols
[2024-05-23 02:01:59] [INFO ] Computed 17 invariants in 1 ms
[2024-05-23 02:01:59] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-23 02:01:59] [INFO ] Invariant cache hit.
[2024-05-23 02:01:59] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 34/44 places, 18/24 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 194 ms. Remains : 34/44 places, 18/24 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-024-LTLCardinality-01
Product exploration explored 100000 steps with 14322 reset in 251 ms.
Product exploration explored 100000 steps with 14245 reset in 173 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) p0)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 171 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 20 steps (0 resets) in 6 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 1 factoid took 180 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 95 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
[2024-05-23 02:02:01] [INFO ] Invariant cache hit.
[2024-05-23 02:02:01] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2024-05-23 02:02:01] [INFO ] [Real]Absence check using 15 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-23 02:02:01] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-23 02:02:01] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 02:02:01] [INFO ] Added : 7 causal constraints over 2 iterations in 20 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 18/18 transitions.
Applied a total of 0 rules in 3 ms. Remains 34 /34 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-23 02:02:01] [INFO ] Invariant cache hit.
[2024-05-23 02:02:01] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-23 02:02:01] [INFO ] Invariant cache hit.
[2024-05-23 02:02:01] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-05-23 02:02:01] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2024-05-23 02:02:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 15/33 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 1/34 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 18/52 variables, 34/51 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 51 constraints, problems are : Problem set: 0 solved, 10 unsolved in 162 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 15/33 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 1/34 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 18/52 variables, 34/51 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/52 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 61 constraints, problems are : Problem set: 0 solved, 10 unsolved in 173 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 339ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 339ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 436 ms. Remains : 34/34 places, 18/18 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)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 205 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 62 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 27 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 1 factoid took 202 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 85 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
[2024-05-23 02:02:02] [INFO ] Invariant cache hit.
[2024-05-23 02:02:02] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2024-05-23 02:02:02] [INFO ] [Real]Absence check using 15 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-23 02:02:02] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-23 02:02:02] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 02:02:02] [INFO ] Added : 7 causal constraints over 2 iterations in 15 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 14327 reset in 158 ms.
Product exploration explored 100000 steps with 14356 reset in 253 ms.
Support contains 2 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 34 /34 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-23 02:02:02] [INFO ] Invariant cache hit.
[2024-05-23 02:02:02] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-23 02:02:02] [INFO ] Invariant cache hit.
[2024-05-23 02:02:02] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-05-23 02:02:02] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2024-05-23 02:02:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 15/33 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 1/34 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 18/52 variables, 34/51 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 51 constraints, problems are : Problem set: 0 solved, 10 unsolved in 150 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 15/33 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 1/34 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 18/52 variables, 34/51 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/52 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 61 constraints, problems are : Problem set: 0 solved, 10 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 282ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 282ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 370 ms. Remains : 34/34 places, 18/18 transitions.
Treatment of property CircularTrains-PT-024-LTLCardinality-01 finished in 3497 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 24/24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 44 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 43 transition count 23
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 43 transition count 21
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 41 transition count 21
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 38 transition count 18
Applied a total of 12 rules in 6 ms. Remains 38 /44 variables (removed 6) and now considering 18/24 (removed 6) transitions.
// Phase 1: matrix 18 rows 38 cols
[2024-05-23 02:02:03] [INFO ] Computed 21 invariants in 1 ms
[2024-05-23 02:02:03] [INFO ] Implicit Places using invariants in 53 ms returned [6, 26, 35, 37]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 54 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/44 places, 18/24 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 34 transition count 16
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 32 transition count 16
Applied a total of 4 rules in 1 ms. Remains 32 /34 variables (removed 2) and now considering 16/18 (removed 2) transitions.
// Phase 1: matrix 16 rows 32 cols
[2024-05-23 02:02:03] [INFO ] Computed 17 invariants in 0 ms
[2024-05-23 02:02:03] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-23 02:02:03] [INFO ] Invariant cache hit.
[2024-05-23 02:02:03] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/44 places, 16/24 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 134 ms. Remains : 32/44 places, 16/24 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-024-LTLCardinality-03
Product exploration explored 100000 steps with 7434 reset in 137 ms.
Stack based approach found an accepted trace after 3304 steps with 247 reset with depth 63 and stack size 63 in 4 ms.
FORMULA CircularTrains-PT-024-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property CircularTrains-PT-024-LTLCardinality-03 finished in 353 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||X(F(p1)))))))'
Support contains 2 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 24/24 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 24/24 (removed 0) transitions.
// Phase 1: matrix 24 rows 44 cols
[2024-05-23 02:02:03] [INFO ] Computed 21 invariants in 1 ms
[2024-05-23 02:02:03] [INFO ] Implicit Places using invariants in 46 ms returned [8, 28, 38, 43]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 47 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 40/44 places, 24/24 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49 ms. Remains : 40/44 places, 24/24 transitions.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-024-LTLCardinality-04
Product exploration explored 100000 steps with 19201 reset in 144 ms.
Product exploration explored 100000 steps with 19305 reset in 174 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)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 198 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 70 steps (0 resets) in 5 ms. (11 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 1 factoid took 169 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 24/24 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 24/24 (removed 0) transitions.
// Phase 1: matrix 24 rows 40 cols
[2024-05-23 02:02:04] [INFO ] Computed 17 invariants in 2 ms
[2024-05-23 02:02:04] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-23 02:02:04] [INFO ] Invariant cache hit.
[2024-05-23 02:02:04] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Running 16 sub problems to find dead transitions.
[2024-05-23 02:02:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 15/39 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/40 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 24/64 variables, 40/57 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/64 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 64/64 variables, and 57 constraints, problems are : Problem set: 0 solved, 16 unsolved in 186 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 15/39 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/40 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 24/64 variables, 40/57 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 16/73 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/64 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 64/64 variables, and 73 constraints, problems are : Problem set: 0 solved, 16 unsolved in 174 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 364ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 365ms
Finished structural reductions in LTL mode , in 1 iterations and 453 ms. Remains : 40/40 places, 24/24 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 : [(AND (NOT p0) p1)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 111 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 72 steps (0 resets) in 5 ms. (12 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 1 factoid took 145 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 19436 reset in 114 ms.
Product exploration explored 100000 steps with 19403 reset in 115 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 24/24 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 40 transition count 24
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 8 rules in 7 ms. Remains 40 /40 variables (removed 0) and now considering 24/24 (removed 0) transitions.
[2024-05-23 02:02:06] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
// Phase 1: matrix 24 rows 40 cols
[2024-05-23 02:02:06] [INFO ] Computed 17 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 15/39 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-23 02:02:06] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 5 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-23 02:02:06] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-23 02:02:06] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
[2024-05-23 02:02:06] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-23 02:02:06] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-23 02:02:06] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-23 02:02:06] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-23 02:02:06] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD15 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 8/24 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/24 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1/40 variables, 1/25 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/25 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 24/64 variables, 40/65 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/65 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/64 variables, 0/65 constraints. Problems are: Problem set: 8 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 64/64 variables, and 65 constraints, problems are : Problem set: 8 solved, 8 unsolved in 315 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 8 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 23/39 variables, 15/15 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/16 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 8/24 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/24 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1/40 variables, 1/25 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/25 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 24/64 variables, 40/65 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 8/73 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 0/73 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/64 variables, 0/73 constraints. Problems are: Problem set: 8 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 64/64 variables, and 73 constraints, problems are : Problem set: 8 solved, 8 unsolved in 107 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 8/16 constraints, Known Traps: 8/8 constraints]
After SMT, in 433ms problems are : Problem set: 8 solved, 8 unsolved
Search for dead transitions found 8 dead transitions in 434ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 40/40 places, 16/24 transitions.
Graph (complete) has 64 edges and 40 vertex of which 32 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 32 /40 variables (removed 8) and now considering 16/16 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/40 places, 16/24 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 454 ms. Remains : 32/40 places, 16/24 transitions.
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 24/24 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 24/24 (removed 0) transitions.
// Phase 1: matrix 24 rows 40 cols
[2024-05-23 02:02:07] [INFO ] Computed 17 invariants in 1 ms
[2024-05-23 02:02:07] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-23 02:02:07] [INFO ] Invariant cache hit.
[2024-05-23 02:02:07] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Running 16 sub problems to find dead transitions.
[2024-05-23 02:02:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 15/39 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/40 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 24/64 variables, 40/57 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/64 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 64/64 variables, and 57 constraints, problems are : Problem set: 0 solved, 16 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 15/39 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/40 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 24/64 variables, 40/57 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 16/73 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/64 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 64/64 variables, and 73 constraints, problems are : Problem set: 0 solved, 16 unsolved in 162 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 338ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 339ms
Finished structural reductions in LTL mode , in 1 iterations and 420 ms. Remains : 40/40 places, 24/24 transitions.
Treatment of property CircularTrains-PT-024-LTLCardinality-04 finished in 4120 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 24/24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 44 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 43 transition count 23
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 43 transition count 20
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 40 transition count 20
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 37 transition count 17
Applied a total of 14 rules in 4 ms. Remains 37 /44 variables (removed 7) and now considering 17/24 (removed 7) transitions.
// Phase 1: matrix 17 rows 37 cols
[2024-05-23 02:02:07] [INFO ] Computed 21 invariants in 3 ms
[2024-05-23 02:02:07] [INFO ] Implicit Places using invariants in 39 ms returned [6, 26, 36]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 40 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/44 places, 17/24 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 34 transition count 16
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 33 transition count 16
Applied a total of 2 rules in 1 ms. Remains 33 /34 variables (removed 1) and now considering 16/17 (removed 1) transitions.
// Phase 1: matrix 16 rows 33 cols
[2024-05-23 02:02:07] [INFO ] Computed 18 invariants in 0 ms
[2024-05-23 02:02:07] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-23 02:02:07] [INFO ] Invariant cache hit.
[2024-05-23 02:02:07] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 33/44 places, 16/24 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 121 ms. Remains : 33/44 places, 16/24 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-024-LTLCardinality-05
Product exploration explored 100000 steps with 0 reset in 141 ms.
Stack based approach found an accepted trace after 83 steps with 0 reset with depth 84 and stack size 84 in 1 ms.
FORMULA CircularTrains-PT-024-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property CircularTrains-PT-024-LTLCardinality-05 finished in 305 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0 U p1))||(p2&&G(F(p1))))))'
Support contains 6 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 24/24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 44 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 43 transition count 23
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 43 transition count 22
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 42 transition count 22
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 40 transition count 20
Applied a total of 8 rules in 11 ms. Remains 40 /44 variables (removed 4) and now considering 20/24 (removed 4) transitions.
// Phase 1: matrix 20 rows 40 cols
[2024-05-23 02:02:07] [INFO ] Computed 21 invariants in 1 ms
[2024-05-23 02:02:07] [INFO ] Implicit Places using invariants in 37 ms returned [6, 26, 35, 39]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 38 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/44 places, 20/24 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 36 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 35 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 35 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 34 transition count 18
Applied a total of 4 rules in 3 ms. Remains 34 /36 variables (removed 2) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 34 cols
[2024-05-23 02:02:07] [INFO ] Computed 17 invariants in 1 ms
[2024-05-23 02:02:08] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-23 02:02:08] [INFO ] Invariant cache hit.
[2024-05-23 02:02:08] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 34/44 places, 18/24 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 122 ms. Remains : 34/44 places, 18/24 transitions.
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CircularTrains-PT-024-LTLCardinality-09
Product exploration explored 100000 steps with 14476 reset in 148 ms.
Stack based approach found an accepted trace after 78289 steps with 11350 reset with depth 20 and stack size 20 in 118 ms.
FORMULA CircularTrains-PT-024-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property CircularTrains-PT-024-LTLCardinality-09 finished in 627 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 24/24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 44 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 43 transition count 23
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 43 transition count 20
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 40 transition count 20
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 38 transition count 18
Applied a total of 12 rules in 9 ms. Remains 38 /44 variables (removed 6) and now considering 18/24 (removed 6) transitions.
// Phase 1: matrix 18 rows 38 cols
[2024-05-23 02:02:08] [INFO ] Computed 21 invariants in 1 ms
[2024-05-23 02:02:08] [INFO ] Implicit Places using invariants in 40 ms returned [6, 26, 34, 37]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 40 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/44 places, 18/24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 34 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 33 transition count 17
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 33 transition count 16
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 32 transition count 16
Applied a total of 4 rules in 2 ms. Remains 32 /34 variables (removed 2) and now considering 16/18 (removed 2) transitions.
// Phase 1: matrix 16 rows 32 cols
[2024-05-23 02:02:08] [INFO ] Computed 17 invariants in 1 ms
[2024-05-23 02:02:08] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-23 02:02:08] [INFO ] Invariant cache hit.
[2024-05-23 02:02:08] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/44 places, 16/24 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 120 ms. Remains : 32/44 places, 16/24 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-024-LTLCardinality-14
Product exploration explored 100000 steps with 0 reset in 137 ms.
Stack based approach found an accepted trace after 250 steps with 0 reset with depth 251 and stack size 251 in 0 ms.
FORMULA CircularTrains-PT-024-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property CircularTrains-PT-024-LTLCardinality-14 finished in 303 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0&&F(p1)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||X(F(p1)))))))'
Found a Shortening insensitive property : CircularTrains-PT-024-LTLCardinality-04
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 44 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 44/44 places, 24/24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 44 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 43 transition count 23
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 43 transition count 22
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 42 transition count 22
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 39 transition count 19
Applied a total of 10 rules in 10 ms. Remains 39 /44 variables (removed 5) and now considering 19/24 (removed 5) transitions.
// Phase 1: matrix 19 rows 39 cols
[2024-05-23 02:02:09] [INFO ] Computed 21 invariants in 1 ms
[2024-05-23 02:02:09] [INFO ] Implicit Places using invariants in 54 ms returned [6, 26, 35, 38]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 54 ms to find 4 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 35/44 places, 19/24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 35 transition count 18
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 4 place count 34 transition count 16
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 32 transition count 16
Applied a total of 6 rules in 1 ms. Remains 32 /35 variables (removed 3) and now considering 16/19 (removed 3) transitions.
// Phase 1: matrix 16 rows 32 cols
[2024-05-23 02:02:09] [INFO ] Computed 17 invariants in 1 ms
[2024-05-23 02:02:09] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-23 02:02:09] [INFO ] Invariant cache hit.
[2024-05-23 02:02:09] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 32/44 places, 16/24 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 141 ms. Remains : 32/44 places, 16/24 transitions.
Running random walk in product with property : CircularTrains-PT-024-LTLCardinality-04
Product exploration explored 100000 steps with 21258 reset in 99 ms.
Product exploration explored 100000 steps with 21273 reset in 116 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)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 111 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 59 steps (0 resets) in 4 ms. (11 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 1 factoid took 177 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2024-05-23 02:02:10] [INFO ] Invariant cache hit.
[2024-05-23 02:02:10] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-23 02:02:10] [INFO ] Invariant cache hit.
[2024-05-23 02:02:10] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Running 8 sub problems to find dead transitions.
[2024-05-23 02:02:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 15/31 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 1/32 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 16/48 variables, 32/49 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 49 constraints, problems are : Problem set: 0 solved, 8 unsolved in 98 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 15/31 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 1/32 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 16/48 variables, 32/49 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 57 constraints, problems are : Problem set: 0 solved, 8 unsolved in 124 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 235ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 235ms
Finished structural reductions in LTL mode , in 1 iterations and 313 ms. Remains : 32/32 places, 16/16 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 : [(AND (NOT p0) p1)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 186 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 48 steps (0 resets) in 4 ms. (9 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 1 factoid took 294 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 21378 reset in 117 ms.
Product exploration explored 100000 steps with 21352 reset in 114 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Applied a total of 0 rules in 3 ms. Remains 32 /32 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2024-05-23 02:02:12] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2024-05-23 02:02:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 15/31 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 1/32 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 16/48 variables, 32/49 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 49 constraints, problems are : Problem set: 0 solved, 8 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 15/31 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 1/32 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 16/48 variables, 32/49 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 57 constraints, problems are : Problem set: 0 solved, 8 unsolved in 103 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 234ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 235ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 242 ms. Remains : 32/32 places, 16/16 transitions.
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2024-05-23 02:02:12] [INFO ] Invariant cache hit.
[2024-05-23 02:02:12] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-23 02:02:12] [INFO ] Invariant cache hit.
[2024-05-23 02:02:12] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Running 8 sub problems to find dead transitions.
[2024-05-23 02:02:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 15/31 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 1/32 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 16/48 variables, 32/49 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 49 constraints, problems are : Problem set: 0 solved, 8 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 15/31 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 1/32 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 16/48 variables, 32/49 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 57 constraints, problems are : Problem set: 0 solved, 8 unsolved in 83 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 168ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 169ms
Finished structural reductions in LTL mode , in 1 iterations and 247 ms. Remains : 32/32 places, 16/16 transitions.
Treatment of property CircularTrains-PT-024-LTLCardinality-04 finished in 4091 ms.
[2024-05-23 02:02:13] [INFO ] Flatten gal took : 5 ms
[2024-05-23 02:02:13] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-05-23 02:02:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 44 places, 24 transitions and 88 arcs took 2 ms.
Total runtime 15937 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CircularTrains-PT-024

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 44
TRANSITIONS: 24
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.002s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1370
MODEL NAME: /home/mcc/execution/412/model
44 places, 24 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA CircularTrains-PT-024-LTLCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CircularTrains-PT-024-LTLCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716429733666

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

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

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="CircularTrains-PT-024"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is CircularTrains-PT-024, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r069-tall-171620504300331"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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