About the Execution of ITS-Tools for BridgeAndVehicles-COL-V50P50N10
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
8482.783 | 3600000.00 | 13893764.00 | 186.80 | FFFF?TFFFFTFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2021-input.r026-tajo-162038143400092.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BridgeAndVehicles-COL-V50P50N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143400092
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 83K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Mar 28 15:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 28 15:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 02:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 02:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Mar 22 11:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Mar 22 11:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 10 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 42K May 5 16:51 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 BridgeAndVehicles-COL-V50P50N10-00
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-01
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-02
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-03
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-04
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-05
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-06
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-07
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-08
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-09
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-10
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-11
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-12
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-13
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-14
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-15
=== Now, execution of the tool begins
BK_START 1620516501984
Running Version 0
[2021-05-08 23:28:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-08 23:28:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 23:28:23] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2021-05-08 23:28:23] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-08 23:28:24] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 509 ms
[2021-05-08 23:28:24] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 128 PT places and 114798.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
[2021-05-08 23:28:24] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions in 6 ms.
[2021-05-08 23:28:24] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_166539415031302755.dot
[2021-05-08 23:28:24] [INFO ] Initial state test concluded for 4 properties.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA BridgeAndVehicles-COL-V50P50N10-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N10-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N10-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N10-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 100000 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=649 ) properties (out of 20) seen :16
Running SMT prover for 4 properties.
// Phase 1: matrix 10 rows 12 cols
[2021-05-08 23:28:24] [INFO ] Computed 4 place invariants in 4 ms
[2021-05-08 23:28:24] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-08 23:28:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:28:24] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-08 23:28:24] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-08 23:28:24] [INFO ] Added : 1 causal constraints over 1 iterations in 24 ms. Result :sat
[2021-05-08 23:28:24] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
[2021-05-08 23:28:24] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-08 23:28:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:28:24] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-08 23:28:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:28:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-08 23:28:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:28:24] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2021-05-08 23:28:24] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-08 23:28:24] [INFO ] Added : 2 causal constraints over 1 iterations in 10 ms. Result :sat
[2021-05-08 23:28:24] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA BridgeAndVehicles-COL-V50P50N10-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-08 23:28:24] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-08 23:28:24] [INFO ] Flatten gal took : 17 ms
FORMULA BridgeAndVehicles-COL-V50P50N10-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N10-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-08 23:28:24] [INFO ] Flatten gal took : 2 ms
[2021-05-08 23:28:24] [INFO ] Unfolded HLPN to a Petri net with 128 places and 1328 transitions in 27 ms.
[2021-05-08 23:28:24] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_13440293802188625918.dot
[2021-05-08 23:28:24] [INFO ] Initial state test concluded for 1 properties.
Support contains 13 out of 128 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 128/128 places, 1328/1328 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 127 transition count 1328
Applied a total of 1 rules in 42 ms. Remains 127 /128 variables (removed 1) and now considering 1328/1328 (removed 0) transitions.
[2021-05-08 23:28:24] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 127 cols
[2021-05-08 23:28:24] [INFO ] Computed 6 place invariants in 19 ms
[2021-05-08 23:28:25] [INFO ] Dead Transitions using invariants and state equation in 576 ms returned []
[2021-05-08 23:28:25] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 127 cols
[2021-05-08 23:28:25] [INFO ] Computed 6 place invariants in 7 ms
[2021-05-08 23:28:25] [INFO ] Implicit Places using invariants in 198 ms returned []
[2021-05-08 23:28:25] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 127 cols
[2021-05-08 23:28:25] [INFO ] Computed 6 place invariants in 4 ms
[2021-05-08 23:28:25] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-08 23:28:25] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
[2021-05-08 23:28:25] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 127 cols
[2021-05-08 23:28:25] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-08 23:28:26] [INFO ] Dead Transitions using invariants and state equation in 427 ms returned []
Finished structural reductions, in 1 iterations. Remains : 127/128 places, 1328/1328 transitions.
[2021-05-08 23:28:26] [INFO ] Flatten gal took : 103 ms
[2021-05-08 23:28:26] [INFO ] Flatten gal took : 82 ms
[2021-05-08 23:28:26] [INFO ] Input system was already deterministic with 1328 transitions.
Incomplete random walk after 100000 steps, including 227 resets, run finished after 563 ms. (steps per millisecond=177 ) properties (out of 13) seen :12
Running SMT prover for 1 properties.
[2021-05-08 23:28:27] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 127 cols
[2021-05-08 23:28:27] [INFO ] Computed 6 place invariants in 6 ms
[2021-05-08 23:28:27] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-08 23:28:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 23:28:27] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2021-05-08 23:28:27] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-08 23:28:27] [INFO ] [Real]Added 22 Read/Feed constraints in 21 ms returned sat
[2021-05-08 23:28:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 23:28:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-08 23:28:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 23:28:27] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2021-05-08 23:28:27] [INFO ] [Nat]Added 22 Read/Feed constraints in 17 ms returned sat
[2021-05-08 23:28:27] [INFO ] Deduced a trap composed of 5 places in 252 ms of which 3 ms to minimize.
[2021-05-08 23:28:28] [INFO ] Deduced a trap composed of 6 places in 195 ms of which 1 ms to minimize.
[2021-05-08 23:28:28] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 1 ms to minimize.
[2021-05-08 23:28:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 608 ms
[2021-05-08 23:28:28] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 70 ms.
[2021-05-08 23:28:28] [INFO ] Added : 107 causal constraints over 24 iterations in 389 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(p0))&&(F(p1)||G(p2))))], workingDir=/home/mcc/execution]
Support contains 7 out of 127 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 127/127 places, 1328/1328 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 126 transition count 1328
Applied a total of 1 rules in 12 ms. Remains 126 /127 variables (removed 1) and now considering 1328/1328 (removed 0) transitions.
[2021-05-08 23:28:28] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2021-05-08 23:28:28] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-08 23:28:29] [INFO ] Dead Transitions using invariants and state equation in 334 ms returned []
[2021-05-08 23:28:29] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2021-05-08 23:28:29] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-08 23:28:29] [INFO ] Implicit Places using invariants in 139 ms returned []
[2021-05-08 23:28:29] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2021-05-08 23:28:29] [INFO ] Computed 5 place invariants in 7 ms
[2021-05-08 23:28:29] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-08 23:28:29] [INFO ] Implicit Places using invariants and state equation in 448 ms returned [53]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 592 ms to find 1 implicit places.
[2021-05-08 23:28:29] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 125 cols
[2021-05-08 23:28:29] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 23:28:30] [INFO ] Dead Transitions using invariants and state equation in 373 ms returned []
Starting structural reductions, iteration 1 : 125/127 places, 1328/1328 transitions.
Applied a total of 0 rules in 10 ms. Remains 125 /125 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2021-05-08 23:28:30] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 125 cols
[2021-05-08 23:28:30] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-08 23:28:30] [INFO ] Dead Transitions using invariants and state equation in 317 ms returned []
Finished structural reductions, in 2 iterations. Remains : 125/127 places, 1328/1328 transitions.
Stuttering acceptance computed with spot in 278 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-00 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 2}, { cond=(NOT p0), acceptance={0} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=1, aps=[p1:(GT (ADD s123 s124) (ADD s108 s109)), p0:(OR (GT (ADD s123 s124) (ADD s108 s109)) (GT 1 s106)), p2:(GT s0 s53)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 2 ms.
FORMULA BridgeAndVehicles-COL-V50P50N10-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N10-00 finished in 1969 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 127/127 places, 1328/1328 transitions.
Graph (complete) has 2749 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 177 ms. Remains 126 /127 variables (removed 1) and now considering 1328/1328 (removed 0) transitions.
[2021-05-08 23:28:30] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2021-05-08 23:28:30] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-08 23:28:31] [INFO ] Dead Transitions using invariants and state equation in 514 ms returned []
[2021-05-08 23:28:31] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2021-05-08 23:28:31] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-08 23:28:31] [INFO ] Implicit Places using invariants in 186 ms returned []
[2021-05-08 23:28:31] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2021-05-08 23:28:31] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 23:28:31] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-08 23:28:32] [INFO ] Implicit Places using invariants and state equation in 723 ms returned [53, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 916 ms to find 2 implicit places.
[2021-05-08 23:28:32] [INFO ] Redundant transitions in 99 ms returned []
[2021-05-08 23:28:32] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2021-05-08 23:28:32] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-08 23:28:32] [INFO ] Dead Transitions using invariants and state equation in 356 ms returned []
Starting structural reductions, iteration 1 : 124/127 places, 1328/1328 transitions.
Applied a total of 0 rules in 69 ms. Remains 124 /124 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2021-05-08 23:28:32] [INFO ] Redundant transitions in 21 ms returned []
[2021-05-08 23:28:32] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2021-05-08 23:28:32] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 23:28:33] [INFO ] Dead Transitions using invariants and state equation in 365 ms returned []
Finished structural reductions, in 2 iterations. Remains : 124/127 places, 1328/1328 transitions.
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-04 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(GT s0 s53)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 236 reset in 540 ms.
Product exploration explored 100000 steps with 236 reset in 421 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 33 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 236 reset in 385 ms.
Product exploration explored 100000 steps with 236 reset in 388 ms.
[2021-05-08 23:28:35] [INFO ] Flatten gal took : 53 ms
[2021-05-08 23:28:35] [INFO ] Flatten gal took : 46 ms
[2021-05-08 23:28:35] [INFO ] Time to serialize gal into /tmp/LTL2606590924162305457.gal : 11 ms
[2021-05-08 23:28:35] [INFO ] Time to serialize properties into /tmp/LTL3893288716235999613.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL2606590924162305457.gal, -t, CGAL, -LTL, /tmp/LTL3893288716235999613.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2606590924162305457.gal -t CGAL -LTL /tmp/LTL3893288716235999613.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G("(CAPACITE_0>SUR_PONT_A_0)")))
Formula 0 simplified : !G"(CAPACITE_0>SUR_PONT_A_0)"
Detected timeout of ITS tools.
[2021-05-08 23:28:50] [INFO ] Flatten gal took : 48 ms
[2021-05-08 23:28:50] [INFO ] Applying decomposition
[2021-05-08 23:28:50] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph4174417737607374968.txt, -o, /tmp/graph4174417737607374968.bin, -w, /tmp/graph4174417737607374968.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph4174417737607374968.bin, -l, -1, -v, -w, /tmp/graph4174417737607374968.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 23:28:50] [INFO ] Decomposing Gal with order
[2021-05-08 23:28:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 23:28:50] [INFO ] Removed a total of 1244 redundant transitions.
[2021-05-08 23:28:50] [INFO ] Flatten gal took : 327 ms
[2021-05-08 23:28:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 266 labels/synchronizations in 16 ms.
[2021-05-08 23:28:51] [INFO ] Time to serialize gal into /tmp/LTL16645142807125221104.gal : 4 ms
[2021-05-08 23:28:51] [INFO ] Time to serialize properties into /tmp/LTL10309251944853929558.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL16645142807125221104.gal, -t, CGAL, -LTL, /tmp/LTL10309251944853929558.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL16645142807125221104.gal -t CGAL -LTL /tmp/LTL10309251944853929558.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G("(gu1.CAPACITE_0>gu1.SUR_PONT_A_0)")))
Formula 0 simplified : !G"(gu1.CAPACITE_0>gu1.SUR_PONT_A_0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6674254570946792320
[2021-05-08 23:29:06] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6674254570946792320
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6674254570946792320]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6674254570946792320] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6674254570946792320] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property BridgeAndVehicles-COL-V50P50N10-04 finished in 36493 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||G(p1)||X(p2)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 127 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 127/127 places, 1328/1328 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 126 transition count 1328
Applied a total of 1 rules in 20 ms. Remains 126 /127 variables (removed 1) and now considering 1328/1328 (removed 0) transitions.
[2021-05-08 23:29:07] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2021-05-08 23:29:07] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 23:29:07] [INFO ] Dead Transitions using invariants and state equation in 471 ms returned []
[2021-05-08 23:29:07] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2021-05-08 23:29:07] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 23:29:07] [INFO ] Implicit Places using invariants in 219 ms returned []
[2021-05-08 23:29:07] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2021-05-08 23:29:07] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-08 23:29:08] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-08 23:29:08] [INFO ] Implicit Places using invariants and state equation in 631 ms returned [107]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 855 ms to find 1 implicit places.
[2021-05-08 23:29:08] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 125 cols
[2021-05-08 23:29:08] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 23:29:08] [INFO ] Dead Transitions using invariants and state equation in 375 ms returned []
Starting structural reductions, iteration 1 : 125/127 places, 1328/1328 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2021-05-08 23:29:08] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 125 cols
[2021-05-08 23:29:08] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-08 23:29:09] [INFO ] Dead Transitions using invariants and state equation in 368 ms returned []
Finished structural reductions, in 2 iterations. Remains : 125/127 places, 1328/1328 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(GT s52 s54), p1:(LEQ s53 (ADD s123 s124)), p2:(GT 3 s107)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 710 ms.
Product exploration explored 100000 steps with 50000 reset in 804 ms.
Knowledge obtained : [p0, p1, (NOT p2)]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 50000 reset in 630 ms.
Product exploration explored 100000 steps with 50000 reset in 517 ms.
Applying partial POR strategy [false, true, false]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 6 out of 125 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 125/125 places, 1328/1328 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 125 transition count 1328
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 47 ms. Remains 125 /125 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2021-05-08 23:29:12] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 125 cols
[2021-05-08 23:29:12] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 23:29:12] [INFO ] Dead Transitions using invariants and state equation in 342 ms returned []
[2021-05-08 23:29:12] [INFO ] Redundant transitions in 13 ms returned []
[2021-05-08 23:29:12] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 125 cols
[2021-05-08 23:29:13] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 23:29:13] [INFO ] Dead Transitions using invariants and state equation in 376 ms returned []
Finished structural reductions, in 1 iterations. Remains : 125/125 places, 1328/1328 transitions.
Product exploration explored 100000 steps with 50000 reset in 472 ms.
Product exploration explored 100000 steps with 50000 reset in 454 ms.
[2021-05-08 23:29:14] [INFO ] Flatten gal took : 44 ms
[2021-05-08 23:29:14] [INFO ] Flatten gal took : 41 ms
[2021-05-08 23:29:14] [INFO ] Time to serialize gal into /tmp/LTL2099695315749205669.gal : 8 ms
[2021-05-08 23:29:14] [INFO ] Time to serialize properties into /tmp/LTL11098597100695517118.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL2099695315749205669.gal, -t, CGAL, -LTL, /tmp/LTL11098597100695517118.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2099695315749205669.gal -t CGAL -LTL /tmp/LTL11098597100695517118.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((("(ROUTE_A_0>SUR_PONT_A_0)")||(G("(ATTENTE_A_0<=(VIDANGE_0+VIDANGE_1))")))||(X("(ROUTE_B_0<3)"))))))
Formula 0 simplified : !XF("(ROUTE_A_0>SUR_PONT_A_0)" | G"(ATTENTE_A_0<=(VIDANGE_0+VIDANGE_1))" | X"(ROUTE_B_0<3)")
Detected timeout of ITS tools.
[2021-05-08 23:29:29] [INFO ] Flatten gal took : 51 ms
[2021-05-08 23:29:29] [INFO ] Applying decomposition
[2021-05-08 23:29:29] [INFO ] Flatten gal took : 46 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph15964904534720589394.txt, -o, /tmp/graph15964904534720589394.bin, -w, /tmp/graph15964904534720589394.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph15964904534720589394.bin, -l, -1, -v, -w, /tmp/graph15964904534720589394.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 23:29:29] [INFO ] Decomposing Gal with order
[2021-05-08 23:29:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 23:29:30] [INFO ] Removed a total of 1298 redundant transitions.
[2021-05-08 23:29:30] [INFO ] Flatten gal took : 999 ms
[2021-05-08 23:29:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 1203 labels/synchronizations in 49 ms.
[2021-05-08 23:29:30] [INFO ] Time to serialize gal into /tmp/LTL16211910163801721989.gal : 8 ms
[2021-05-08 23:29:30] [INFO ] Time to serialize properties into /tmp/LTL4758253267758950319.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL16211910163801721989.gal, -t, CGAL, -LTL, /tmp/LTL4758253267758950319.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL16211910163801721989.gal -t CGAL -LTL /tmp/LTL4758253267758950319.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((("(gu1.ROUTE_A_0>gu1.SUR_PONT_A_0)")||(G("(gu2.ATTENTE_A_0<=(gu2.VIDANGE_0+gu2.VIDANGE_1))")))||(X("(gu0.ROUTE_B_0<3)"))))))
Formula 0 simplified : !XF("(gu1.ROUTE_A_0>gu1.SUR_PONT_A_0)" | G"(gu2.ATTENTE_A_0<=(gu2.VIDANGE_0+gu2.VIDANGE_1))" | X"(gu0.ROUTE_B_0<3)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12700257575786729377
[2021-05-08 23:29:45] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12700257575786729377
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12700257575786729377]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12700257575786729377] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12700257575786729377] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property BridgeAndVehicles-COL-V50P50N10-05 finished in 39758 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 127/127 places, 1328/1328 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 126 transition count 1328
Applied a total of 1 rules in 27 ms. Remains 126 /127 variables (removed 1) and now considering 1328/1328 (removed 0) transitions.
[2021-05-08 23:29:46] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2021-05-08 23:29:46] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-08 23:29:47] [INFO ] Dead Transitions using invariants and state equation in 599 ms returned []
[2021-05-08 23:29:47] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2021-05-08 23:29:47] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 23:29:47] [INFO ] Implicit Places using invariants in 245 ms returned []
[2021-05-08 23:29:47] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2021-05-08 23:29:47] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-08 23:29:47] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-08 23:29:48] [INFO ] Implicit Places using invariants and state equation in 874 ms returned [53, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1124 ms to find 2 implicit places.
[2021-05-08 23:29:48] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2021-05-08 23:29:48] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 23:29:49] [INFO ] Dead Transitions using invariants and state equation in 544 ms returned []
Starting structural reductions, iteration 1 : 124/127 places, 1328/1328 transitions.
Applied a total of 0 rules in 21 ms. Remains 124 /124 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2021-05-08 23:29:49] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2021-05-08 23:29:49] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 23:29:49] [INFO ] Dead Transitions using invariants and state equation in 426 ms returned []
Finished structural reductions, in 2 iterations. Remains : 124/127 places, 1328/1328 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 s53)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-COL-V50P50N10-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N10-06 finished in 2847 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 127/127 places, 1328/1328 transitions.
Graph (complete) has 2749 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 125 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 125 transition count 1327
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 123 transition count 1326
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 121 transition count 1324
Applied a total of 10 rules in 298 ms. Remains 121 /127 variables (removed 6) and now considering 1324/1328 (removed 4) transitions.
[2021-05-08 23:29:50] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
// Phase 1: matrix 246 rows 121 cols
[2021-05-08 23:29:50] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-08 23:29:50] [INFO ] Implicit Places using invariants in 160 ms returned []
[2021-05-08 23:29:50] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
// Phase 1: matrix 246 rows 121 cols
[2021-05-08 23:29:50] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-08 23:29:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-08 23:29:50] [INFO ] Implicit Places using invariants and state equation in 557 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 719 ms to find 1 implicit places.
[2021-05-08 23:29:50] [INFO ] Redundant transitions in 35 ms returned []
[2021-05-08 23:29:50] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
// Phase 1: matrix 246 rows 120 cols
[2021-05-08 23:29:50] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-08 23:29:51] [INFO ] Dead Transitions using invariants and state equation in 364 ms returned []
Starting structural reductions, iteration 1 : 120/127 places, 1324/1328 transitions.
Applied a total of 0 rules in 69 ms. Remains 120 /120 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2021-05-08 23:29:51] [INFO ] Redundant transitions in 14 ms returned []
[2021-05-08 23:29:51] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
// Phase 1: matrix 246 rows 120 cols
[2021-05-08 23:29:51] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-08 23:29:51] [INFO ] Dead Transitions using invariants and state equation in 313 ms returned []
Finished structural reductions, in 2 iterations. Remains : 120/127 places, 1324/1328 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 s103)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 314 steps with 0 reset in 2 ms.
FORMULA BridgeAndVehicles-COL-V50P50N10-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N10-07 finished in 1899 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 127/127 places, 1328/1328 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 126 transition count 1328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 125 transition count 1327
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 125 transition count 1327
Applied a total of 3 rules in 48 ms. Remains 125 /127 variables (removed 2) and now considering 1327/1328 (removed 1) transitions.
[2021-05-08 23:29:51] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2021-05-08 23:29:51] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-08 23:29:52] [INFO ] Dead Transitions using invariants and state equation in 352 ms returned []
[2021-05-08 23:29:52] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2021-05-08 23:29:52] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 23:29:52] [INFO ] Implicit Places using invariants in 234 ms returned []
[2021-05-08 23:29:52] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2021-05-08 23:29:52] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 23:29:52] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-08 23:29:53] [INFO ] Implicit Places using invariants and state equation in 698 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 936 ms to find 2 implicit places.
[2021-05-08 23:29:53] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2021-05-08 23:29:53] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-08 23:29:53] [INFO ] Dead Transitions using invariants and state equation in 422 ms returned []
Starting structural reductions, iteration 1 : 123/127 places, 1327/1328 transitions.
Applied a total of 0 rules in 15 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2021-05-08 23:29:53] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2021-05-08 23:29:53] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 23:29:53] [INFO ] Dead Transitions using invariants and state equation in 433 ms returned []
Finished structural reductions, in 2 iterations. Remains : 123/127 places, 1327/1328 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 (ADD s108 s109))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 27763 reset in 463 ms.
Product exploration explored 100000 steps with 27902 reset in 635 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 27830 reset in 513 ms.
Product exploration explored 100000 steps with 27902 reset in 546 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 123 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 123/123 places, 1327/1327 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 123 transition count 1327
Deduced a syphon composed of 1 places in 2 ms
Applied a total of 1 rules in 139 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2021-05-08 23:29:56] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2021-05-08 23:29:56] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 23:29:57] [INFO ] Dead Transitions using invariants and state equation in 492 ms returned []
[2021-05-08 23:29:57] [INFO ] Redundant transitions in 19 ms returned []
[2021-05-08 23:29:57] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2021-05-08 23:29:57] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-08 23:29:57] [INFO ] Dead Transitions using invariants and state equation in 364 ms returned []
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 1327/1327 transitions.
Product exploration explored 100000 steps with 27978 reset in 984 ms.
Product exploration explored 100000 steps with 27777 reset in 916 ms.
[2021-05-08 23:29:59] [INFO ] Flatten gal took : 48 ms
[2021-05-08 23:29:59] [INFO ] Flatten gal took : 81 ms
[2021-05-08 23:29:59] [INFO ] Time to serialize gal into /tmp/LTL12752796329356832676.gal : 12 ms
[2021-05-08 23:29:59] [INFO ] Time to serialize properties into /tmp/LTL15727028036442709373.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL12752796329356832676.gal, -t, CGAL, -LTL, /tmp/LTL15727028036442709373.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL12752796329356832676.gal -t CGAL -LTL /tmp/LTL15727028036442709373.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((CHOIX_0+CHOIX_1)>=1)"))))
Formula 0 simplified : !XF"((CHOIX_0+CHOIX_1)>=1)"
Detected timeout of ITS tools.
[2021-05-08 23:30:14] [INFO ] Flatten gal took : 65 ms
[2021-05-08 23:30:14] [INFO ] Applying decomposition
[2021-05-08 23:30:14] [INFO ] Flatten gal took : 88 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10619000250272411704.txt, -o, /tmp/graph10619000250272411704.bin, -w, /tmp/graph10619000250272411704.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10619000250272411704.bin, -l, -1, -v, -w, /tmp/graph10619000250272411704.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 23:30:14] [INFO ] Decomposing Gal with order
[2021-05-08 23:30:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 23:30:15] [INFO ] Removed a total of 1365 redundant transitions.
[2021-05-08 23:30:15] [INFO ] Flatten gal took : 193 ms
[2021-05-08 23:30:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 298 labels/synchronizations in 10 ms.
[2021-05-08 23:30:15] [INFO ] Time to serialize gal into /tmp/LTL3750989767416276808.gal : 4 ms
[2021-05-08 23:30:15] [INFO ] Time to serialize properties into /tmp/LTL6627709177093831096.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL3750989767416276808.gal, -t, CGAL, -LTL, /tmp/LTL6627709177093831096.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3750989767416276808.gal -t CGAL -LTL /tmp/LTL6627709177093831096.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((gu2.CHOIX_0+gu2.CHOIX_1)>=1)"))))
Formula 0 simplified : !XF"((gu2.CHOIX_0+gu2.CHOIX_1)>=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4286472332590429358
[2021-05-08 23:30:30] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4286472332590429358
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4286472332590429358]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4286472332590429358] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4286472332590429358] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property BridgeAndVehicles-COL-V50P50N10-10 finished in 39587 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((F(p0) U p1)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 127/127 places, 1328/1328 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 126 transition count 1328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 125 transition count 1327
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 125 transition count 1327
Applied a total of 3 rules in 26 ms. Remains 125 /127 variables (removed 2) and now considering 1327/1328 (removed 1) transitions.
[2021-05-08 23:30:31] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2021-05-08 23:30:31] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-08 23:30:31] [INFO ] Dead Transitions using invariants and state equation in 532 ms returned []
[2021-05-08 23:30:31] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2021-05-08 23:30:31] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-08 23:30:32] [INFO ] Implicit Places using invariants in 227 ms returned []
[2021-05-08 23:30:32] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2021-05-08 23:30:32] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 23:30:32] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-08 23:30:32] [INFO ] Implicit Places using invariants and state equation in 613 ms returned [106]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 870 ms to find 1 implicit places.
[2021-05-08 23:30:32] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 124 cols
[2021-05-08 23:30:32] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 23:30:33] [INFO ] Dead Transitions using invariants and state equation in 460 ms returned []
Starting structural reductions, iteration 1 : 124/127 places, 1327/1328 transitions.
Applied a total of 0 rules in 8 ms. Remains 124 /124 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2021-05-08 23:30:33] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 124 cols
[2021-05-08 23:30:33] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 23:30:33] [INFO ] Dead Transitions using invariants and state equation in 423 ms returned []
Finished structural reductions, in 2 iterations. Remains : 124/127 places, 1327/1328 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ 1 s53), p0:(LEQ 2 s53)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 440 steps with 2 reset in 2 ms.
FORMULA BridgeAndVehicles-COL-V50P50N10-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N10-11 finished in 2502 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(G((!p0||X(p1))))&&F(p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 127 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 127/127 places, 1328/1328 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 126 transition count 1328
Applied a total of 1 rules in 7 ms. Remains 126 /127 variables (removed 1) and now considering 1328/1328 (removed 0) transitions.
[2021-05-08 23:30:33] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2021-05-08 23:30:33] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-08 23:30:34] [INFO ] Dead Transitions using invariants and state equation in 435 ms returned []
[2021-05-08 23:30:34] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2021-05-08 23:30:34] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 23:30:34] [INFO ] Implicit Places using invariants in 176 ms returned []
[2021-05-08 23:30:34] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2021-05-08 23:30:34] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-08 23:30:34] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-08 23:30:35] [INFO ] Implicit Places using invariants and state equation in 691 ms returned [53, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 895 ms to find 2 implicit places.
[2021-05-08 23:30:35] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2021-05-08 23:30:35] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-08 23:30:35] [INFO ] Dead Transitions using invariants and state equation in 377 ms returned []
Starting structural reductions, iteration 1 : 124/127 places, 1328/1328 transitions.
Applied a total of 0 rules in 5 ms. Remains 124 /124 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2021-05-08 23:30:35] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2021-05-08 23:30:35] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 23:30:35] [INFO ] Dead Transitions using invariants and state equation in 348 ms returned []
Finished structural reductions, in 2 iterations. Remains : 124/127 places, 1328/1328 transitions.
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p1) (NOT p0)), (AND p0 (NOT p1)), (NOT p0), (AND p0 (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 1 s53), p1:(LEQ s106 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 4639 reset in 394 ms.
Product exploration explored 100000 steps with 4609 reset in 389 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p1) (NOT p0)), (AND p0 (NOT p1)), (NOT p0), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 4730 reset in 359 ms.
Product exploration explored 100000 steps with 4652 reset in 367 ms.
Applying partial POR strategy [false, false, true, false]
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p1) (NOT p0)), (AND p0 (NOT p1)), (NOT p0), (AND p0 (NOT p1))]
Support contains 3 out of 124 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 124/124 places, 1328/1328 transitions.
Applied a total of 0 rules in 83 ms. Remains 124 /124 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2021-05-08 23:30:37] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2021-05-08 23:30:37] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 23:30:38] [INFO ] Dead Transitions using invariants and state equation in 409 ms returned []
[2021-05-08 23:30:38] [INFO ] Redundant transitions in 19 ms returned []
[2021-05-08 23:30:38] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2021-05-08 23:30:38] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 23:30:38] [INFO ] Dead Transitions using invariants and state equation in 379 ms returned []
Finished structural reductions, in 1 iterations. Remains : 124/124 places, 1328/1328 transitions.
Product exploration explored 100000 steps with 4580 reset in 537 ms.
Product exploration explored 100000 steps with 4613 reset in 454 ms.
[2021-05-08 23:30:39] [INFO ] Flatten gal took : 36 ms
[2021-05-08 23:30:39] [INFO ] Flatten gal took : 34 ms
[2021-05-08 23:30:39] [INFO ] Time to serialize gal into /tmp/LTL5479078004213579473.gal : 5 ms
[2021-05-08 23:30:39] [INFO ] Time to serialize properties into /tmp/LTL1604240961322212799.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL5479078004213579473.gal, -t, CGAL, -LTL, /tmp/LTL1604240961322212799.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5479078004213579473.gal -t CGAL -LTL /tmp/LTL1604240961322212799.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((F(G(("(SUR_PONT_A_0<1)")||(X("(ROUTE_B_0<=CAPACITE_0)")))))&&(F("(SUR_PONT_A_0>=1)")))))
Formula 0 simplified : !G(FG("(SUR_PONT_A_0<1)" | X"(ROUTE_B_0<=CAPACITE_0)") & F"(SUR_PONT_A_0>=1)")
Detected timeout of ITS tools.
[2021-05-08 23:30:54] [INFO ] Flatten gal took : 45 ms
[2021-05-08 23:30:54] [INFO ] Applying decomposition
[2021-05-08 23:30:55] [INFO ] Flatten gal took : 63 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10907043037323585674.txt, -o, /tmp/graph10907043037323585674.bin, -w, /tmp/graph10907043037323585674.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10907043037323585674.bin, -l, -1, -v, -w, /tmp/graph10907043037323585674.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 23:30:55] [INFO ] Decomposing Gal with order
[2021-05-08 23:30:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 23:30:55] [INFO ] Removed a total of 1296 redundant transitions.
[2021-05-08 23:30:55] [INFO ] Flatten gal took : 247 ms
[2021-05-08 23:30:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 368 labels/synchronizations in 8 ms.
[2021-05-08 23:30:55] [INFO ] Time to serialize gal into /tmp/LTL15278607406845203774.gal : 4 ms
[2021-05-08 23:30:55] [INFO ] Time to serialize properties into /tmp/LTL5721872323266049318.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL15278607406845203774.gal, -t, CGAL, -LTL, /tmp/LTL5721872323266049318.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL15278607406845203774.gal -t CGAL -LTL /tmp/LTL5721872323266049318.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((F(G(("(gi1.gu1.SUR_PONT_A_0<1)")||(X("(gu0.ROUTE_B_0<=gu0.CAPACITE_0)")))))&&(F("(gi1.gu1.SUR_PONT_A_0>=1)")))))
Formula 0 simplified : !G(FG("(gi1.gu1.SUR_PONT_A_0<1)" | X"(gu0.ROUTE_B_0<=gu0.CAPACITE_0)") & F"(gi1.gu1.SUR_PONT_A_0>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8867517956589166247
[2021-05-08 23:31:10] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8867517956589166247
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8867517956589166247]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8867517956589166247] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8867517956589166247] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property BridgeAndVehicles-COL-V50P50N10-13 finished in 37851 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U !p1)&&(p0 U X(G(!p0)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 127 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 127/127 places, 1328/1328 transitions.
Applied a total of 0 rules in 10 ms. Remains 127 /127 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2021-05-08 23:31:11] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 127 cols
[2021-05-08 23:31:11] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-08 23:31:11] [INFO ] Dead Transitions using invariants and state equation in 356 ms returned []
[2021-05-08 23:31:12] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 127 cols
[2021-05-08 23:31:12] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-08 23:31:12] [INFO ] Implicit Places using invariants in 158 ms returned []
[2021-05-08 23:31:12] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 127 cols
[2021-05-08 23:31:12] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-08 23:31:12] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-08 23:31:12] [INFO ] Implicit Places using invariants and state equation in 651 ms returned [54, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 837 ms to find 2 implicit places.
[2021-05-08 23:31:12] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 125 cols
[2021-05-08 23:31:12] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-08 23:31:13] [INFO ] Dead Transitions using invariants and state equation in 371 ms returned []
Starting structural reductions, iteration 1 : 125/127 places, 1328/1328 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2021-05-08 23:31:13] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 125 cols
[2021-05-08 23:31:13] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-08 23:31:13] [INFO ] Dead Transitions using invariants and state equation in 346 ms returned []
Finished structural reductions, in 2 iterations. Remains : 125/127 places, 1328/1328 transitions.
Stuttering acceptance computed with spot in 85 ms :[p0, p0, true, (OR p0 p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N10-15 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p0:(LEQ s54 s52), p1:(GT 3 s107)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V50P50N10-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N10-15 finished in 2062 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1370412655102992989
[2021-05-08 23:31:13] [INFO ] Computing symmetric may disable matrix : 1328 transitions.
[2021-05-08 23:31:13] [INFO ] Applying decomposition
[2021-05-08 23:31:13] [INFO ] Computation of Complete disable matrix. took 50 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-08 23:31:13] [INFO ] Flatten gal took : 67 ms
[2021-05-08 23:31:13] [INFO ] Computing symmetric may enable matrix : 1328 transitions.
[2021-05-08 23:31:13] [INFO ] Computation of Complete enable matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph6770461634592455300.txt, -o, /tmp/graph6770461634592455300.bin, -w, /tmp/graph6770461634592455300.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph6770461634592455300.bin, -l, -1, -v, -w, /tmp/graph6770461634592455300.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 23:31:13] [INFO ] Decomposing Gal with order
[2021-05-08 23:31:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 23:31:14] [INFO ] Computing Do-Not-Accords matrix : 1328 transitions.
[2021-05-08 23:31:14] [INFO ] Computation of Completed DNA matrix. took 86 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-08 23:31:14] [INFO ] Built C files in 555ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1370412655102992989
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin1370412655102992989]
[2021-05-08 23:31:15] [INFO ] Removed a total of 1570 redundant transitions.
[2021-05-08 23:31:15] [INFO ] Flatten gal took : 1815 ms
[2021-05-08 23:31:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 1322 labels/synchronizations in 65 ms.
[2021-05-08 23:31:16] [INFO ] Time to serialize gal into /tmp/LTLCardinality10591337827717970816.gal : 16 ms
[2021-05-08 23:31:16] [INFO ] Time to serialize properties into /tmp/LTLCardinality6217575741682162687.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality10591337827717970816.gal, -t, CGAL, -LTL, /tmp/LTLCardinality6217575741682162687.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality10591337827717970816.gal -t CGAL -LTL /tmp/LTLCardinality6217575741682162687.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 4 LTL properties
Checking formula 0 : !((G("(gi1.gu2.CAPACITE_0>gi1.gu1.SUR_PONT_A_0)")))
Formula 0 simplified : !G"(gi1.gu2.CAPACITE_0>gi1.gu1.SUR_PONT_A_0)"
Compilation finished in 13092 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin1370412655102992989]
Link finished in 97 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, []((LTLAPp0==true)), --buchi-type=spotba], workingDir=/tmp/ltsmin1370412655102992989]
WARNING : LTSmin timed out (>400 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, []((LTLAPp0==true)), --buchi-type=spotba], workingDir=/tmp/ltsmin1370412655102992989]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>(((LTLAPp1==true)||[]((LTLAPp2==true))||X((LTLAPp3==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin1370412655102992989]
LTSmin run took 3279 ms.
FORMULA BridgeAndVehicles-COL-V50P50N10-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>((LTLAPp4==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin1370412655102992989]
LTSmin run took 5020 ms.
FORMULA BridgeAndVehicles-COL-V50P50N10-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, []((<>([]((!(LTLAPp5==true)||X((LTLAPp6==true)))))&&<>((LTLAPp5==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin1370412655102992989]
LTSmin run took 82637 ms.
FORMULA BridgeAndVehicles-COL-V50P50N10-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 3200 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, []((LTLAPp0==true)), --buchi-type=spotba], workingDir=/tmp/ltsmin1370412655102992989]
Detected timeout of ITS tools.
[2021-05-08 23:52:12] [INFO ] Applying decomposition
[2021-05-08 23:52:12] [INFO ] Flatten gal took : 299 ms
[2021-05-08 23:52:13] [INFO ] Decomposing Gal with order
[2021-05-08 23:52:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 23:52:13] [INFO ] Removed a total of 7230 redundant transitions.
[2021-05-08 23:52:13] [INFO ] Flatten gal took : 247 ms
[2021-05-08 23:52:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 45 ms.
[2021-05-08 23:52:13] [INFO ] Time to serialize gal into /tmp/LTLCardinality3917404905269250848.gal : 17 ms
[2021-05-08 23:52:13] [INFO ] Time to serialize properties into /tmp/LTLCardinality4462931281706356538.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality3917404905269250848.gal, -t, CGAL, -LTL, /tmp/LTLCardinality4462931281706356538.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality3917404905269250848.gal -t CGAL -LTL /tmp/LTLCardinality4462931281706356538.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G("(gCAPACITE.CAPACITE_0>gSUR_PONT_A.SUR_PONT_A_0)")))
Formula 0 simplified : !G"(gCAPACITE.CAPACITE_0>gSUR_PONT_A.SUR_PONT_A_0)"
Detected timeout of ITS tools.
[2021-05-09 00:13:10] [INFO ] Flatten gal took : 133 ms
[2021-05-09 00:13:10] [INFO ] Input system was already deterministic with 1328 transitions.
[2021-05-09 00:13:10] [INFO ] Transformed 127 places.
[2021-05-09 00:13:10] [INFO ] Transformed 1328 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-09 00:13:10] [INFO ] Time to serialize gal into /tmp/LTLCardinality15972858674900334616.gal : 5 ms
[2021-05-09 00:13:10] [INFO ] Time to serialize properties into /tmp/LTLCardinality10213350501283834155.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality15972858674900334616.gal, -t, CGAL, -LTL, /tmp/LTLCardinality10213350501283834155.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality15972858674900334616.gal -t CGAL -LTL /tmp/LTLCardinality10213350501283834155.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G("(CAPACITE_0>SUR_PONT_A_0)")))
Formula 0 simplified : !G"(CAPACITE_0>SUR_PONT_A_0)"
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-COL-V50P50N10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-COL-V50P50N10, 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 r026-tajo-162038143400092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V50P50N10.tgz
mv BridgeAndVehicles-COL-V50P50N10 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 '
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 ;