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.r087-tall-171620521300023.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 CANConstruction-PT-040, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r087-tall-171620521300023
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.0M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 12 18:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Apr 12 18:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 12 18:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Apr 12 18:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:31 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 2.5M 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 CANConstruction-PT-040-LTLFireability-00
FORMULA_NAME CANConstruction-PT-040-LTLFireability-01
FORMULA_NAME CANConstruction-PT-040-LTLFireability-02
FORMULA_NAME CANConstruction-PT-040-LTLFireability-03
FORMULA_NAME CANConstruction-PT-040-LTLFireability-04
FORMULA_NAME CANConstruction-PT-040-LTLFireability-05
FORMULA_NAME CANConstruction-PT-040-LTLFireability-06
FORMULA_NAME CANConstruction-PT-040-LTLFireability-07
FORMULA_NAME CANConstruction-PT-040-LTLFireability-08
FORMULA_NAME CANConstruction-PT-040-LTLFireability-09
FORMULA_NAME CANConstruction-PT-040-LTLFireability-10
FORMULA_NAME CANConstruction-PT-040-LTLFireability-11
FORMULA_NAME CANConstruction-PT-040-LTLFireability-12
FORMULA_NAME CANConstruction-PT-040-LTLFireability-13
FORMULA_NAME CANConstruction-PT-040-LTLFireability-14
FORMULA_NAME CANConstruction-PT-040-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716216018949

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-040
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-20 14:40:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 14:40:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 14:40:20] [INFO ] Load time of PNML (sax parser for PT used): 214 ms
[2024-05-20 14:40:20] [INFO ] Transformed 3682 places.
[2024-05-20 14:40:20] [INFO ] Transformed 6720 transitions.
[2024-05-20 14:40:20] [INFO ] Parsed PT model containing 3682 places and 6720 transitions and 20000 arcs in 307 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA CANConstruction-PT-040-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 59 out of 3682 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3682/3682 places, 6720/6720 transitions.
Discarding 1503 places :
Symmetric choice reduction at 0 with 1503 rule applications. Total rules 1503 place count 2179 transition count 3714
Iterating global reduction 0 with 1503 rules applied. Total rules applied 3006 place count 2179 transition count 3714
Applied a total of 3006 rules in 436 ms. Remains 2179 /3682 variables (removed 1503) and now considering 3714/6720 (removed 3006) transitions.
// Phase 1: matrix 3714 rows 2179 cols
[2024-05-20 14:40:21] [INFO ] Computed 81 invariants in 77 ms
[2024-05-20 14:40:22] [INFO ] Implicit Places using invariants in 1359 ms returned [12, 26, 40, 54, 68, 82, 96, 110, 124, 138, 152, 166, 180, 194, 208, 222, 236, 250, 264, 278, 292, 306, 320, 334, 348, 362, 376, 390, 404, 418, 432, 446, 460, 474, 488, 502, 516, 530, 544, 558]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 1390 ms to find 40 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2139/3682 places, 3714/6720 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 2099 transition count 3674
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 2099 transition count 3674
Applied a total of 80 rules in 386 ms. Remains 2099 /2139 variables (removed 40) and now considering 3674/3714 (removed 40) transitions.
// Phase 1: matrix 3674 rows 2099 cols
[2024-05-20 14:40:23] [INFO ] Computed 41 invariants in 31 ms
[2024-05-20 14:40:24] [INFO ] Implicit Places using invariants in 999 ms returned []
[2024-05-20 14:40:24] [INFO ] Invariant cache hit.
[2024-05-20 14:40:25] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 14:40:49] [INFO ] Implicit Places using invariants and state equation in 25154 ms returned []
Implicit Place search using SMT with State Equation took 26159 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 2099/3682 places, 3674/6720 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 28372 ms. Remains : 2099/3682 places, 3674/6720 transitions.
Support contains 59 out of 2099 places after structural reductions.
[2024-05-20 14:40:49] [INFO ] Flatten gal took : 203 ms
[2024-05-20 14:40:50] [INFO ] Flatten gal took : 134 ms
[2024-05-20 14:40:50] [INFO ] Input system was already deterministic with 3674 transitions.
Support contains 58 out of 2099 places (down from 59) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 585 ms. (steps per millisecond=17 ) properties (out of 39) seen :29
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2024-05-20 14:40:51] [INFO ] Invariant cache hit.
[2024-05-20 14:40:51] [INFO ] [Real]Absence check using 41 positive place invariants in 39 ms returned sat
[2024-05-20 14:40:53] [INFO ] After 1924ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6 real:4
[2024-05-20 14:40:54] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 14:40:54] [INFO ] After 920ms SMT Verify possible using 3160 Read/Feed constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-20 14:40:54] [INFO ] After 3849ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-20 14:40:55] [INFO ] [Nat]Absence check using 41 positive place invariants in 41 ms returned sat
[2024-05-20 14:40:57] [INFO ] After 1758ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-20 14:40:59] [INFO ] After 1537ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2024-05-20 14:41:00] [INFO ] After 3292ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 1085 ms.
[2024-05-20 14:41:01] [INFO ] After 7027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 3 different solutions.
Parikh walk visited 4 properties in 29 ms.
Support contains 8 out of 2099 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2099/2099 places, 3674/3674 transitions.
Drop transitions removed 265 transitions
Trivial Post-agglo rules discarded 265 transitions
Performed 265 trivial Post agglomeration. Transition count delta: 265
Iterating post reduction 0 with 265 rules applied. Total rules applied 265 place count 2099 transition count 3409
Reduce places removed 265 places and 0 transitions.
Iterating post reduction 1 with 265 rules applied. Total rules applied 530 place count 1834 transition count 3409
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 530 place count 1834 transition count 3369
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 610 place count 1794 transition count 3369
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 623 place count 1781 transition count 3343
Iterating global reduction 2 with 13 rules applied. Total rules applied 636 place count 1781 transition count 3343
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 2 with 11 rules applied. Total rules applied 647 place count 1781 transition count 3332
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 658 place count 1770 transition count 3332
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 742 place count 1728 transition count 3290
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 743 place count 1728 transition count 3289
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 744 place count 1727 transition count 3289
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 746 place count 1727 transition count 3289
Applied a total of 746 rules in 1009 ms. Remains 1727 /2099 variables (removed 372) and now considering 3289/3674 (removed 385) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1010 ms. Remains : 1727/2099 places, 3289/3674 transitions.
Finished random walk after 6646 steps, including 24 resets, run visited all 6 properties in 154 ms. (steps per millisecond=43 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 121 stabilizing places and 160 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' '!((X((F(p0)||X(G(p1))))||(X(!p2) U ((!p0&&X(!p2))||X(G(!p2))))))'
Support contains 5 out of 2099 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2099/2099 places, 3674/3674 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 2083 transition count 3642
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 2083 transition count 3642
Applied a total of 32 rules in 225 ms. Remains 2083 /2099 variables (removed 16) and now considering 3642/3674 (removed 32) transitions.
// Phase 1: matrix 3642 rows 2083 cols
[2024-05-20 14:41:03] [INFO ] Computed 41 invariants in 20 ms
[2024-05-20 14:41:05] [INFO ] Implicit Places using invariants in 1380 ms returned []
[2024-05-20 14:41:05] [INFO ] Invariant cache hit.
[2024-05-20 14:41:06] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 14:41:28] [INFO ] Implicit Places using invariants and state equation in 23400 ms returned []
Implicit Place search using SMT with State Equation took 24783 ms to find 0 implicit places.
[2024-05-20 14:41:28] [INFO ] Invariant cache hit.
[2024-05-20 14:41:30] [INFO ] Dead Transitions using invariants and state equation in 1513 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2083/2099 places, 3642/3674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26524 ms. Remains : 2083/2099 places, 3642/3674 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 354 ms :[(NOT p0), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(AND (GEQ s210 1) (GEQ s455 1)), p2:(AND (GEQ s1 1) (GEQ s38 1)), p1:(LT s1198 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1979 ms.
Product exploration explored 100000 steps with 50000 reset in 1818 ms.
Computed a total of 121 stabilizing places and 160 stable transitions
Computed a total of 121 stabilizing places and 160 stable transitions
Detected a total of 121/2083 stabilizing places and 160/3642 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 56 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-040-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-040-LTLFireability-00 finished in 30824 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(p1))))'
Support contains 4 out of 2099 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2099/2099 places, 3674/3674 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 2082 transition count 3640
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 2082 transition count 3640
Applied a total of 34 rules in 209 ms. Remains 2082 /2099 variables (removed 17) and now considering 3640/3674 (removed 34) transitions.
// Phase 1: matrix 3640 rows 2082 cols
[2024-05-20 14:41:34] [INFO ] Computed 41 invariants in 81 ms
[2024-05-20 14:41:36] [INFO ] Implicit Places using invariants in 1462 ms returned []
[2024-05-20 14:41:36] [INFO ] Invariant cache hit.
[2024-05-20 14:41:37] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 14:41:59] [INFO ] Implicit Places using invariants and state equation in 23526 ms returned []
Implicit Place search using SMT with State Equation took 24998 ms to find 0 implicit places.
[2024-05-20 14:41:59] [INFO ] Invariant cache hit.
[2024-05-20 14:42:01] [INFO ] Dead Transitions using invariants and state equation in 1599 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2082/2099 places, 3640/3674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26814 ms. Remains : 2082/2099 places, 3640/3674 transitions.
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s59 1) (LT s234 1)), p1:(OR (LT s42 1) (LT s311 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1744 ms.
Product exploration explored 100000 steps with 50000 reset in 1809 ms.
Computed a total of 121 stabilizing places and 160 stable transitions
Computed a total of 121 stabilizing places and 160 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 141 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-040-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-040-LTLFireability-01 finished in 30661 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&X(G((!p1 U p2)))))&&F(p3)))'
Support contains 7 out of 2099 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2099/2099 places, 3674/3674 transitions.
Drop transitions removed 265 transitions
Trivial Post-agglo rules discarded 265 transitions
Performed 265 trivial Post agglomeration. Transition count delta: 265
Iterating post reduction 0 with 265 rules applied. Total rules applied 265 place count 2099 transition count 3409
Reduce places removed 265 places and 0 transitions.
Iterating post reduction 1 with 265 rules applied. Total rules applied 530 place count 1834 transition count 3409
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 530 place count 1834 transition count 3369
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 610 place count 1794 transition count 3369
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 626 place count 1778 transition count 3337
Iterating global reduction 2 with 16 rules applied. Total rules applied 642 place count 1778 transition count 3337
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 2 with 14 rules applied. Total rules applied 656 place count 1778 transition count 3323
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 670 place count 1764 transition count 3323
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 746 place count 1726 transition count 3285
Applied a total of 746 rules in 578 ms. Remains 1726 /2099 variables (removed 373) and now considering 3285/3674 (removed 389) transitions.
// Phase 1: matrix 3285 rows 1726 cols
[2024-05-20 14:42:05] [INFO ] Computed 41 invariants in 25 ms
[2024-05-20 14:42:06] [INFO ] Implicit Places using invariants in 1013 ms returned []
[2024-05-20 14:42:06] [INFO ] Invariant cache hit.
[2024-05-20 14:42:07] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 14:42:28] [INFO ] Implicit Places using invariants and state equation in 21981 ms returned []
Implicit Place search using SMT with State Equation took 22998 ms to find 0 implicit places.
[2024-05-20 14:42:28] [INFO ] Redundant transitions in 173 ms returned []
[2024-05-20 14:42:28] [INFO ] Invariant cache hit.
[2024-05-20 14:42:30] [INFO ] Dead Transitions using invariants and state equation in 1331 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1726/2099 places, 3285/3674 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25104 ms. Remains : 1726/2099 places, 3285/3674 transitions.
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p0) (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p0)), (NOT p3), (NOT p2), (NOT p2)]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=3 dest: 1}, { cond=(OR p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s29 1) (LT s641 1)), p3:(AND (GEQ s19 1) (GEQ s1575 1)), p2:(LT s897 1), p1:(AND (GEQ s108 1) (GEQ s901 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 307 steps with 0 reset in 3 ms.
FORMULA CANConstruction-PT-040-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLFireability-02 finished in 25367 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 2099 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2099/2099 places, 3674/3674 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 2083 transition count 3642
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 2083 transition count 3642
Applied a total of 32 rules in 261 ms. Remains 2083 /2099 variables (removed 16) and now considering 3642/3674 (removed 32) transitions.
// Phase 1: matrix 3642 rows 2083 cols
[2024-05-20 14:42:30] [INFO ] Computed 41 invariants in 25 ms
[2024-05-20 14:42:31] [INFO ] Implicit Places using invariants in 1091 ms returned []
[2024-05-20 14:42:31] [INFO ] Invariant cache hit.
[2024-05-20 14:42:33] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 14:42:55] [INFO ] Implicit Places using invariants and state equation in 23925 ms returned []
Implicit Place search using SMT with State Equation took 25030 ms to find 0 implicit places.
[2024-05-20 14:42:55] [INFO ] Invariant cache hit.
[2024-05-20 14:42:57] [INFO ] Dead Transitions using invariants and state equation in 1490 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2083/2099 places, 3642/3674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26784 ms. Remains : 2083/2099 places, 3642/3674 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s1179 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1713 ms.
Product exploration explored 100000 steps with 50000 reset in 1738 ms.
Computed a total of 121 stabilizing places and 160 stable transitions
Computed a total of 121 stabilizing places and 160 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 21 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-040-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-040-LTLFireability-03 finished in 30381 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(G((p0&&F(p1))))&&F(!p1)))'
Support contains 3 out of 2099 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2099/2099 places, 3674/3674 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 2083 transition count 3642
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 2083 transition count 3642
Applied a total of 32 rules in 236 ms. Remains 2083 /2099 variables (removed 16) and now considering 3642/3674 (removed 32) transitions.
// Phase 1: matrix 3642 rows 2083 cols
[2024-05-20 14:43:01] [INFO ] Computed 41 invariants in 26 ms
[2024-05-20 14:43:02] [INFO ] Implicit Places using invariants in 1064 ms returned []
[2024-05-20 14:43:02] [INFO ] Invariant cache hit.
[2024-05-20 14:43:03] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 14:43:26] [INFO ] Implicit Places using invariants and state equation in 24137 ms returned []
Implicit Place search using SMT with State Equation took 25205 ms to find 0 implicit places.
[2024-05-20 14:43:26] [INFO ] Invariant cache hit.
[2024-05-20 14:43:27] [INFO ] Dead Transitions using invariants and state equation in 1485 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2083/2099 places, 3642/3674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26936 ms. Remains : 2083/2099 places, 3642/3674 transitions.
Stuttering acceptance computed with spot in 258 ms :[true, (OR (NOT p0) (NOT p1)), p1, true, (NOT p1)]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s282 1) (GEQ s1324 1)), p0:(GEQ s1591 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-040-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLFireability-04 finished in 27218 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(F(p0))&&F(p1))))))'
Support contains 3 out of 2099 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2099/2099 places, 3674/3674 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 2083 transition count 3642
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 2083 transition count 3642
Applied a total of 32 rules in 246 ms. Remains 2083 /2099 variables (removed 16) and now considering 3642/3674 (removed 32) transitions.
// Phase 1: matrix 3642 rows 2083 cols
[2024-05-20 14:43:28] [INFO ] Computed 41 invariants in 24 ms
[2024-05-20 14:43:29] [INFO ] Implicit Places using invariants in 1017 ms returned []
[2024-05-20 14:43:29] [INFO ] Invariant cache hit.
[2024-05-20 14:43:30] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 14:43:52] [INFO ] Implicit Places using invariants and state equation in 23219 ms returned []
Implicit Place search using SMT with State Equation took 24250 ms to find 0 implicit places.
[2024-05-20 14:43:52] [INFO ] Invariant cache hit.
[2024-05-20 14:43:54] [INFO ] Dead Transitions using invariants and state equation in 1668 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2083/2099 places, 3642/3674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26170 ms. Remains : 2083/2099 places, 3642/3674 transitions.
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=true, acceptance={} source=3 dest: 5}, { cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(GEQ s1770 1), p1:(OR (LT s227 1) (LT s306 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 625 steps with 0 reset in 5 ms.
FORMULA CANConstruction-PT-040-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLFireability-05 finished in 26469 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(F(p1)&&F((p2||G(p3)))))))'
Support contains 7 out of 2099 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2099/2099 places, 3674/3674 transitions.
Drop transitions removed 261 transitions
Trivial Post-agglo rules discarded 261 transitions
Performed 261 trivial Post agglomeration. Transition count delta: 261
Iterating post reduction 0 with 261 rules applied. Total rules applied 261 place count 2099 transition count 3413
Reduce places removed 261 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 262 rules applied. Total rules applied 523 place count 1838 transition count 3412
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 524 place count 1837 transition count 3412
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 524 place count 1837 transition count 3373
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 602 place count 1798 transition count 3373
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 619 place count 1781 transition count 3339
Iterating global reduction 3 with 17 rules applied. Total rules applied 636 place count 1781 transition count 3339
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 3 with 15 rules applied. Total rules applied 651 place count 1781 transition count 3324
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 666 place count 1766 transition count 3324
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 740 place count 1729 transition count 3287
Applied a total of 740 rules in 417 ms. Remains 1729 /2099 variables (removed 370) and now considering 3287/3674 (removed 387) transitions.
// Phase 1: matrix 3287 rows 1729 cols
[2024-05-20 14:43:55] [INFO ] Computed 41 invariants in 25 ms
[2024-05-20 14:43:56] [INFO ] Implicit Places using invariants in 968 ms returned []
[2024-05-20 14:43:56] [INFO ] Invariant cache hit.
[2024-05-20 14:43:57] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 14:44:18] [INFO ] Implicit Places using invariants and state equation in 22002 ms returned []
Implicit Place search using SMT with State Equation took 22977 ms to find 0 implicit places.
[2024-05-20 14:44:18] [INFO ] Redundant transitions in 185 ms returned []
[2024-05-20 14:44:18] [INFO ] Invariant cache hit.
[2024-05-20 14:44:19] [INFO ] Dead Transitions using invariants and state equation in 1217 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1729/2099 places, 3287/3674 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24808 ms. Remains : 1729/2099 places, 3287/3674 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s32 1) (GEQ s59 1) (LT s90 1)), p1:(AND (GEQ s40 1) (GEQ s109 1)), p2:(AND (GEQ s22 1) (GEQ s1423 1)), p3:(AND (GEQ s32 1) (GEQ s59 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 368 steps with 1 reset in 7 ms.
FORMULA CANConstruction-PT-040-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLFireability-06 finished in 24958 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0 U (p1||G(p0)))&&X(G((p0||G(p2))))))))'
Support contains 5 out of 2099 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2099/2099 places, 3674/3674 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 2083 transition count 3642
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 2083 transition count 3642
Applied a total of 32 rules in 234 ms. Remains 2083 /2099 variables (removed 16) and now considering 3642/3674 (removed 32) transitions.
// Phase 1: matrix 3642 rows 2083 cols
[2024-05-20 14:44:19] [INFO ] Computed 41 invariants in 25 ms
[2024-05-20 14:44:20] [INFO ] Implicit Places using invariants in 1019 ms returned []
[2024-05-20 14:44:20] [INFO ] Invariant cache hit.
[2024-05-20 14:44:22] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 14:44:43] [INFO ] Implicit Places using invariants and state equation in 22719 ms returned []
Implicit Place search using SMT with State Equation took 23742 ms to find 0 implicit places.
[2024-05-20 14:44:43] [INFO ] Invariant cache hit.
[2024-05-20 14:44:45] [INFO ] Dead Transitions using invariants and state equation in 1477 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2083/2099 places, 3642/3674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25454 ms. Remains : 2083/2099 places, 3642/3674 transitions.
Stuttering acceptance computed with spot in 253 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 1}]], initial=5, aps=[p1:(AND (LT s1926 1) (NOT (AND (GEQ s126 1) (GEQ s1468 1)))), p0:(LT s1926 1), p2:(AND (GEQ s167 1) (GEQ s330 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 23185 steps with 32 reset in 157 ms.
FORMULA CANConstruction-PT-040-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLFireability-07 finished in 25894 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((X(F(p0))||(X(p2)&&p1))))'
Support contains 5 out of 2099 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2099/2099 places, 3674/3674 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 2083 transition count 3642
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 2083 transition count 3642
Applied a total of 32 rules in 256 ms. Remains 2083 /2099 variables (removed 16) and now considering 3642/3674 (removed 32) transitions.
// Phase 1: matrix 3642 rows 2083 cols
[2024-05-20 14:44:45] [INFO ] Computed 41 invariants in 22 ms
[2024-05-20 14:44:46] [INFO ] Implicit Places using invariants in 1043 ms returned []
[2024-05-20 14:44:46] [INFO ] Invariant cache hit.
[2024-05-20 14:44:48] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 14:45:10] [INFO ] Implicit Places using invariants and state equation in 23783 ms returned []
Implicit Place search using SMT with State Equation took 24827 ms to find 0 implicit places.
[2024-05-20 14:45:10] [INFO ] Invariant cache hit.
[2024-05-20 14:45:12] [INFO ] Dead Transitions using invariants and state equation in 1527 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2083/2099 places, 3642/3674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26616 ms. Remains : 2083/2099 places, 3642/3674 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s78 1) (GEQ s1114 1)), p0:(OR (LT s174 1) (LT s887 1)), p2:(GEQ s655 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1836 ms.
Product exploration explored 100000 steps with 50000 reset in 1810 ms.
Computed a total of 121 stabilizing places and 160 stable transitions
Computed a total of 121 stabilizing places and 160 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 112 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-040-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-040-LTLFireability-08 finished in 30549 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||X(p1)))))'
Support contains 4 out of 2099 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2099/2099 places, 3674/3674 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 2084 transition count 3644
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 2084 transition count 3644
Applied a total of 30 rules in 236 ms. Remains 2084 /2099 variables (removed 15) and now considering 3644/3674 (removed 30) transitions.
// Phase 1: matrix 3644 rows 2084 cols
[2024-05-20 14:45:16] [INFO ] Computed 41 invariants in 27 ms
[2024-05-20 14:45:17] [INFO ] Implicit Places using invariants in 1074 ms returned []
[2024-05-20 14:45:17] [INFO ] Invariant cache hit.
[2024-05-20 14:45:18] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 14:45:40] [INFO ] Implicit Places using invariants and state equation in 23100 ms returned []
Implicit Place search using SMT with State Equation took 24188 ms to find 0 implicit places.
[2024-05-20 14:45:40] [INFO ] Invariant cache hit.
[2024-05-20 14:45:42] [INFO ] Dead Transitions using invariants and state equation in 1567 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2084/2099 places, 3644/3674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25992 ms. Remains : 2084/2099 places, 3644/3674 transitions.
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(LT s1766 1), p1:(AND (LT s1217 1) (OR (LT s378 1) (LT s1215 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 139 reset in 538 ms.
Product exploration explored 100000 steps with 140 reset in 692 ms.
Computed a total of 121 stabilizing places and 160 stable transitions
Computed a total of 121 stabilizing places and 160 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 111 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-20 14:45:43] [INFO ] Invariant cache hit.
[2024-05-20 14:45:44] [INFO ] [Real]Absence check using 41 positive place invariants in 33 ms returned sat
[2024-05-20 14:45:45] [INFO ] After 1352ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 14:45:45] [INFO ] [Nat]Absence check using 41 positive place invariants in 32 ms returned sat
[2024-05-20 14:45:46] [INFO ] After 1022ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 14:45:46] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 14:45:46] [INFO ] After 313ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 14:45:46] [INFO ] After 482ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 110 ms.
[2024-05-20 14:45:47] [INFO ] After 1907ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 17 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=8 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT p0)), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 11 factoid took 317 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 2084 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2084/2084 places, 3644/3644 transitions.
Applied a total of 0 rules in 121 ms. Remains 2084 /2084 variables (removed 0) and now considering 3644/3644 (removed 0) transitions.
[2024-05-20 14:45:47] [INFO ] Invariant cache hit.
[2024-05-20 14:45:48] [INFO ] Implicit Places using invariants in 1017 ms returned []
[2024-05-20 14:45:48] [INFO ] Invariant cache hit.
[2024-05-20 14:45:49] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 14:46:11] [INFO ] Implicit Places using invariants and state equation in 22649 ms returned []
Implicit Place search using SMT with State Equation took 23681 ms to find 0 implicit places.
[2024-05-20 14:46:11] [INFO ] Invariant cache hit.
[2024-05-20 14:46:12] [INFO ] Dead Transitions using invariants and state equation in 1552 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25364 ms. Remains : 2084/2084 places, 3644/3644 transitions.
Computed a total of 121 stabilizing places and 160 stable transitions
Computed a total of 121 stabilizing places and 160 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 206 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 98556 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{1=1, 2=1}
Probabilistic random walk after 98556 steps, saw 51604 distinct states, run finished after 3003 ms. (steps per millisecond=32 ) properties seen :2
Running SMT prover for 3 properties.
[2024-05-20 14:46:16] [INFO ] Invariant cache hit.
[2024-05-20 14:46:16] [INFO ] [Real]Absence check using 41 positive place invariants in 34 ms returned sat
[2024-05-20 14:46:18] [INFO ] After 1101ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2024-05-20 14:46:18] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 14:46:18] [INFO ] After 400ms SMT Verify possible using 3160 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 14:46:18] [INFO ] After 1911ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 14:46:18] [INFO ] [Nat]Absence check using 41 positive place invariants in 33 ms returned sat
[2024-05-20 14:46:20] [INFO ] After 1182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-20 14:46:20] [INFO ] After 476ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-20 14:46:21] [INFO ] After 977ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 313 ms.
[2024-05-20 14:46:21] [INFO ] After 2875ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 17 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=8 )
Parikh walk visited 3 properties in 2 ms.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT p0)), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 11 factoid took 227 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 142 reset in 518 ms.
Product exploration explored 100000 steps with 142 reset in 516 ms.
Built C files in :
/tmp/ltsmin13158356747313910686
[2024-05-20 14:46:23] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13158356747313910686
Running compilation step : cd /tmp/ltsmin13158356747313910686;'/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/ltsmin13158356747313910686;'/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/ltsmin13158356747313910686;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 2084 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2084/2084 places, 3644/3644 transitions.
Applied a total of 0 rules in 123 ms. Remains 2084 /2084 variables (removed 0) and now considering 3644/3644 (removed 0) transitions.
[2024-05-20 14:46:26] [INFO ] Invariant cache hit.
[2024-05-20 14:46:27] [INFO ] Implicit Places using invariants in 1064 ms returned []
[2024-05-20 14:46:27] [INFO ] Invariant cache hit.
[2024-05-20 14:46:28] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 14:46:50] [INFO ] Implicit Places using invariants and state equation in 23375 ms returned []
Implicit Place search using SMT with State Equation took 24442 ms to find 0 implicit places.
[2024-05-20 14:46:50] [INFO ] Invariant cache hit.
[2024-05-20 14:46:52] [INFO ] Dead Transitions using invariants and state equation in 1468 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26047 ms. Remains : 2084/2084 places, 3644/3644 transitions.
Built C files in :
/tmp/ltsmin15827854756422487864
[2024-05-20 14:46:52] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15827854756422487864
Running compilation step : cd /tmp/ltsmin15827854756422487864;'/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/ltsmin15827854756422487864;'/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/ltsmin15827854756422487864;'/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-20 14:46:55] [INFO ] Flatten gal took : 104 ms
[2024-05-20 14:46:55] [INFO ] Flatten gal took : 97 ms
[2024-05-20 14:46:55] [INFO ] Time to serialize gal into /tmp/LTL13359279810645065514.gal : 20 ms
[2024-05-20 14:46:55] [INFO ] Time to serialize properties into /tmp/LTL234042993885622118.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/LTL13359279810645065514.gal' '-t' 'CGAL' '-hoa' '/tmp/aut361199680361236300.hoa' '-atoms' '/tmp/LTL234042993885622118.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...316
Loading property file /tmp/LTL234042993885622118.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut361199680361236300.hoa
Detected timeout of ITS tools.
[2024-05-20 14:47:10] [INFO ] Flatten gal took : 98 ms
[2024-05-20 14:47:10] [INFO ] Flatten gal took : 98 ms
[2024-05-20 14:47:10] [INFO ] Time to serialize gal into /tmp/LTL5635122311735411635.gal : 16 ms
[2024-05-20 14:47:10] [INFO ] Time to serialize properties into /tmp/LTL9993546316205596543.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/LTL5635122311735411635.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9993546316205596543.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 : !((F(G(("(Node31GiveAnswer34<1)")||(X("((Node17GiveAnswer32<1)&&((Node31IsInserted<1)||(Node17requestsent31<1)))"))))))
Formula 0 simplified : GF(!"(Node31GiveAnswer34<1)" & X!"((Node17GiveAnswer32<1)&&((Node31IsInserted<1)||(Node17requestsent31<1)))")
Detected timeout of ITS tools.
[2024-05-20 14:47:26] [INFO ] Flatten gal took : 92 ms
[2024-05-20 14:47:26] [INFO ] Applying decomposition
[2024-05-20 14:47:26] [INFO ] Flatten gal took : 113 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/graph15937742700432789330.txt' '-o' '/tmp/graph15937742700432789330.bin' '-w' '/tmp/graph15937742700432789330.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15937742700432789330.bin' '-l' '-1' '-v' '-w' '/tmp/graph15937742700432789330.weights' '-q' '0' '-e' '0.001'
[2024-05-20 14:47:26] [INFO ] Decomposing Gal with order
[2024-05-20 14:47:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 14:47:27] [INFO ] Removed a total of 3236 redundant transitions.
[2024-05-20 14:47:27] [INFO ] Flatten gal took : 633 ms
[2024-05-20 14:47:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 6228 labels/synchronizations in 285 ms.
[2024-05-20 14:47:27] [INFO ] Time to serialize gal into /tmp/LTL1342618822339218058.gal : 32 ms
[2024-05-20 14:47:27] [INFO ] Time to serialize properties into /tmp/LTL6571685630066761064.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/LTL1342618822339218058.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6571685630066761064.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...254
Read 1 LTL properties
Checking formula 0 : !((F(G(("(i34.u156.Node31GiveAnswer34<1)")||(X("((i32.u147.Node17GiveAnswer32<1)&&((i34.u179.Node31IsInserted<1)||(i17.u77.Node17reque...175
Formula 0 simplified : GF(!"(i34.u156.Node31GiveAnswer34<1)" & X!"((i32.u147.Node17GiveAnswer32<1)&&((i34.u179.Node31IsInserted<1)||(i17.u77.Node17requests...167
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2612013908785972055
[2024-05-20 14:47:42] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2612013908785972055
Running compilation step : cd /tmp/ltsmin2612013908785972055;'/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/ltsmin2612013908785972055;'/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/ltsmin2612013908785972055;'/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)
Treatment of property CANConstruction-PT-040-LTLFireability-09 finished in 149800 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((p0||X(p1)))&&F(p2)))'
Support contains 4 out of 2099 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2099/2099 places, 3674/3674 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 2084 transition count 3644
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 2084 transition count 3644
Applied a total of 30 rules in 257 ms. Remains 2084 /2099 variables (removed 15) and now considering 3644/3674 (removed 30) transitions.
// Phase 1: matrix 3644 rows 2084 cols
[2024-05-20 14:47:46] [INFO ] Computed 41 invariants in 34 ms
[2024-05-20 14:47:47] [INFO ] Implicit Places using invariants in 1159 ms returned []
[2024-05-20 14:47:47] [INFO ] Invariant cache hit.
[2024-05-20 14:47:48] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 14:48:10] [INFO ] Implicit Places using invariants and state equation in 23387 ms returned []
Implicit Place search using SMT with State Equation took 24568 ms to find 0 implicit places.
[2024-05-20 14:48:10] [INFO ] Invariant cache hit.
[2024-05-20 14:48:12] [INFO ] Dead Transitions using invariants and state equation in 1463 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2084/2099 places, 3644/3674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26289 ms. Remains : 2084/2099 places, 3644/3674 transitions.
Stuttering acceptance computed with spot in 186 ms :[true, (OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2 p1), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={0} source=1 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 p2), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=4, aps=[p1:(GEQ s1147 1), p0:(GEQ s1835 1), p2:(AND (GEQ s35 1) (GEQ s402 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-040-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLFireability-10 finished in 26506 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(G(p0)))'
Support contains 1 out of 2099 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2099/2099 places, 3674/3674 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 2083 transition count 3642
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 2083 transition count 3642
Applied a total of 32 rules in 276 ms. Remains 2083 /2099 variables (removed 16) and now considering 3642/3674 (removed 32) transitions.
// Phase 1: matrix 3642 rows 2083 cols
[2024-05-20 14:48:12] [INFO ] Computed 41 invariants in 24 ms
[2024-05-20 14:48:13] [INFO ] Implicit Places using invariants in 1058 ms returned []
[2024-05-20 14:48:13] [INFO ] Invariant cache hit.
[2024-05-20 14:48:14] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 14:48:37] [INFO ] Implicit Places using invariants and state equation in 24024 ms returned []
Implicit Place search using SMT with State Equation took 25089 ms to find 0 implicit places.
[2024-05-20 14:48:37] [INFO ] Invariant cache hit.
[2024-05-20 14:48:39] [INFO ] Dead Transitions using invariants and state equation in 1566 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2083/2099 places, 3642/3674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26932 ms. Remains : 2083/2099 places, 3642/3674 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s777 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 3485 steps with 4 reset in 24 ms.
FORMULA CANConstruction-PT-040-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLFireability-11 finished in 27065 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(G((G((p0&&X(p1)))||(p2&&X(G(p3)))))))'
Support contains 6 out of 2099 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2099/2099 places, 3674/3674 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 2084 transition count 3644
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 2084 transition count 3644
Applied a total of 30 rules in 245 ms. Remains 2084 /2099 variables (removed 15) and now considering 3644/3674 (removed 30) transitions.
// Phase 1: matrix 3644 rows 2084 cols
[2024-05-20 14:48:39] [INFO ] Computed 41 invariants in 25 ms
[2024-05-20 14:48:40] [INFO ] Implicit Places using invariants in 1021 ms returned []
[2024-05-20 14:48:40] [INFO ] Invariant cache hit.
[2024-05-20 14:48:41] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 14:49:03] [INFO ] Implicit Places using invariants and state equation in 22540 ms returned []
Implicit Place search using SMT with State Equation took 23564 ms to find 0 implicit places.
[2024-05-20 14:49:03] [INFO ] Invariant cache hit.
[2024-05-20 14:49:04] [INFO ] Dead Transitions using invariants and state equation in 1581 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2084/2099 places, 3644/3674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25397 ms. Remains : 2084/2099 places, 3644/3674 transitions.
Stuttering acceptance computed with spot in 235 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), true, (OR (NOT p1) (NOT p0)), (NOT p3), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 4}, { cond=(AND p0 p2), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 2}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p3) (NOT p1))), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p3) p1), acceptance={} source=5 dest: 3}, { cond=(OR (AND (NOT p0) p3) (AND p3 (NOT p1))), acceptance={} source=5 dest: 4}, { cond=(AND p0 p3 p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(GEQ s1289 1), p0:(GEQ s1223 1), p1:(AND (GEQ s107 1) (GEQ s282 1)), p3:(AND (GEQ s42 1) (GEQ s1110 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-040-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLFireability-13 finished in 25665 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)||G(p1))))'
Support contains 3 out of 2099 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2099/2099 places, 3674/3674 transitions.
Drop transitions removed 264 transitions
Trivial Post-agglo rules discarded 264 transitions
Performed 264 trivial Post agglomeration. Transition count delta: 264
Iterating post reduction 0 with 264 rules applied. Total rules applied 264 place count 2099 transition count 3410
Reduce places removed 264 places and 0 transitions.
Iterating post reduction 1 with 264 rules applied. Total rules applied 528 place count 1835 transition count 3410
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 528 place count 1835 transition count 3370
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 608 place count 1795 transition count 3370
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 624 place count 1779 transition count 3338
Iterating global reduction 2 with 16 rules applied. Total rules applied 640 place count 1779 transition count 3338
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 2 with 14 rules applied. Total rules applied 654 place count 1779 transition count 3324
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 668 place count 1765 transition count 3324
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 748 place count 1725 transition count 3284
Applied a total of 748 rules in 405 ms. Remains 1725 /2099 variables (removed 374) and now considering 3284/3674 (removed 390) transitions.
// Phase 1: matrix 3284 rows 1725 cols
[2024-05-20 14:49:05] [INFO ] Computed 41 invariants in 20 ms
[2024-05-20 14:49:06] [INFO ] Implicit Places using invariants in 962 ms returned []
[2024-05-20 14:49:06] [INFO ] Invariant cache hit.
[2024-05-20 14:49:07] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 14:49:28] [INFO ] Implicit Places using invariants and state equation in 22036 ms returned []
Implicit Place search using SMT with State Equation took 23036 ms to find 0 implicit places.
[2024-05-20 14:49:28] [INFO ] Redundant transitions in 88 ms returned []
[2024-05-20 14:49:28] [INFO ] Invariant cache hit.
[2024-05-20 14:49:29] [INFO ] Dead Transitions using invariants and state equation in 1296 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1725/2099 places, 3284/3674 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24860 ms. Remains : 1725/2099 places, 3284/3674 transitions.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s741 1), p1:(AND (GEQ s26 1) (GEQ s41 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 279 steps with 0 reset in 3 ms.
FORMULA CANConstruction-PT-040-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-040-LTLFireability-14 finished in 24940 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&&(!p1 U (G(!p1)||(!p1&&G(p2))))))))'
Support contains 4 out of 2099 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2099/2099 places, 3674/3674 transitions.
Drop transitions removed 265 transitions
Trivial Post-agglo rules discarded 265 transitions
Performed 265 trivial Post agglomeration. Transition count delta: 265
Iterating post reduction 0 with 265 rules applied. Total rules applied 265 place count 2099 transition count 3409
Reduce places removed 265 places and 0 transitions.
Iterating post reduction 1 with 265 rules applied. Total rules applied 530 place count 1834 transition count 3409
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 530 place count 1834 transition count 3369
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 610 place count 1794 transition count 3369
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 625 place count 1779 transition count 3339
Iterating global reduction 2 with 15 rules applied. Total rules applied 640 place count 1779 transition count 3339
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 2 with 13 rules applied. Total rules applied 653 place count 1779 transition count 3326
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 666 place count 1766 transition count 3326
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 748 place count 1725 transition count 3285
Applied a total of 748 rules in 403 ms. Remains 1725 /2099 variables (removed 374) and now considering 3285/3674 (removed 389) transitions.
// Phase 1: matrix 3285 rows 1725 cols
[2024-05-20 14:49:30] [INFO ] Computed 41 invariants in 19 ms
[2024-05-20 14:49:31] [INFO ] Implicit Places using invariants in 988 ms returned []
[2024-05-20 14:49:31] [INFO ] Invariant cache hit.
[2024-05-20 14:49:32] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 14:49:52] [INFO ] Implicit Places using invariants and state equation in 21516 ms returned []
Implicit Place search using SMT with State Equation took 22514 ms to find 0 implicit places.
[2024-05-20 14:49:53] [INFO ] Redundant transitions in 88 ms returned []
[2024-05-20 14:49:53] [INFO ] Invariant cache hit.
[2024-05-20 14:49:54] [INFO ] Dead Transitions using invariants and state equation in 1308 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1725/2099 places, 3285/3674 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24356 ms. Remains : 1725/2099 places, 3285/3674 transitions.
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p0) p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={1} source=3 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p0) p2) (AND p2 p1)), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p0:(LT s642 1), p1:(AND (GEQ s67 1) (GEQ s1434 1)), p2:(LT s1406 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 363 reset in 780 ms.
Stack based approach found an accepted trace after 34691 steps with 125 reset with depth 207 and stack size 207 in 291 ms.
FORMULA CANConstruction-PT-040-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-040-LTLFireability-15 finished in 25690 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||X(p1)))))'
Found a Lengthening insensitive property : CANConstruction-PT-040-LTLFireability-09
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 2099 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2099/2099 places, 3674/3674 transitions.
Drop transitions removed 265 transitions
Trivial Post-agglo rules discarded 265 transitions
Performed 265 trivial Post agglomeration. Transition count delta: 265
Iterating post reduction 0 with 265 rules applied. Total rules applied 265 place count 2099 transition count 3409
Reduce places removed 265 places and 0 transitions.
Iterating post reduction 1 with 265 rules applied. Total rules applied 530 place count 1834 transition count 3409
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 530 place count 1834 transition count 3369
Deduced a syphon composed of 40 places in 14 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 610 place count 1794 transition count 3369
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 625 place count 1779 transition count 3339
Iterating global reduction 2 with 15 rules applied. Total rules applied 640 place count 1779 transition count 3339
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 2 with 13 rules applied. Total rules applied 653 place count 1779 transition count 3326
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 666 place count 1766 transition count 3326
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 748 place count 1725 transition count 3285
Applied a total of 748 rules in 452 ms. Remains 1725 /2099 variables (removed 374) and now considering 3285/3674 (removed 389) transitions.
// Phase 1: matrix 3285 rows 1725 cols
[2024-05-20 14:49:56] [INFO ] Computed 41 invariants in 37 ms
[2024-05-20 14:49:57] [INFO ] Implicit Places using invariants in 1210 ms returned []
[2024-05-20 14:49:57] [INFO ] Invariant cache hit.
[2024-05-20 14:49:58] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 14:50:18] [INFO ] Implicit Places using invariants and state equation in 20660 ms returned []
Implicit Place search using SMT with State Equation took 21882 ms to find 0 implicit places.
[2024-05-20 14:50:18] [INFO ] Invariant cache hit.
[2024-05-20 14:50:19] [INFO ] Dead Transitions using invariants and state equation in 1317 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1725/2099 places, 3285/3674 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 23665 ms. Remains : 1725/2099 places, 3285/3674 transitions.
Running random walk in product with property : CANConstruction-PT-040-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(LT s1407 1), p1:(AND (LT s858 1) (OR (LT s97 1) (LT s856 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 361 reset in 767 ms.
Product exploration explored 100000 steps with 363 reset in 801 ms.
Computed a total of 41 stabilizing places and 80 stable transitions
Computed a total of 41 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 122 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 36 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-20 14:50:21] [INFO ] Invariant cache hit.
[2024-05-20 14:50:21] [INFO ] [Real]Absence check using 41 positive place invariants in 31 ms returned sat
[2024-05-20 14:50:21] [INFO ] After 241ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 14:50:21] [INFO ] [Nat]Absence check using 41 positive place invariants in 27 ms returned sat
[2024-05-20 14:50:22] [INFO ] After 836ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 14:50:22] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 14:50:23] [INFO ] After 392ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 14:50:23] [INFO ] After 555ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 97 ms.
[2024-05-20 14:50:23] [INFO ] After 1785ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 1725 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1725/1725 places, 3285/3285 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1725 transition count 3284
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1724 transition count 3284
Applied a total of 2 rules in 240 ms. Remains 1724 /1725 variables (removed 1) and now considering 3284/3285 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 242 ms. Remains : 1724/1725 places, 3284/3285 transitions.
Incomplete random walk after 10000 steps, including 37 resets, run finished after 94 ms. (steps per millisecond=106 ) 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 101847 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 101847 steps, saw 30051 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 3284 rows 1724 cols
[2024-05-20 14:50:26] [INFO ] Computed 41 invariants in 26 ms
[2024-05-20 14:50:27] [INFO ] [Real]Absence check using 41 positive place invariants in 33 ms returned sat
[2024-05-20 14:50:27] [INFO ] After 258ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 14:50:27] [INFO ] [Nat]Absence check using 41 positive place invariants in 31 ms returned sat
[2024-05-20 14:50:28] [INFO ] After 840ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 14:50:28] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 14:50:28] [INFO ] After 291ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 14:50:28] [INFO ] After 432ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 93 ms.
[2024-05-20 14:50:28] [INFO ] After 1632ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT p0)), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 11 factoid took 249 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1725 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1725/1725 places, 3285/3285 transitions.
Applied a total of 0 rules in 85 ms. Remains 1725 /1725 variables (removed 0) and now considering 3285/3285 (removed 0) transitions.
// Phase 1: matrix 3285 rows 1725 cols
[2024-05-20 14:50:29] [INFO ] Computed 41 invariants in 29 ms
[2024-05-20 14:50:30] [INFO ] Implicit Places using invariants in 983 ms returned []
[2024-05-20 14:50:30] [INFO ] Invariant cache hit.
[2024-05-20 14:50:31] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 14:50:51] [INFO ] Implicit Places using invariants and state equation in 20968 ms returned []
Implicit Place search using SMT with State Equation took 21955 ms to find 0 implicit places.
[2024-05-20 14:50:51] [INFO ] Invariant cache hit.
[2024-05-20 14:50:52] [INFO ] Dead Transitions using invariants and state equation in 1272 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23334 ms. Remains : 1725/1725 places, 3285/3285 transitions.
Computed a total of 41 stabilizing places and 80 stable transitions
Computed a total of 41 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 99 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 37 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-20 14:50:52] [INFO ] Invariant cache hit.
[2024-05-20 14:50:53] [INFO ] [Real]Absence check using 41 positive place invariants in 33 ms returned sat
[2024-05-20 14:50:53] [INFO ] After 245ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 14:50:53] [INFO ] [Nat]Absence check using 41 positive place invariants in 27 ms returned sat
[2024-05-20 14:50:54] [INFO ] After 816ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 14:50:54] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 14:50:54] [INFO ] After 385ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 14:50:54] [INFO ] After 544ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 101 ms.
[2024-05-20 14:50:54] [INFO ] After 1715ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 1725 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1725/1725 places, 3285/3285 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1725 transition count 3284
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1724 transition count 3284
Applied a total of 2 rules in 231 ms. Remains 1724 /1725 variables (removed 1) and now considering 3284/3285 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 232 ms. Remains : 1724/1725 places, 3284/3285 transitions.
Incomplete random walk after 10000 steps, including 35 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 102165 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 102165 steps, saw 30162 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 3284 rows 1724 cols
[2024-05-20 14:50:58] [INFO ] Computed 41 invariants in 24 ms
[2024-05-20 14:50:58] [INFO ] [Real]Absence check using 41 positive place invariants in 29 ms returned sat
[2024-05-20 14:50:58] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 14:50:58] [INFO ] [Nat]Absence check using 41 positive place invariants in 31 ms returned sat
[2024-05-20 14:50:59] [INFO ] After 846ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 14:50:59] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 14:50:59] [INFO ] After 289ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 14:50:59] [INFO ] After 435ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 93 ms.
[2024-05-20 14:51:00] [INFO ] After 1640ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT p0)), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 11 factoid took 236 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 362 reset in 743 ms.
Product exploration explored 100000 steps with 360 reset in 766 ms.
Built C files in :
/tmp/ltsmin13910096616413730081
[2024-05-20 14:51:02] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13910096616413730081
Running compilation step : cd /tmp/ltsmin13910096616413730081;'/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/ltsmin13910096616413730081;'/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/ltsmin13910096616413730081;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 1725 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1725/1725 places, 3285/3285 transitions.
Applied a total of 0 rules in 86 ms. Remains 1725 /1725 variables (removed 0) and now considering 3285/3285 (removed 0) transitions.
// Phase 1: matrix 3285 rows 1725 cols
[2024-05-20 14:51:05] [INFO ] Computed 41 invariants in 17 ms
[2024-05-20 14:51:06] [INFO ] Implicit Places using invariants in 972 ms returned []
[2024-05-20 14:51:06] [INFO ] Invariant cache hit.
[2024-05-20 14:51:07] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 14:51:27] [INFO ] Implicit Places using invariants and state equation in 21729 ms returned []
Implicit Place search using SMT with State Equation took 22713 ms to find 0 implicit places.
[2024-05-20 14:51:27] [INFO ] Invariant cache hit.
[2024-05-20 14:51:29] [INFO ] Dead Transitions using invariants and state equation in 1334 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24148 ms. Remains : 1725/1725 places, 3285/3285 transitions.
Built C files in :
/tmp/ltsmin1485808468893707218
[2024-05-20 14:51:29] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1485808468893707218
Running compilation step : cd /tmp/ltsmin1485808468893707218;'/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/ltsmin1485808468893707218;'/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/ltsmin1485808468893707218;'/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-20 14:51:32] [INFO ] Flatten gal took : 98 ms
[2024-05-20 14:51:32] [INFO ] Flatten gal took : 71 ms
[2024-05-20 14:51:32] [INFO ] Time to serialize gal into /tmp/LTL18280430163445036366.gal : 14 ms
[2024-05-20 14:51:32] [INFO ] Time to serialize properties into /tmp/LTL6803179452093866821.prop : 13 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/LTL18280430163445036366.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11931539099136641765.hoa' '-atoms' '/tmp/LTL6803179452093866821.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL6803179452093866821.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11931539099136641765.hoa
Detected timeout of ITS tools.
[2024-05-20 14:51:47] [INFO ] Flatten gal took : 67 ms
[2024-05-20 14:51:47] [INFO ] Flatten gal took : 69 ms
[2024-05-20 14:51:48] [INFO ] Time to serialize gal into /tmp/LTL9472694393051595388.gal : 29 ms
[2024-05-20 14:51:48] [INFO ] Time to serialize properties into /tmp/LTL16123997007757532038.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/LTL9472694393051595388.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16123997007757532038.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(("(Node31GiveAnswer34<1)")||(X("((Node17GiveAnswer32<1)&&((Node31IsInserted<1)||(Node17requestsent31<1)))"))))))
Formula 0 simplified : GF(!"(Node31GiveAnswer34<1)" & X!"((Node17GiveAnswer32<1)&&((Node31IsInserted<1)||(Node17requestsent31<1)))")
Detected timeout of ITS tools.
[2024-05-20 14:52:03] [INFO ] Flatten gal took : 70 ms
[2024-05-20 14:52:03] [INFO ] Applying decomposition
[2024-05-20 14:52:03] [INFO ] Flatten gal took : 123 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/graph14719245127073700576.txt' '-o' '/tmp/graph14719245127073700576.bin' '-w' '/tmp/graph14719245127073700576.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14719245127073700576.bin' '-l' '-1' '-v' '-w' '/tmp/graph14719245127073700576.weights' '-q' '0' '-e' '0.001'
[2024-05-20 14:52:03] [INFO ] Decomposing Gal with order
[2024-05-20 14:52:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 14:52:04] [INFO ] Removed a total of 3157 redundant transitions.
[2024-05-20 14:52:04] [INFO ] Flatten gal took : 454 ms
[2024-05-20 14:52:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 3124 labels/synchronizations in 283 ms.
[2024-05-20 14:52:04] [INFO ] Time to serialize gal into /tmp/LTL14173630915426464650.gal : 31 ms
[2024-05-20 14:52:04] [INFO ] Time to serialize properties into /tmp/LTL3419450242593894086.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14173630915426464650.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3419450242593894086.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(("(u35.Node31GiveAnswer34<1)")||(X("((u33.Node17GiveAnswer32<1)&&((u31.Node31IsInserted<1)||(u18.Node17requestsent31<1)))")))))...156
Formula 0 simplified : GF(!"(u35.Node31GiveAnswer34<1)" & X!"((u33.Node17GiveAnswer32<1)&&((u31.Node31IsInserted<1)||(u18.Node17requestsent31<1)))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3602670333510748009
[2024-05-20 14:52:19] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3602670333510748009
Running compilation step : cd /tmp/ltsmin3602670333510748009;'/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/ltsmin3602670333510748009;'/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/ltsmin3602670333510748009;'/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)
Treatment of property CANConstruction-PT-040-LTLFireability-09 finished in 147014 ms.
[2024-05-20 14:52:22] [INFO ] Flatten gal took : 89 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14581578146726896248
[2024-05-20 14:52:22] [INFO ] Too many transitions (3674) to apply POR reductions. Disabling POR matrices.
[2024-05-20 14:52:22] [INFO ] Built C files in 78ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14581578146726896248
Running compilation step : cd /tmp/ltsmin14581578146726896248;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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-20 14:52:22] [INFO ] Applying decomposition
[2024-05-20 14:52:23] [INFO ] Flatten gal took : 139 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/graph16397845319018278519.txt' '-o' '/tmp/graph16397845319018278519.bin' '-w' '/tmp/graph16397845319018278519.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16397845319018278519.bin' '-l' '-1' '-v' '-w' '/tmp/graph16397845319018278519.weights' '-q' '0' '-e' '0.001'
[2024-05-20 14:52:23] [INFO ] Decomposing Gal with order
[2024-05-20 14:52:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 14:52:23] [INFO ] Removed a total of 3229 redundant transitions.
[2024-05-20 14:52:23] [INFO ] Flatten gal took : 305 ms
[2024-05-20 14:52:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 6160 labels/synchronizations in 187 ms.
[2024-05-20 14:52:24] [INFO ] Time to serialize gal into /tmp/LTLFireability2373365000804305873.gal : 26 ms
[2024-05-20 14:52:24] [INFO ] Time to serialize properties into /tmp/LTLFireability4434897504616062143.ltl : 16 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/LTLFireability2373365000804305873.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4434897504616062143.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 1 LTL properties
Checking formula 0 : !((F(G(("(i34.u154.Node31GiveAnswer34<1)")||(X("((i32.u144.Node17GiveAnswer32<1)&&((i33.u147.Node31IsInserted<1)||(i17.u79.Node17reque...175
Formula 0 simplified : GF(!"(i34.u154.Node31GiveAnswer34<1)" & X!"((i32.u144.Node17GiveAnswer32<1)&&((i33.u147.Node31IsInserted<1)||(i17.u79.Node17requests...167
Compilation finished in 9839 ms.
Running link step : cd /tmp/ltsmin14581578146726896248;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin14581578146726896248;'/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)||X((LTLAPp1==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-20 15:16:25] [INFO ] Flatten gal took : 261 ms
[2024-05-20 15:16:25] [INFO ] Time to serialize gal into /tmp/LTLFireability14748630897750815218.gal : 28 ms
[2024-05-20 15:16:25] [INFO ] Time to serialize properties into /tmp/LTLFireability2947292115300865317.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14748630897750815218.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2947292115300865317.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...298
Read 1 LTL properties
Checking formula 0 : !((F(G(("(Node31GiveAnswer34<1)")||(X("((Node17GiveAnswer32<1)&&((Node31IsInserted<1)||(Node17requestsent31<1)))"))))))
Formula 0 simplified : GF(!"(Node31GiveAnswer34<1)" & X!"((Node17GiveAnswer32<1)&&((Node31IsInserted<1)||(Node17requestsent31<1)))")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 162612 kB
After kill :
MemTotal: 16393232 kB
MemFree: 15911392 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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is CANConstruction-PT-040, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r087-tall-171620521300023"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-040.tgz
mv CANConstruction-PT-040 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;