Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r037-tajo-167813690700667.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is CANConstruction-PT-070, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690700667
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.8M
-rw-r--r-- 1 mcc users 11K Feb 25 22:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 22:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 25 21:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 21:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 22:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 25 22:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 22:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 22:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 7.3M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678370245890

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-070
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-09 13:57:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 13:57:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 13:57:27] [INFO ] Load time of PNML (sax parser for PT used): 354 ms
[2023-03-09 13:57:27] [INFO ] Transformed 10642 places.
[2023-03-09 13:57:27] [INFO ] Transformed 20160 transitions.
[2023-03-09 13:57:27] [INFO ] Parsed PT model containing 10642 places and 20160 transitions and 60200 arcs in 508 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CANConstruction-PT-070-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-070-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 64 out of 10642 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10642/10642 places, 20160/20160 transitions.
Discarding 4734 places :
Symmetric choice reduction at 0 with 4734 rule applications. Total rules 4734 place count 5908 transition count 10692
Iterating global reduction 0 with 4734 rules applied. Total rules applied 9468 place count 5908 transition count 10692
Applied a total of 9468 rules in 2714 ms. Remains 5908 /10642 variables (removed 4734) and now considering 10692/20160 (removed 9468) transitions.
// Phase 1: matrix 10692 rows 5908 cols
[2023-03-09 13:57:31] [INFO ] Computed 141 place invariants in 159 ms
[2023-03-09 13:57:32] [INFO ] Implicit Places using invariants in 1167 ms returned []
Implicit Place search using SMT only with invariants took 1197 ms to find 0 implicit places.
[2023-03-09 13:57:32] [INFO ] Invariant cache hit.
[2023-03-09 13:57:33] [INFO ] Dead Transitions using invariants and state equation in 857 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5908/10642 places, 10692/20160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4772 ms. Remains : 5908/10642 places, 10692/20160 transitions.
Support contains 64 out of 5908 places after structural reductions.
[2023-03-09 13:57:33] [INFO ] Flatten gal took : 611 ms
[2023-03-09 13:57:34] [INFO ] Flatten gal took : 341 ms
[2023-03-09 13:57:34] [INFO ] Input system was already deterministic with 10692 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 722 ms. (steps per millisecond=13 ) properties (out of 36) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Running SMT prover for 31 properties.
[2023-03-09 13:57:35] [INFO ] Invariant cache hit.
[2023-03-09 13:57:39] [INFO ] After 3289ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:31
[2023-03-09 13:57:43] [INFO ] [Nat]Absence check using 71 positive place invariants in 186 ms returned sat
[2023-03-09 13:57:43] [INFO ] [Nat]Absence check using 71 positive and 70 generalized place invariants in 67 ms returned sat
[2023-03-09 13:57:54] [INFO ] After 9846ms SMT Verify possible using state equation in natural domain returned unsat :12 sat :19
[2023-03-09 13:57:55] [INFO ] State equation strengthened by 9730 read => feed constraints.
[2023-03-09 13:58:04] [INFO ] After 9300ms SMT Verify possible using 9730 Read/Feed constraints in natural domain returned unsat :12 sat :19
[2023-03-09 13:58:04] [INFO ] After 9301ms SMT Verify possible using trap constraints in natural domain returned unsat :12 sat :19
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-09 13:58:04] [INFO ] After 25106ms SMT Verify possible using all constraints in natural domain returned unsat :12 sat :19
Fused 31 Parikh solutions to 19 different solutions.
Parikh walk visited 8 properties in 306 ms.
Support contains 22 out of 5908 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5908/5908 places, 10692/10692 transitions.
Drop transitions removed 487 transitions
Trivial Post-agglo rules discarded 487 transitions
Performed 487 trivial Post agglomeration. Transition count delta: 487
Iterating post reduction 0 with 487 rules applied. Total rules applied 487 place count 5908 transition count 10205
Reduce places removed 487 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 488 rules applied. Total rules applied 975 place count 5421 transition count 10204
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 976 place count 5420 transition count 10204
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 976 place count 5420 transition count 10203
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 978 place count 5419 transition count 10203
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 993 place count 5404 transition count 10173
Iterating global reduction 3 with 15 rules applied. Total rules applied 1008 place count 5404 transition count 10173
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 2 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 138 rules applied. Total rules applied 1146 place count 5335 transition count 10104
Free-agglomeration rule applied 121 times.
Iterating global reduction 3 with 121 rules applied. Total rules applied 1267 place count 5335 transition count 9983
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 3 with 121 rules applied. Total rules applied 1388 place count 5214 transition count 9983
Partial Free-agglomeration rule applied 19 times.
Drop transitions removed 19 transitions
Iterating global reduction 4 with 19 rules applied. Total rules applied 1407 place count 5214 transition count 9983
Applied a total of 1407 rules in 5769 ms. Remains 5214 /5908 variables (removed 694) and now considering 9983/10692 (removed 709) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5772 ms. Remains : 5214/5908 places, 9983/10692 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 513 ms. (steps per millisecond=19 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 9983 rows 5214 cols
[2023-03-09 13:58:11] [INFO ] Computed 141 place invariants in 78 ms
[2023-03-09 13:58:12] [INFO ] [Real]Absence check using 71 positive place invariants in 148 ms returned sat
[2023-03-09 13:58:12] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 57 ms returned sat
[2023-03-09 13:58:12] [INFO ] After 1504ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-09 13:58:14] [INFO ] [Nat]Absence check using 71 positive place invariants in 142 ms returned sat
[2023-03-09 13:58:14] [INFO ] [Nat]Absence check using 71 positive and 70 generalized place invariants in 55 ms returned sat
[2023-03-09 13:58:20] [INFO ] After 5335ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-09 13:58:20] [INFO ] State equation strengthened by 9808 read => feed constraints.
[2023-03-09 13:58:24] [INFO ] After 3854ms SMT Verify possible using 9808 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-09 13:58:28] [INFO ] After 8011ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 2825 ms.
[2023-03-09 13:58:31] [INFO ] After 18458ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 6 properties in 22 ms.
Support contains 2 out of 5214 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5214/5214 places, 9983/9983 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 5213 transition count 9981
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 5213 transition count 9981
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 20 place count 5204 transition count 9972
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 5203 transition count 9972
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 5203 transition count 9971
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 24 place count 5202 transition count 9971
Applied a total of 24 rules in 5127 ms. Remains 5202 /5214 variables (removed 12) and now considering 9971/9983 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5127 ms. Remains : 5202/5214 places, 9971/9983 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 88556 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 88556 steps, saw 64227 distinct states, run finished after 3003 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 9971 rows 5202 cols
[2023-03-09 13:58:39] [INFO ] Computed 141 place invariants in 88 ms
[2023-03-09 13:58:40] [INFO ] After 685ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 13:58:41] [INFO ] [Nat]Absence check using 71 positive place invariants in 143 ms returned sat
[2023-03-09 13:58:41] [INFO ] [Nat]Absence check using 71 positive and 70 generalized place invariants in 54 ms returned sat
[2023-03-09 13:58:45] [INFO ] After 3683ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 13:58:45] [INFO ] State equation strengthened by 9818 read => feed constraints.
[2023-03-09 13:58:46] [INFO ] After 1237ms SMT Verify possible using 9818 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 13:58:46] [INFO ] After 1724ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 385 ms.
[2023-03-09 13:58:47] [INFO ] After 6840ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 9 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Parikh walk visited 1 properties in 4 ms.
FORMULA CANConstruction-PT-070-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 12 atomic propositions for a total of 13 simplifications.
FORMULA CANConstruction-PT-070-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-070-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-070-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-070-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 281 stabilizing places and 350 stable transitions
FORMULA CANConstruction-PT-070-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0&&F(p1))))'
Support contains 5 out of 5908 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5908/5908 places, 10692/10692 transitions.
Drop transitions removed 490 transitions
Trivial Post-agglo rules discarded 490 transitions
Performed 490 trivial Post agglomeration. Transition count delta: 490
Iterating post reduction 0 with 490 rules applied. Total rules applied 490 place count 5908 transition count 10202
Reduce places removed 490 places and 0 transitions.
Iterating post reduction 1 with 490 rules applied. Total rules applied 980 place count 5418 transition count 10202
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 1005 place count 5393 transition count 10152
Iterating global reduction 2 with 25 rules applied. Total rules applied 1030 place count 5393 transition count 10152
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 2 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 1170 place count 5323 transition count 10082
Applied a total of 1170 rules in 3479 ms. Remains 5323 /5908 variables (removed 585) and now considering 10082/10692 (removed 610) transitions.
// Phase 1: matrix 10082 rows 5323 cols
[2023-03-09 13:58:51] [INFO ] Computed 141 place invariants in 96 ms
[2023-03-09 13:58:54] [INFO ] Implicit Places using invariants in 3625 ms returned []
Implicit Place search using SMT only with invariants took 3639 ms to find 0 implicit places.
[2023-03-09 13:58:54] [INFO ] Invariant cache hit.
[2023-03-09 13:58:59] [INFO ] Dead Transitions using invariants and state equation in 4952 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5323/5908 places, 10082/10692 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12073 ms. Remains : 5323/5908 places, 10082/10692 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : CANConstruction-PT-070-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s1786 s1515), p1:(AND (LEQ 1 s5221) (LEQ s2760 s3656))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 654 steps with 0 reset in 22 ms.
FORMULA CANConstruction-PT-070-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-070-LTLCardinality-02 finished in 12333 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 3 out of 5908 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5908/5908 places, 10692/10692 transitions.
Drop transitions removed 488 transitions
Trivial Post-agglo rules discarded 488 transitions
Performed 488 trivial Post agglomeration. Transition count delta: 488
Iterating post reduction 0 with 488 rules applied. Total rules applied 488 place count 5908 transition count 10204
Reduce places removed 488 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 489 rules applied. Total rules applied 977 place count 5420 transition count 10203
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 978 place count 5419 transition count 10203
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1002 place count 5395 transition count 10155
Iterating global reduction 3 with 24 rules applied. Total rules applied 1026 place count 5395 transition count 10155
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 2 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 1166 place count 5325 transition count 10085
Applied a total of 1166 rules in 3302 ms. Remains 5325 /5908 variables (removed 583) and now considering 10085/10692 (removed 607) transitions.
// Phase 1: matrix 10085 rows 5325 cols
[2023-03-09 13:59:03] [INFO ] Computed 141 place invariants in 82 ms
[2023-03-09 13:59:06] [INFO ] Implicit Places using invariants in 3428 ms returned []
Implicit Place search using SMT only with invariants took 3429 ms to find 0 implicit places.
[2023-03-09 13:59:06] [INFO ] Invariant cache hit.
[2023-03-09 13:59:11] [INFO ] Dead Transitions using invariants and state equation in 4954 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5325/5908 places, 10085/10692 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11691 ms. Remains : 5325/5908 places, 10085/10692 transitions.
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-070-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(LEQ s3332 s387), p0:(LEQ 1 s1280)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 160 reset in 1719 ms.
Product exploration explored 100000 steps with 163 reset in 1567 ms.
Computed a total of 213 stabilizing places and 211 stable transitions
Computed a total of 213 stabilizing places and 211 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 157 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 16 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 105411 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 105411 steps, saw 84723 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-09 13:59:18] [INFO ] Invariant cache hit.
[2023-03-09 13:59:19] [INFO ] After 629ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 13:59:20] [INFO ] [Nat]Absence check using 71 positive place invariants in 119 ms returned sat
[2023-03-09 13:59:20] [INFO ] [Nat]Absence check using 71 positive and 70 generalized place invariants in 62 ms returned sat
[2023-03-09 13:59:24] [INFO ] After 3876ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 13:59:24] [INFO ] State equation strengthened by 9800 read => feed constraints.
[2023-03-09 13:59:26] [INFO ] After 1643ms SMT Verify possible using 9800 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 13:59:27] [INFO ] After 2972ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 883 ms.
[2023-03-09 13:59:28] [INFO ] After 9011ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 26 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=8 )
Parikh walk visited 2 properties in 5 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 242 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Support contains 3 out of 5325 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5325/5325 places, 10085/10085 transitions.
Applied a total of 0 rules in 1271 ms. Remains 5325 /5325 variables (removed 0) and now considering 10085/10085 (removed 0) transitions.
[2023-03-09 13:59:29] [INFO ] Invariant cache hit.
[2023-03-09 13:59:33] [INFO ] Implicit Places using invariants in 3377 ms returned []
Implicit Place search using SMT only with invariants took 3379 ms to find 0 implicit places.
[2023-03-09 13:59:33] [INFO ] Invariant cache hit.
[2023-03-09 13:59:38] [INFO ] Dead Transitions using invariants and state equation in 5069 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9722 ms. Remains : 5325/5325 places, 10085/10085 transitions.
Computed a total of 213 stabilizing places and 211 stable transitions
Computed a total of 213 stabilizing places and 211 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 532 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 16 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 13:59:39] [INFO ] Invariant cache hit.
[2023-03-09 13:59:39] [INFO ] After 655ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 13:59:40] [INFO ] [Nat]Absence check using 71 positive place invariants in 120 ms returned sat
[2023-03-09 13:59:40] [INFO ] [Nat]Absence check using 71 positive and 70 generalized place invariants in 50 ms returned sat
[2023-03-09 13:59:44] [INFO ] After 3621ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 13:59:44] [INFO ] State equation strengthened by 9800 read => feed constraints.
[2023-03-09 13:59:45] [INFO ] After 1055ms SMT Verify possible using 9800 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 13:59:46] [INFO ] After 1636ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 365 ms.
[2023-03-09 13:59:46] [INFO ] After 6582ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 8 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=2 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 273 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 164 reset in 1585 ms.
Product exploration explored 100000 steps with 161 reset in 1543 ms.
Built C files in :
/tmp/ltsmin14917228900809811433
[2023-03-09 13:59:50] [INFO ] Too many transitions (10085) to apply POR reductions. Disabling POR matrices.
[2023-03-09 13:59:50] [INFO ] Built C files in 166ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14917228900809811433
Running compilation step : cd /tmp/ltsmin14917228900809811433;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14917228900809811433;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14917228900809811433;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 5325 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5325/5325 places, 10085/10085 transitions.
Applied a total of 0 rules in 1320 ms. Remains 5325 /5325 variables (removed 0) and now considering 10085/10085 (removed 0) transitions.
[2023-03-09 13:59:54] [INFO ] Invariant cache hit.
[2023-03-09 13:59:58] [INFO ] Implicit Places using invariants in 3534 ms returned []
Implicit Place search using SMT only with invariants took 3535 ms to find 0 implicit places.
[2023-03-09 13:59:58] [INFO ] Invariant cache hit.
[2023-03-09 14:00:03] [INFO ] Dead Transitions using invariants and state equation in 4987 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9844 ms. Remains : 5325/5325 places, 10085/10085 transitions.
Built C files in :
/tmp/ltsmin5366724073412858574
[2023-03-09 14:00:03] [INFO ] Too many transitions (10085) to apply POR reductions. Disabling POR matrices.
[2023-03-09 14:00:03] [INFO ] Built C files in 86ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5366724073412858574
Running compilation step : cd /tmp/ltsmin5366724073412858574;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5366724073412858574;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5366724073412858574;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-09 14:00:06] [INFO ] Flatten gal took : 316 ms
[2023-03-09 14:00:07] [INFO ] Flatten gal took : 224 ms
[2023-03-09 14:00:07] [INFO ] Time to serialize gal into /tmp/LTL17550492470166510552.gal : 74 ms
[2023-03-09 14:00:07] [INFO ] Time to serialize properties into /tmp/LTL8502943666129910258.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17550492470166510552.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7849864630666899203.hoa' '-atoms' '/tmp/LTL8502943666129910258.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8502943666129910258.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7849864630666899203.hoa
Detected timeout of ITS tools.
[2023-03-09 14:00:22] [INFO ] Flatten gal took : 295 ms
[2023-03-09 14:00:23] [INFO ] Flatten gal took : 265 ms
[2023-03-09 14:00:23] [INFO ] Time to serialize gal into /tmp/LTL2618849390467268698.gal : 44 ms
[2023-03-09 14:00:23] [INFO ] Time to serialize properties into /tmp/LTL16759813083879845772.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2618849390467268698.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16759813083879845772.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(("(Node11GiveAnswer28>=1)")||(G("(Node41GiveAnswer8<=Node64DHTinfo)")))))
Formula 0 simplified : G(!"(Node11GiveAnswer28>=1)" & F!"(Node41GiveAnswer8<=Node64DHTinfo)")
Detected timeout of ITS tools.
[2023-03-09 14:00:38] [INFO ] Flatten gal took : 271 ms
[2023-03-09 14:00:38] [INFO ] Applying decomposition
[2023-03-09 14:00:38] [INFO ] Flatten gal took : 254 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9946399487270460826.txt' '-o' '/tmp/graph9946399487270460826.bin' '-w' '/tmp/graph9946399487270460826.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9946399487270460826.bin' '-l' '-1' '-v' '-w' '/tmp/graph9946399487270460826.weights' '-q' '0' '-e' '0.001'
[2023-03-09 14:00:39] [INFO ] Decomposing Gal with order
[2023-03-09 14:00:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 14:00:40] [INFO ] Removed a total of 9647 redundant transitions.
[2023-03-09 14:00:41] [INFO ] Flatten gal took : 1800 ms
[2023-03-09 14:00:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 9522 labels/synchronizations in 896 ms.
[2023-03-09 14:00:43] [INFO ] Time to serialize gal into /tmp/LTL13403161051019547288.gal : 184 ms
[2023-03-09 14:00:43] [INFO ] Time to serialize properties into /tmp/LTL18438182841895048398.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13403161051019547288.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18438182841895048398.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(("(gi0.gu72.Node11GiveAnswer28>=1)")||(G("(gu73.Node41GiveAnswer8<=gu73.Node64DHTinfo)")))))
Formula 0 simplified : G(!"(gi0.gu72.Node11GiveAnswer28>=1)" & F!"(gu73.Node41GiveAnswer8<=gu73.Node64DHTinfo)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18446203624515727334
[2023-03-09 14:00:58] [INFO ] Built C files in 107ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18446203624515727334
Running compilation step : cd /tmp/ltsmin18446203624515727334;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18446203624515727334;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18446203624515727334;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANConstruction-PT-070-LTLCardinality-03 finished in 121733 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(G(p1)))))'
Support contains 3 out of 5908 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5908/5908 places, 10692/10692 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 5883 transition count 10642
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 5883 transition count 10642
Applied a total of 50 rules in 2534 ms. Remains 5883 /5908 variables (removed 25) and now considering 10642/10692 (removed 50) transitions.
// Phase 1: matrix 10642 rows 5883 cols
[2023-03-09 14:01:04] [INFO ] Computed 141 place invariants in 93 ms
[2023-03-09 14:01:07] [INFO ] Implicit Places using invariants in 3613 ms returned []
Implicit Place search using SMT only with invariants took 3614 ms to find 0 implicit places.
[2023-03-09 14:01:07] [INFO ] Invariant cache hit.
[2023-03-09 14:01:13] [INFO ] Dead Transitions using invariants and state equation in 5785 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5883/5908 places, 10642/10692 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11935 ms. Remains : 5883/5908 places, 10642/10692 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : CANConstruction-PT-070-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (LEQ s1361 s3733) (LEQ 1 s3684)), p0:(LEQ s1361 s3733)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 18143 steps with 14 reset in 214 ms.
FORMULA CANConstruction-PT-070-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-070-LTLCardinality-05 finished in 12275 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 5908 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5908/5908 places, 10692/10692 transitions.
Drop transitions removed 490 transitions
Trivial Post-agglo rules discarded 490 transitions
Performed 490 trivial Post agglomeration. Transition count delta: 490
Iterating post reduction 0 with 490 rules applied. Total rules applied 490 place count 5908 transition count 10202
Reduce places removed 490 places and 0 transitions.
Iterating post reduction 1 with 490 rules applied. Total rules applied 980 place count 5418 transition count 10202
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 1006 place count 5392 transition count 10150
Iterating global reduction 2 with 26 rules applied. Total rules applied 1032 place count 5392 transition count 10150
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 2 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 1172 place count 5322 transition count 10080
Applied a total of 1172 rules in 3384 ms. Remains 5322 /5908 variables (removed 586) and now considering 10080/10692 (removed 612) transitions.
// Phase 1: matrix 10080 rows 5322 cols
[2023-03-09 14:01:17] [INFO ] Computed 141 place invariants in 83 ms
[2023-03-09 14:01:20] [INFO ] Implicit Places using invariants in 3573 ms returned []
Implicit Place search using SMT only with invariants took 3574 ms to find 0 implicit places.
[2023-03-09 14:01:20] [INFO ] Invariant cache hit.
[2023-03-09 14:01:26] [INFO ] Dead Transitions using invariants and state equation in 5824 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5322/5908 places, 10080/10692 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12784 ms. Remains : 5322/5908 places, 10080/10692 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-070-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s1430 s2332)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 164 reset in 1465 ms.
Product exploration explored 100000 steps with 161 reset in 1522 ms.
Computed a total of 212 stabilizing places and 210 stable transitions
Computed a total of 212 stabilizing places and 210 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 16 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 175428 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 175428 steps, saw 149464 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 14:01:33] [INFO ] Invariant cache hit.
[2023-03-09 14:01:33] [INFO ] After 506ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:01:34] [INFO ] [Nat]Absence check using 71 positive place invariants in 91 ms returned sat
[2023-03-09 14:01:34] [INFO ] [Nat]Absence check using 71 positive and 70 generalized place invariants in 44 ms returned sat
[2023-03-09 14:01:37] [INFO ] After 3564ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:01:38] [INFO ] State equation strengthened by 9800 read => feed constraints.
[2023-03-09 14:01:39] [INFO ] After 1056ms SMT Verify possible using 9800 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:01:39] [INFO ] After 1581ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 326 ms.
[2023-03-09 14:01:40] [INFO ] After 6251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 17 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=8 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 5322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5322/5322 places, 10080/10080 transitions.
Applied a total of 0 rules in 1196 ms. Remains 5322 /5322 variables (removed 0) and now considering 10080/10080 (removed 0) transitions.
[2023-03-09 14:01:41] [INFO ] Invariant cache hit.
[2023-03-09 14:01:47] [INFO ] Implicit Places using invariants in 6290 ms returned []
Implicit Place search using SMT only with invariants took 6292 ms to find 0 implicit places.
[2023-03-09 14:01:47] [INFO ] Invariant cache hit.
[2023-03-09 14:01:53] [INFO ] Dead Transitions using invariants and state equation in 5773 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13262 ms. Remains : 5322/5322 places, 10080/10080 transitions.
Computed a total of 212 stabilizing places and 210 stable transitions
Computed a total of 212 stabilizing places and 210 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 194412 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 194412 steps, saw 167920 distinct states, run finished after 3002 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 14:01:56] [INFO ] Invariant cache hit.
[2023-03-09 14:01:57] [INFO ] After 557ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:01:58] [INFO ] [Nat]Absence check using 71 positive place invariants in 127 ms returned sat
[2023-03-09 14:01:58] [INFO ] [Nat]Absence check using 71 positive and 70 generalized place invariants in 91 ms returned sat
[2023-03-09 14:02:01] [INFO ] After 3730ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:02:02] [INFO ] State equation strengthened by 9800 read => feed constraints.
[2023-03-09 14:02:02] [INFO ] After 881ms SMT Verify possible using 9800 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:02:03] [INFO ] After 1313ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 298 ms.
[2023-03-09 14:02:03] [INFO ] After 6202ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 17 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=8 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 160 reset in 1641 ms.
Product exploration explored 100000 steps with 165 reset in 1562 ms.
Built C files in :
/tmp/ltsmin1593767909504478569
[2023-03-09 14:02:07] [INFO ] Too many transitions (10080) to apply POR reductions. Disabling POR matrices.
[2023-03-09 14:02:07] [INFO ] Built C files in 123ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1593767909504478569
Running compilation step : cd /tmp/ltsmin1593767909504478569;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1593767909504478569;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1593767909504478569;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 5322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5322/5322 places, 10080/10080 transitions.
Applied a total of 0 rules in 1403 ms. Remains 5322 /5322 variables (removed 0) and now considering 10080/10080 (removed 0) transitions.
[2023-03-09 14:02:11] [INFO ] Invariant cache hit.
[2023-03-09 14:02:17] [INFO ] Implicit Places using invariants in 6091 ms returned []
Implicit Place search using SMT only with invariants took 6091 ms to find 0 implicit places.
[2023-03-09 14:02:17] [INFO ] Invariant cache hit.
[2023-03-09 14:02:23] [INFO ] Dead Transitions using invariants and state equation in 5847 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13342 ms. Remains : 5322/5322 places, 10080/10080 transitions.
Built C files in :
/tmp/ltsmin14131760699758333076
[2023-03-09 14:02:23] [INFO ] Too many transitions (10080) to apply POR reductions. Disabling POR matrices.
[2023-03-09 14:02:23] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14131760699758333076
Running compilation step : cd /tmp/ltsmin14131760699758333076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14131760699758333076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14131760699758333076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-09 14:02:27] [INFO ] Flatten gal took : 479 ms
[2023-03-09 14:02:27] [INFO ] Flatten gal took : 269 ms
[2023-03-09 14:02:27] [INFO ] Time to serialize gal into /tmp/LTL11961058848951067089.gal : 52 ms
[2023-03-09 14:02:27] [INFO ] Time to serialize properties into /tmp/LTL12860275140739615326.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11961058848951067089.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18090744963415467801.hoa' '-atoms' '/tmp/LTL12860275140739615326.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL12860275140739615326.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18090744963415467801.hoa
Detected timeout of ITS tools.
[2023-03-09 14:02:43] [INFO ] Flatten gal took : 220 ms
[2023-03-09 14:02:43] [INFO ] Flatten gal took : 197 ms
[2023-03-09 14:02:43] [INFO ] Time to serialize gal into /tmp/LTL4313212147744888045.gal : 29 ms
[2023-03-09 14:02:43] [INFO ] Time to serialize properties into /tmp/LTL14645471697828451686.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4313212147744888045.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14645471697828451686.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(Node13requestsent42<=Node26requestsent47)"))))
Formula 0 simplified : FG!"(Node13requestsent42<=Node26requestsent47)"
Detected timeout of ITS tools.
[2023-03-09 14:02:58] [INFO ] Flatten gal took : 291 ms
[2023-03-09 14:02:58] [INFO ] Applying decomposition
[2023-03-09 14:02:59] [INFO ] Flatten gal took : 286 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph11109397360037498423.txt' '-o' '/tmp/graph11109397360037498423.bin' '-w' '/tmp/graph11109397360037498423.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11109397360037498423.bin' '-l' '-1' '-v' '-w' '/tmp/graph11109397360037498423.weights' '-q' '0' '-e' '0.001'
[2023-03-09 14:02:59] [INFO ] Decomposing Gal with order
[2023-03-09 14:02:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 14:03:00] [INFO ] Removed a total of 9640 redundant transitions.
[2023-03-09 14:03:00] [INFO ] Flatten gal took : 960 ms
[2023-03-09 14:03:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 9516 labels/synchronizations in 931 ms.
[2023-03-09 14:03:02] [INFO ] Time to serialize gal into /tmp/LTL599997900147113502.gal : 37 ms
[2023-03-09 14:03:02] [INFO ] Time to serialize properties into /tmp/LTL7166452615103322024.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL599997900147113502.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7166452615103322024.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((G(F("(gu71.Node13requestsent42<=gu71.Node26requestsent47)"))))
Formula 0 simplified : FG!"(gu71.Node13requestsent42<=gu71.Node26requestsent47)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13844615769925766915
[2023-03-09 14:03:17] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13844615769925766915
Running compilation step : cd /tmp/ltsmin13844615769925766915;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13844615769925766915;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13844615769925766915;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANConstruction-PT-070-LTLCardinality-06 finished in 126409 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 5908 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5908/5908 places, 10692/10692 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 5884 transition count 10644
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 5884 transition count 10644
Applied a total of 48 rules in 2700 ms. Remains 5884 /5908 variables (removed 24) and now considering 10644/10692 (removed 48) transitions.
// Phase 1: matrix 10644 rows 5884 cols
[2023-03-09 14:03:23] [INFO ] Computed 141 place invariants in 93 ms
[2023-03-09 14:03:26] [INFO ] Implicit Places using invariants in 3752 ms returned []
Implicit Place search using SMT only with invariants took 3753 ms to find 0 implicit places.
[2023-03-09 14:03:26] [INFO ] Invariant cache hit.
[2023-03-09 14:03:32] [INFO ] Dead Transitions using invariants and state equation in 5530 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5884/5908 places, 10644/10692 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11984 ms. Remains : 5884/5908 places, 10644/10692 transitions.
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : CANConstruction-PT-070-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s5109 s1330)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 3278 ms.
Product exploration explored 100000 steps with 50000 reset in 3291 ms.
Computed a total of 281 stabilizing places and 350 stable transitions
Computed a total of 281 stabilizing places and 350 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-070-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-070-LTLCardinality-11 finished in 18906 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 4 out of 5908 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5908/5908 places, 10692/10692 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 5884 transition count 10644
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 5884 transition count 10644
Applied a total of 48 rules in 2544 ms. Remains 5884 /5908 variables (removed 24) and now considering 10644/10692 (removed 48) transitions.
// Phase 1: matrix 10644 rows 5884 cols
[2023-03-09 14:03:41] [INFO ] Computed 141 place invariants in 93 ms
[2023-03-09 14:03:45] [INFO ] Implicit Places using invariants in 3724 ms returned []
Implicit Place search using SMT only with invariants took 3724 ms to find 0 implicit places.
[2023-03-09 14:03:45] [INFO ] Invariant cache hit.
[2023-03-09 14:03:50] [INFO ] Dead Transitions using invariants and state equation in 5293 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5884/5908 places, 10644/10692 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11562 ms. Remains : 5884/5908 places, 10644/10692 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : CANConstruction-PT-070-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ s1519 s1770), p0:(LEQ s4744 s3479)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 3135 ms.
Product exploration explored 100000 steps with 50000 reset in 3000 ms.
Computed a total of 281 stabilizing places and 350 stable transitions
Computed a total of 281 stabilizing places and 350 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 6 factoid took 155 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-070-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-070-LTLCardinality-12 finished in 17964 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&(F(p1) U p2)))))'
Support contains 6 out of 5908 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5908/5908 places, 10692/10692 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 5885 transition count 10646
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 5885 transition count 10646
Applied a total of 46 rules in 2453 ms. Remains 5885 /5908 variables (removed 23) and now considering 10646/10692 (removed 46) transitions.
// Phase 1: matrix 10646 rows 5885 cols
[2023-03-09 14:03:59] [INFO ] Computed 141 place invariants in 94 ms
[2023-03-09 14:04:03] [INFO ] Implicit Places using invariants in 3900 ms returned []
Implicit Place search using SMT only with invariants took 3901 ms to find 0 implicit places.
[2023-03-09 14:04:03] [INFO ] Invariant cache hit.
[2023-03-09 14:04:08] [INFO ] Dead Transitions using invariants and state equation in 5287 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5885/5908 places, 10646/10692 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11642 ms. Remains : 5885/5908 places, 10646/10692 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : CANConstruction-PT-070-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s1380 s4952), p2:(LEQ s2805 s5767), p1:(LEQ s3861 s167)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 3537 ms.
Product exploration explored 100000 steps with 50000 reset in 3303 ms.
Computed a total of 281 stabilizing places and 350 stable transitions
Computed a total of 281 stabilizing places and 350 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1)))))), (X (X p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 (NOT p2))))
Knowledge based reduction with 10 factoid took 191 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-070-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-070-LTLCardinality-13 finished in 18933 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||(p1&&G(p2)))))'
Support contains 6 out of 5908 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5908/5908 places, 10692/10692 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 5884 transition count 10644
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 5884 transition count 10644
Applied a total of 48 rules in 2604 ms. Remains 5884 /5908 variables (removed 24) and now considering 10644/10692 (removed 48) transitions.
// Phase 1: matrix 10644 rows 5884 cols
[2023-03-09 14:04:18] [INFO ] Computed 141 place invariants in 95 ms
[2023-03-09 14:04:22] [INFO ] Implicit Places using invariants in 4007 ms returned []
Implicit Place search using SMT only with invariants took 4008 ms to find 0 implicit places.
[2023-03-09 14:04:22] [INFO ] Invariant cache hit.
[2023-03-09 14:04:28] [INFO ] Dead Transitions using invariants and state equation in 5321 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5884/5908 places, 10644/10692 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11934 ms. Remains : 5884/5908 places, 10644/10692 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-070-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ s4227 s5618), p1:(GT 1 s3447), p2:(AND (LEQ 1 s107) (GT s5673 s4695))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 2058 ms.
Product exploration explored 100000 steps with 33333 reset in 2080 ms.
Computed a total of 281 stabilizing places and 350 stable transitions
Computed a total of 281 stabilizing places and 350 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p1 p2))), (X (OR (NOT p1) (NOT p2))), (X (X p0)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 6 factoid took 155 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-070-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-070-LTLCardinality-15 finished in 16461 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-09 14:04:33] [INFO ] Flatten gal took : 283 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5527293532895043913
[2023-03-09 14:04:33] [INFO ] Too many transitions (10692) to apply POR reductions. Disabling POR matrices.
[2023-03-09 14:04:33] [INFO ] Applying decomposition
[2023-03-09 14:04:33] [INFO ] Built C files in 129ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5527293532895043913
Running compilation step : cd /tmp/ltsmin5527293532895043913;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-09 14:04:33] [INFO ] Flatten gal took : 240 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph11869454577123327594.txt' '-o' '/tmp/graph11869454577123327594.bin' '-w' '/tmp/graph11869454577123327594.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11869454577123327594.bin' '-l' '-1' '-v' '-w' '/tmp/graph11869454577123327594.weights' '-q' '0' '-e' '0.001'
[2023-03-09 14:04:34] [INFO ] Decomposing Gal with order
[2023-03-09 14:04:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 14:04:35] [INFO ] Removed a total of 9864 redundant transitions.
[2023-03-09 14:04:35] [INFO ] Flatten gal took : 940 ms
[2023-03-09 14:04:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 9548 labels/synchronizations in 751 ms.
[2023-03-09 14:04:37] [INFO ] Time to serialize gal into /tmp/LTLCardinality15896570615866166592.gal : 617 ms
[2023-03-09 14:04:37] [INFO ] Time to serialize properties into /tmp/LTLCardinality2188590736498227005.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality15896570615866166592.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2188590736498227005.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !((F(("(gi0.gi23.gu296.Node11GiveAnswer28>=1)")||(G("(gu298.Node41GiveAnswer8<=gu298.Node64DHTinfo)")))))
Formula 0 simplified : G(!"(gi0.gi23.gu296.Node11GiveAnswer28>=1)" & F!"(gu298.Node41GiveAnswer8<=gu298.Node64DHTinfo)")
Compilation finished in 64549 ms.
Running link step : cd /tmp/ltsmin5527293532895043913;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 101 ms.
Running LTSmin : cd /tmp/ltsmin5527293532895043913;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(((LTLAPp0==true)||[]((LTLAPp1==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-09 14:27:00] [INFO ] Flatten gal took : 553 ms
[2023-03-09 14:27:00] [INFO ] Time to serialize gal into /tmp/LTLCardinality5263449299746811224.gal : 85 ms
[2023-03-09 14:27:00] [INFO ] Time to serialize properties into /tmp/LTLCardinality6556595325654336514.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5263449299746811224.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6556595325654336514.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 2 LTL properties
Checking formula 0 : !((F(("(Node11GiveAnswer28>=1)")||(G("(Node41GiveAnswer8<=Node64DHTinfo)")))))
Formula 0 simplified : G(!"(Node11GiveAnswer28>=1)" & F!"(Node41GiveAnswer8<=Node64DHTinfo)")
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin5527293532895043913;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(((LTLAPp0==true)||[]((LTLAPp1==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin5527293532895043913;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-09 14:49:24] [INFO ] Flatten gal took : 711 ms
[2023-03-09 14:49:24] [INFO ] Input system was already deterministic with 10692 transitions.
[2023-03-09 14:49:24] [INFO ] Transformed 5908 places.
[2023-03-09 14:49:25] [INFO ] Transformed 10692 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-09 14:49:58] [INFO ] Time to serialize gal into /tmp/LTLCardinality5680316251471937974.gal : 105 ms
[2023-03-09 14:49:58] [INFO ] Time to serialize properties into /tmp/LTLCardinality11599130265537090532.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5680316251471937974.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11599130265537090532.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(("(Node11GiveAnswer28>=1)")||(G("(Node41GiveAnswer8<=Node64DHTinfo)")))))
Formula 0 simplified : G(!"(Node11GiveAnswer28>=1)" & F!"(Node41GiveAnswer8<=Node64DHTinfo)")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 10166632 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16023800 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANConstruction-PT-070"
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-5348"
echo " Executing tool itstools"
echo " Input is CANConstruction-PT-070, 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 r037-tajo-167813690700667"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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