Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Apr 13 08:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 13 08:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 08:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 118K Apr 13 08:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.8M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FlexibleBarrier-PT-22b-LTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-22b-LTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-22b-LTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-22b-LTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-22b-LTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-22b-LTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-22b-LTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-22b-LTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-22b-LTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-22b-LTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-22b-LTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-22b-LTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-22b-LTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-22b-LTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-22b-LTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-22b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716500342892

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-22b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-23 21:39:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 21:39:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 21:39:04] [INFO ] Load time of PNML (sax parser for PT used): 245 ms
[2024-05-23 21:39:04] [INFO ] Transformed 6478 places.
[2024-05-23 21:39:04] [INFO ] Transformed 7469 transitions.
[2024-05-23 21:39:04] [INFO ] Found NUPN structural information;
[2024-05-23 21:39:04] [INFO ] Parsed PT model containing 6478 places and 7469 transitions and 18797 arcs in 366 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA FlexibleBarrier-PT-22b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22b-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22b-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22b-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 2 formulas.
FORMULA FlexibleBarrier-PT-22b-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 6478 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6478/6478 places, 7469/7469 transitions.
Discarding 2758 places :
Symmetric choice reduction at 0 with 2758 rule applications. Total rules 2758 place count 3720 transition count 4711
Iterating global reduction 0 with 2758 rules applied. Total rules applied 5516 place count 3720 transition count 4711
Discarding 1321 places :
Symmetric choice reduction at 0 with 1321 rule applications. Total rules 6837 place count 2399 transition count 3390
Iterating global reduction 0 with 1321 rules applied. Total rules applied 8158 place count 2399 transition count 3390
Discarding 869 places :
Symmetric choice reduction at 0 with 869 rule applications. Total rules 9027 place count 1530 transition count 2521
Iterating global reduction 0 with 869 rules applied. Total rules applied 9896 place count 1530 transition count 2521
Ensure Unique test removed 431 transitions
Reduce isomorphic transitions removed 431 transitions.
Iterating post reduction 0 with 431 rules applied. Total rules applied 10327 place count 1530 transition count 2090
Applied a total of 10327 rules in 1421 ms. Remains 1530 /6478 variables (removed 4948) and now considering 2090/7469 (removed 5379) transitions.
// Phase 1: matrix 2090 rows 1530 cols
[2024-05-23 21:39:06] [INFO ] Computed 24 invariants in 91 ms
[2024-05-23 21:39:07] [INFO ] Implicit Places using invariants in 884 ms returned []
[2024-05-23 21:39:07] [INFO ] Invariant cache hit.
[2024-05-23 21:39:08] [INFO ] Implicit Places using invariants and state equation in 1481 ms returned []
Implicit Place search using SMT with State Equation took 2509 ms to find 0 implicit places.
[2024-05-23 21:39:08] [INFO ] Invariant cache hit.
[2024-05-23 21:39:09] [INFO ] Dead Transitions using invariants and state equation in 787 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1530/6478 places, 2090/7469 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4719 ms. Remains : 1530/6478 places, 2090/7469 transitions.
Support contains 15 out of 1530 places after structural reductions.
[2024-05-23 21:39:10] [INFO ] Flatten gal took : 147 ms
[2024-05-23 21:39:10] [INFO ] Flatten gal took : 95 ms
[2024-05-23 21:39:10] [INFO ] Input system was already deterministic with 2090 transitions.
Support contains 13 out of 1530 places (down from 15) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 68 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-23 21:39:10] [INFO ] Invariant cache hit.
[2024-05-23 21:39:11] [INFO ] After 297ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-23 21:39:11] [INFO ] [Nat]Absence check using 24 positive place invariants in 19 ms returned sat
[2024-05-23 21:39:12] [INFO ] After 729ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-23 21:39:12] [INFO ] After 1082ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 193 ms.
[2024-05-23 21:39:12] [INFO ] After 1692ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 222 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=111 )
Parikh walk visited 2 properties in 9 ms.
Support contains 2 out of 1530 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1530/1530 places, 2090/2090 transitions.
Graph (trivial) has 1459 edges and 1530 vertex of which 133 / 1530 are part of one of the 22 SCC in 6 ms
Free SCC test removed 111 places
Drop transitions removed 134 transitions
Reduce isomorphic transitions removed 134 transitions.
Drop transitions removed 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 109 rules applied. Total rules applied 110 place count 1419 transition count 1847
Reduce places removed 109 places and 0 transitions.
Iterating post reduction 1 with 109 rules applied. Total rules applied 219 place count 1310 transition count 1847
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 219 place count 1310 transition count 1800
Deduced a syphon composed of 47 places in 2 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 313 place count 1263 transition count 1800
Discarding 54 places :
Symmetric choice reduction at 2 with 54 rule applications. Total rules 367 place count 1209 transition count 1746
Iterating global reduction 2 with 54 rules applied. Total rules applied 421 place count 1209 transition count 1746
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 424 place count 1209 transition count 1743
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 424 place count 1209 transition count 1742
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 426 place count 1208 transition count 1742
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 431 place count 1203 transition count 1737
Iterating global reduction 3 with 5 rules applied. Total rules applied 436 place count 1203 transition count 1737
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 440 place count 1203 transition count 1733
Performed 136 Post agglomeration using F-continuation condition.Transition count delta: 136
Deduced a syphon composed of 136 places in 1 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 4 with 272 rules applied. Total rules applied 712 place count 1067 transition count 1597
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 4 with 44 rules applied. Total rules applied 756 place count 1067 transition count 1553
Discarding 24 places :
Symmetric choice reduction at 5 with 24 rule applications. Total rules 780 place count 1043 transition count 1529
Iterating global reduction 5 with 24 rules applied. Total rules applied 804 place count 1043 transition count 1529
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 806 place count 1043 transition count 1527
Free-agglomeration rule applied 927 times.
Iterating global reduction 6 with 927 rules applied. Total rules applied 1733 place count 1043 transition count 600
Reduce places removed 927 places and 0 transitions.
Drop transitions removed 440 transitions
Reduce isomorphic transitions removed 440 transitions.
Graph (complete) has 319 edges and 116 vertex of which 26 are kept as prefixes of interest. Removing 90 places using SCC suffix rule.1 ms
Discarding 90 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 1368 rules applied. Total rules applied 3101 place count 26 transition count 160
Drop transitions removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 7 with 126 rules applied. Total rules applied 3227 place count 26 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 3228 place count 25 transition count 33
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 20 edges and 24 vertex of which 8 / 24 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 2 rules applied. Total rules applied 3230 place count 20 transition count 33
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 3238 place count 20 transition count 25
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 4 Pre rules applied. Total rules applied 3238 place count 20 transition count 21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 3246 place count 16 transition count 21
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 3250 place count 16 transition count 17
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 3258 place count 12 transition count 13
Free-agglomeration rule applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 3262 place count 12 transition count 9
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 11 rules applied. Total rules applied 3273 place count 5 transition count 5
Free-agglomeration rule applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 3274 place count 5 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 3275 place count 4 transition count 4
Applied a total of 3275 rules in 1193 ms. Remains 4 /1530 variables (removed 1526) and now considering 4/2090 (removed 2086) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1193 ms. Remains : 4/1530 places, 4/2090 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
FORMULA FlexibleBarrier-PT-22b-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 24 stabilizing places and 24 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1530 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1530/1530 places, 2090/2090 transitions.
Graph (trivial) has 1459 edges and 1530 vertex of which 133 / 1530 are part of one of the 22 SCC in 2 ms
Free SCC test removed 111 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 109 rules applied. Total rules applied 110 place count 1418 transition count 1868
Reduce places removed 109 places and 0 transitions.
Iterating post reduction 1 with 109 rules applied. Total rules applied 219 place count 1309 transition count 1868
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 219 place count 1309 transition count 1821
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 313 place count 1262 transition count 1821
Discarding 54 places :
Symmetric choice reduction at 2 with 54 rule applications. Total rules 367 place count 1208 transition count 1767
Iterating global reduction 2 with 54 rules applied. Total rules applied 421 place count 1208 transition count 1767
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 424 place count 1208 transition count 1764
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 424 place count 1208 transition count 1763
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 426 place count 1207 transition count 1763
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 431 place count 1202 transition count 1758
Iterating global reduction 3 with 5 rules applied. Total rules applied 436 place count 1202 transition count 1758
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 440 place count 1202 transition count 1754
Performed 134 Post agglomeration using F-continuation condition.Transition count delta: 134
Deduced a syphon composed of 134 places in 0 ms
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 4 with 268 rules applied. Total rules applied 708 place count 1068 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 709 place count 1067 transition count 1619
Iterating global reduction 4 with 1 rules applied. Total rules applied 710 place count 1067 transition count 1619
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 711 place count 1067 transition count 1618
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 5 with 22 rules applied. Total rules applied 733 place count 1067 transition count 1596
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 735 place count 1065 transition count 1594
Applied a total of 735 rules in 1021 ms. Remains 1065 /1530 variables (removed 465) and now considering 1594/2090 (removed 496) transitions.
[2024-05-23 21:39:15] [INFO ] Flow matrix only has 1551 transitions (discarded 43 similar events)
// Phase 1: matrix 1551 rows 1065 cols
[2024-05-23 21:39:15] [INFO ] Computed 24 invariants in 60 ms
[2024-05-23 21:39:15] [INFO ] Implicit Places using invariants in 720 ms returned []
[2024-05-23 21:39:15] [INFO ] Flow matrix only has 1551 transitions (discarded 43 similar events)
[2024-05-23 21:39:15] [INFO ] Invariant cache hit.
[2024-05-23 21:39:17] [INFO ] Implicit Places using invariants and state equation in 1181 ms returned []
Implicit Place search using SMT with State Equation took 1903 ms to find 0 implicit places.
[2024-05-23 21:39:17] [INFO ] Redundant transitions in 120 ms returned []
[2024-05-23 21:39:17] [INFO ] Flow matrix only has 1551 transitions (discarded 43 similar events)
[2024-05-23 21:39:17] [INFO ] Invariant cache hit.
[2024-05-23 21:39:17] [INFO ] Dead Transitions using invariants and state equation in 543 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1065/1530 places, 1594/2090 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3595 ms. Remains : 1065/1530 places, 1594/2090 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 125 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s505 0) (EQ s608 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3519 reset in 1588 ms.
Product exploration explored 100000 steps with 3517 reset in 1449 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, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 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 30 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 357 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 366824 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :{}
Probabilistic random walk after 366824 steps, saw 106084 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 21:39:24] [INFO ] Flow matrix only has 1551 transitions (discarded 43 similar events)
[2024-05-23 21:39:24] [INFO ] Invariant cache hit.
[2024-05-23 21:39:24] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 21:39:24] [INFO ] [Nat]Absence check using 24 positive place invariants in 12 ms returned sat
[2024-05-23 21:39:25] [INFO ] After 449ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 21:39:25] [INFO ] After 534ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 78 ms.
[2024-05-23 21:39:25] [INFO ] After 755ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 1065 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1065/1065 places, 1594/1594 transitions.
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 1065 transition count 1550
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 66 place count 1043 transition count 1528
Iterating global reduction 1 with 22 rules applied. Total rules applied 88 place count 1043 transition count 1528
Free-agglomeration rule applied 928 times.
Iterating global reduction 1 with 928 rules applied. Total rules applied 1016 place count 1043 transition count 600
Discarding 95 places :
Also discarding 475 output transitions
Drop transitions removed 475 transitions
Remove reverse transitions (loop back) rule discarded transition t458.t1584.t1427 and 95 places that fell out of Prefix Of Interest.
Drop transitions removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Graph (trivial) has 21 edges and 18 vertex of which 15 / 18 are part of one of the 3 SCC in 0 ms
Free SCC test removed 12 places
Iterating post reduction 1 with 101 rules applied. Total rules applied 1117 place count 6 transition count 26
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 1139 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1139 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1141 place count 4 transition count 4
Applied a total of 1141 rules in 354 ms. Remains 4 /1065 variables (removed 1061) and now considering 4/1594 (removed 1590) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 354 ms. Remains : 4/1065 places, 4/1594 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 90 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 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Support contains 2 out of 1065 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1065/1065 places, 1594/1594 transitions.
Applied a total of 0 rules in 121 ms. Remains 1065 /1065 variables (removed 0) and now considering 1594/1594 (removed 0) transitions.
[2024-05-23 21:39:26] [INFO ] Flow matrix only has 1551 transitions (discarded 43 similar events)
[2024-05-23 21:39:26] [INFO ] Invariant cache hit.
[2024-05-23 21:39:26] [INFO ] Implicit Places using invariants in 536 ms returned []
[2024-05-23 21:39:26] [INFO ] Flow matrix only has 1551 transitions (discarded 43 similar events)
[2024-05-23 21:39:26] [INFO ] Invariant cache hit.
[2024-05-23 21:39:27] [INFO ] Implicit Places using invariants and state equation in 1299 ms returned []
Implicit Place search using SMT with State Equation took 1837 ms to find 0 implicit places.
[2024-05-23 21:39:28] [INFO ] Redundant transitions in 154 ms returned []
[2024-05-23 21:39:28] [INFO ] Flow matrix only has 1551 transitions (discarded 43 similar events)
[2024-05-23 21:39:28] [INFO ] Invariant cache hit.
[2024-05-23 21:39:28] [INFO ] Dead Transitions using invariants and state equation in 573 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2698 ms. Remains : 1065/1065 places, 1594/1594 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, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 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 33 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 361 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 378243 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :{}
Probabilistic random walk after 378243 steps, saw 107894 distinct states, run finished after 3002 ms. (steps per millisecond=125 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 21:39:32] [INFO ] Flow matrix only has 1551 transitions (discarded 43 similar events)
[2024-05-23 21:39:32] [INFO ] Invariant cache hit.
[2024-05-23 21:39:32] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 21:39:32] [INFO ] [Nat]Absence check using 24 positive place invariants in 12 ms returned sat
[2024-05-23 21:39:33] [INFO ] After 461ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 21:39:33] [INFO ] After 533ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2024-05-23 21:39:33] [INFO ] After 715ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 1065 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1065/1065 places, 1594/1594 transitions.
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 1065 transition count 1550
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 66 place count 1043 transition count 1528
Iterating global reduction 1 with 22 rules applied. Total rules applied 88 place count 1043 transition count 1528
Free-agglomeration rule applied 928 times.
Iterating global reduction 1 with 928 rules applied. Total rules applied 1016 place count 1043 transition count 600
Discarding 95 places :
Also discarding 475 output transitions
Drop transitions removed 475 transitions
Remove reverse transitions (loop back) rule discarded transition t458.t1584.t1427 and 95 places that fell out of Prefix Of Interest.
Drop transitions removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Graph (trivial) has 21 edges and 18 vertex of which 15 / 18 are part of one of the 3 SCC in 0 ms
Free SCC test removed 12 places
Iterating post reduction 1 with 101 rules applied. Total rules applied 1117 place count 6 transition count 26
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 1139 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1139 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1141 place count 4 transition count 4
Applied a total of 1141 rules in 191 ms. Remains 4 /1065 variables (removed 1061) and now considering 4/1594 (removed 1590) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 4/1065 places, 4/1594 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 106 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 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 132 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3515 reset in 1424 ms.
Product exploration explored 100000 steps with 3525 reset in 1434 ms.
Built C files in :
/tmp/ltsmin1098888415728716173
[2024-05-23 21:39:36] [INFO ] Too many transitions (1594) to apply POR reductions. Disabling POR matrices.
[2024-05-23 21:39:36] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1098888415728716173
Running compilation step : cd /tmp/ltsmin1098888415728716173;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2869 ms.
Running link step : cd /tmp/ltsmin1098888415728716173;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin1098888415728716173;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12944621086293304839.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1065 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1065/1065 places, 1594/1594 transitions.
Applied a total of 0 rules in 129 ms. Remains 1065 /1065 variables (removed 0) and now considering 1594/1594 (removed 0) transitions.
[2024-05-23 21:39:51] [INFO ] Flow matrix only has 1551 transitions (discarded 43 similar events)
[2024-05-23 21:39:51] [INFO ] Invariant cache hit.
[2024-05-23 21:39:52] [INFO ] Implicit Places using invariants in 539 ms returned []
[2024-05-23 21:39:52] [INFO ] Flow matrix only has 1551 transitions (discarded 43 similar events)
[2024-05-23 21:39:52] [INFO ] Invariant cache hit.
[2024-05-23 21:39:53] [INFO ] Implicit Places using invariants and state equation in 1212 ms returned []
Implicit Place search using SMT with State Equation took 1753 ms to find 0 implicit places.
[2024-05-23 21:39:53] [INFO ] Redundant transitions in 21 ms returned []
[2024-05-23 21:39:53] [INFO ] Flow matrix only has 1551 transitions (discarded 43 similar events)
[2024-05-23 21:39:53] [INFO ] Invariant cache hit.
[2024-05-23 21:39:54] [INFO ] Dead Transitions using invariants and state equation in 555 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2465 ms. Remains : 1065/1065 places, 1594/1594 transitions.
Built C files in :
/tmp/ltsmin6443180586855639987
[2024-05-23 21:39:54] [INFO ] Too many transitions (1594) to apply POR reductions. Disabling POR matrices.
[2024-05-23 21:39:54] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6443180586855639987
Running compilation step : cd /tmp/ltsmin6443180586855639987;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6443180586855639987;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6443180586855639987;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-23 21:39:57] [INFO ] Flatten gal took : 49 ms
[2024-05-23 21:39:57] [INFO ] Flatten gal took : 45 ms
[2024-05-23 21:39:57] [INFO ] Time to serialize gal into /tmp/LTL759039692060668179.gal : 14 ms
[2024-05-23 21:39:57] [INFO ] Time to serialize properties into /tmp/LTL15012579624773866236.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL759039692060668179.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12765390004522011491.hoa' '-atoms' '/tmp/LTL15012579624773866236.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL15012579624773866236.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12765390004522011491.hoa
Detected timeout of ITS tools.
[2024-05-23 21:40:12] [INFO ] Flatten gal took : 48 ms
[2024-05-23 21:40:12] [INFO ] Flatten gal took : 43 ms
[2024-05-23 21:40:12] [INFO ] Time to serialize gal into /tmp/LTL12673154990418669725.gal : 7 ms
[2024-05-23 21:40:12] [INFO ] Time to serialize properties into /tmp/LTL1296109345676558442.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12673154990418669725.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1296109345676558442.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((p3616==0)||(p4206==1))"))))
Formula 0 simplified : GF!"((p3616==0)||(p4206==1))"
Detected timeout of ITS tools.
[2024-05-23 21:40:27] [INFO ] Flatten gal took : 41 ms
[2024-05-23 21:40:27] [INFO ] Applying decomposition
[2024-05-23 21:40:27] [INFO ] Flatten gal took : 54 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5147971059798476469.txt' '-o' '/tmp/graph5147971059798476469.bin' '-w' '/tmp/graph5147971059798476469.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5147971059798476469.bin' '-l' '-1' '-v' '-w' '/tmp/graph5147971059798476469.weights' '-q' '0' '-e' '0.001'
[2024-05-23 21:40:27] [INFO ] Decomposing Gal with order
[2024-05-23 21:40:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 21:40:28] [INFO ] Removed a total of 619 redundant transitions.
[2024-05-23 21:40:28] [INFO ] Flatten gal took : 672 ms
[2024-05-23 21:40:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 98 labels/synchronizations in 49 ms.
[2024-05-23 21:40:28] [INFO ] Time to serialize gal into /tmp/LTL1014486759206560116.gal : 42 ms
[2024-05-23 21:40:28] [INFO ] Time to serialize properties into /tmp/LTL14050174514161226956.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1014486759206560116.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14050174514161226956.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("((i18.u54.p3616==0)||(u66.p4206==1))"))))
Formula 0 simplified : GF!"((i18.u54.p3616==0)||(u66.p4206==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3129178491939320578
[2024-05-23 21:40:43] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3129178491939320578
Running compilation step : cd /tmp/ltsmin3129178491939320578;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2749 ms.
Running link step : cd /tmp/ltsmin3129178491939320578;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin3129178491939320578;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FlexibleBarrier-PT-22b-LTLCardinality-00 finished in 104887 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 1530 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1530/1530 places, 2090/2090 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1519 transition count 2079
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1519 transition count 2079
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 1519 transition count 2078
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 33 place count 1509 transition count 2068
Iterating global reduction 1 with 10 rules applied. Total rules applied 43 place count 1509 transition count 2068
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 49 place count 1509 transition count 2062
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 51 place count 1507 transition count 2060
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 1507 transition count 2060
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 1507 transition count 2059
Applied a total of 54 rules in 164 ms. Remains 1507 /1530 variables (removed 23) and now considering 2059/2090 (removed 31) transitions.
// Phase 1: matrix 2059 rows 1507 cols
[2024-05-23 21:40:59] [INFO ] Computed 24 invariants in 42 ms
[2024-05-23 21:40:59] [INFO ] Implicit Places using invariants in 615 ms returned []
[2024-05-23 21:40:59] [INFO ] Invariant cache hit.
[2024-05-23 21:41:01] [INFO ] Implicit Places using invariants and state equation in 1458 ms returned []
Implicit Place search using SMT with State Equation took 2076 ms to find 0 implicit places.
[2024-05-23 21:41:01] [INFO ] Invariant cache hit.
[2024-05-23 21:41:01] [INFO ] Dead Transitions using invariants and state equation in 765 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1507/1530 places, 2059/2090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3010 ms. Remains : 1507/1530 places, 2059/2090 transitions.
Stuttering acceptance computed with spot in 247 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLCardinality-10 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 (EQ s452 0) (EQ s32 1))], 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]]
Product exploration explored 100000 steps with 50000 reset in 842 ms.
Product exploration explored 100000 steps with 50000 reset in 826 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-22b-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-22b-LTLCardinality-10 finished in 4981 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||G((p1&&F((G(p2)||(!p1 U (p3||G(!p1)))))))))'
Support contains 6 out of 1530 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1530/1530 places, 2090/2090 transitions.
Graph (trivial) has 1454 edges and 1530 vertex of which 133 / 1530 are part of one of the 22 SCC in 1 ms
Free SCC test removed 111 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 108 place count 1418 transition count 1870
Reduce places removed 107 places and 0 transitions.
Iterating post reduction 1 with 107 rules applied. Total rules applied 215 place count 1311 transition count 1870
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 215 place count 1311 transition count 1821
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 313 place count 1262 transition count 1821
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 364 place count 1211 transition count 1770
Iterating global reduction 2 with 51 rules applied. Total rules applied 415 place count 1211 transition count 1770
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 417 place count 1211 transition count 1768
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 421 place count 1207 transition count 1764
Iterating global reduction 3 with 4 rules applied. Total rules applied 425 place count 1207 transition count 1764
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 429 place count 1207 transition count 1760
Performed 135 Post agglomeration using F-continuation condition.Transition count delta: 135
Deduced a syphon composed of 135 places in 0 ms
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 4 with 270 rules applied. Total rules applied 699 place count 1072 transition count 1625
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 700 place count 1071 transition count 1624
Iterating global reduction 4 with 1 rules applied. Total rules applied 701 place count 1071 transition count 1624
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 702 place count 1071 transition count 1623
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 5 with 22 rules applied. Total rules applied 724 place count 1071 transition count 1601
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 726 place count 1069 transition count 1599
Applied a total of 726 rules in 597 ms. Remains 1069 /1530 variables (removed 461) and now considering 1599/2090 (removed 491) transitions.
[2024-05-23 21:41:04] [INFO ] Flow matrix only has 1556 transitions (discarded 43 similar events)
// Phase 1: matrix 1556 rows 1069 cols
[2024-05-23 21:41:04] [INFO ] Computed 24 invariants in 47 ms
[2024-05-23 21:41:05] [INFO ] Implicit Places using invariants in 531 ms returned []
[2024-05-23 21:41:05] [INFO ] Flow matrix only has 1556 transitions (discarded 43 similar events)
[2024-05-23 21:41:05] [INFO ] Invariant cache hit.
[2024-05-23 21:41:06] [INFO ] Implicit Places using invariants and state equation in 1153 ms returned []
Implicit Place search using SMT with State Equation took 1686 ms to find 0 implicit places.
[2024-05-23 21:41:06] [INFO ] Redundant transitions in 22 ms returned []
[2024-05-23 21:41:06] [INFO ] Flow matrix only has 1556 transitions (discarded 43 similar events)
[2024-05-23 21:41:06] [INFO ] Invariant cache hit.
[2024-05-23 21:41:06] [INFO ] Dead Transitions using invariants and state equation in 549 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1069/1530 places, 1599/2090 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2860 ms. Remains : 1069/1530 places, 1599/2090 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0), (AND p1 (NOT p0) (NOT p3) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s773 0) (EQ s1012 1)), p0:(OR (EQ s269 0) (EQ s918 1)), p3:(AND (NOT (OR (EQ s1025 0) (EQ s315 1))) (NOT (OR (EQ s773 0) (EQ s1012 1)))), p2:(A...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 3518 reset in 1488 ms.
Product exploration explored 100000 steps with 3530 reset in 1528 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 p1 p0 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p0) p1 (NOT p3))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X p1), (X (NOT p1)), (X (AND (NOT p0) p1 p2 (NOT p3))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1 (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p0) p1 p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))))]
Knowledge based reduction with 8 factoid took 631 ms. Reduced automaton from 4 states, 11 edges and 4 AP (stutter insensitive) to 4 states, 11 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0), (AND p1 (NOT p0) (NOT p3) (NOT p2))]
Incomplete random walk after 10000 steps, including 358 resets, run finished after 353 ms. (steps per millisecond=28 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-23 21:41:11] [INFO ] Flow matrix only has 1556 transitions (discarded 43 similar events)
[2024-05-23 21:41:11] [INFO ] Invariant cache hit.
[2024-05-23 21:41:11] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 21:41:12] [INFO ] [Nat]Absence check using 24 positive place invariants in 15 ms returned sat
[2024-05-23 21:41:12] [INFO ] After 147ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (G (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p0) p1 (NOT p3))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X p1), (X (NOT p1)), (X (AND (NOT p0) p1 p2 (NOT p3))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1 (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p0) p1 p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (F (AND (NOT p0) (NOT p1) p2 (NOT p3))), (F (NOT p0)), (F (AND (NOT p0) p1 p2 (NOT p3))), (F (NOT p1)), (F (AND (NOT p0) p1 (NOT p3))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 10 factoid took 863 ms. Reduced automaton from 4 states, 11 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 4 out of 1069 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1069/1069 places, 1599/1599 transitions.
Applied a total of 0 rules in 130 ms. Remains 1069 /1069 variables (removed 0) and now considering 1599/1599 (removed 0) transitions.
[2024-05-23 21:41:13] [INFO ] Flow matrix only has 1556 transitions (discarded 43 similar events)
[2024-05-23 21:41:13] [INFO ] Invariant cache hit.
[2024-05-23 21:41:13] [INFO ] Implicit Places using invariants in 462 ms returned []
[2024-05-23 21:41:13] [INFO ] Flow matrix only has 1556 transitions (discarded 43 similar events)
[2024-05-23 21:41:13] [INFO ] Invariant cache hit.
[2024-05-23 21:41:14] [INFO ] Implicit Places using invariants and state equation in 1082 ms returned []
Implicit Place search using SMT with State Equation took 1545 ms to find 0 implicit places.
[2024-05-23 21:41:14] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-23 21:41:14] [INFO ] Flow matrix only has 1556 transitions (discarded 43 similar events)
[2024-05-23 21:41:14] [INFO ] Invariant cache hit.
[2024-05-23 21:41:15] [INFO ] Dead Transitions using invariants and state equation in 546 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2246 ms. Remains : 1069/1069 places, 1599/1599 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 p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 291 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 356 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 2) seen :1
Finished Best-First random walk after 1419 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=709 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 316 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3525 reset in 1490 ms.
Stuttering criterion allowed to conclude after 68889 steps with 2425 reset in 1006 ms.
FORMULA FlexibleBarrier-PT-22b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22b-LTLCardinality-11 finished in 15651 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1530 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1530/1530 places, 2090/2090 transitions.
Graph (trivial) has 1459 edges and 1530 vertex of which 133 / 1530 are part of one of the 22 SCC in 1 ms
Free SCC test removed 111 places
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 109 rules applied. Total rules applied 110 place count 1418 transition count 1868
Reduce places removed 109 places and 0 transitions.
Iterating post reduction 1 with 109 rules applied. Total rules applied 219 place count 1309 transition count 1868
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 219 place count 1309 transition count 1821
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 313 place count 1262 transition count 1821
Discarding 54 places :
Symmetric choice reduction at 2 with 54 rule applications. Total rules 367 place count 1208 transition count 1767
Iterating global reduction 2 with 54 rules applied. Total rules applied 421 place count 1208 transition count 1767
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 424 place count 1208 transition count 1764
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 424 place count 1208 transition count 1763
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 426 place count 1207 transition count 1763
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 431 place count 1202 transition count 1758
Iterating global reduction 3 with 5 rules applied. Total rules applied 436 place count 1202 transition count 1758
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 440 place count 1202 transition count 1754
Performed 134 Post agglomeration using F-continuation condition.Transition count delta: 134
Deduced a syphon composed of 134 places in 0 ms
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 4 with 268 rules applied. Total rules applied 708 place count 1068 transition count 1620
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 710 place count 1066 transition count 1618
Iterating global reduction 4 with 2 rules applied. Total rules applied 712 place count 1066 transition count 1618
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 714 place count 1066 transition count 1616
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 5 with 22 rules applied. Total rules applied 736 place count 1066 transition count 1594
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 738 place count 1064 transition count 1592
Applied a total of 738 rules in 503 ms. Remains 1064 /1530 variables (removed 466) and now considering 1592/2090 (removed 498) transitions.
[2024-05-23 21:41:20] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
// Phase 1: matrix 1549 rows 1064 cols
[2024-05-23 21:41:20] [INFO ] Computed 24 invariants in 51 ms
[2024-05-23 21:41:20] [INFO ] Implicit Places using invariants in 519 ms returned []
[2024-05-23 21:41:20] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
[2024-05-23 21:41:20] [INFO ] Invariant cache hit.
[2024-05-23 21:41:21] [INFO ] Implicit Places using invariants and state equation in 1147 ms returned []
Implicit Place search using SMT with State Equation took 1669 ms to find 0 implicit places.
[2024-05-23 21:41:21] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-23 21:41:21] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
[2024-05-23 21:41:21] [INFO ] Invariant cache hit.
[2024-05-23 21:41:22] [INFO ] Dead Transitions using invariants and state equation in 542 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1064/1530 places, 1592/2090 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2750 ms. Remains : 1064/1530 places, 1592/2090 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-22b-LTLCardinality-15 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:(OR (EQ s112 0) (EQ s921 1))], 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 3513 reset in 1419 ms.
Product exploration explored 100000 steps with 3523 reset in 1435 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, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 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 65 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 357 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 382134 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :{}
Probabilistic random walk after 382134 steps, saw 107685 distinct states, run finished after 3001 ms. (steps per millisecond=127 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 21:41:28] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
[2024-05-23 21:41:28] [INFO ] Invariant cache hit.
[2024-05-23 21:41:29] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 21:41:29] [INFO ] [Nat]Absence check using 24 positive place invariants in 11 ms returned sat
[2024-05-23 21:41:29] [INFO ] After 473ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 21:41:29] [INFO ] After 541ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2024-05-23 21:41:29] [INFO ] After 738ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1064 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1064/1064 places, 1592/1592 transitions.
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 1064 transition count 1548
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 66 place count 1042 transition count 1526
Iterating global reduction 1 with 22 rules applied. Total rules applied 88 place count 1042 transition count 1526
Free-agglomeration rule applied 927 times.
Iterating global reduction 1 with 927 rules applied. Total rules applied 1015 place count 1042 transition count 599
Reduce places removed 928 places and 0 transitions.
Drop transitions removed 440 transitions
Reduce isomorphic transitions removed 440 transitions.
Graph (complete) has 207 edges and 114 vertex of which 24 are kept as prefixes of interest. Removing 90 places using SCC suffix rule.0 ms
Discarding 90 places :
Also discarding 90 output transitions
Drop transitions removed 90 transitions
Graph (trivial) has 56 edges and 24 vertex of which 8 / 24 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 1 with 1370 rules applied. Total rules applied 2385 place count 20 transition count 69
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 2 with 44 rules applied. Total rules applied 2429 place count 20 transition count 25
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 2429 place count 20 transition count 21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 2437 place count 16 transition count 21
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 2441 place count 16 transition count 17
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 2449 place count 12 transition count 13
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2453 place count 12 transition count 9
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 2464 place count 5 transition count 5
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2465 place count 5 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2466 place count 4 transition count 4
Applied a total of 2466 rules in 215 ms. Remains 4 /1064 variables (removed 1060) and now considering 4/1592 (removed 1588) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 215 ms. Remains : 4/1064 places, 4/1592 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 82 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 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1064 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1064/1064 places, 1592/1592 transitions.
Applied a total of 0 rules in 104 ms. Remains 1064 /1064 variables (removed 0) and now considering 1592/1592 (removed 0) transitions.
[2024-05-23 21:41:30] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
[2024-05-23 21:41:30] [INFO ] Invariant cache hit.
[2024-05-23 21:41:30] [INFO ] Implicit Places using invariants in 468 ms returned []
[2024-05-23 21:41:30] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
[2024-05-23 21:41:30] [INFO ] Invariant cache hit.
[2024-05-23 21:41:32] [INFO ] Implicit Places using invariants and state equation in 1170 ms returned []
Implicit Place search using SMT with State Equation took 1639 ms to find 0 implicit places.
[2024-05-23 21:41:32] [INFO ] Redundant transitions in 22 ms returned []
[2024-05-23 21:41:32] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
[2024-05-23 21:41:32] [INFO ] Invariant cache hit.
[2024-05-23 21:41:32] [INFO ] Dead Transitions using invariants and state equation in 537 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2312 ms. Remains : 1064/1064 places, 1592/1592 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, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 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 74 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 360 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 387080 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :{}
Probabilistic random walk after 387080 steps, saw 108467 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 21:41:36] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
[2024-05-23 21:41:36] [INFO ] Invariant cache hit.
[2024-05-23 21:41:36] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 21:41:36] [INFO ] [Nat]Absence check using 24 positive place invariants in 11 ms returned sat
[2024-05-23 21:41:36] [INFO ] After 472ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 21:41:37] [INFO ] After 546ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2024-05-23 21:41:37] [INFO ] After 720ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 1064 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1064/1064 places, 1592/1592 transitions.
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 1064 transition count 1548
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 66 place count 1042 transition count 1526
Iterating global reduction 1 with 22 rules applied. Total rules applied 88 place count 1042 transition count 1526
Free-agglomeration rule applied 927 times.
Iterating global reduction 1 with 927 rules applied. Total rules applied 1015 place count 1042 transition count 599
Reduce places removed 928 places and 0 transitions.
Drop transitions removed 440 transitions
Reduce isomorphic transitions removed 440 transitions.
Graph (complete) has 207 edges and 114 vertex of which 24 are kept as prefixes of interest. Removing 90 places using SCC suffix rule.0 ms
Discarding 90 places :
Also discarding 90 output transitions
Drop transitions removed 90 transitions
Graph (trivial) has 56 edges and 24 vertex of which 8 / 24 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 1 with 1370 rules applied. Total rules applied 2385 place count 20 transition count 69
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 2 with 44 rules applied. Total rules applied 2429 place count 20 transition count 25
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 2429 place count 20 transition count 21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 2437 place count 16 transition count 21
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 2441 place count 16 transition count 17
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 2449 place count 12 transition count 13
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2453 place count 12 transition count 9
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 2464 place count 5 transition count 5
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2465 place count 5 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2466 place count 4 transition count 4
Applied a total of 2466 rules in 187 ms. Remains 4 /1064 variables (removed 1060) and now considering 4/1592 (removed 1588) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 4/1064 places, 4/1592 transitions.
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 81 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 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3525 reset in 1431 ms.
Product exploration explored 100000 steps with 3520 reset in 1438 ms.
Built C files in :
/tmp/ltsmin13581785739254932353
[2024-05-23 21:41:40] [INFO ] Too many transitions (1592) to apply POR reductions. Disabling POR matrices.
[2024-05-23 21:41:40] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13581785739254932353
Running compilation step : cd /tmp/ltsmin13581785739254932353;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2742 ms.
Running link step : cd /tmp/ltsmin13581785739254932353;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin13581785739254932353;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11408647586279370654.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1064 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1064/1064 places, 1592/1592 transitions.
Applied a total of 0 rules in 108 ms. Remains 1064 /1064 variables (removed 0) and now considering 1592/1592 (removed 0) transitions.
[2024-05-23 21:41:55] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
[2024-05-23 21:41:55] [INFO ] Invariant cache hit.
[2024-05-23 21:41:56] [INFO ] Implicit Places using invariants in 510 ms returned []
[2024-05-23 21:41:56] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
[2024-05-23 21:41:56] [INFO ] Invariant cache hit.
[2024-05-23 21:41:57] [INFO ] Implicit Places using invariants and state equation in 1215 ms returned []
Implicit Place search using SMT with State Equation took 1727 ms to find 0 implicit places.
[2024-05-23 21:41:57] [INFO ] Redundant transitions in 22 ms returned []
[2024-05-23 21:41:57] [INFO ] Flow matrix only has 1549 transitions (discarded 43 similar events)
[2024-05-23 21:41:57] [INFO ] Invariant cache hit.
[2024-05-23 21:41:57] [INFO ] Dead Transitions using invariants and state equation in 589 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2457 ms. Remains : 1064/1064 places, 1592/1592 transitions.
Built C files in :
/tmp/ltsmin15544995075584105231
[2024-05-23 21:41:57] [INFO ] Too many transitions (1592) to apply POR reductions. Disabling POR matrices.
[2024-05-23 21:41:57] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15544995075584105231
Running compilation step : cd /tmp/ltsmin15544995075584105231;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2686 ms.
Running link step : cd /tmp/ltsmin15544995075584105231;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin15544995075584105231;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11121454085944888034.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 21:42:13] [INFO ] Flatten gal took : 42 ms
[2024-05-23 21:42:13] [INFO ] Flatten gal took : 33 ms
[2024-05-23 21:42:13] [INFO ] Time to serialize gal into /tmp/LTL15210728282719221336.gal : 12 ms
[2024-05-23 21:42:13] [INFO ] Time to serialize properties into /tmp/LTL10216950398926498124.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15210728282719221336.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17742117369609189972.hoa' '-atoms' '/tmp/LTL10216950398926498124.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL10216950398926498124.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17742117369609189972.hoa
Detected timeout of ITS tools.
[2024-05-23 21:42:28] [INFO ] Flatten gal took : 39 ms
[2024-05-23 21:42:28] [INFO ] Flatten gal took : 35 ms
[2024-05-23 21:42:28] [INFO ] Time to serialize gal into /tmp/LTL9025796150153283225.gal : 7 ms
[2024-05-23 21:42:28] [INFO ] Time to serialize properties into /tmp/LTL1143856374519482444.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9025796150153283225.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1143856374519482444.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("((p827==0)||(p5762==1))"))))
Formula 0 simplified : FG!"((p827==0)||(p5762==1))"
Detected timeout of ITS tools.
[2024-05-23 21:42:43] [INFO ] Flatten gal took : 33 ms
[2024-05-23 21:42:43] [INFO ] Applying decomposition
[2024-05-23 21:42:43] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12110441567699133715.txt' '-o' '/tmp/graph12110441567699133715.bin' '-w' '/tmp/graph12110441567699133715.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12110441567699133715.bin' '-l' '-1' '-v' '-w' '/tmp/graph12110441567699133715.weights' '-q' '0' '-e' '0.001'
[2024-05-23 21:42:43] [INFO ] Decomposing Gal with order
[2024-05-23 21:42:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 21:42:43] [INFO ] Removed a total of 616 redundant transitions.
[2024-05-23 21:42:43] [INFO ] Flatten gal took : 173 ms
[2024-05-23 21:42:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 93 labels/synchronizations in 18 ms.
[2024-05-23 21:42:43] [INFO ] Time to serialize gal into /tmp/LTL9876287947739997586.gal : 12 ms
[2024-05-23 21:42:43] [INFO ] Time to serialize properties into /tmp/LTL11663464530116031297.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9876287947739997586.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11663464530116031297.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("((i5.u14.p827==0)||(i1.u67.p5762==1))"))))
Formula 0 simplified : FG!"((i5.u14.p827==0)||(i1.u67.p5762==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17172953502314851990
[2024-05-23 21:42:58] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17172953502314851990
Running compilation step : cd /tmp/ltsmin17172953502314851990;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2962 ms.
Running link step : cd /tmp/ltsmin17172953502314851990;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin17172953502314851990;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FlexibleBarrier-PT-22b-LTLCardinality-15 finished in 114326 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-05-23 21:43:14] [INFO ] Flatten gal took : 39 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17651662599713237734
[2024-05-23 21:43:14] [INFO ] Too many transitions (2090) to apply POR reductions. Disabling POR matrices.
[2024-05-23 21:43:14] [INFO ] Applying decomposition
[2024-05-23 21:43:14] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17651662599713237734
Running compilation step : cd /tmp/ltsmin17651662599713237734;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-23 21:43:14] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17270299857755996881.txt' '-o' '/tmp/graph17270299857755996881.bin' '-w' '/tmp/graph17270299857755996881.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17270299857755996881.bin' '-l' '-1' '-v' '-w' '/tmp/graph17270299857755996881.weights' '-q' '0' '-e' '0.001'
[2024-05-23 21:43:14] [INFO ] Decomposing Gal with order
[2024-05-23 21:43:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 21:43:14] [INFO ] Removed a total of 630 redundant transitions.
[2024-05-23 21:43:14] [INFO ] Flatten gal took : 180 ms
[2024-05-23 21:43:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 38 ms.
[2024-05-23 21:43:14] [INFO ] Time to serialize gal into /tmp/LTLCardinality2025327058063954064.gal : 15 ms
[2024-05-23 21:43:14] [INFO ] Time to serialize properties into /tmp/LTLCardinality7664696783196196950.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2025327058063954064.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7664696783196196950.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((F(G("((i20.u191.p3616==0)||(i0.u222.p4206==1))"))))
Formula 0 simplified : GF!"((i20.u191.p3616==0)||(i0.u222.p4206==1))"
Compilation finished in 4500 ms.
Running link step : cd /tmp/ltsmin17651662599713237734;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin17651662599713237734;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-23 22:04:38] [INFO ] Applying decomposition
[2024-05-23 22:04:38] [INFO ] Flatten gal took : 126 ms
[2024-05-23 22:04:38] [INFO ] Decomposing Gal with order
[2024-05-23 22:04:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 22:04:39] [INFO ] Removed a total of 584 redundant transitions.
[2024-05-23 22:04:39] [INFO ] Flatten gal took : 581 ms
[2024-05-23 22:04:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 1954 labels/synchronizations in 712 ms.
[2024-05-23 22:04:40] [INFO ] Time to serialize gal into /tmp/LTLCardinality13552344068132665646.gal : 69 ms
[2024-05-23 22:04:40] [INFO ] Time to serialize properties into /tmp/LTLCardinality385292168422262210.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13552344068132665646.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality385292168422262210.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((F(G("((i0.i0.i0.i0.u40.p3616==0)||(i0.u43.p4206==1))"))))
Formula 0 simplified : GF!"((i0.i0.i0.i0.u40.p3616==0)||(i0.u43.p4206==1))"
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin17651662599713237734;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin17651662599713237734;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp1==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-23 22:26:12] [INFO ] Flatten gal took : 3343 ms
[2024-05-23 22:26:17] [INFO ] Input system was already deterministic with 2090 transitions.
[2024-05-23 22:26:17] [INFO ] Transformed 1530 places.
[2024-05-23 22:26:17] [INFO ] Transformed 2090 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-23 22:26:18] [INFO ] Time to serialize gal into /tmp/LTLCardinality13656515802425667071.gal : 29 ms
[2024-05-23 22:26:19] [INFO ] Time to serialize properties into /tmp/LTLCardinality7977710347002393841.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13656515802425667071.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7977710347002393841.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("((p3616==0)||(p4206==1))"))))
Formula 0 simplified : GF!"((p3616==0)||(p4206==1))"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 7884840 kB
After kill :
MemTotal: 16393232 kB
MemFree: 15901456 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FlexibleBarrier-PT-22b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is FlexibleBarrier-PT-22b, 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 r197-tall-171640624900097"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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