Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r073-smll-167814399200179.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is CircularTrains-PT-192, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r073-smll-167814399200179
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 7.2K Feb 26 04:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 04:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 04:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 04:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 04:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 26 04:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 04:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Feb 26 04:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 147K Mar 5 18:22 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-192-LTLCardinality-00
FORMULA_NAME CircularTrains-PT-192-LTLCardinality-01
FORMULA_NAME CircularTrains-PT-192-LTLCardinality-02
FORMULA_NAME CircularTrains-PT-192-LTLCardinality-03
FORMULA_NAME CircularTrains-PT-192-LTLCardinality-04
FORMULA_NAME CircularTrains-PT-192-LTLCardinality-05
FORMULA_NAME CircularTrains-PT-192-LTLCardinality-06
FORMULA_NAME CircularTrains-PT-192-LTLCardinality-07
FORMULA_NAME CircularTrains-PT-192-LTLCardinality-08
FORMULA_NAME CircularTrains-PT-192-LTLCardinality-09
FORMULA_NAME CircularTrains-PT-192-LTLCardinality-10
FORMULA_NAME CircularTrains-PT-192-LTLCardinality-11
FORMULA_NAME CircularTrains-PT-192-LTLCardinality-12
FORMULA_NAME CircularTrains-PT-192-LTLCardinality-13
FORMULA_NAME CircularTrains-PT-192-LTLCardinality-14
FORMULA_NAME CircularTrains-PT-192-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678304205664

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircularTrains-PT-192
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 19:36:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 19:36:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 19:36:49] [INFO ] Load time of PNML (sax parser for PT used): 184 ms
[2023-03-08 19:36:49] [INFO ] Transformed 384 places.
[2023-03-08 19:36:49] [INFO ] Transformed 192 transitions.
[2023-03-08 19:36:49] [INFO ] Parsed PT model containing 384 places and 192 transitions and 768 arcs in 367 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CircularTrains-PT-192-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-192-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 60 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 192/192 transitions.
Applied a total of 0 rules in 100 ms. Remains 384 /384 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 384 cols
[2023-03-08 19:36:50] [INFO ] Computed 193 place invariants in 50 ms
[2023-03-08 19:36:51] [INFO ] Implicit Places using invariants in 1181 ms returned [1, 7, 10, 18, 21, 28, 37, 44, 47, 48, 62, 75, 78, 81, 89, 102, 108, 133, 138, 144, 146, 163, 167, 217, 230, 231, 244, 245, 247, 261, 284, 285, 298, 311, 313, 314, 324, 327, 330, 332, 333, 346, 354, 356, 366, 369, 371, 374, 375, 376, 378, 380, 382]
Discarding 53 places :
Implicit Place search using SMT only with invariants took 1247 ms to find 53 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 331/384 places, 192/192 transitions.
Applied a total of 0 rules in 27 ms. Remains 331 /331 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1374 ms. Remains : 331/384 places, 192/192 transitions.
Support contains 60 out of 331 places after structural reductions.
[2023-03-08 19:36:51] [INFO ] Flatten gal took : 113 ms
[2023-03-08 19:36:52] [INFO ] Flatten gal took : 51 ms
[2023-03-08 19:36:52] [INFO ] Input system was already deterministic with 192 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 860 ms. (steps per millisecond=11 ) properties (out of 32) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 192 rows 331 cols
[2023-03-08 19:36:53] [INFO ] Computed 140 place invariants in 11 ms
[2023-03-08 19:36:53] [INFO ] [Real]Absence check using 124 positive place invariants in 114 ms returned sat
[2023-03-08 19:36:53] [INFO ] [Real]Absence check using 124 positive and 16 generalized place invariants in 11 ms returned sat
[2023-03-08 19:36:53] [INFO ] After 373ms SMT Verify possible using all constraints in real domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA CircularTrains-PT-192-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 6 atomic propositions for a total of 13 simplifications.
FORMULA CircularTrains-PT-192-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-192-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA CircularTrains-PT-192-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 3 out of 331 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 331/331 places, 192/192 transitions.
Applied a total of 0 rules in 14 ms. Remains 331 /331 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2023-03-08 19:36:54] [INFO ] Invariant cache hit.
[2023-03-08 19:36:54] [INFO ] Implicit Places using invariants in 525 ms returned [53, 54, 122, 139, 173, 253, 261, 308, 313, 316]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 535 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 321/331 places, 192/192 transitions.
Applied a total of 0 rules in 9 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 559 ms. Remains : 321/331 places, 192/192 transitions.
Stuttering acceptance computed with spot in 327 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : CircularTrains-PT-192-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LEQ s84 s197) (LEQ 2 s33))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 5 ms.
FORMULA CircularTrains-PT-192-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-192-LTLCardinality-00 finished in 964 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 331 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 331/331 places, 192/192 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 331 transition count 151
Reduce places removed 41 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 42 rules applied. Total rules applied 83 place count 290 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 84 place count 289 transition count 150
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 84 place count 289 transition count 139
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 106 place count 278 transition count 139
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 124 place count 269 transition count 130
Applied a total of 124 rules in 62 ms. Remains 269 /331 variables (removed 62) and now considering 130/192 (removed 62) transitions.
// Phase 1: matrix 130 rows 269 cols
[2023-03-08 19:36:55] [INFO ] Computed 140 place invariants in 6 ms
[2023-03-08 19:36:55] [INFO ] Implicit Places using invariants in 678 ms returned [46, 47, 71, 101, 117, 143, 203, 210, 248, 253]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 686 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 259/331 places, 130/192 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 259 transition count 129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 258 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 257 transition count 128
Applied a total of 4 rules in 26 ms. Remains 257 /259 variables (removed 2) and now considering 128/130 (removed 2) transitions.
// Phase 1: matrix 128 rows 257 cols
[2023-03-08 19:36:55] [INFO ] Computed 130 place invariants in 14 ms
[2023-03-08 19:36:56] [INFO ] Implicit Places using invariants in 427 ms returned []
[2023-03-08 19:36:56] [INFO ] Invariant cache hit.
[2023-03-08 19:36:56] [INFO ] Implicit Places using invariants and state equation in 524 ms returned []
Implicit Place search using SMT with State Equation took 975 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 257/331 places, 128/192 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1750 ms. Remains : 257/331 places, 128/192 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-192-LTLCardinality-01 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 (LEQ s193 s135) (LEQ s244 s121))], 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 0 reset in 1202 ms.
Product exploration explored 100000 steps with 0 reset in 1253 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)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 133 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 134 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=44 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 145 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2023-03-08 19:36:59] [INFO ] Invariant cache hit.
[2023-03-08 19:37:00] [INFO ] [Real]Absence check using 126 positive place invariants in 78 ms returned sat
[2023-03-08 19:37:00] [INFO ] [Real]Absence check using 126 positive and 4 generalized place invariants in 24 ms returned sat
[2023-03-08 19:37:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:37:00] [INFO ] [Real]Absence check using state equation in 475 ms returned sat
[2023-03-08 19:37:00] [INFO ] Computed and/alt/rep : 64/128/64 causal constraints (skipped 0 transitions) in 21 ms.
[2023-03-08 19:37:01] [INFO ] Added : 62 causal constraints over 13 iterations in 676 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 257 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 257/257 places, 128/128 transitions.
Applied a total of 0 rules in 14 ms. Remains 257 /257 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2023-03-08 19:37:01] [INFO ] Invariant cache hit.
[2023-03-08 19:37:01] [INFO ] Implicit Places using invariants in 433 ms returned []
[2023-03-08 19:37:01] [INFO ] Invariant cache hit.
[2023-03-08 19:37:02] [INFO ] Implicit Places using invariants and state equation in 580 ms returned []
Implicit Place search using SMT with State Equation took 1022 ms to find 0 implicit places.
[2023-03-08 19:37:02] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-08 19:37:02] [INFO ] Invariant cache hit.
[2023-03-08 19:37:02] [INFO ] Dead Transitions using invariants and state equation in 260 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1312 ms. Remains : 257/257 places, 128/128 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)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 176 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 214 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
[2023-03-08 19:37:03] [INFO ] Invariant cache hit.
[2023-03-08 19:37:03] [INFO ] [Real]Absence check using 126 positive place invariants in 76 ms returned sat
[2023-03-08 19:37:03] [INFO ] [Real]Absence check using 126 positive and 4 generalized place invariants in 24 ms returned sat
[2023-03-08 19:37:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:37:04] [INFO ] [Real]Absence check using state equation in 488 ms returned sat
[2023-03-08 19:37:04] [INFO ] Computed and/alt/rep : 64/128/64 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-08 19:37:04] [INFO ] Added : 62 causal constraints over 13 iterations in 556 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 67 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1011 ms.
Product exploration explored 100000 steps with 0 reset in 933 ms.
Support contains 4 out of 257 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 257/257 places, 128/128 transitions.
Applied a total of 0 rules in 8 ms. Remains 257 /257 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2023-03-08 19:37:06] [INFO ] Invariant cache hit.
[2023-03-08 19:37:07] [INFO ] Implicit Places using invariants in 303 ms returned []
[2023-03-08 19:37:07] [INFO ] Invariant cache hit.
[2023-03-08 19:37:07] [INFO ] Implicit Places using invariants and state equation in 543 ms returned []
Implicit Place search using SMT with State Equation took 849 ms to find 0 implicit places.
[2023-03-08 19:37:07] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-08 19:37:07] [INFO ] Invariant cache hit.
[2023-03-08 19:37:07] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1150 ms. Remains : 257/257 places, 128/128 transitions.
Treatment of property CircularTrains-PT-192-LTLCardinality-01 finished in 12807 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((p1&&F((p0&&X(p2))))))))'
Support contains 4 out of 331 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 331/331 places, 192/192 transitions.
Applied a total of 0 rules in 8 ms. Remains 331 /331 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 331 cols
[2023-03-08 19:37:07] [INFO ] Computed 140 place invariants in 5 ms
[2023-03-08 19:37:08] [INFO ] Implicit Places using invariants in 555 ms returned [53, 54, 86, 122, 139, 173, 261, 308, 313, 316]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 561 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 321/331 places, 192/192 transitions.
Applied a total of 0 rules in 7 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 576 ms. Remains : 321/331 places, 192/192 transitions.
Stuttering acceptance computed with spot in 278 ms :[(NOT p2), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : CircularTrains-PT-192-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ 1 s247), p2:(LEQ 1 s233), p1:(LEQ s124 s55)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 837 reset in 1166 ms.
Product exploration explored 100000 steps with 839 reset in 949 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 p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 5 factoid took 633 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[(NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 2088 steps, including 0 resets, run visited all 7 properties in 34 ms. (steps per millisecond=61 )
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p2) p0))), (F (NOT p0)), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 5 factoid took 1125 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[(NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 235 ms :[(NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2))]
// Phase 1: matrix 192 rows 321 cols
[2023-03-08 19:37:13] [INFO ] Computed 130 place invariants in 4 ms
[2023-03-08 19:37:13] [INFO ] [Real]Absence check using 127 positive place invariants in 81 ms returned sat
[2023-03-08 19:37:13] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 26 ms returned sat
[2023-03-08 19:37:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:37:14] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2023-03-08 19:37:14] [INFO ] Computed and/alt/rep : 128/192/128 causal constraints (skipped 0 transitions) in 21 ms.
[2023-03-08 19:37:15] [INFO ] Added : 125 causal constraints over 25 iterations in 1645 ms. Result :sat
Could not prove EG (NOT p2)
[2023-03-08 19:37:15] [INFO ] Invariant cache hit.
[2023-03-08 19:37:16] [INFO ] [Real]Absence check using 127 positive place invariants in 83 ms returned sat
[2023-03-08 19:37:16] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 20 ms returned sat
[2023-03-08 19:37:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:37:17] [INFO ] [Real]Absence check using state equation in 821 ms returned sat
[2023-03-08 19:37:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:37:17] [INFO ] [Nat]Absence check using 127 positive place invariants in 77 ms returned sat
[2023-03-08 19:37:17] [INFO ] [Nat]Absence check using 127 positive and 3 generalized place invariants in 16 ms returned sat
[2023-03-08 19:37:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:37:17] [INFO ] [Nat]Absence check using state equation in 382 ms returned sat
[2023-03-08 19:37:17] [INFO ] Computed and/alt/rep : 128/192/128 causal constraints (skipped 0 transitions) in 21 ms.
[2023-03-08 19:37:18] [INFO ] Added : 125 causal constraints over 25 iterations in 883 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 192/192 transitions.
Applied a total of 0 rules in 5 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2023-03-08 19:37:18] [INFO ] Invariant cache hit.
[2023-03-08 19:37:19] [INFO ] Implicit Places using invariants in 390 ms returned []
[2023-03-08 19:37:19] [INFO ] Invariant cache hit.
[2023-03-08 19:37:19] [INFO ] Implicit Places using invariants and state equation in 642 ms returned []
Implicit Place search using SMT with State Equation took 1041 ms to find 0 implicit places.
[2023-03-08 19:37:19] [INFO ] Invariant cache hit.
[2023-03-08 19:37:20] [INFO ] Dead Transitions using invariants and state equation in 346 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1393 ms. Remains : 321/321 places, 192/192 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 p2) p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 5 factoid took 843 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 797 steps, including 0 resets, run visited all 7 properties in 21 ms. (steps per millisecond=37 )
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p2) p0))), (F (NOT p0)), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 5 factoid took 945 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 229 ms :[(NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2))]
[2023-03-08 19:37:22] [INFO ] Invariant cache hit.
[2023-03-08 19:37:22] [INFO ] [Real]Absence check using 127 positive place invariants in 83 ms returned sat
[2023-03-08 19:37:23] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 30 ms returned sat
[2023-03-08 19:37:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:37:23] [INFO ] [Real]Absence check using state equation in 692 ms returned sat
[2023-03-08 19:37:23] [INFO ] Computed and/alt/rep : 128/192/128 causal constraints (skipped 0 transitions) in 23 ms.
[2023-03-08 19:37:25] [INFO ] Added : 125 causal constraints over 25 iterations in 1564 ms. Result :sat
Could not prove EG (NOT p2)
[2023-03-08 19:37:25] [INFO ] Invariant cache hit.
[2023-03-08 19:37:25] [INFO ] [Real]Absence check using 127 positive place invariants in 88 ms returned sat
[2023-03-08 19:37:25] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 20 ms returned sat
[2023-03-08 19:37:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:37:26] [INFO ] [Real]Absence check using state equation in 768 ms returned sat
[2023-03-08 19:37:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:37:26] [INFO ] [Nat]Absence check using 127 positive place invariants in 44 ms returned sat
[2023-03-08 19:37:26] [INFO ] [Nat]Absence check using 127 positive and 3 generalized place invariants in 15 ms returned sat
[2023-03-08 19:37:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:37:27] [INFO ] [Nat]Absence check using state equation in 381 ms returned sat
[2023-03-08 19:37:27] [INFO ] Computed and/alt/rep : 128/192/128 causal constraints (skipped 0 transitions) in 20 ms.
[2023-03-08 19:37:28] [INFO ] Added : 125 causal constraints over 25 iterations in 1026 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 234 ms :[(NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 830 reset in 1285 ms.
Product exploration explored 100000 steps with 886 reset in 1023 ms.
Support contains 4 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 192/192 transitions.
Applied a total of 0 rules in 7 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2023-03-08 19:37:30] [INFO ] Invariant cache hit.
[2023-03-08 19:37:31] [INFO ] Implicit Places using invariants in 386 ms returned []
[2023-03-08 19:37:31] [INFO ] Invariant cache hit.
[2023-03-08 19:37:31] [INFO ] Implicit Places using invariants and state equation in 665 ms returned []
Implicit Place search using SMT with State Equation took 1054 ms to find 0 implicit places.
[2023-03-08 19:37:31] [INFO ] Invariant cache hit.
[2023-03-08 19:37:32] [INFO ] Dead Transitions using invariants and state equation in 353 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1416 ms. Remains : 321/321 places, 192/192 transitions.
Treatment of property CircularTrains-PT-192-LTLCardinality-02 finished in 24459 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&F(p1))))'
Support contains 4 out of 331 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 331/331 places, 192/192 transitions.
Applied a total of 0 rules in 7 ms. Remains 331 /331 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 331 cols
[2023-03-08 19:37:32] [INFO ] Computed 140 place invariants in 4 ms
[2023-03-08 19:37:32] [INFO ] Implicit Places using invariants in 510 ms returned [54, 86, 122, 139, 173, 253, 261, 308, 313, 316]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 512 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 321/331 places, 192/192 transitions.
Applied a total of 0 rules in 6 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 526 ms. Remains : 321/331 places, 192/192 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-192-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GT 3 s53) (GT s162 s95)), p0:(AND (OR (GT 2 s238) (GT s162 s95)) (GT s162 s95))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 841 reset in 921 ms.
Product exploration explored 100000 steps with 816 reset in 938 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))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 1 factoid took 442 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 39 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 615 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
// Phase 1: matrix 192 rows 321 cols
[2023-03-08 19:37:36] [INFO ] Computed 130 place invariants in 3 ms
[2023-03-08 19:37:36] [INFO ] [Real]Absence check using 127 positive place invariants in 80 ms returned sat
[2023-03-08 19:37:36] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 17 ms returned unsat
Proved EG (NOT p0)
[2023-03-08 19:37:36] [INFO ] Invariant cache hit.
[2023-03-08 19:37:37] [INFO ] [Real]Absence check using 127 positive place invariants in 86 ms returned sat
[2023-03-08 19:37:37] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 19 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (G (NOT p0)), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 1 factoid took 533 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CircularTrains-PT-192-LTLCardinality-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CircularTrains-PT-192-LTLCardinality-04 finished in 5474 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(F((p1||G(p2))))))))'
Support contains 6 out of 331 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 331/331 places, 192/192 transitions.
Applied a total of 0 rules in 7 ms. Remains 331 /331 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 331 cols
[2023-03-08 19:37:37] [INFO ] Computed 140 place invariants in 4 ms
[2023-03-08 19:37:38] [INFO ] Implicit Places using invariants in 484 ms returned [53, 54, 86, 122, 139, 173, 253, 261, 308, 313, 316]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 486 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 320/331 places, 192/192 transitions.
Applied a total of 0 rules in 6 ms. Remains 320 /320 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 500 ms. Remains : 320/331 places, 192/192 transitions.
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-192-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(LEQ s252 s147), p2:(LEQ s293 s123), p1:(LEQ s218 s15)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3328 reset in 1320 ms.
Product exploration explored 100000 steps with 3369 reset in 1453 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) p2 p1), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (AND p2 (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0)))))]
Knowledge based reduction with 3 factoid took 361 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 3473 steps, including 1 resets, run visited all 3 properties in 27 ms. (steps per millisecond=128 )
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (AND p2 (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (F p0), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 3 factoid took 335 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 6 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 192/192 transitions.
Applied a total of 0 rules in 5 ms. Remains 320 /320 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 320 cols
[2023-03-08 19:37:42] [INFO ] Computed 129 place invariants in 2 ms
[2023-03-08 19:37:42] [INFO ] Implicit Places using invariants in 284 ms returned []
[2023-03-08 19:37:42] [INFO ] Invariant cache hit.
[2023-03-08 19:37:43] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 775 ms to find 0 implicit places.
[2023-03-08 19:37:43] [INFO ] Invariant cache hit.
[2023-03-08 19:37:43] [INFO ] Dead Transitions using invariants and state equation in 317 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1099 ms. Remains : 320/320 places, 192/192 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 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
Knowledge based reduction with 3 factoid took 356 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 1819 steps, including 0 resets, run visited all 3 properties in 44 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (F p0), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 3 factoid took 369 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 3332 reset in 1567 ms.
Product exploration explored 100000 steps with 3370 reset in 1051 ms.
Applying partial POR strategy [true, true, false]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 6 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 192/192 transitions.
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 320 transition count 192
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 60 place count 320 transition count 192
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 320 transition count 192
Deduced a syphon composed of 62 places in 0 ms
Applied a total of 62 rules in 28 ms. Remains 320 /320 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2023-03-08 19:37:47] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 192 rows 320 cols
[2023-03-08 19:37:47] [INFO ] Computed 129 place invariants in 2 ms
[2023-03-08 19:37:48] [INFO ] Dead Transitions using invariants and state equation in 332 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 320/320 places, 192/192 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 375 ms. Remains : 320/320 places, 192/192 transitions.
Support contains 6 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 192/192 transitions.
Applied a total of 0 rules in 18 ms. Remains 320 /320 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 320 cols
[2023-03-08 19:37:48] [INFO ] Computed 129 place invariants in 3 ms
[2023-03-08 19:37:48] [INFO ] Implicit Places using invariants in 407 ms returned []
[2023-03-08 19:37:48] [INFO ] Invariant cache hit.
[2023-03-08 19:37:49] [INFO ] Implicit Places using invariants and state equation in 623 ms returned []
Implicit Place search using SMT with State Equation took 1033 ms to find 0 implicit places.
[2023-03-08 19:37:49] [INFO ] Invariant cache hit.
[2023-03-08 19:37:49] [INFO ] Dead Transitions using invariants and state equation in 305 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1359 ms. Remains : 320/320 places, 192/192 transitions.
Treatment of property CircularTrains-PT-192-LTLCardinality-06 finished in 11729 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 331 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 331/331 places, 192/192 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 331 transition count 149
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 86 place count 288 transition count 149
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 86 place count 288 transition count 140
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 104 place count 279 transition count 140
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 120 place count 271 transition count 132
Applied a total of 120 rules in 46 ms. Remains 271 /331 variables (removed 60) and now considering 132/192 (removed 60) transitions.
// Phase 1: matrix 132 rows 271 cols
[2023-03-08 19:37:49] [INFO ] Computed 140 place invariants in 2 ms
[2023-03-08 19:37:50] [INFO ] Implicit Places using invariants in 449 ms returned [46, 47, 71, 101, 117, 145, 205, 212, 250, 255, 258]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 450 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 260/331 places, 132/192 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 260 transition count 130
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 258 transition count 130
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 258 transition count 129
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 6 place count 257 transition count 129
Applied a total of 6 rules in 22 ms. Remains 257 /260 variables (removed 3) and now considering 129/132 (removed 3) transitions.
// Phase 1: matrix 129 rows 257 cols
[2023-03-08 19:37:50] [INFO ] Computed 129 place invariants in 2 ms
[2023-03-08 19:37:50] [INFO ] Implicit Places using invariants in 419 ms returned []
[2023-03-08 19:37:50] [INFO ] Invariant cache hit.
[2023-03-08 19:37:51] [INFO ] Implicit Places using invariants and state equation in 585 ms returned []
Implicit Place search using SMT with State Equation took 1006 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 257/331 places, 129/192 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1525 ms. Remains : 257/331 places, 129/192 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-192-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s133 s49)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 767 reset in 1314 ms.
Product exploration explored 100000 steps with 747 reset in 1132 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 : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 132 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 83 ms :[(NOT p0), (NOT p0)]
Finished random walk after 161 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=40 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 214 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 103 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 257 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 257/257 places, 129/129 transitions.
Applied a total of 0 rules in 11 ms. Remains 257 /257 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2023-03-08 19:37:54] [INFO ] Invariant cache hit.
[2023-03-08 19:37:54] [INFO ] Implicit Places using invariants in 418 ms returned []
[2023-03-08 19:37:54] [INFO ] Invariant cache hit.
[2023-03-08 19:37:55] [INFO ] Implicit Places using invariants and state equation in 560 ms returned []
Implicit Place search using SMT with State Equation took 981 ms to find 0 implicit places.
[2023-03-08 19:37:55] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 19:37:55] [INFO ] Invariant cache hit.
[2023-03-08 19:37:55] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1254 ms. Remains : 257/257 places, 129/129 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 : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 172 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 98 ms :[(NOT p0), (NOT p0)]
Finished random walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 313 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 102 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 751 reset in 841 ms.
Product exploration explored 100000 steps with 768 reset in 913 ms.
Support contains 2 out of 257 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 257/257 places, 129/129 transitions.
Applied a total of 0 rules in 7 ms. Remains 257 /257 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2023-03-08 19:37:58] [INFO ] Invariant cache hit.
[2023-03-08 19:37:58] [INFO ] Implicit Places using invariants in 404 ms returned []
[2023-03-08 19:37:58] [INFO ] Invariant cache hit.
[2023-03-08 19:37:59] [INFO ] Implicit Places using invariants and state equation in 568 ms returned []
Implicit Place search using SMT with State Equation took 982 ms to find 0 implicit places.
[2023-03-08 19:37:59] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-08 19:37:59] [INFO ] Invariant cache hit.
[2023-03-08 19:37:59] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1221 ms. Remains : 257/257 places, 129/129 transitions.
Treatment of property CircularTrains-PT-192-LTLCardinality-07 finished in 9942 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U p1))'
Support contains 4 out of 331 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 331/331 places, 192/192 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 331 transition count 150
Reduce places removed 42 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 43 rules applied. Total rules applied 85 place count 289 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 86 place count 288 transition count 149
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 86 place count 288 transition count 139
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 106 place count 278 transition count 139
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 124 place count 269 transition count 130
Applied a total of 124 rules in 34 ms. Remains 269 /331 variables (removed 62) and now considering 130/192 (removed 62) transitions.
// Phase 1: matrix 130 rows 269 cols
[2023-03-08 19:37:59] [INFO ] Computed 140 place invariants in 2 ms
[2023-03-08 19:38:00] [INFO ] Implicit Places using invariants in 475 ms returned [46, 47, 71, 101, 117, 203, 210, 248, 253, 256]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 476 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 259/331 places, 130/192 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 259 transition count 129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 258 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 257 transition count 128
Applied a total of 4 rules in 28 ms. Remains 257 /259 variables (removed 2) and now considering 128/130 (removed 2) transitions.
// Phase 1: matrix 128 rows 257 cols
[2023-03-08 19:38:00] [INFO ] Computed 130 place invariants in 2 ms
[2023-03-08 19:38:00] [INFO ] Implicit Places using invariants in 331 ms returned []
[2023-03-08 19:38:00] [INFO ] Invariant cache hit.
[2023-03-08 19:38:00] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 713 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 257/331 places, 128/192 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1252 ms. Remains : 257/331 places, 128/192 transitions.
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p1)]
Running random walk in product with property : CircularTrains-PT-192-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(GT s145 s136), p0:(GT s75 s250)], 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, null][true, true]]
Entered a terminal (fully accepting) state of product in 57 steps with 0 reset in 1 ms.
FORMULA CircularTrains-PT-192-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-192-LTLCardinality-11 finished in 1320 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||X(!p0)))&&X(p1)&&F(p2)))'
Support contains 7 out of 331 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 331/331 places, 192/192 transitions.
Applied a total of 0 rules in 4 ms. Remains 331 /331 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 331 cols
[2023-03-08 19:38:00] [INFO ] Computed 140 place invariants in 1 ms
[2023-03-08 19:38:01] [INFO ] Implicit Places using invariants in 469 ms returned [53, 54, 86, 122, 139, 173, 253, 261, 308, 313, 316]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 471 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 320/331 places, 192/192 transitions.
Applied a total of 0 rules in 6 ms. Remains 320 /320 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 482 ms. Remains : 320/331 places, 192/192 transitions.
Stuttering acceptance computed with spot in 386 ms :[(OR (NOT p2) (NOT p1)), p0, false, (NOT p1), (NOT p2), true]
Running random walk in product with property : CircularTrains-PT-192-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GT s305 s207), p2:(GT s95 s176), p1:(AND (GT 2 s203) (GT s275 s292))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 1347 steps with 28 reset in 22 ms.
FORMULA CircularTrains-PT-192-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-192-LTLCardinality-12 finished in 911 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!p0) U ((X(!p0)&&(p1||(G(p2) U p3)))||X(G(!p0)))))'
Support contains 6 out of 331 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 331/331 places, 192/192 transitions.
Applied a total of 0 rules in 6 ms. Remains 331 /331 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2023-03-08 19:38:01] [INFO ] Invariant cache hit.
[2023-03-08 19:38:02] [INFO ] Implicit Places using invariants in 474 ms returned [53, 54, 86, 139, 173, 253, 261, 308, 313, 316]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 475 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 321/331 places, 192/192 transitions.
Applied a total of 0 rules in 6 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 487 ms. Remains : 321/331 places, 192/192 transitions.
Stuttering acceptance computed with spot in 427 ms :[p0, p0, (OR (AND p0 (NOT p3)) (AND p0 (NOT p2))), true, (AND (NOT p2) p0), (AND p0 (NOT p3) p2), (NOT p2), (NOT p3)]
Running random walk in product with property : CircularTrains-PT-192-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p3) (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p3) p2 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p2 p0), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p3) (NOT p2) p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p3) p2 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p2 p0), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 3}, { cond=(AND p2 p0), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p3) p2 p0), acceptance={} source=5 dest: 7}], [{ cond=(NOT p2), acceptance={} source=6 dest: 3}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p3) p2), acceptance={0} source=7 dest: 7}]], initial=1, aps=[p0:(AND (LEQ s51 s151) (LEQ s119 s143)), p1:(GT s51 s151), p3:(LEQ s119 s143), p2:(LEQ s81 s232)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1310 ms.
Product exploration explored 100000 steps with 50000 reset in 1076 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 (NOT p3) p2), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p3) p2 p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)))), true, (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p3) p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) p2 p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND (NOT p3) p2)), (X (NOT (AND (NOT p3) p2))), (X (AND (NOT p1) (NOT p3) p2 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p3) p2 (NOT p0)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0))))), (X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND (NOT p1) (NOT p3) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) p2 (NOT p0)))))]
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 12 factoid took 661 ms. Reduced automaton from 8 states, 22 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CircularTrains-PT-192-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CircularTrains-PT-192-LTLCardinality-14 finished in 4045 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)&&p0)))'
Support contains 7 out of 331 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 331/331 places, 192/192 transitions.
Applied a total of 0 rules in 6 ms. Remains 331 /331 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2023-03-08 19:38:05] [INFO ] Invariant cache hit.
[2023-03-08 19:38:06] [INFO ] Implicit Places using invariants in 474 ms returned [53, 54, 86, 122, 139, 173, 253, 261, 316]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 476 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 322/331 places, 192/192 transitions.
Applied a total of 0 rules in 6 ms. Remains 322 /322 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 489 ms. Remains : 322/331 places, 192/192 transitions.
Stuttering acceptance computed with spot in 255 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-192-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(LEQ s28 s300), p0:(AND (GT s4 s140) (OR (LEQ s27 s32) (GT 2 s305) (LEQ 2 s305)))], 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 1 steps with 0 reset in 1 ms.
FORMULA CircularTrains-PT-192-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-192-LTLCardinality-15 finished in 765 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((p1&&F((p0&&X(p2))))))))'
Found a Shortening insensitive property : CircularTrains-PT-192-LTLCardinality-02
Stuttering acceptance computed with spot in 233 ms :[(NOT p2), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p2))]
Support contains 4 out of 331 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 331/331 places, 192/192 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 331 transition count 149
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 86 place count 288 transition count 149
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 86 place count 288 transition count 139
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 106 place count 278 transition count 139
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 122 place count 270 transition count 131
Applied a total of 122 rules in 29 ms. Remains 270 /331 variables (removed 61) and now considering 131/192 (removed 61) transitions.
// Phase 1: matrix 131 rows 270 cols
[2023-03-08 19:38:07] [INFO ] Computed 140 place invariants in 2 ms
[2023-03-08 19:38:07] [INFO ] Implicit Places using invariants in 424 ms returned [46, 47, 71, 101, 117, 143, 211, 249, 254, 257]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 426 ms to find 10 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 260/331 places, 131/192 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 260 transition count 130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 259 transition count 130
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 259 transition count 128
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 257 transition count 128
Applied a total of 6 rules in 18 ms. Remains 257 /260 variables (removed 3) and now considering 128/131 (removed 3) transitions.
// Phase 1: matrix 128 rows 257 cols
[2023-03-08 19:38:07] [INFO ] Computed 130 place invariants in 3 ms
[2023-03-08 19:38:08] [INFO ] Implicit Places using invariants in 432 ms returned []
[2023-03-08 19:38:08] [INFO ] Invariant cache hit.
[2023-03-08 19:38:08] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 1000 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 257/331 places, 128/192 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1475 ms. Remains : 257/331 places, 128/192 transitions.
Running random walk in product with property : CircularTrains-PT-192-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ 1 s195), p2:(LEQ 1 s186), p1:(LEQ s102 s48)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1305 reset in 1450 ms.
Product exploration explored 100000 steps with 1352 reset in 995 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 p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 2 factoid took 767 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2))]
Finished random walk after 725 steps, including 0 resets, run visited all 7 properties in 48 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (NOT (AND p0 (NOT p1)))), (F (NOT (AND (NOT p2) p0))), (F (NOT p0)), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 2 factoid took 1065 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 227 ms :[(NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2))]
[2023-03-08 19:38:13] [INFO ] Invariant cache hit.
[2023-03-08 19:38:13] [INFO ] [Real]Absence check using 127 positive place invariants in 75 ms returned sat
[2023-03-08 19:38:13] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 30 ms returned sat
[2023-03-08 19:38:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:38:14] [INFO ] [Real]Absence check using state equation in 375 ms returned sat
[2023-03-08 19:38:14] [INFO ] Computed and/alt/rep : 64/128/64 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-08 19:38:14] [INFO ] Added : 62 causal constraints over 13 iterations in 550 ms. Result :sat
Could not prove EG (NOT p2)
[2023-03-08 19:38:14] [INFO ] Invariant cache hit.
[2023-03-08 19:38:15] [INFO ] [Real]Absence check using 127 positive place invariants in 74 ms returned sat
[2023-03-08 19:38:15] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 22 ms returned sat
[2023-03-08 19:38:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:38:15] [INFO ] [Real]Absence check using state equation in 492 ms returned sat
[2023-03-08 19:38:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:38:16] [INFO ] [Nat]Absence check using 127 positive place invariants in 76 ms returned sat
[2023-03-08 19:38:16] [INFO ] [Nat]Absence check using 127 positive and 3 generalized place invariants in 21 ms returned sat
[2023-03-08 19:38:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:38:16] [INFO ] [Nat]Absence check using state equation in 365 ms returned sat
[2023-03-08 19:38:16] [INFO ] Computed and/alt/rep : 64/128/64 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-08 19:38:16] [INFO ] Added : 62 causal constraints over 13 iterations in 263 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 128/128 transitions.
Applied a total of 0 rules in 3 ms. Remains 257 /257 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2023-03-08 19:38:16] [INFO ] Invariant cache hit.
[2023-03-08 19:38:16] [INFO ] Implicit Places using invariants in 267 ms returned []
[2023-03-08 19:38:16] [INFO ] Invariant cache hit.
[2023-03-08 19:38:17] [INFO ] Implicit Places using invariants and state equation in 559 ms returned []
Implicit Place search using SMT with State Equation took 845 ms to find 0 implicit places.
[2023-03-08 19:38:17] [INFO ] Invariant cache hit.
[2023-03-08 19:38:17] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1099 ms. Remains : 257/257 places, 128/128 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 p2) p0 (NOT p1)), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 2 factoid took 821 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2))]
Finished random walk after 433 steps, including 0 resets, run visited all 7 properties in 22 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (NOT (AND p0 (NOT p1)))), (F (NOT (AND (NOT p2) p0))), (F (NOT p0)), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 2 factoid took 1055 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 220 ms :[(NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2))]
[2023-03-08 19:38:20] [INFO ] Invariant cache hit.
[2023-03-08 19:38:20] [INFO ] [Real]Absence check using 127 positive place invariants in 74 ms returned sat
[2023-03-08 19:38:20] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 27 ms returned sat
[2023-03-08 19:38:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:38:21] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2023-03-08 19:38:21] [INFO ] Computed and/alt/rep : 64/128/64 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-08 19:38:21] [INFO ] Added : 62 causal constraints over 13 iterations in 560 ms. Result :sat
Could not prove EG (NOT p2)
[2023-03-08 19:38:21] [INFO ] Invariant cache hit.
[2023-03-08 19:38:21] [INFO ] [Real]Absence check using 127 positive place invariants in 73 ms returned sat
[2023-03-08 19:38:21] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 19 ms returned sat
[2023-03-08 19:38:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:38:22] [INFO ] [Real]Absence check using state equation in 484 ms returned sat
[2023-03-08 19:38:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 19:38:22] [INFO ] [Nat]Absence check using 127 positive place invariants in 73 ms returned sat
[2023-03-08 19:38:22] [INFO ] [Nat]Absence check using 127 positive and 3 generalized place invariants in 14 ms returned sat
[2023-03-08 19:38:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 19:38:22] [INFO ] [Nat]Absence check using state equation in 238 ms returned sat
[2023-03-08 19:38:22] [INFO ] Computed and/alt/rep : 64/128/64 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-08 19:38:23] [INFO ] Added : 62 causal constraints over 13 iterations in 423 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 224 ms :[(NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 1290 reset in 1257 ms.
Product exploration explored 100000 steps with 1313 reset in 1003 ms.
Support contains 4 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 128/128 transitions.
Applied a total of 0 rules in 3 ms. Remains 257 /257 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2023-03-08 19:38:25] [INFO ] Invariant cache hit.
[2023-03-08 19:38:26] [INFO ] Implicit Places using invariants in 306 ms returned []
[2023-03-08 19:38:26] [INFO ] Invariant cache hit.
[2023-03-08 19:38:26] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 756 ms to find 0 implicit places.
[2023-03-08 19:38:26] [INFO ] Invariant cache hit.
[2023-03-08 19:38:26] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1000 ms. Remains : 257/257 places, 128/128 transitions.
Treatment of property CircularTrains-PT-192-LTLCardinality-02 finished in 20178 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(F((p1||G(p2))))))))'
Found a Shortening insensitive property : CircularTrains-PT-192-LTLCardinality-06
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 6 out of 331 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 331/331 places, 192/192 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 331 transition count 151
Reduce places removed 41 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 43 rules applied. Total rules applied 84 place count 290 transition count 149
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 288 transition count 149
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 86 place count 288 transition count 140
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 104 place count 279 transition count 140
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 118 place count 272 transition count 133
Applied a total of 118 rules in 24 ms. Remains 272 /331 variables (removed 59) and now considering 133/192 (removed 59) transitions.
// Phase 1: matrix 133 rows 272 cols
[2023-03-08 19:38:27] [INFO ] Computed 140 place invariants in 1 ms
[2023-03-08 19:38:27] [INFO ] Implicit Places using invariants in 312 ms returned [46, 47, 71, 102, 118, 145, 206, 213, 251, 256, 259]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 326 ms to find 11 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 261/331 places, 133/192 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 261 transition count 131
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 259 transition count 131
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 259 transition count 130
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 258 transition count 130
Applied a total of 6 rules in 13 ms. Remains 258 /261 variables (removed 3) and now considering 130/133 (removed 3) transitions.
// Phase 1: matrix 130 rows 258 cols
[2023-03-08 19:38:27] [INFO ] Computed 129 place invariants in 1 ms
[2023-03-08 19:38:27] [INFO ] Implicit Places using invariants in 290 ms returned []
[2023-03-08 19:38:27] [INFO ] Invariant cache hit.
[2023-03-08 19:38:28] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 648 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 258/331 places, 130/192 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1011 ms. Remains : 258/331 places, 130/192 transitions.
Running random walk in product with property : CircularTrains-PT-192-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(LEQ s201 s124), p2:(LEQ s234 s101), p1:(LEQ s175 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3785 reset in 1425 ms.
Product exploration explored 100000 steps with 3799 reset in 1273 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) p2 p1), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (AND p2 (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0)))))]
Knowledge based reduction with 3 factoid took 254 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 602 steps, including 0 resets, run visited all 3 properties in 6 ms. (steps per millisecond=100 )
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (AND p2 (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (F p0), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 3 factoid took 427 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 6 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 130/130 transitions.
Applied a total of 0 rules in 5 ms. Remains 258 /258 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2023-03-08 19:38:32] [INFO ] Invariant cache hit.
[2023-03-08 19:38:32] [INFO ] Implicit Places using invariants in 417 ms returned []
[2023-03-08 19:38:32] [INFO ] Invariant cache hit.
[2023-03-08 19:38:33] [INFO ] Implicit Places using invariants and state equation in 571 ms returned []
Implicit Place search using SMT with State Equation took 991 ms to find 0 implicit places.
[2023-03-08 19:38:33] [INFO ] Invariant cache hit.
[2023-03-08 19:38:33] [INFO ] Dead Transitions using invariants and state equation in 256 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1253 ms. Remains : 258/258 places, 130/130 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 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
Knowledge based reduction with 3 factoid took 435 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 49 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (F p0), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 3 factoid took 478 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 3864 reset in 1673 ms.
Product exploration explored 100000 steps with 3844 reset in 1160 ms.
Applying partial POR strategy [true, true, false]
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 6 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 130/130 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2023-03-08 19:38:38] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 19:38:38] [INFO ] Invariant cache hit.
[2023-03-08 19:38:38] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 272 ms. Remains : 258/258 places, 130/130 transitions.
Support contains 6 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 130/130 transitions.
Applied a total of 0 rules in 5 ms. Remains 258 /258 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2023-03-08 19:38:38] [INFO ] Invariant cache hit.
[2023-03-08 19:38:38] [INFO ] Implicit Places using invariants in 422 ms returned []
[2023-03-08 19:38:38] [INFO ] Invariant cache hit.
[2023-03-08 19:38:39] [INFO ] Implicit Places using invariants and state equation in 557 ms returned []
Implicit Place search using SMT with State Equation took 992 ms to find 0 implicit places.
[2023-03-08 19:38:39] [INFO ] Invariant cache hit.
[2023-03-08 19:38:39] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1274 ms. Remains : 258/258 places, 130/130 transitions.
Treatment of property CircularTrains-PT-192-LTLCardinality-06 finished in 12732 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-08 19:38:39] [INFO ] Flatten gal took : 27 ms
[2023-03-08 19:38:39] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-08 19:38:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 331 places, 192 transitions and 662 arcs took 6 ms.
Total runtime 110454 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2426/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2426/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2426/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2426/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CircularTrains-PT-192-LTLCardinality-01
Could not compute solution for formula : CircularTrains-PT-192-LTLCardinality-02
Could not compute solution for formula : CircularTrains-PT-192-LTLCardinality-06
Could not compute solution for formula : CircularTrains-PT-192-LTLCardinality-07

BK_STOP 1678304321969

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name CircularTrains-PT-192-LTLCardinality-01
ltl formula formula --ltl=/tmp/2426/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 331 places, 192 transitions and 662 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.100 real 0.020 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2426/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2426/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2426/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2426/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name CircularTrains-PT-192-LTLCardinality-02
ltl formula formula --ltl=/tmp/2426/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 331 places, 192 transitions and 662 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.010 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2426/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2426/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2426/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2426/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name CircularTrains-PT-192-LTLCardinality-06
ltl formula formula --ltl=/tmp/2426/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 331 places, 192 transitions and 662 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.020 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2426/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2426/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2426/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2426/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name CircularTrains-PT-192-LTLCardinality-07
ltl formula formula --ltl=/tmp/2426/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 331 places, 192 transitions and 662 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.090 real 0.010 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2426/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2426/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2426/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2426/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-192"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is CircularTrains-PT-192, 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 r073-smll-167814399200179"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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