fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r292-tall-162124155900076
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for CANConstruction-PT-090

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16247.792 3600000.00 5120241.00 567172.60 FFFFFFFFT?FTTF?T 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-162124155900076.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-090, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124155900076
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 37M
-rw-r--r-- 1 mcc users 28K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 152K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 88K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K May 12 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 12 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 12 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.3K May 11 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 11 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K May 11 15:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 11 15:36 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 37M 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-090-00
FORMULA_NAME CANConstruction-PT-090-01
FORMULA_NAME CANConstruction-PT-090-02
FORMULA_NAME CANConstruction-PT-090-03
FORMULA_NAME CANConstruction-PT-090-04
FORMULA_NAME CANConstruction-PT-090-05
FORMULA_NAME CANConstruction-PT-090-06
FORMULA_NAME CANConstruction-PT-090-07
FORMULA_NAME CANConstruction-PT-090-08
FORMULA_NAME CANConstruction-PT-090-09
FORMULA_NAME CANConstruction-PT-090-10
FORMULA_NAME CANConstruction-PT-090-11
FORMULA_NAME CANConstruction-PT-090-12
FORMULA_NAME CANConstruction-PT-090-13
FORMULA_NAME CANConstruction-PT-090-14
FORMULA_NAME CANConstruction-PT-090-15

=== Now, execution of the tool begins

BK_START 1621262427464

Running Version 0
[2021-05-17 14:40:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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 14:40:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 14:40:45] [INFO ] Load time of PNML (sax parser for PT used): 920 ms
[2021-05-17 14:40:45] [INFO ] Transformed 17282 places.
[2021-05-17 14:40:45] [INFO ] Transformed 33120 transitions.
[2021-05-17 14:40:45] [INFO ] Parsed PT model containing 17282 places and 33120 transitions in 1084 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 14:40:45] [INFO ] Initial state test concluded for 2 properties.
FORMULA CANConstruction-PT-090-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 17282 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 17282/17282 places, 33120/33120 transitions.
Discarding 7896 places :
Symmetric choice reduction at 0 with 7896 rule applications. Total rules 7896 place count 9386 transition count 17328
Iterating global reduction 0 with 7896 rules applied. Total rules applied 15792 place count 9386 transition count 17328
Applied a total of 15792 rules in 23211 ms. Remains 9386 /17282 variables (removed 7896) and now considering 17328/33120 (removed 15792) transitions.
// Phase 1: matrix 17328 rows 9386 cols
[2021-05-17 14:41:09] [INFO ] Computed 181 place invariants in 267 ms
[2021-05-17 14:41:10] [INFO ] Implicit Places using invariants in 1320 ms returned []
Implicit Place search using SMT only with invariants took 1344 ms to find 0 implicit places.
// Phase 1: matrix 17328 rows 9386 cols
[2021-05-17 14:41:10] [INFO ] Computed 181 place invariants in 129 ms
[2021-05-17 14:41:11] [INFO ] Dead Transitions using invariants and state equation in 1048 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9386/17282 places, 17328/33120 transitions.
[2021-05-17 14:41:31] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-17 14:41:31] [INFO ] Flatten gal took : 701 ms
FORMULA CANConstruction-PT-090-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-090-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 14:41:32] [INFO ] Flatten gal took : 582 ms
[2021-05-17 14:41:33] [INFO ] Input system was already deterministic with 17328 transitions.
Incomplete random walk after 100000 steps, including 63 resets, run finished after 2208 ms. (steps per millisecond=45 ) properties (out of 23) seen :14
Running SMT prover for 9 properties.
// Phase 1: matrix 17328 rows 9386 cols
[2021-05-17 14:41:35] [INFO ] Computed 181 place invariants in 118 ms
[2021-05-17 14:41:38] [INFO ] [Real]Absence check using 91 positive place invariants in 260 ms returned sat
[2021-05-17 14:41:38] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 103 ms returned sat
[2021-05-17 14:41:38] [INFO ] SMT Verify possible in real domain returnedunsat :1 sat :0 real:8
[2021-05-17 14:41:40] [INFO ] [Nat]Absence check using 91 positive place invariants in 233 ms returned sat
[2021-05-17 14:41:40] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 107 ms returned sat
[2021-05-17 14:41:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:41:52] [INFO ] [Nat]Absence check using state equation in 11461 ms returned unsat :4 sat :5
[2021-05-17 14:41:52] [INFO ] State equation strengthened by 16110 read => feed constraints.
[2021-05-17 14:41:53] [INFO ] [Nat]Added 16110 Read/Feed constraints in 838 ms returned sat
Attempting to minimize the solution found.
Minimization took 4079 ms.
[2021-05-17 14:42:02] [INFO ] SMT Verify possible in nat domain returned unsat :4 sat :5
Successfully simplified 5 atomic propositions for a total of 13 simplifications.
[2021-05-17 14:42:02] [INFO ] Initial state test concluded for 3 properties.
FORMULA CANConstruction-PT-090-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-090-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-090-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 9386 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9386/9386 places, 17328/17328 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 9363 transition count 17282
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 9363 transition count 17282
Applied a total of 46 rules in 5410 ms. Remains 9363 /9386 variables (removed 23) and now considering 17282/17328 (removed 46) transitions.
// Phase 1: matrix 17282 rows 9363 cols
[2021-05-17 14:42:07] [INFO ] Computed 181 place invariants in 114 ms
[2021-05-17 14:42:08] [INFO ] Implicit Places using invariants in 970 ms returned []
Implicit Place search using SMT only with invariants took 971 ms to find 0 implicit places.
// Phase 1: matrix 17282 rows 9363 cols
[2021-05-17 14:42:08] [INFO ] Computed 181 place invariants in 111 ms
[2021-05-17 14:42:09] [INFO ] Dead Transitions using invariants and state equation in 997 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9363/9386 places, 17282/17328 transitions.
Stuttering acceptance computed with spot in 26510 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : CANConstruction-PT-090-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GT s5008 s2652)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 4 ms.
FORMULA CANConstruction-PT-090-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-00 finished in 33974 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X((p0 U (p1||G(p0)))) U (X(G(p2))||(p3&&X(((p0 U (p1||G(p0)))&&G(F(p3)))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 9386 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9386/9386 places, 17328/17328 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 9364 transition count 17284
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 9364 transition count 17284
Applied a total of 44 rules in 5511 ms. Remains 9364 /9386 variables (removed 22) and now considering 17284/17328 (removed 44) transitions.
// Phase 1: matrix 17284 rows 9364 cols
[2021-05-17 14:42:42] [INFO ] Computed 181 place invariants in 113 ms
[2021-05-17 14:42:42] [INFO ] Implicit Places using invariants in 1003 ms returned []
Implicit Place search using SMT only with invariants took 1007 ms to find 0 implicit places.
// Phase 1: matrix 17284 rows 9364 cols
[2021-05-17 14:42:43] [INFO ] Computed 181 place invariants in 112 ms
[2021-05-17 14:42:43] [INFO ] Dead Transitions using invariants and state equation in 993 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9364/9386 places, 17284/17328 transitions.
Spot timed out Subprocess running CommandLine [args=[/home/mcc/BenchKit/bin//..//autfilt, --hoaf=tv, --small, -F, /tmp/curaut1616392459509219302.hoa], workingDir=/home/mcc/execution] killed by timeout after 10 SECONDS
Spot timed out Subprocess running CommandLine [args=[/home/mcc/BenchKit/bin//..//autfilt, --hoaf=tv, --small, -F, /tmp/curaut16185208445616725192.hoa], workingDir=/home/mcc/execution] killed by timeout after 10 SECONDS
Stuttering acceptance computed with spot in 22133 ms :[false, false, (AND (NOT p1) (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), true, (NOT p2), (AND (NOT p1) (NOT p0)), (NOT p3), (OR (AND p1 (NOT p3)) (AND p2 (NOT p3)) (AND p0 (NOT p3))), (AND (NOT p3) p2 (NOT p1) (NOT p0)), (AND (NOT p3) p2 (NOT p1) (NOT p0)), (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3)))]
Running random walk in product with property : CANConstruction-PT-090-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND p3 (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p3 p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(OR p1 p0), acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}, { cond=(OR (AND (NOT p3) (NOT p2) p1) (AND (NOT p3) (NOT p2) p0)), acceptance={} source=1 dest: 6}], [{ cond=(AND p2 (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 8}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 9}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 10}], [{ cond=(AND p3 (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND p3 p2), acceptance={} source=3 dest: 1}, { cond=true, acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=true, acceptance={} source=4 dest: 5}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 11}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 12}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=5 dest: 13}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=5 dest: 15}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p3) p2), acceptance={} source=6 dest: 6}, { cond=(NOT p3), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 11}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={} source=7 dest: 14}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=7 dest: 16}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=(NOT p2), acceptance={} source=9 dest: 8}, { cond=p2, acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=10 dest: 8}, { cond=(AND (NOT p1) p0), acceptance={} source=10 dest: 10}], [{ cond=(NOT p3), acceptance={0} source=11 dest: 11}], [{ cond=(OR (AND (NOT p3) p2) (AND (NOT p3) p1) (AND (NOT p3) p0)), acceptance={} source=12 dest: 11}, { cond=(OR p2 p1 p0), acceptance={} source=12 dest: 12}], [{ cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=13 dest: 11}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=13 dest: 12}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=13 dest: 13}], [{ cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=14 dest: 11}, { cond=(AND (NOT p3) p2 (NOT p1) p0), acceptance={} source=14 dest: 14}], [{ cond=(OR (AND (NOT p3) (NOT p2) p1) (AND (NOT p3) (NOT p2) p0)), acceptance={} source=15 dest: 11}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=15 dest: 12}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=15 dest: 15}], [{ cond=(OR (AND (NOT p3) (NOT p2) p1) (AND (NOT p3) (NOT p2) p0)), acceptance={} source=16 dest: 11}, { cond=(OR (AND (NOT p3) p2 p1) (AND (NOT p3) p2 p0)), acceptance={} source=16 dest: 16}]], initial=0, aps=[p3:(LEQ s5978 s922), p2:(OR (GT s6676 s2443) (AND (GT 1 s1098) (GT s6676 s2443))), p1:(AND (GT 1 s1098) (GT s6676 s2443)), p0:(GT s6676 s2443)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 3 ms.
FORMULA CANConstruction-PT-090-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-03 finished in 29721 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 9386 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9386/9386 places, 17328/17328 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 9364 transition count 17284
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 9364 transition count 17284
Applied a total of 44 rules in 5584 ms. Remains 9364 /9386 variables (removed 22) and now considering 17284/17328 (removed 44) transitions.
// Phase 1: matrix 17284 rows 9364 cols
[2021-05-17 14:43:11] [INFO ] Computed 181 place invariants in 113 ms
[2021-05-17 14:43:12] [INFO ] Implicit Places using invariants in 997 ms returned []
Implicit Place search using SMT only with invariants took 1001 ms to find 0 implicit places.
// Phase 1: matrix 17284 rows 9364 cols
[2021-05-17 14:43:12] [INFO ] Computed 181 place invariants in 114 ms
[2021-05-17 14:43:13] [INFO ] Dead Transitions using invariants and state equation in 1012 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9364/9386 places, 17284/17328 transitions.
Spot timed out Subprocess running CommandLine [args=[/home/mcc/BenchKit/bin//..//autfilt, --hoaf=tv, --small, -F, /tmp/curaut14068712770705755092.hoa], workingDir=/home/mcc/execution] killed by timeout after 10 SECONDS
Stuttering acceptance computed with spot in 20121 ms :[false, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : CANConstruction-PT-090-04 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(OR (LEQ s9267 s5246) (GT s541 s3732)), p0:(GT s541 s3732)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 22868 steps with 14 reset in 410 ms.
FORMULA CANConstruction-PT-090-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-04 finished in 28170 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 9386 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9386/9386 places, 17328/17328 transitions.
Drop transitions removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 9386 transition count 16698
Reduce places removed 630 places and 0 transitions.
Iterating post reduction 1 with 630 rules applied. Total rules applied 1260 place count 8756 transition count 16698
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 1282 place count 8734 transition count 16654
Iterating global reduction 2 with 22 rules applied. Total rules applied 1304 place count 8734 transition count 16654
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 4 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 1484 place count 8644 transition count 16564
Applied a total of 1484 rules in 8051 ms. Remains 8644 /9386 variables (removed 742) and now considering 16564/17328 (removed 764) transitions.
// Phase 1: matrix 16564 rows 8644 cols
[2021-05-17 14:43:42] [INFO ] Computed 181 place invariants in 106 ms
[2021-05-17 14:43:43] [INFO ] Implicit Places using invariants in 893 ms returned []
Implicit Place search using SMT only with invariants took 894 ms to find 0 implicit places.
// Phase 1: matrix 16564 rows 8644 cols
[2021-05-17 14:43:43] [INFO ] Computed 181 place invariants in 105 ms
[2021-05-17 14:43:44] [INFO ] Dead Transitions using invariants and state equation in 883 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8644/9386 places, 16564/17328 transitions.
Stuttering acceptance computed with spot in 47654 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-090-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GT s2984 s1309), p1:(AND (GT s7689 s5070) (GT 3 s8429))], 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 766 steps with 0 reset in 19 ms.
FORMULA CANConstruction-PT-090-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-05 finished in 57536 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(p0))||G((p1||X(p0)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 9386 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9386/9386 places, 17328/17328 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 9364 transition count 17284
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 9364 transition count 17284
Applied a total of 44 rules in 6165 ms. Remains 9364 /9386 variables (removed 22) and now considering 17284/17328 (removed 44) transitions.
// Phase 1: matrix 17284 rows 9364 cols
[2021-05-17 14:44:38] [INFO ] Computed 181 place invariants in 118 ms
[2021-05-17 14:44:38] [INFO ] Implicit Places using invariants in 982 ms returned []
Implicit Place search using SMT only with invariants took 982 ms to find 0 implicit places.
// Phase 1: matrix 17284 rows 9364 cols
[2021-05-17 14:44:39] [INFO ] Computed 181 place invariants in 109 ms
[2021-05-17 14:44:39] [INFO ] Dead Transitions using invariants and state equation in 974 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9364/9386 places, 17284/17328 transitions.
Spot timed out Subprocess running CommandLine [args=[/home/mcc/BenchKit/bin//..//autfilt, --hoaf=tv, --small, -F, /tmp/curaut11822407534194153701.hoa], workingDir=/home/mcc/execution] killed by timeout after 10 SECONDS
Spot timed out Subprocess running CommandLine [args=[/home/mcc/BenchKit/bin//..//autfilt, --hoaf=tv, --small, -F, /tmp/curaut14687210838758492298.hoa], workingDir=/home/mcc/execution] killed by timeout after 10 SECONDS
Stuttering acceptance computed with spot in 29832 ms :[false, false, (AND (NOT p0) p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-090-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 3}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(GT 1 s7750), p0:(GT s9334 s9071)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 52391 steps with 32 reset in 910 ms.
FORMULA CANConstruction-PT-090-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-06 finished in 38904 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 9386 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9386/9386 places, 17328/17328 transitions.
Drop transitions removed 629 transitions
Trivial Post-agglo rules discarded 629 transitions
Performed 629 trivial Post agglomeration. Transition count delta: 629
Iterating post reduction 0 with 629 rules applied. Total rules applied 629 place count 9386 transition count 16699
Reduce places removed 629 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 630 rules applied. Total rules applied 1259 place count 8757 transition count 16698
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1260 place count 8756 transition count 16698
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 1283 place count 8733 transition count 16652
Iterating global reduction 3 with 23 rules applied. Total rules applied 1306 place count 8733 transition count 16652
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 1486 place count 8643 transition count 16562
Applied a total of 1486 rules in 10058 ms. Remains 8643 /9386 variables (removed 743) and now considering 16562/17328 (removed 766) transitions.
// Phase 1: matrix 16562 rows 8643 cols
[2021-05-17 14:45:20] [INFO ] Computed 181 place invariants in 106 ms
[2021-05-17 14:45:21] [INFO ] Implicit Places using invariants in 910 ms returned []
Implicit Place search using SMT only with invariants took 915 ms to find 0 implicit places.
// Phase 1: matrix 16562 rows 8643 cols
[2021-05-17 14:45:21] [INFO ] Computed 181 place invariants in 105 ms
[2021-05-17 14:45:22] [INFO ] Dead Transitions using invariants and state equation in 916 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8643/9386 places, 16562/17328 transitions.
Stuttering acceptance computed with spot in 2306 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-090-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT s5310 s13)], nbAcceptance=1, 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 710 steps with 0 reset in 16 ms.
FORMULA CANConstruction-PT-090-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-07 finished in 14244 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0&&X(F(p0))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 9386 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9386/9386 places, 17328/17328 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 9362 transition count 17280
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 9362 transition count 17280
Applied a total of 48 rules in 7700 ms. Remains 9362 /9386 variables (removed 24) and now considering 17280/17328 (removed 48) transitions.
// Phase 1: matrix 17280 rows 9362 cols
[2021-05-17 14:45:32] [INFO ] Computed 181 place invariants in 114 ms
[2021-05-17 14:45:33] [INFO ] Implicit Places using invariants in 1007 ms returned []
Implicit Place search using SMT only with invariants took 1008 ms to find 0 implicit places.
// Phase 1: matrix 17280 rows 9362 cols
[2021-05-17 14:45:33] [INFO ] Computed 181 place invariants in 125 ms
[2021-05-17 14:45:34] [INFO ] Dead Transitions using invariants and state equation in 882 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9362/9386 places, 17280/17328 transitions.
Stuttering acceptance computed with spot in 8658 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-090-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s5917 s4372)], 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]]
Product exploration explored 100000 steps with 33333 reset in 4855 ms.
Product exploration explored 100000 steps with 33333 reset in 4839 ms.
Knowledge obtained : [p0]
java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[/home/mcc/BenchKit/bin//..//autfilt, --hoaf=tv, -F, /tmp/curaut16910128930774603384.hoa, --complement], workingDir=/home/mcc/execution] killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:138)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:112)
at fr.lip6.move.gal.application.SpotRunner.buildComplement(SpotRunner.java:532)
at fr.lip6.move.gal.application.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:367)
at fr.lip6.move.gal.application.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:174)
at fr.lip6.move.gal.application.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:60)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:470)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Stuttering acceptance computed with spot in 275 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 4700 ms.
Product exploration explored 100000 steps with 33333 reset in 4754 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 9362 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 9362/9362 places, 17280/17280 transitions.
Performed 450 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 450 rules applied. Total rules applied 450 place count 9362 transition count 17280
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 90 Pre rules applied. Total rules applied 450 place count 9362 transition count 17280
Deduced a syphon composed of 540 places in 5 ms
Iterating global reduction 1 with 90 rules applied. Total rules applied 540 place count 9362 transition count 17280
Discarding 180 places :
Symmetric choice reduction at 1 with 180 rule applications. Total rules 720 place count 9182 transition count 17100
Deduced a syphon composed of 360 places in 4 ms
Iterating global reduction 1 with 180 rules applied. Total rules applied 900 place count 9182 transition count 17100
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 540 places in 3 ms
Iterating global reduction 1 with 180 rules applied. Total rules applied 1080 place count 9182 transition count 17100
Discarding 360 places :
Symmetric choice reduction at 1 with 360 rule applications. Total rules 1440 place count 8822 transition count 16740
Deduced a syphon composed of 180 places in 2 ms
Iterating global reduction 1 with 360 rules applied. Total rules applied 1800 place count 8822 transition count 16740
Deduced a syphon composed of 180 places in 3 ms
Applied a total of 1800 rules in 15272 ms. Remains 8822 /9362 variables (removed 540) and now considering 16740/17280 (removed 540) transitions.
// Phase 1: matrix 16740 rows 8822 cols
[2021-05-17 14:46:35] [INFO ] Computed 181 place invariants in 108 ms
[2021-05-17 14:46:36] [INFO ] Dead Transitions using invariants and state equation in 943 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8822/9362 places, 16740/17280 transitions.
Product exploration timeout after 26140 steps with 8713 reset in 10001 ms.
Product exploration timeout after 26350 steps with 8783 reset in 10002 ms.
[2021-05-17 14:46:58] [INFO ] Flatten gal took : 506 ms
[2021-05-17 14:46:59] [INFO ] Flatten gal took : 483 ms
[2021-05-17 14:46:59] [INFO ] Time to serialize gal into /tmp/LTL3558777873307013679.gal : 122 ms
[2021-05-17 14:46:59] [INFO ] Time to serialize properties into /tmp/LTL7376790912473967343.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/LTL3558777873307013679.gal, -t, CGAL, -LTL, /tmp/LTL7376790912473967343.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/LTL3558777873307013679.gal -t CGAL -LTL /tmp/LTL7376790912473967343.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("(Node51requestsent26<=Node33requestsent84)")&&(X(F("(Node51requestsent26<=Node33requestsent84)")))))))
Formula 0 simplified : !XF("(Node51requestsent26<=Node33requestsent84)" & XF"(Node51requestsent26<=Node33requestsent84)")
Detected timeout of ITS tools.
[2021-05-17 14:47:15] [INFO ] Flatten gal took : 472 ms
[2021-05-17 14:47:15] [INFO ] Applying decomposition
[2021-05-17 14:47:15] [INFO ] Flatten gal took : 481 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/graph6223165116694866260.txt, -o, /tmp/graph6223165116694866260.bin, -w, /tmp/graph6223165116694866260.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/graph6223165116694866260.bin, -l, -1, -v, -w, /tmp/graph6223165116694866260.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 14:47:16] [INFO ] Decomposing Gal with order
[2021-05-17 14:47:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 14:47:20] [INFO ] Removed a total of 16254 redundant transitions.
[2021-05-17 14:47:21] [INFO ] Flatten gal took : 3211 ms
[2021-05-17 14:47:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 15836 labels/synchronizations in 3024 ms.
[2021-05-17 14:47:44] [INFO ] Time to serialize gal into /tmp/LTL5308805212497916150.gal : 18174 ms
[2021-05-17 14:47:44] [INFO ] Time to serialize properties into /tmp/LTL5120696696078303711.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/LTL5308805212497916150.gal, -t, CGAL, -LTL, /tmp/LTL5120696696078303711.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/LTL5308805212497916150.gal -t CGAL -LTL /tmp/LTL5120696696078303711.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("(gu360.Node51requestsent26<=gu360.Node33requestsent84)")&&(X(F("(gu360.Node51requestsent26<=gu360.Node33requestsent84)")))))))
Formula 0 simplified : !XF("(gu360.Node51requestsent26<=gu360.Node33requestsent84)" & XF"(gu360.Node51requestsent26<=gu360.Node33requestsent84)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17540984825810320694
[2021-05-17 14:48:07] [INFO ] Built C files in 182ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17540984825810320694
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/ltsmin17540984825810320694]
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/ltsmin17540984825810320694] 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/ltsmin17540984825810320694] 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-090-09 finished in 163675 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 9386 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9386/9386 places, 17328/17328 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 9364 transition count 17284
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 9364 transition count 17284
Applied a total of 44 rules in 7926 ms. Remains 9364 /9386 variables (removed 22) and now considering 17284/17328 (removed 44) transitions.
// Phase 1: matrix 17284 rows 9364 cols
[2021-05-17 14:48:16] [INFO ] Computed 181 place invariants in 112 ms
[2021-05-17 14:48:17] [INFO ] Implicit Places using invariants in 963 ms returned []
Implicit Place search using SMT only with invariants took 964 ms to find 0 implicit places.
// Phase 1: matrix 17284 rows 9364 cols
[2021-05-17 14:48:17] [INFO ] Computed 181 place invariants in 113 ms
[2021-05-17 14:48:18] [INFO ] Dead Transitions using invariants and state equation in 1012 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9364/9386 places, 17284/17328 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-090-10 automaton TGBA [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:(LEQ s3502 s4208)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 90125 steps with 55 reset in 1552 ms.
FORMULA CANConstruction-PT-090-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-10 finished in 11595 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 9386 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9386/9386 places, 17328/17328 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 9364 transition count 17284
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 9364 transition count 17284
Applied a total of 44 rules in 8010 ms. Remains 9364 /9386 variables (removed 22) and now considering 17284/17328 (removed 44) transitions.
// Phase 1: matrix 17284 rows 9364 cols
[2021-05-17 14:48:28] [INFO ] Computed 181 place invariants in 115 ms
[2021-05-17 14:48:29] [INFO ] Implicit Places using invariants in 1061 ms returned []
Implicit Place search using SMT only with invariants took 1062 ms to find 0 implicit places.
// Phase 1: matrix 17284 rows 9364 cols
[2021-05-17 14:48:29] [INFO ] Computed 181 place invariants in 125 ms
[2021-05-17 14:48:30] [INFO ] Dead Transitions using invariants and state equation in 1036 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9364/9386 places, 17284/17328 transitions.
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-090-13 automaton TGBA [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:(LEQ s5915 s7202)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 57962 steps with 35 reset in 1048 ms.
FORMULA CANConstruction-PT-090-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-13 finished in 11255 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 9386 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9386/9386 places, 17328/17328 transitions.
Drop transitions removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 9386 transition count 16698
Reduce places removed 630 places and 0 transitions.
Iterating post reduction 1 with 630 rules applied. Total rules applied 1260 place count 8756 transition count 16698
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 1282 place count 8734 transition count 16654
Iterating global reduction 2 with 22 rules applied. Total rules applied 1304 place count 8734 transition count 16654
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 4 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 1484 place count 8644 transition count 16564
Applied a total of 1484 rules in 10648 ms. Remains 8644 /9386 variables (removed 742) and now considering 16564/17328 (removed 764) transitions.
// Phase 1: matrix 16564 rows 8644 cols
[2021-05-17 14:48:42] [INFO ] Computed 181 place invariants in 111 ms
[2021-05-17 14:48:43] [INFO ] Implicit Places using invariants in 948 ms returned []
Implicit Place search using SMT only with invariants took 949 ms to find 0 implicit places.
// Phase 1: matrix 16564 rows 8644 cols
[2021-05-17 14:48:43] [INFO ] Computed 181 place invariants in 111 ms
[2021-05-17 14:48:44] [INFO ] Dead Transitions using invariants and state equation in 945 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8644/9386 places, 16564/17328 transitions.
Stuttering acceptance computed with spot in 24 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-090-14 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} 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 p0 p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s5691 s912), p1:(GT s6676 s3368)], nbAcceptance=2, 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 123 reset in 2308 ms.
Product exploration explored 100000 steps with 125 reset in 2467 ms.
Knowledge obtained : [p0, (NOT p1)]
Stuttering acceptance computed with spot in 24 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 123 reset in 2366 ms.
Product exploration explored 100000 steps with 125 reset in 2409 ms.
[2021-05-17 14:48:55] [INFO ] Flatten gal took : 499 ms
[2021-05-17 14:48:55] [INFO ] Flatten gal took : 489 ms
[2021-05-17 14:48:55] [INFO ] Time to serialize gal into /tmp/LTL14467354495404317950.gal : 75 ms
[2021-05-17 14:48:55] [INFO ] Time to serialize properties into /tmp/LTL16958347531389134223.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/LTL14467354495404317950.gal, -t, CGAL, -LTL, /tmp/LTL16958347531389134223.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/LTL14467354495404317950.gal -t CGAL -LTL /tmp/LTL16958347531389134223.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G("(Node56requestsent75<=Node3GiveAnswer13)"))||(G("(Node67GiveAnswer80>Node30requestsent66)")))))
Formula 0 simplified : !F(G"(Node56requestsent75<=Node3GiveAnswer13)" | G"(Node67GiveAnswer80>Node30requestsent66)")
Detected timeout of ITS tools.
[2021-05-17 14:49:11] [INFO ] Flatten gal took : 471 ms
[2021-05-17 14:49:11] [INFO ] Applying decomposition
[2021-05-17 14:49:11] [INFO ] Flatten gal took : 464 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/graph9123339697769087474.txt, -o, /tmp/graph9123339697769087474.bin, -w, /tmp/graph9123339697769087474.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/graph9123339697769087474.bin, -l, -1, -v, -w, /tmp/graph9123339697769087474.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 14:49:14] [INFO ] Decomposing Gal with order
[2021-05-17 14:49:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 14:49:17] [INFO ] Removed a total of 16011 redundant transitions.
[2021-05-17 14:49:17] [INFO ] Flatten gal took : 2667 ms
[2021-05-17 14:49:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 15840 labels/synchronizations in 2763 ms.
[2021-05-17 14:49:21] [INFO ] Time to serialize gal into /tmp/LTL3031494364769664289.gal : 45 ms
[2021-05-17 14:49:21] [INFO ] Time to serialize properties into /tmp/LTL6862199699326777649.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/LTL3031494364769664289.gal, -t, CGAL, -LTL, /tmp/LTL6862199699326777649.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/LTL3031494364769664289.gal -t CGAL -LTL /tmp/LTL6862199699326777649.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G("(gu92.Node56requestsent75<=gu92.Node3GiveAnswer13)"))||(G("(gu93.Node67GiveAnswer80>gu93.Node30requestsent66)")))))
Formula 0 simplified : !F(G"(gu92.Node56requestsent75<=gu92.Node3GiveAnswer13)" | G"(gu93.Node67GiveAnswer80>gu93.Node30requestsent66)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5823212082759930163
[2021-05-17 14:49:36] [INFO ] Built C files in 149ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5823212082759930163
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/ltsmin5823212082759930163]
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/ltsmin5823212082759930163] 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/ltsmin5823212082759930163] 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-090-14 finished in 66039 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15802734849473057347
[2021-05-17 14:49:37] [INFO ] Too many transitions (17328) to apply POR reductions. Disabling POR matrices.
[2021-05-17 14:49:38] [INFO ] Applying decomposition
[2021-05-17 14:49:38] [INFO ] Built C files in 239ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15802734849473057347
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/ltsmin15802734849473057347]
[2021-05-17 14:49:38] [INFO ] Flatten gal took : 735 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/graph7094956909135555061.txt, -o, /tmp/graph7094956909135555061.bin, -w, /tmp/graph7094956909135555061.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/graph7094956909135555061.bin, -l, -1, -v, -w, /tmp/graph7094956909135555061.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 14:49:44] [INFO ] Decomposing Gal with order
[2021-05-17 14:49:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 14:49:48] [INFO ] Removed a total of 16274 redundant transitions.
[2021-05-17 14:49:49] [INFO ] Flatten gal took : 2730 ms
[2021-05-17 14:49:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 15866 labels/synchronizations in 3171 ms.
[2021-05-17 14:49:56] [INFO ] Time to serialize gal into /tmp/LTLCardinality10258771445076348733.gal : 2452 ms
[2021-05-17 14:49:56] [INFO ] Time to serialize properties into /tmp/LTLCardinality8986030614936206411.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/LTLCardinality10258771445076348733.gal, -t, CGAL, -LTL, /tmp/LTLCardinality8986030614936206411.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/LTLCardinality10258771445076348733.gal -t CGAL -LTL /tmp/LTLCardinality8986030614936206411.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 2 LTL properties
Checking formula 0 : !((X(F(("(gu373.Node51requestsent26<=gu373.Node33requestsent84)")&&(X(F("(gu373.Node51requestsent26<=gu373.Node33requestsent84)")))))))
Formula 0 simplified : !XF("(gu373.Node51requestsent26<=gu373.Node33requestsent84)" & XF"(gu373.Node51requestsent26<=gu373.Node33requestsent84)")
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/ltsmin15802734849473057347] killed by timeout after 27 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/ltsmin15802734849473057347] killed by timeout after 27 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
ITS-tools command line returned an error code 137
[2021-05-17 14:59:29] [INFO ] Flatten gal took : 711 ms
[2021-05-17 14:59:30] [INFO ] Time to serialize gal into /tmp/LTLCardinality7190149212113930962.gal : 146 ms
[2021-05-17 14:59:30] [INFO ] Time to serialize properties into /tmp/LTLCardinality9141281044800772810.ltl : 11 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/LTLCardinality7190149212113930962.gal, -t, CGAL, -LTL, /tmp/LTLCardinality9141281044800772810.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/LTLCardinality7190149212113930962.gal -t CGAL -LTL /tmp/LTLCardinality9141281044800772810.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 2 LTL properties
Checking formula 0 : !((X(F(("(Node51requestsent26<=Node33requestsent84)")&&(X(F("(Node51requestsent26<=Node33requestsent84)")))))))
Formula 0 simplified : !XF("(Node51requestsent26<=Node33requestsent84)" & XF"(Node51requestsent26<=Node33requestsent84)")
Detected timeout of ITS tools.
[2021-05-17 15:22:42] [INFO ] Flatten gal took : 1032 ms
[2021-05-17 15:22:43] [INFO ] Input system was already deterministic with 17328 transitions.
[2021-05-17 15:22:44] [INFO ] Transformed 9386 places.
[2021-05-17 15:22:44] [INFO ] Transformed 17328 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
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 15:23:17] [INFO ] Time to serialize gal into /tmp/LTLCardinality17076896163583798881.gal : 39 ms
[2021-05-17 15:23:17] [INFO ] Time to serialize properties into /tmp/LTLCardinality17059161206806451175.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/LTLCardinality17076896163583798881.gal, -t, CGAL, -LTL, /tmp/LTLCardinality17059161206806451175.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/LTLCardinality17076896163583798881.gal -t CGAL -LTL /tmp/LTLCardinality17059161206806451175.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 : !((X(F(("(Node51requestsent26<=Node33requestsent84)")&&(X(F("(Node51requestsent26<=Node33requestsent84)")))))))
Formula 0 simplified : !XF("(Node51requestsent26<=Node33requestsent84)" & XF"(Node51requestsent26<=Node33requestsent84)")

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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -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-090"
export BK_EXAMINATION="LTLCardinality"
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-090, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r292-tall-162124155900076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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