About the Execution of ITS-Tools for CANConstruction-PT-050
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16248.487 | 3600000.00 | 2477540.00 | 631580.00 | FFFFF??FFFFTFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r292-tall-162124155900045.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is CANConstruction-PT-050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124155900045
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 22K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 20K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 103K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 12 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 12 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 12 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 12 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 4.4K May 11 18:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 11 18:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 11 15:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 11 15:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 12 04:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 12 04:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 4 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 12M May 12 08:13 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-050-00
FORMULA_NAME CANConstruction-PT-050-01
FORMULA_NAME CANConstruction-PT-050-02
FORMULA_NAME CANConstruction-PT-050-03
FORMULA_NAME CANConstruction-PT-050-04
FORMULA_NAME CANConstruction-PT-050-05
FORMULA_NAME CANConstruction-PT-050-06
FORMULA_NAME CANConstruction-PT-050-07
FORMULA_NAME CANConstruction-PT-050-08
FORMULA_NAME CANConstruction-PT-050-09
FORMULA_NAME CANConstruction-PT-050-10
FORMULA_NAME CANConstruction-PT-050-11
FORMULA_NAME CANConstruction-PT-050-12
FORMULA_NAME CANConstruction-PT-050-13
FORMULA_NAME CANConstruction-PT-050-14
FORMULA_NAME CANConstruction-PT-050-15
=== Now, execution of the tool begins
BK_START 1621250508185
Running Version 0
[2021-05-17 11:21:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 11:21:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 11:21:50] [INFO ] Load time of PNML (sax parser for PT used): 402 ms
[2021-05-17 11:21:50] [INFO ] Transformed 5602 places.
[2021-05-17 11:21:50] [INFO ] Transformed 10400 transitions.
[2021-05-17 11:21:50] [INFO ] Parsed PT model containing 5602 places and 10400 transitions in 492 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 11:21:50] [INFO ] Initial state test concluded for 2 properties.
Support contains 56 out of 5602 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5602/5602 places, 10400/10400 transitions.
Discarding 2385 places :
Symmetric choice reduction at 0 with 2385 rule applications. Total rules 2385 place count 3217 transition count 5630
Iterating global reduction 0 with 2385 rules applied. Total rules applied 4770 place count 3217 transition count 5630
Applied a total of 4770 rules in 841 ms. Remains 3217 /5602 variables (removed 2385) and now considering 5630/10400 (removed 4770) transitions.
// Phase 1: matrix 5630 rows 3217 cols
[2021-05-17 11:21:51] [INFO ] Computed 101 place invariants in 89 ms
[2021-05-17 11:21:53] [INFO ] Implicit Places using invariants in 2657 ms returned []
// Phase 1: matrix 5630 rows 3217 cols
[2021-05-17 11:21:54] [INFO ] Computed 101 place invariants in 55 ms
[2021-05-17 11:21:55] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2021-05-17 11:22:12] [INFO ] Implicit Places using invariants and state equation in 18952 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, 572, 586, 600, 614, 628, 642, 656, 670, 684, 698]
Discarding 50 places :
Implicit Place search using SMT with State Equation took 21657 ms to find 50 implicit places.
// Phase 1: matrix 5630 rows 3167 cols
[2021-05-17 11:22:13] [INFO ] Computed 51 place invariants in 43 ms
[2021-05-17 11:22:15] [INFO ] Dead Transitions using invariants and state equation in 2931 ms returned []
Starting structural reductions, iteration 1 : 3167/5602 places, 5630/10400 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 3117 transition count 5580
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 3117 transition count 5580
Applied a total of 100 rules in 1462 ms. Remains 3117 /3167 variables (removed 50) and now considering 5580/5630 (removed 50) transitions.
// Phase 1: matrix 5580 rows 3117 cols
[2021-05-17 11:22:17] [INFO ] Computed 51 place invariants in 34 ms
[2021-05-17 11:22:19] [INFO ] Implicit Places using invariants in 2343 ms returned []
// Phase 1: matrix 5580 rows 3117 cols
[2021-05-17 11:22:19] [INFO ] Computed 51 place invariants in 47 ms
[2021-05-17 11:22:23] [INFO ] Implicit Places using invariants and state equation in 3426 ms returned []
Implicit Place search using SMT with State Equation took 5791 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 3117/5602 places, 5580/10400 transitions.
[2021-05-17 11:22:23] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-17 11:22:23] [INFO ] Flatten gal took : 360 ms
FORMULA CANConstruction-PT-050-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-050-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 11:22:24] [INFO ] Flatten gal took : 201 ms
[2021-05-17 11:22:24] [INFO ] Input system was already deterministic with 5580 transitions.
Incomplete random walk after 100000 steps, including 114 resets, run finished after 1044 ms. (steps per millisecond=95 ) properties (out of 34) seen :33
Running SMT prover for 1 properties.
// Phase 1: matrix 5580 rows 3117 cols
[2021-05-17 11:22:25] [INFO ] Computed 51 place invariants in 37 ms
[2021-05-17 11:22:26] [INFO ] [Real]Absence check using 51 positive place invariants in 56 ms returned sat
[2021-05-17 11:22:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 11:22:28] [INFO ] [Real]Absence check using state equation in 1859 ms returned unsat :0 sat :1 real:0
[2021-05-17 11:22:28] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2021-05-17 11:22:28] [INFO ] [Real]Added 4950 Read/Feed constraints in 282 ms returned sat
[2021-05-17 11:22:28] [INFO ] SMT Verify possible in real domain returnedunsat :0 sat :0 real:1
[2021-05-17 11:22:29] [INFO ] [Nat]Absence check using 51 positive place invariants in 98 ms returned sat
[2021-05-17 11:22:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 11:22:30] [INFO ] [Nat]Absence check using state equation in 1802 ms returned unsat :0 sat :1
[2021-05-17 11:22:31] [INFO ] [Nat]Added 4950 Read/Feed constraints in 244 ms returned sat
Attempting to minimize the solution found.
Minimization took 235 ms.
[2021-05-17 11:22:31] [INFO ] SMT Verify possible in nat domain returned unsat :0 sat :1
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((p0||X(p1)))&&X((p2||X(((p3 U p0) U ((p3 U p0)&&p4)))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 3117 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3117/3117 places, 5580/5580 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 3103 transition count 5552
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 3103 transition count 5552
Applied a total of 28 rules in 502 ms. Remains 3103 /3117 variables (removed 14) and now considering 5552/5580 (removed 28) transitions.
// Phase 1: matrix 5552 rows 3103 cols
[2021-05-17 11:22:32] [INFO ] Computed 51 place invariants in 31 ms
[2021-05-17 11:22:34] [INFO ] Implicit Places using invariants in 1940 ms returned []
// Phase 1: matrix 5552 rows 3103 cols
[2021-05-17 11:22:34] [INFO ] Computed 51 place invariants in 32 ms
[2021-05-17 11:22:37] [INFO ] Implicit Places using invariants and state equation in 2966 ms returned []
Implicit Place search using SMT with State Equation took 4930 ms to find 0 implicit places.
// Phase 1: matrix 5552 rows 3103 cols
[2021-05-17 11:22:37] [INFO ] Computed 51 place invariants in 29 ms
[2021-05-17 11:22:40] [INFO ] Dead Transitions using invariants and state equation in 2851 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3103/3117 places, 5552/5580 transitions.
Stuttering acceptance computed with spot in 479 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p4))), (NOT p1), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p2))), true, (OR (NOT p4) (NOT p0)), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=5 dest: 4}, { cond=(OR (AND p0 (NOT p4)) (AND (NOT p4) p3)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) p4 p3), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p0) p3), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s35 1) (GEQ s570 1)), p1:(AND (GEQ s558 1) (GEQ s2363 1)), p2:(AND (GEQ s263 1) (GEQ s582 1)), p3:(GEQ s2747 1), p4:(AND (GEQ s263 1) (GEQ s582 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 2 steps with 0 reset in 2 ms.
FORMULA CANConstruction-PT-050-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-00 finished in 8838 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(((F(p0) U p1)||F(p2)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 3117 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3117/3117 places, 5580/5580 transitions.
Drop transitions removed 334 transitions
Trivial Post-agglo rules discarded 334 transitions
Performed 334 trivial Post agglomeration. Transition count delta: 334
Iterating post reduction 0 with 334 rules applied. Total rules applied 334 place count 3117 transition count 5246
Reduce places removed 334 places and 0 transitions.
Iterating post reduction 1 with 334 rules applied. Total rules applied 668 place count 2783 transition count 5246
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 668 place count 2783 transition count 5196
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 768 place count 2733 transition count 5196
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 781 place count 2720 transition count 5170
Iterating global reduction 2 with 13 rules applied. Total rules applied 794 place count 2720 transition count 5170
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 807 place count 2720 transition count 5157
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 820 place count 2707 transition count 5157
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 2 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 918 place count 2658 transition count 5108
Applied a total of 918 rules in 1137 ms. Remains 2658 /3117 variables (removed 459) and now considering 5108/5580 (removed 472) transitions.
// Phase 1: matrix 5108 rows 2658 cols
[2021-05-17 11:22:41] [INFO ] Computed 51 place invariants in 37 ms
[2021-05-17 11:22:43] [INFO ] Implicit Places using invariants in 1845 ms returned []
// Phase 1: matrix 5108 rows 2658 cols
[2021-05-17 11:22:43] [INFO ] Computed 51 place invariants in 62 ms
[2021-05-17 11:22:44] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2021-05-17 11:23:05] [INFO ] Implicit Places using invariants and state equation in 21924 ms returned []
Implicit Place search using SMT with State Equation took 23772 ms to find 0 implicit places.
[2021-05-17 11:23:06] [INFO ] Redundant transitions in 382 ms returned []
// Phase 1: matrix 5108 rows 2658 cols
[2021-05-17 11:23:06] [INFO ] Computed 51 place invariants in 36 ms
[2021-05-17 11:23:08] [INFO ] Dead Transitions using invariants and state equation in 2601 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2658/3117 places, 5108/5580 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-050-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(OR (AND (GEQ s2102 1) (GEQ s25 1) (GEQ s95 1)) (GEQ s532 1)), p1:(AND (GEQ s25 1) (GEQ s95 1)), p0:(AND (GEQ s30 1) (GEQ s45 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 363 steps with 0 reset in 11 ms.
FORMULA CANConstruction-PT-050-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-01 finished in 28058 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(((!p0&&X(F(p0)))||G(F(p0))))))], workingDir=/home/mcc/execution]
Support contains 1 out of 3117 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3117/3117 places, 5580/5580 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 3103 transition count 5552
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 3103 transition count 5552
Applied a total of 28 rules in 467 ms. Remains 3103 /3117 variables (removed 14) and now considering 5552/5580 (removed 28) transitions.
// Phase 1: matrix 5552 rows 3103 cols
[2021-05-17 11:23:09] [INFO ] Computed 51 place invariants in 29 ms
[2021-05-17 11:23:11] [INFO ] Implicit Places using invariants in 1965 ms returned []
// Phase 1: matrix 5552 rows 3103 cols
[2021-05-17 11:23:11] [INFO ] Computed 51 place invariants in 31 ms
[2021-05-17 11:23:12] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2021-05-17 11:23:38] [INFO ] Implicit Places using invariants and state equation in 27249 ms returned []
Implicit Place search using SMT with State Equation took 29217 ms to find 0 implicit places.
// Phase 1: matrix 5552 rows 3103 cols
[2021-05-17 11:23:38] [INFO ] Computed 51 place invariants in 34 ms
[2021-05-17 11:23:41] [INFO ] Dead Transitions using invariants and state equation in 2972 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3103/3117 places, 5552/5580 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-02 automaton TGBA [mat=[[{ cond=(NOT p0), 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:(GEQ s1710 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 787 steps with 0 reset in 9 ms.
FORMULA CANConstruction-PT-050-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-02 finished in 32803 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 3117 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3117/3117 places, 5580/5580 transitions.
Drop transitions removed 336 transitions
Trivial Post-agglo rules discarded 336 transitions
Performed 336 trivial Post agglomeration. Transition count delta: 336
Iterating post reduction 0 with 336 rules applied. Total rules applied 336 place count 3117 transition count 5244
Reduce places removed 336 places and 0 transitions.
Iterating post reduction 1 with 336 rules applied. Total rules applied 672 place count 2781 transition count 5244
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 672 place count 2781 transition count 5194
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 772 place count 2731 transition count 5194
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 786 place count 2717 transition count 5166
Iterating global reduction 2 with 14 rules applied. Total rules applied 800 place count 2717 transition count 5166
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 813 place count 2717 transition count 5153
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 826 place count 2704 transition count 5153
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 926 place count 2654 transition count 5103
Applied a total of 926 rules in 1077 ms. Remains 2654 /3117 variables (removed 463) and now considering 5103/5580 (removed 477) transitions.
// Phase 1: matrix 5103 rows 2654 cols
[2021-05-17 11:23:42] [INFO ] Computed 51 place invariants in 41 ms
[2021-05-17 11:23:44] [INFO ] Implicit Places using invariants in 1903 ms returned []
// Phase 1: matrix 5103 rows 2654 cols
[2021-05-17 11:23:44] [INFO ] Computed 51 place invariants in 41 ms
[2021-05-17 11:23:45] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2021-05-17 11:24:08] [INFO ] Implicit Places using invariants and state equation in 24346 ms returned []
Implicit Place search using SMT with State Equation took 26251 ms to find 0 implicit places.
[2021-05-17 11:24:09] [INFO ] Redundant transitions in 363 ms returned []
// Phase 1: matrix 5103 rows 2654 cols
[2021-05-17 11:24:09] [INFO ] Computed 51 place invariants in 39 ms
[2021-05-17 11:24:11] [INFO ] Dead Transitions using invariants and state equation in 2514 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2654/3117 places, 5103/5580 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LT s2316 1) (OR (LT s43 1) (LT s2324 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 296 reset in 1346 ms.
Stack based approach found an accepted trace after 33594 steps with 99 reset with depth 271 and stack size 271 in 458 ms.
FORMULA CANConstruction-PT-050-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-03 finished in 32142 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&F(p1)&&(p2 U (p3||G(p2)))))], workingDir=/home/mcc/execution]
Support contains 8 out of 3117 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3117/3117 places, 5580/5580 transitions.
Drop transitions removed 334 transitions
Trivial Post-agglo rules discarded 334 transitions
Performed 334 trivial Post agglomeration. Transition count delta: 334
Iterating post reduction 0 with 334 rules applied. Total rules applied 334 place count 3117 transition count 5246
Reduce places removed 334 places and 0 transitions.
Iterating post reduction 1 with 334 rules applied. Total rules applied 668 place count 2783 transition count 5246
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 668 place count 2783 transition count 5196
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 768 place count 2733 transition count 5196
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 783 place count 2718 transition count 5166
Iterating global reduction 2 with 15 rules applied. Total rules applied 798 place count 2718 transition count 5166
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 812 place count 2718 transition count 5152
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 826 place count 2704 transition count 5152
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 918 place count 2658 transition count 5106
Applied a total of 918 rules in 845 ms. Remains 2658 /3117 variables (removed 459) and now considering 5106/5580 (removed 474) transitions.
// Phase 1: matrix 5106 rows 2658 cols
[2021-05-17 11:24:14] [INFO ] Computed 51 place invariants in 38 ms
[2021-05-17 11:24:16] [INFO ] Implicit Places using invariants in 1765 ms returned []
// Phase 1: matrix 5106 rows 2658 cols
[2021-05-17 11:24:16] [INFO ] Computed 51 place invariants in 39 ms
[2021-05-17 11:24:17] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2021-05-17 11:24:41] [INFO ] Implicit Places using invariants and state equation in 25676 ms returned []
Implicit Place search using SMT with State Equation took 27443 ms to find 0 implicit places.
[2021-05-17 11:24:42] [INFO ] Redundant transitions in 245 ms returned []
// Phase 1: matrix 5106 rows 2658 cols
[2021-05-17 11:24:42] [INFO ] Computed 51 place invariants in 37 ms
[2021-05-17 11:24:44] [INFO ] Dead Transitions using invariants and state equation in 2540 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2658/3117 places, 5106/5580 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p0), (NOT p1), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-050-04 automaton TGBA [mat=[[{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p3) (AND (NOT p0) p2)), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p1) p3) (AND (NOT p1) p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(AND (OR (LT s50 1) (LT s1644 1)) (OR (LT s13 1) (LT s157 1))), p2:(OR (LT s13 1) (LT s157 1)), p0:(OR (AND (GEQ s77 1) (GEQ s818 1)) (AND (GEQ s13 1) (GEQ s157 1))), p1:(OR (LT s55 1) (LT s58 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 632 steps with 1 reset in 9 ms.
FORMULA CANConstruction-PT-050-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-04 finished in 31254 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 3117 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3117/3117 places, 5580/5580 transitions.
Drop transitions removed 336 transitions
Trivial Post-agglo rules discarded 336 transitions
Performed 336 trivial Post agglomeration. Transition count delta: 336
Iterating post reduction 0 with 336 rules applied. Total rules applied 336 place count 3117 transition count 5244
Reduce places removed 336 places and 0 transitions.
Iterating post reduction 1 with 336 rules applied. Total rules applied 672 place count 2781 transition count 5244
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 672 place count 2781 transition count 5194
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 772 place count 2731 transition count 5194
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 785 place count 2718 transition count 5168
Iterating global reduction 2 with 13 rules applied. Total rules applied 798 place count 2718 transition count 5168
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 2 with 12 rules applied. Total rules applied 810 place count 2718 transition count 5156
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 822 place count 2706 transition count 5156
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 4 with 104 rules applied. Total rules applied 926 place count 2654 transition count 5104
Applied a total of 926 rules in 937 ms. Remains 2654 /3117 variables (removed 463) and now considering 5104/5580 (removed 476) transitions.
// Phase 1: matrix 5104 rows 2654 cols
[2021-05-17 11:24:45] [INFO ] Computed 51 place invariants in 37 ms
[2021-05-17 11:24:47] [INFO ] Implicit Places using invariants in 1685 ms returned []
// Phase 1: matrix 5104 rows 2654 cols
[2021-05-17 11:24:47] [INFO ] Computed 51 place invariants in 45 ms
[2021-05-17 11:24:48] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2021-05-17 11:25:12] [INFO ] Implicit Places using invariants and state equation in 24624 ms returned []
Implicit Place search using SMT with State Equation took 26329 ms to find 0 implicit places.
[2021-05-17 11:25:12] [INFO ] Redundant transitions in 243 ms returned []
// Phase 1: matrix 5104 rows 2654 cols
[2021-05-17 11:25:12] [INFO ] Computed 51 place invariants in 39 ms
[2021-05-17 11:25:15] [INFO ] Dead Transitions using invariants and state equation in 2622 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2654/3117 places, 5104/5580 transitions.
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-050-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(LT s2235 1), p0:(LT s1285 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 290 reset in 1243 ms.
Product exploration explored 100000 steps with 290 reset in 1208 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 288 reset in 1178 ms.
Product exploration explored 100000 steps with 289 reset in 1215 ms.
[2021-05-17 11:25:20] [INFO ] Flatten gal took : 168 ms
[2021-05-17 11:25:20] [INFO ] Flatten gal took : 174 ms
[2021-05-17 11:25:20] [INFO ] Time to serialize gal into /tmp/LTL8246004313940969222.gal : 64 ms
[2021-05-17 11:25:20] [INFO ] Time to serialize properties into /tmp/LTL7348594312480820409.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8246004313940969222.gal, -t, CGAL, -LTL, /tmp/LTL7348594312480820409.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8246004313940969222.gal -t CGAL -LTL /tmp/LTL7348594312480820409.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F(("(Node22GiveAnswer4<1)")||(G("(Node41GiveAnswer22<1)"))))))
Formula 0 simplified : !GF("(Node22GiveAnswer4<1)" | G"(Node41GiveAnswer22<1)")
Detected timeout of ITS tools.
[2021-05-17 11:25:36] [INFO ] Flatten gal took : 157 ms
[2021-05-17 11:25:36] [INFO ] Applying decomposition
[2021-05-17 11:25:36] [INFO ] Flatten gal took : 158 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph9095706643894287871.txt, -o, /tmp/graph9095706643894287871.bin, -w, /tmp/graph9095706643894287871.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph9095706643894287871.bin, -l, -1, -v, -w, /tmp/graph9095706643894287871.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 11:25:36] [INFO ] Decomposing Gal with order
[2021-05-17 11:25:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 11:25:37] [INFO ] Removed a total of 4951 redundant transitions.
[2021-05-17 11:25:37] [INFO ] Flatten gal took : 1236 ms
[2021-05-17 11:25:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 4808 labels/synchronizations in 365 ms.
[2021-05-17 11:25:38] [INFO ] Time to serialize gal into /tmp/LTL902897777968572337.gal : 20 ms
[2021-05-17 11:25:38] [INFO ] Time to serialize properties into /tmp/LTL8022725230784789772.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL902897777968572337.gal, -t, CGAL, -LTL, /tmp/LTL8022725230784789772.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL902897777968572337.gal -t CGAL -LTL /tmp/LTL8022725230784789772.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F(("(u4.Node22GiveAnswer4<1)")||(G("(u50.Node41GiveAnswer22<1)"))))))
Formula 0 simplified : !GF("(u4.Node22GiveAnswer4<1)" | G"(u50.Node41GiveAnswer22<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2682696956939152108
[2021-05-17 11:25:53] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2682696956939152108
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin2682696956939152108]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin2682696956939152108] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin2682696956939152108] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property CANConstruction-PT-050-05 finished in 69713 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p1)||p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 3117 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3117/3117 places, 5580/5580 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 3102 transition count 5550
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 3102 transition count 5550
Applied a total of 30 rules in 666 ms. Remains 3102 /3117 variables (removed 15) and now considering 5550/5580 (removed 30) transitions.
// Phase 1: matrix 5550 rows 3102 cols
[2021-05-17 11:25:55] [INFO ] Computed 51 place invariants in 28 ms
[2021-05-17 11:25:57] [INFO ] Implicit Places using invariants in 2035 ms returned []
// Phase 1: matrix 5550 rows 3102 cols
[2021-05-17 11:25:57] [INFO ] Computed 51 place invariants in 27 ms
[2021-05-17 11:25:58] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2021-05-17 11:26:25] [INFO ] Implicit Places using invariants and state equation in 27889 ms returned []
Implicit Place search using SMT with State Equation took 29925 ms to find 0 implicit places.
// Phase 1: matrix 5550 rows 3102 cols
[2021-05-17 11:26:25] [INFO ] Computed 51 place invariants in 27 ms
[2021-05-17 11:26:28] [INFO ] Dead Transitions using invariants and state equation in 3042 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3102/3117 places, 5550/5580 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-050-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (LT s210 1) (LT s2237 1)), p0:(OR (LT s143 1) (LT s186 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 3061 ms.
Product exploration explored 100000 steps with 50000 reset in 3031 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 77 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 3051 ms.
Product exploration explored 100000 steps with 50000 reset in 3048 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 99 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 3102 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 3102/3102 places, 5550/5550 transitions.
Performed 199 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 3102 transition count 5550
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 51 Pre rules applied. Total rules applied 199 place count 3102 transition count 5550
Deduced a syphon composed of 250 places in 1 ms
Iterating global reduction 1 with 51 rules applied. Total rules applied 250 place count 3102 transition count 5550
Discarding 100 places :
Symmetric choice reduction at 1 with 100 rule applications. Total rules 350 place count 3002 transition count 5450
Deduced a syphon composed of 150 places in 1 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 450 place count 3002 transition count 5450
Performed 197 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 347 places in 1 ms
Iterating global reduction 1 with 197 rules applied. Total rules applied 647 place count 3002 transition count 5450
Discarding 246 places :
Symmetric choice reduction at 1 with 246 rule applications. Total rules 893 place count 2756 transition count 5204
Deduced a syphon composed of 101 places in 1 ms
Iterating global reduction 1 with 246 rules applied. Total rules applied 1139 place count 2756 transition count 5204
Deduced a syphon composed of 101 places in 1 ms
Applied a total of 1139 rules in 1518 ms. Remains 2756 /3102 variables (removed 346) and now considering 5204/5550 (removed 346) transitions.
[2021-05-17 11:26:46] [INFO ] Redundant transitions in 271 ms returned []
// Phase 1: matrix 5204 rows 2756 cols
[2021-05-17 11:26:46] [INFO ] Computed 51 place invariants in 47 ms
[2021-05-17 11:26:49] [INFO ] Dead Transitions using invariants and state equation in 2707 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2756/3102 places, 5204/5550 transitions.
Product exploration timeout after 51030 steps with 25515 reset in 10002 ms.
Product exploration timeout after 51700 steps with 25850 reset in 10002 ms.
[2021-05-17 11:27:09] [INFO ] Flatten gal took : 166 ms
[2021-05-17 11:27:09] [INFO ] Flatten gal took : 144 ms
[2021-05-17 11:27:09] [INFO ] Time to serialize gal into /tmp/LTL15414777381792448163.gal : 29 ms
[2021-05-17 11:27:09] [INFO ] Time to serialize properties into /tmp/LTL14331914517158041548.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL15414777381792448163.gal, -t, CGAL, -LTL, /tmp/LTL14331914517158041548.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL15414777381792448163.gal -t CGAL -LTL /tmp/LTL14331914517158041548.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("((Node11Request<1)||(Node15IsInserted<1))")||(G("((Node17IsInserted<1)||(Node32requestsent17<1))")))))
Formula 0 simplified : !X("((Node11Request<1)||(Node15IsInserted<1))" | G"((Node17IsInserted<1)||(Node32requestsent17<1))")
Detected timeout of ITS tools.
[2021-05-17 11:27:24] [INFO ] Flatten gal took : 149 ms
[2021-05-17 11:27:24] [INFO ] Applying decomposition
[2021-05-17 11:27:25] [INFO ] Flatten gal took : 153 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph5332653104033127803.txt, -o, /tmp/graph5332653104033127803.bin, -w, /tmp/graph5332653104033127803.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph5332653104033127803.bin, -l, -1, -v, -w, /tmp/graph5332653104033127803.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 11:27:25] [INFO ] Decomposing Gal with order
[2021-05-17 11:27:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 11:27:26] [INFO ] Removed a total of 5045 redundant transitions.
[2021-05-17 11:27:26] [INFO ] Flatten gal took : 548 ms
[2021-05-17 11:27:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 9800 labels/synchronizations in 339 ms.
[2021-05-17 11:27:26] [INFO ] Time to serialize gal into /tmp/LTL7459230997078990883.gal : 26 ms
[2021-05-17 11:27:26] [INFO ] Time to serialize properties into /tmp/LTL14405554523885959334.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL7459230997078990883.gal, -t, CGAL, -LTL, /tmp/LTL14405554523885959334.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7459230997078990883.gal -t CGAL -LTL /tmp/LTL14405554523885959334.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(("((i11.u52.Node11Request<1)||(i15.u66.Node15IsInserted<1))")||(G("((i17.u74.Node17IsInserted<1)||(i32.u139.Node32requestsent17<1))")))))
Formula 0 simplified : !X("((i11.u52.Node11Request<1)||(i15.u66.Node15IsInserted<1))" | G"((i17.u74.Node17IsInserted<1)||(i32.u139.Node32requestsent17<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11553839170248773413
[2021-05-17 11:27:41] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11553839170248773413
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11553839170248773413]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11553839170248773413] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11553839170248773413] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property CANConstruction-PT-050-06 finished in 108171 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 3117 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3117/3117 places, 5580/5580 transitions.
Drop transitions removed 336 transitions
Trivial Post-agglo rules discarded 336 transitions
Performed 336 trivial Post agglomeration. Transition count delta: 336
Iterating post reduction 0 with 336 rules applied. Total rules applied 336 place count 3117 transition count 5244
Reduce places removed 336 places and 0 transitions.
Iterating post reduction 1 with 336 rules applied. Total rules applied 672 place count 2781 transition count 5244
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 672 place count 2781 transition count 5194
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 772 place count 2731 transition count 5194
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 786 place count 2717 transition count 5166
Iterating global reduction 2 with 14 rules applied. Total rules applied 800 place count 2717 transition count 5166
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 813 place count 2717 transition count 5153
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 826 place count 2704 transition count 5153
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 928 place count 2653 transition count 5102
Applied a total of 928 rules in 692 ms. Remains 2653 /3117 variables (removed 464) and now considering 5102/5580 (removed 478) transitions.
// Phase 1: matrix 5102 rows 2653 cols
[2021-05-17 11:27:43] [INFO ] Computed 51 place invariants in 41 ms
[2021-05-17 11:27:45] [INFO ] Implicit Places using invariants in 1782 ms returned []
// Phase 1: matrix 5102 rows 2653 cols
[2021-05-17 11:27:45] [INFO ] Computed 51 place invariants in 41 ms
[2021-05-17 11:27:46] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2021-05-17 11:28:08] [INFO ] Implicit Places using invariants and state equation in 23374 ms returned []
Implicit Place search using SMT with State Equation took 25159 ms to find 0 implicit places.
[2021-05-17 11:28:08] [INFO ] Redundant transitions in 253 ms returned []
// Phase 1: matrix 5102 rows 2653 cols
[2021-05-17 11:28:09] [INFO ] Computed 51 place invariants in 77 ms
[2021-05-17 11:28:11] [INFO ] Dead Transitions using invariants and state equation in 2397 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2653/3117 places, 5102/5580 transitions.
Stuttering acceptance computed with spot in 2733 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LT s2193 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 289 reset in 1203 ms.
Stack based approach found an accepted trace after 58671 steps with 170 reset with depth 211 and stack size 211 in 715 ms.
FORMULA CANConstruction-PT-050-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-07 finished in 33187 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(F(p0))&&F(p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 3117 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3117/3117 places, 5580/5580 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3104 transition count 5554
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3104 transition count 5554
Applied a total of 26 rules in 395 ms. Remains 3104 /3117 variables (removed 13) and now considering 5554/5580 (removed 26) transitions.
// Phase 1: matrix 5554 rows 3104 cols
[2021-05-17 11:28:16] [INFO ] Computed 51 place invariants in 30 ms
[2021-05-17 11:28:18] [INFO ] Implicit Places using invariants in 1849 ms returned []
// Phase 1: matrix 5554 rows 3104 cols
[2021-05-17 11:28:18] [INFO ] Computed 51 place invariants in 29 ms
[2021-05-17 11:28:19] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2021-05-17 11:28:45] [INFO ] Implicit Places using invariants and state equation in 26761 ms returned []
Implicit Place search using SMT with State Equation took 28612 ms to find 0 implicit places.
// Phase 1: matrix 5554 rows 3104 cols
[2021-05-17 11:28:45] [INFO ] Computed 51 place invariants in 35 ms
[2021-05-17 11:28:47] [INFO ] Dead Transitions using invariants and state equation in 2893 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3104/3117 places, 5554/5580 transitions.
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-050-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (LT s1612 1) (GEQ s1205 1)), p0:(AND (GEQ s246 1) (GEQ s1997 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 922 steps with 0 reset in 7 ms.
FORMULA CANConstruction-PT-050-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-09 finished in 32031 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X((G(p0)||F(p1))) U G(p2)))], workingDir=/home/mcc/execution]
Support contains 4 out of 3117 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3117/3117 places, 5580/5580 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3104 transition count 5554
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3104 transition count 5554
Applied a total of 26 rules in 424 ms. Remains 3104 /3117 variables (removed 13) and now considering 5554/5580 (removed 26) transitions.
// Phase 1: matrix 5554 rows 3104 cols
[2021-05-17 11:28:48] [INFO ] Computed 51 place invariants in 27 ms
[2021-05-17 11:28:50] [INFO ] Implicit Places using invariants in 1941 ms returned []
// Phase 1: matrix 5554 rows 3104 cols
[2021-05-17 11:28:50] [INFO ] Computed 51 place invariants in 28 ms
[2021-05-17 11:28:51] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2021-05-17 11:29:19] [INFO ] Implicit Places using invariants and state equation in 28652 ms returned []
Implicit Place search using SMT with State Equation took 30614 ms to find 0 implicit places.
// Phase 1: matrix 5554 rows 3104 cols
[2021-05-17 11:29:19] [INFO ] Computed 51 place invariants in 27 ms
[2021-05-17 11:29:21] [INFO ] Dead Transitions using invariants and state equation in 2906 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3104/3117 places, 5554/5580 transitions.
Stuttering acceptance computed with spot in 693 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : CANConstruction-PT-050-10 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(AND p2 p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(GEQ s2114 1), p0:(AND (GEQ s486 1) (GEQ s2457 1)), p1:(GEQ s2414 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 823 steps with 0 reset in 8 ms.
FORMULA CANConstruction-PT-050-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-10 finished in 34681 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||X((G(p2)&&p1)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 3117 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3117/3117 places, 5580/5580 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 3103 transition count 5552
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 3103 transition count 5552
Applied a total of 28 rules in 411 ms. Remains 3103 /3117 variables (removed 14) and now considering 5552/5580 (removed 28) transitions.
// Phase 1: matrix 5552 rows 3103 cols
[2021-05-17 11:29:23] [INFO ] Computed 51 place invariants in 31 ms
[2021-05-17 11:29:24] [INFO ] Implicit Places using invariants in 1830 ms returned []
// Phase 1: matrix 5552 rows 3103 cols
[2021-05-17 11:29:25] [INFO ] Computed 51 place invariants in 30 ms
[2021-05-17 11:29:25] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2021-05-17 11:29:48] [INFO ] Implicit Places using invariants and state equation in 23914 ms returned []
Implicit Place search using SMT with State Equation took 25753 ms to find 0 implicit places.
// Phase 1: matrix 5552 rows 3103 cols
[2021-05-17 11:29:48] [INFO ] Computed 51 place invariants in 48 ms
[2021-05-17 11:29:52] [INFO ] Dead Transitions using invariants and state equation in 3113 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3103/3117 places, 5552/5580 transitions.
Stuttering acceptance computed with spot in 82 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-050-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s2269 1), p1:(AND (GEQ s174 1) (GEQ s2921 1)), p2:(AND (GEQ s2269 1) (GEQ s335 1) (GEQ s570 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 850 steps with 0 reset in 8 ms.
FORMULA CANConstruction-PT-050-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-12 finished in 29389 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((G(p0)||X((p1 U (p2||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 3117 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3117/3117 places, 5580/5580 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 3102 transition count 5550
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 3102 transition count 5550
Applied a total of 30 rules in 418 ms. Remains 3102 /3117 variables (removed 15) and now considering 5550/5580 (removed 30) transitions.
// Phase 1: matrix 5550 rows 3102 cols
[2021-05-17 11:29:52] [INFO ] Computed 51 place invariants in 31 ms
[2021-05-17 11:29:54] [INFO ] Implicit Places using invariants in 1926 ms returned []
// Phase 1: matrix 5550 rows 3102 cols
[2021-05-17 11:29:54] [INFO ] Computed 51 place invariants in 29 ms
[2021-05-17 11:29:55] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2021-05-17 11:30:17] [INFO ] Implicit Places using invariants and state equation in 22846 ms returned []
Implicit Place search using SMT with State Equation took 24789 ms to find 0 implicit places.
// Phase 1: matrix 5550 rows 3102 cols
[2021-05-17 11:30:17] [INFO ] Computed 51 place invariants in 32 ms
[2021-05-17 11:30:20] [INFO ] Dead Transitions using invariants and state equation in 2978 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3102/3117 places, 5550/5580 transitions.
Stuttering acceptance computed with spot in 1005 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-050-13 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p2) p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LT s7 1), p2:(AND (OR (LT s90 1) (LT s1639 1)) (OR (LT s54 1) (LT s527 1))), p1:(OR (LT s54 1) (LT s527 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1284 steps with 1 reset in 10 ms.
FORMULA CANConstruction-PT-050-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-13 finished in 29235 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((X(X(X((G(p1)&&F(G(p2))))))||p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 3117 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3117/3117 places, 5580/5580 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 3102 transition count 5550
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 3102 transition count 5550
Applied a total of 30 rules in 378 ms. Remains 3102 /3117 variables (removed 15) and now considering 5550/5580 (removed 30) transitions.
// Phase 1: matrix 5550 rows 3102 cols
[2021-05-17 11:30:21] [INFO ] Computed 51 place invariants in 30 ms
[2021-05-17 11:30:23] [INFO ] Implicit Places using invariants in 1915 ms returned []
// Phase 1: matrix 5550 rows 3102 cols
[2021-05-17 11:30:23] [INFO ] Computed 51 place invariants in 26 ms
[2021-05-17 11:30:24] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2021-05-17 11:30:48] [INFO ] Implicit Places using invariants and state equation in 24601 ms returned []
Implicit Place search using SMT with State Equation took 26517 ms to find 0 implicit places.
// Phase 1: matrix 5550 rows 3102 cols
[2021-05-17 11:30:49] [INFO ] Computed 51 place invariants in 28 ms
[2021-05-17 11:30:52] [INFO ] Dead Transitions using invariants and state equation in 3815 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3102/3117 places, 5550/5580 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : CANConstruction-PT-050-14 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s467 1) (LT s498 1)), p1:(AND (GEQ s42 1) (GEQ s515 1)), p2:(AND (GEQ s467 1) (GEQ s498 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1493 steps with 1 reset in 12 ms.
FORMULA CANConstruction-PT-050-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-14 finished in 30911 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 3117 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3117/3117 places, 5580/5580 transitions.
Drop transitions removed 336 transitions
Trivial Post-agglo rules discarded 336 transitions
Performed 336 trivial Post agglomeration. Transition count delta: 336
Iterating post reduction 0 with 336 rules applied. Total rules applied 336 place count 3117 transition count 5244
Reduce places removed 336 places and 0 transitions.
Iterating post reduction 1 with 336 rules applied. Total rules applied 672 place count 2781 transition count 5244
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 672 place count 2781 transition count 5194
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 772 place count 2731 transition count 5194
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 787 place count 2716 transition count 5164
Iterating global reduction 2 with 15 rules applied. Total rules applied 802 place count 2716 transition count 5164
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 816 place count 2716 transition count 5150
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 830 place count 2702 transition count 5150
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 928 place count 2653 transition count 5101
Applied a total of 928 rules in 667 ms. Remains 2653 /3117 variables (removed 464) and now considering 5101/5580 (removed 479) transitions.
// Phase 1: matrix 5101 rows 2653 cols
[2021-05-17 11:30:52] [INFO ] Computed 51 place invariants in 35 ms
[2021-05-17 11:30:54] [INFO ] Implicit Places using invariants in 1750 ms returned []
// Phase 1: matrix 5101 rows 2653 cols
[2021-05-17 11:30:54] [INFO ] Computed 51 place invariants in 39 ms
[2021-05-17 11:30:55] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2021-05-17 11:31:15] [INFO ] Implicit Places using invariants and state equation in 20624 ms returned []
Implicit Place search using SMT with State Equation took 22382 ms to find 0 implicit places.
[2021-05-17 11:31:15] [INFO ] Redundant transitions in 243 ms returned []
// Phase 1: matrix 5101 rows 2653 cols
[2021-05-17 11:31:15] [INFO ] Computed 51 place invariants in 38 ms
[2021-05-17 11:31:17] [INFO ] Dead Transitions using invariants and state equation in 2351 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2653/3117 places, 5101/5580 transitions.
Stuttering acceptance computed with spot in 5033 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-050-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s52 1) (GEQ s316 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 297 steps with 0 reset in 4 ms.
FORMULA CANConstruction-PT-050-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-050-15 finished in 30710 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9155905879429284998
[2021-05-17 11:31:23] [INFO ] Too many transitions (5580) to apply POR reductions. Disabling POR matrices.
[2021-05-17 11:31:23] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9155905879429284998
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin9155905879429284998]
[2021-05-17 11:31:23] [INFO ] Applying decomposition
[2021-05-17 11:31:23] [INFO ] Flatten gal took : 137 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph4552305700122790924.txt, -o, /tmp/graph4552305700122790924.bin, -w, /tmp/graph4552305700122790924.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph4552305700122790924.bin, -l, -1, -v, -w, /tmp/graph4552305700122790924.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 11:31:23] [INFO ] Decomposing Gal with order
[2021-05-17 11:31:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 11:31:24] [INFO ] Removed a total of 5032 redundant transitions.
[2021-05-17 11:31:24] [INFO ] Flatten gal took : 595 ms
[2021-05-17 11:31:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 9738 labels/synchronizations in 327 ms.
[2021-05-17 11:31:24] [INFO ] Time to serialize gal into /tmp/LTLFireability17243881243619964548.gal : 83 ms
[2021-05-17 11:31:24] [INFO ] Time to serialize properties into /tmp/LTLFireability5674450286759307670.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability17243881243619964548.gal, -t, CGAL, -LTL, /tmp/LTLFireability5674450286759307670.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability17243881243619964548.gal -t CGAL -LTL /tmp/LTLFireability5674450286759307670.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((G(F(("(i4.u18.Node22GiveAnswer4<1)")||(G("(i22.u91.Node41GiveAnswer22<1)"))))))
Formula 0 simplified : !GF("(i4.u18.Node22GiveAnswer4<1)" | G"(i22.u91.Node41GiveAnswer22<1)")
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin9155905879429284998] killed by timeout after 25 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin9155905879429284998] killed by timeout after 25 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-17 11:54:44] [INFO ] Flatten gal took : 6966 ms
[2021-05-17 11:54:44] [INFO ] Time to serialize gal into /tmp/LTLFireability11850032358531696985.gal : 33 ms
[2021-05-17 11:54:44] [INFO ] Time to serialize properties into /tmp/LTLFireability14955721504685702840.ltl : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability11850032358531696985.gal, -t, CGAL, -LTL, /tmp/LTLFireability14955721504685702840.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability11850032358531696985.gal -t CGAL -LTL /tmp/LTLFireability14955721504685702840.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 2 LTL properties
Checking formula 0 : !((G(F(("(Node22GiveAnswer4<1)")||(G("(Node41GiveAnswer22<1)"))))))
Formula 0 simplified : !GF("(Node22GiveAnswer4<1)" | G"(Node41GiveAnswer22<1)")
Detected timeout of ITS tools.
[2021-05-17 12:18:01] [INFO ] Flatten gal took : 588 ms
[2021-05-17 12:18:01] [INFO ] Input system was already deterministic with 5580 transitions.
[2021-05-17 12:18:01] [INFO ] Transformed 3117 places.
[2021-05-17 12:18:01] [INFO ] Transformed 5580 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-17 12:18:04] [INFO ] Time to serialize gal into /tmp/LTLFireability11499052127734957093.gal : 36 ms
[2021-05-17 12:18:04] [INFO ] Time to serialize properties into /tmp/LTLFireability13713961810515123628.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability11499052127734957093.gal, -t, CGAL, -LTL, /tmp/LTLFireability13713961810515123628.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability11499052127734957093.gal -t CGAL -LTL /tmp/LTLFireability13713961810515123628.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(("(Node22GiveAnswer4<1)")||(G("(Node41GiveAnswer22<1)"))))))
Formula 0 simplified : !GF("(Node22GiveAnswer4<1)" | G"(Node41GiveAnswer22<1)")
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
++ cut -d . -f 9
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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-050"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is CANConstruction-PT-050, 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 r292-tall-162124155900045"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-050.tgz
mv CANConstruction-PT-050 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 '
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 ;