fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r263-tall-171654372000092
Last Updated
July 7, 2024

About the Execution of 2023-gold for MultiCrashLeafsetExtension-PT-S32C02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10213.447 1347392.00 3430181.00 4135.70 TTTFTTTFFTFTTFTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r263-tall-171654372000092.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is MultiCrashLeafsetExtension-PT-S32C02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654372000092
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 14K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Apr 22 14:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Apr 12 05:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 12 05:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K Apr 12 05:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 12 05:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 16M May 18 16:43 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 MultiCrashLeafsetExtension-PT-S32C02-LTLCardinality-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-LTLCardinality-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-LTLCardinality-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-LTLCardinality-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-LTLCardinality-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-LTLCardinality-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-LTLCardinality-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-LTLCardinality-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-LTLCardinality-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-LTLCardinality-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-LTLCardinality-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-LTLCardinality-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-LTLCardinality-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-LTLCardinality-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-LTLCardinality-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716653421997

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S32C02
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-25 16:10:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 16:10:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 16:10:23] [INFO ] Load time of PNML (sax parser for PT used): 504 ms
[2024-05-25 16:10:24] [INFO ] Transformed 13544 places.
[2024-05-25 16:10:24] [INFO ] Transformed 21807 transitions.
[2024-05-25 16:10:24] [INFO ] Parsed PT model containing 13544 places and 21807 transitions and 93598 arcs in 685 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S32C02-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C02-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C02-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 13544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13544/13544 places, 21807/21807 transitions.
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 13504 transition count 21807
Discarding 2101 places :
Symmetric choice reduction at 1 with 2101 rule applications. Total rules 2141 place count 11403 transition count 19706
Iterating global reduction 1 with 2101 rules applied. Total rules applied 4242 place count 11403 transition count 19706
Discarding 1966 places :
Symmetric choice reduction at 1 with 1966 rule applications. Total rules 6208 place count 9437 transition count 17740
Iterating global reduction 1 with 1966 rules applied. Total rules applied 8174 place count 9437 transition count 17740
Discarding 973 places :
Symmetric choice reduction at 1 with 973 rule applications. Total rules 9147 place count 8464 transition count 15794
Iterating global reduction 1 with 973 rules applied. Total rules applied 10120 place count 8464 transition count 15794
Applied a total of 10120 rules in 10720 ms. Remains 8464 /13544 variables (removed 5080) and now considering 15794/21807 (removed 6013) transitions.
[2024-05-25 16:10:35] [INFO ] Flow matrix only has 14738 transitions (discarded 1056 similar events)
// Phase 1: matrix 14738 rows 8464 cols
[2024-05-25 16:10:36] [INFO ] Computed 1293 invariants in 1058 ms
[2024-05-25 16:10:37] [INFO ] Implicit Places using invariants in 2036 ms returned []
Implicit Place search using SMT only with invariants took 2063 ms to find 0 implicit places.
[2024-05-25 16:10:37] [INFO ] Flow matrix only has 14738 transitions (discarded 1056 similar events)
[2024-05-25 16:10:37] [INFO ] Invariant cache hit.
[2024-05-25 16:10:38] [INFO ] Dead Transitions using invariants and state equation in 887 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8464/13544 places, 15794/21807 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13675 ms. Remains : 8464/13544 places, 15794/21807 transitions.
Support contains 49 out of 8464 places after structural reductions.
[2024-05-25 16:10:39] [INFO ] Flatten gal took : 715 ms
[2024-05-25 16:10:39] [INFO ] Flatten gal took : 464 ms
[2024-05-25 16:10:40] [INFO ] Input system was already deterministic with 15794 transitions.
Incomplete random walk after 10000 steps, including 471 resets, run finished after 749 ms. (steps per millisecond=13 ) properties (out of 29) seen :7
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
[2024-05-25 16:10:41] [INFO ] Flow matrix only has 14738 transitions (discarded 1056 similar events)
[2024-05-25 16:10:41] [INFO ] Invariant cache hit.
[2024-05-25 16:10:45] [INFO ] [Real]Absence check using 65 positive place invariants in 156 ms returned sat
[2024-05-25 16:10:45] [INFO ] [Real]Absence check using 65 positive and 1228 generalized place invariants in 474 ms returned sat
[2024-05-25 16:10:57] [INFO ] After 16043ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:19
[2024-05-25 16:11:00] [INFO ] [Nat]Absence check using 65 positive place invariants in 191 ms returned sat
[2024-05-25 16:11:01] [INFO ] [Nat]Absence check using 65 positive and 1228 generalized place invariants in 510 ms returned sat
[2024-05-25 16:11:20] [INFO ] After 18231ms SMT Verify possible using state equation in natural domain returned unsat :11 sat :10
[2024-05-25 16:11:20] [INFO ] State equation strengthened by 6069 read => feed constraints.
[2024-05-25 16:11:22] [INFO ] After 1926ms SMT Verify possible using 6069 Read/Feed constraints in natural domain returned unsat :14 sat :6
[2024-05-25 16:11:22] [INFO ] After 1928ms SMT Verify possible using trap constraints in natural domain returned unsat :14 sat :6
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-25 16:11:22] [INFO ] After 25046ms SMT Verify possible using all constraints in natural domain returned unsat :14 sat :6
Fused 21 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 44 ms.
Support contains 15 out of 8464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8464/8464 places, 15794/15794 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 8464 transition count 15792
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 8462 transition count 15792
Performed 133 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 133 Pre rules applied. Total rules applied 4 place count 8462 transition count 15659
Deduced a syphon composed of 133 places in 14 ms
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 266 rules applied. Total rules applied 270 place count 8329 transition count 15659
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 278 place count 8321 transition count 15649
Iterating global reduction 2 with 8 rules applied. Total rules applied 286 place count 8321 transition count 15649
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 286 place count 8321 transition count 15648
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 288 place count 8320 transition count 15648
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 294 place count 8314 transition count 15636
Iterating global reduction 2 with 6 rules applied. Total rules applied 300 place count 8314 transition count 15636
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 17 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 372 place count 8278 transition count 15600
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 374 place count 8276 transition count 15598
Iterating global reduction 2 with 2 rules applied. Total rules applied 376 place count 8276 transition count 15598
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 378 place count 8274 transition count 15594
Iterating global reduction 2 with 2 rules applied. Total rules applied 380 place count 8274 transition count 15594
Free-agglomeration rule (complex) applied 579 times.
Iterating global reduction 2 with 579 rules applied. Total rules applied 959 place count 8274 transition count 15969
Reduce places removed 579 places and 0 transitions.
Iterating post reduction 2 with 579 rules applied. Total rules applied 1538 place count 7695 transition count 15969
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 3 with 99 rules applied. Total rules applied 1637 place count 7695 transition count 15969
Applied a total of 1637 rules in 21354 ms. Remains 7695 /8464 variables (removed 769) and now considering 15969/15794 (removed -175) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21360 ms. Remains : 7695/8464 places, 15969/15794 transitions.
Incomplete random walk after 10000 steps, including 761 resets, run finished after 555 ms. (steps per millisecond=18 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-25 16:11:45] [INFO ] Flow matrix only has 14404 transitions (discarded 1565 similar events)
// Phase 1: matrix 14404 rows 7695 cols
[2024-05-25 16:11:45] [INFO ] Computed 1293 invariants in 659 ms
[2024-05-25 16:11:47] [INFO ] After 1213ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-25 16:11:48] [INFO ] [Nat]Absence check using 65 positive place invariants in 123 ms returned sat
[2024-05-25 16:11:48] [INFO ] [Nat]Absence check using 65 positive and 1228 generalized place invariants in 498 ms returned sat
[2024-05-25 16:12:05] [INFO ] After 15802ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-25 16:12:05] [INFO ] State equation strengthened by 7013 read => feed constraints.
[2024-05-25 16:12:12] [INFO ] After 6672ms SMT Verify possible using 7013 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2024-05-25 16:12:12] [INFO ] After 6673ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-25 16:12:12] [INFO ] After 25057ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 17 ms.
Support contains 12 out of 7695 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7695/7695 places, 15969/15969 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 7695 transition count 15968
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7694 transition count 15968
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 7694 transition count 15967
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 7693 transition count 15967
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 5 place count 7692 transition count 15966
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 7692 transition count 15966
Applied a total of 6 rules in 7355 ms. Remains 7692 /7695 variables (removed 3) and now considering 15966/15969 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7355 ms. Remains : 7692/7695 places, 15966/15969 transitions.
Incomplete random walk after 10000 steps, including 762 resets, run finished after 611 ms. (steps per millisecond=16 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-25 16:12:20] [INFO ] Flow matrix only has 14401 transitions (discarded 1565 similar events)
// Phase 1: matrix 14401 rows 7692 cols
[2024-05-25 16:12:21] [INFO ] Computed 1293 invariants in 667 ms
[2024-05-25 16:12:22] [INFO ] After 1026ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 16:12:23] [INFO ] [Nat]Absence check using 65 positive place invariants in 168 ms returned sat
[2024-05-25 16:12:23] [INFO ] [Nat]Absence check using 65 positive and 1228 generalized place invariants in 462 ms returned sat
[2024-05-25 16:12:38] [INFO ] After 14247ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-25 16:12:38] [INFO ] State equation strengthened by 7013 read => feed constraints.
[2024-05-25 16:12:47] [INFO ] After 8647ms SMT Verify possible using 7013 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-25 16:12:47] [INFO ] After 8649ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-25 16:12:47] [INFO ] After 25057ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 9 ms.
Support contains 10 out of 7692 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7692/7692 places, 15966/15966 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 7692 transition count 15965
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7691 transition count 15965
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 7691 transition count 15964
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 7690 transition count 15964
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 5 place count 7690 transition count 15964
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 6 place count 7689 transition count 15963
Iterating global reduction 3 with 1 rules applied. Total rules applied 7 place count 7689 transition count 15963
Applied a total of 7 rules in 9910 ms. Remains 7689 /7692 variables (removed 3) and now considering 15963/15966 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9910 ms. Remains : 7689/7692 places, 15963/15966 transitions.
FORMULA MultiCrashLeafsetExtension-PT-S32C02-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 15 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S32C02-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C02-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C02-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C02-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C02-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C02-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C02-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2448 stabilizing places and 3825 stable transitions
FORMULA MultiCrashLeafsetExtension-PT-S32C02-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 8464 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8464/8464 places, 15794/15794 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 8464 transition count 15788
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 8458 transition count 15788
Performed 133 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 133 Pre rules applied. Total rules applied 12 place count 8458 transition count 15655
Deduced a syphon composed of 133 places in 11 ms
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 266 rules applied. Total rules applied 278 place count 8325 transition count 15655
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 288 place count 8315 transition count 15642
Iterating global reduction 2 with 10 rules applied. Total rules applied 298 place count 8315 transition count 15642
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 305 place count 8308 transition count 15628
Iterating global reduction 2 with 7 rules applied. Total rules applied 312 place count 8308 transition count 15628
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 13 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 384 place count 8272 transition count 15592
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 389 place count 8267 transition count 15587
Iterating global reduction 2 with 5 rules applied. Total rules applied 394 place count 8267 transition count 15587
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 394 place count 8267 transition count 15585
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 398 place count 8265 transition count 15585
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 403 place count 8260 transition count 15575
Iterating global reduction 2 with 5 rules applied. Total rules applied 408 place count 8260 transition count 15575
Applied a total of 408 rules in 15133 ms. Remains 8260 /8464 variables (removed 204) and now considering 15575/15794 (removed 219) transitions.
[2024-05-25 16:13:12] [INFO ] Flow matrix only has 14519 transitions (discarded 1056 similar events)
// Phase 1: matrix 14519 rows 8260 cols
[2024-05-25 16:13:13] [INFO ] Computed 1293 invariants in 652 ms
[2024-05-25 16:13:13] [INFO ] Implicit Places using invariants in 1397 ms returned []
Implicit Place search using SMT only with invariants took 1401 ms to find 0 implicit places.
[2024-05-25 16:13:14] [INFO ] Flow matrix only has 14519 transitions (discarded 1056 similar events)
[2024-05-25 16:13:14] [INFO ] Invariant cache hit.
[2024-05-25 16:13:14] [INFO ] Dead Transitions using invariants and state equation in 737 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8260/8464 places, 15575/15794 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17274 ms. Remains : 8260/8464 places, 15575/15794 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 153 ms :[true, (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C02-LTLCardinality-07 automaton TGBA Formula[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:(LEQ s2768 s3552)], 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]]
Entered a terminal (fully accepting) state of product in 9649 steps with 579 reset in 215 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C02-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C02-LTLCardinality-07 finished in 17734 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(G(p1)))))'
Support contains 4 out of 8464 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8464/8464 places, 15794/15794 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 8464 transition count 15787
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 8457 transition count 15787
Performed 133 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 133 Pre rules applied. Total rules applied 14 place count 8457 transition count 15654
Deduced a syphon composed of 133 places in 12 ms
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 266 rules applied. Total rules applied 280 place count 8324 transition count 15654
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 290 place count 8314 transition count 15641
Iterating global reduction 2 with 10 rules applied. Total rules applied 300 place count 8314 transition count 15641
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 300 place count 8314 transition count 15640
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 302 place count 8313 transition count 15640
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 309 place count 8306 transition count 15626
Iterating global reduction 2 with 7 rules applied. Total rules applied 316 place count 8306 transition count 15626
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 13 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 388 place count 8270 transition count 15590
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 394 place count 8264 transition count 15584
Iterating global reduction 2 with 6 rules applied. Total rules applied 400 place count 8264 transition count 15584
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 400 place count 8264 transition count 15582
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 404 place count 8262 transition count 15582
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 410 place count 8256 transition count 15570
Iterating global reduction 2 with 6 rules applied. Total rules applied 416 place count 8256 transition count 15570
Applied a total of 416 rules in 14964 ms. Remains 8256 /8464 variables (removed 208) and now considering 15570/15794 (removed 224) transitions.
[2024-05-25 16:13:30] [INFO ] Flow matrix only has 14514 transitions (discarded 1056 similar events)
// Phase 1: matrix 14514 rows 8256 cols
[2024-05-25 16:13:30] [INFO ] Computed 1293 invariants in 627 ms
[2024-05-25 16:13:31] [INFO ] Implicit Places using invariants in 1401 ms returned []
Implicit Place search using SMT only with invariants took 1402 ms to find 0 implicit places.
[2024-05-25 16:13:31] [INFO ] Flow matrix only has 14514 transitions (discarded 1056 similar events)
[2024-05-25 16:13:31] [INFO ] Invariant cache hit.
[2024-05-25 16:13:32] [INFO ] Dead Transitions using invariants and state equation in 750 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8256/8464 places, 15570/15794 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17124 ms. Remains : 8256/8464 places, 15570/15794 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C02-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s1511 s3578), p1:(LEQ s541 s3353)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 66 steps with 3 reset in 3 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C02-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C02-LTLCardinality-10 finished in 17319 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(F(p0))))))'
Support contains 2 out of 8464 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8464/8464 places, 15794/15794 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 8448 transition count 15775
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 8448 transition count 15775
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 45 place count 8435 transition count 15755
Iterating global reduction 0 with 13 rules applied. Total rules applied 58 place count 8435 transition count 15755
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 64 place count 8429 transition count 15743
Iterating global reduction 0 with 6 rules applied. Total rules applied 70 place count 8429 transition count 15743
Applied a total of 70 rules in 8564 ms. Remains 8429 /8464 variables (removed 35) and now considering 15743/15794 (removed 51) transitions.
[2024-05-25 16:13:41] [INFO ] Flow matrix only has 14687 transitions (discarded 1056 similar events)
// Phase 1: matrix 14687 rows 8429 cols
[2024-05-25 16:13:41] [INFO ] Computed 1293 invariants in 615 ms
[2024-05-25 16:13:42] [INFO ] Implicit Places using invariants in 1373 ms returned []
Implicit Place search using SMT only with invariants took 1374 ms to find 0 implicit places.
[2024-05-25 16:13:42] [INFO ] Flow matrix only has 14687 transitions (discarded 1056 similar events)
[2024-05-25 16:13:42] [INFO ] Invariant cache hit.
[2024-05-25 16:13:43] [INFO ] Dead Transitions using invariants and state equation in 748 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8429/8464 places, 15743/15794 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10689 ms. Remains : 8429/8464 places, 15743/15794 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C02-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s3308 s2293)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 4612 ms.
Product exploration explored 100000 steps with 33333 reset in 4386 ms.
Computed a total of 2413 stabilizing places and 3774 stable transitions
Computed a total of 2413 stabilizing places and 3774 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S32C02-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S32C02-LTLCardinality-12 finished in 19938 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X((p1 U G(p2))))))'
Support contains 7 out of 8464 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8464/8464 places, 15794/15794 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 8450 transition count 15777
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 8450 transition count 15777
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 39 place count 8439 transition count 15760
Iterating global reduction 0 with 11 rules applied. Total rules applied 50 place count 8439 transition count 15760
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 55 place count 8434 transition count 15750
Iterating global reduction 0 with 5 rules applied. Total rules applied 60 place count 8434 transition count 15750
Applied a total of 60 rules in 8633 ms. Remains 8434 /8464 variables (removed 30) and now considering 15750/15794 (removed 44) transitions.
[2024-05-25 16:14:01] [INFO ] Flow matrix only has 14694 transitions (discarded 1056 similar events)
// Phase 1: matrix 14694 rows 8434 cols
[2024-05-25 16:14:01] [INFO ] Computed 1293 invariants in 610 ms
[2024-05-25 16:14:02] [INFO ] Implicit Places using invariants in 1360 ms returned []
Implicit Place search using SMT only with invariants took 1361 ms to find 0 implicit places.
[2024-05-25 16:14:02] [INFO ] Flow matrix only has 14694 transitions (discarded 1056 similar events)
[2024-05-25 16:14:02] [INFO ] Invariant cache hit.
[2024-05-25 16:14:13] [INFO ] Dead Transitions using invariants and state equation in 11293 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8434/8464 places, 15750/15794 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21288 ms. Remains : 8434/8464 places, 15750/15794 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), true, (NOT p2)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C02-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s5976 s5382), p2:(AND (LEQ s3187 s614) (LEQ s1394 s4226)), p1:(GT 1 s2606)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4721 reset in 1599 ms.
Product exploration explored 100000 steps with 4723 reset in 1631 ms.
Computed a total of 2418 stabilizing places and 3781 stable transitions
Computed a total of 2418 stabilizing places and 3781 stable transitions
Detected a total of 2418/8434 stabilizing places and 3781/15750 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
Knowledge based reduction with 6 factoid took 246 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Incomplete random walk after 10000 steps, including 471 resets, run finished after 295 ms. (steps per millisecond=33 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2024-05-25 16:14:18] [INFO ] Flow matrix only has 14694 transitions (discarded 1056 similar events)
[2024-05-25 16:14:18] [INFO ] Invariant cache hit.
[2024-05-25 16:14:18] [INFO ] After 826ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 16:14:19] [INFO ] [Nat]Absence check using 65 positive place invariants in 139 ms returned sat
[2024-05-25 16:14:20] [INFO ] [Nat]Absence check using 65 positive and 1228 generalized place invariants in 520 ms returned sat
[2024-05-25 16:14:20] [INFO ] After 1473ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (F (NOT p2)), (F (AND (NOT p1) p2)), (F (NOT (AND p1 p2))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 7 factoid took 395 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Stuttering acceptance computed with spot in 184 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Support contains 5 out of 8434 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 8434/8434 places, 15750/15750 transitions.
Applied a total of 0 rules in 1962 ms. Remains 8434 /8434 variables (removed 0) and now considering 15750/15750 (removed 0) transitions.
[2024-05-25 16:14:23] [INFO ] Flow matrix only has 14694 transitions (discarded 1056 similar events)
[2024-05-25 16:14:23] [INFO ] Invariant cache hit.
[2024-05-25 16:14:23] [INFO ] Implicit Places using invariants in 754 ms returned []
Implicit Place search using SMT only with invariants took 756 ms to find 0 implicit places.
[2024-05-25 16:14:23] [INFO ] Flow matrix only has 14694 transitions (discarded 1056 similar events)
[2024-05-25 16:14:23] [INFO ] Invariant cache hit.
[2024-05-25 16:14:24] [INFO ] Dead Transitions using invariants and state equation in 738 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3458 ms. Remains : 8434/8434 places, 15750/15750 transitions.
Computed a total of 2418 stabilizing places and 3781 stable transitions
Computed a total of 2418 stabilizing places and 3781 stable transitions
Detected a total of 2418/8434 stabilizing places and 3781/15750 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p2), (X (X p2)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 199 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Incomplete random walk after 10000 steps, including 472 resets, run finished after 330 ms. (steps per millisecond=30 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 16:14:25] [INFO ] Flow matrix only has 14694 transitions (discarded 1056 similar events)
[2024-05-25 16:14:25] [INFO ] Invariant cache hit.
[2024-05-25 16:14:26] [INFO ] After 790ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 16:14:27] [INFO ] [Nat]Absence check using 65 positive place invariants in 140 ms returned sat
[2024-05-25 16:14:27] [INFO ] [Nat]Absence check using 65 positive and 1228 generalized place invariants in 490 ms returned sat
[2024-05-25 16:14:40] [INFO ] After 12191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 16:14:40] [INFO ] State equation strengthened by 6055 read => feed constraints.
[2024-05-25 16:14:41] [INFO ] After 840ms SMT Verify possible using 6055 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 16:14:41] [INFO ] After 1585ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 476 ms.
[2024-05-25 16:14:42] [INFO ] After 15853ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 8434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8434/8434 places, 15750/15750 transitions.
Performed 136 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 136 Pre rules applied. Total rules applied 0 place count 8434 transition count 15614
Deduced a syphon composed of 136 places in 11 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 0 with 272 rules applied. Total rules applied 272 place count 8298 transition count 15614
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 273 place count 8297 transition count 15613
Iterating global reduction 0 with 1 rules applied. Total rules applied 274 place count 8297 transition count 15613
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 275 place count 8296 transition count 15611
Iterating global reduction 0 with 1 rules applied. Total rules applied 276 place count 8296 transition count 15611
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 12 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 0 with 70 rules applied. Total rules applied 346 place count 8261 transition count 15576
Free-agglomeration rule (complex) applied 577 times.
Iterating global reduction 0 with 577 rules applied. Total rules applied 923 place count 8261 transition count 15972
Reduce places removed 577 places and 0 transitions.
Iterating post reduction 0 with 577 rules applied. Total rules applied 1500 place count 7684 transition count 15972
Partial Free-agglomeration rule applied 66 times.
Drop transitions removed 66 transitions
Iterating global reduction 1 with 66 rules applied. Total rules applied 1566 place count 7684 transition count 15972
Applied a total of 1566 rules in 14698 ms. Remains 7684 /8434 variables (removed 750) and now considering 15972/15750 (removed -222) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14698 ms. Remains : 7684/8434 places, 15972/15750 transitions.
Finished random walk after 2694 steps, including 205 resets, run visited all 1 properties in 80 ms. (steps per millisecond=33 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p2), (X (X p2)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (X (X p1)), (F (NOT (AND p1 p2))), (F (NOT p1)), (F (NOT p2))]
Knowledge based reduction with 3 factoid took 312 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Stuttering acceptance computed with spot in 175 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Stuttering acceptance computed with spot in 167 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Product exploration explored 100000 steps with 4721 reset in 1509 ms.
Product exploration explored 100000 steps with 4718 reset in 1512 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 165 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Support contains 5 out of 8434 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8434/8434 places, 15750/15750 transitions.
Performed 134 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 134 Pre rules applied. Total rules applied 0 place count 8434 transition count 15753
Deduced a syphon composed of 134 places in 12 ms
Iterating global reduction 0 with 134 rules applied. Total rules applied 134 place count 8434 transition count 15753
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 135 place count 8433 transition count 15751
Deduced a syphon composed of 134 places in 11 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 136 place count 8433 transition count 15751
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 137 place count 8432 transition count 15749
Deduced a syphon composed of 134 places in 20 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 138 place count 8432 transition count 15749
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 169 places in 13 ms
Iterating global reduction 0 with 35 rules applied. Total rules applied 173 place count 8432 transition count 15749
Deduced a syphon composed of 169 places in 11 ms
Applied a total of 173 rules in 8001 ms. Remains 8432 /8434 variables (removed 2) and now considering 15749/15750 (removed 1) transitions.
[2024-05-25 16:15:09] [INFO ] Flow matrix only has 14693 transitions (discarded 1056 similar events)
// Phase 1: matrix 14693 rows 8432 cols
[2024-05-25 16:15:09] [INFO ] Computed 1293 invariants in 676 ms
[2024-05-25 16:15:10] [INFO ] Dead Transitions using invariants and state equation in 1408 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8432/8434 places, 15749/15750 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9413 ms. Remains : 8432/8434 places, 15749/15750 transitions.
Built C files in :
/tmp/ltsmin1007159005856064422
[2024-05-25 16:15:10] [INFO ] Built C files in 173ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1007159005856064422
Running compilation step : cd /tmp/ltsmin1007159005856064422;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1007159005856064422;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1007159005856064422;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 8434 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8434/8434 places, 15750/15750 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 8433 transition count 15749
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8433 transition count 15749
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 8432 transition count 15747
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 8432 transition count 15747
Applied a total of 4 rules in 4560 ms. Remains 8432 /8434 variables (removed 2) and now considering 15747/15750 (removed 3) transitions.
[2024-05-25 16:15:18] [INFO ] Flow matrix only has 14691 transitions (discarded 1056 similar events)
// Phase 1: matrix 14691 rows 8432 cols
[2024-05-25 16:15:19] [INFO ] Computed 1293 invariants in 637 ms
[2024-05-25 16:15:19] [INFO ] Implicit Places using invariants in 1377 ms returned []
Implicit Place search using SMT only with invariants took 1378 ms to find 0 implicit places.
[2024-05-25 16:15:19] [INFO ] Flow matrix only has 14691 transitions (discarded 1056 similar events)
[2024-05-25 16:15:19] [INFO ] Invariant cache hit.
[2024-05-25 16:15:20] [INFO ] Dead Transitions using invariants and state equation in 762 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8432/8434 places, 15747/15750 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6701 ms. Remains : 8432/8434 places, 15747/15750 transitions.
Built C files in :
/tmp/ltsmin3221863045625947586
[2024-05-25 16:15:20] [INFO ] Built C files in 158ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3221863045625947586
Running compilation step : cd /tmp/ltsmin3221863045625947586;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3221863045625947586;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3221863045625947586;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 16:15:24] [INFO ] Flatten gal took : 446 ms
[2024-05-25 16:15:25] [INFO ] Flatten gal took : 431 ms
[2024-05-25 16:15:25] [INFO ] Time to serialize gal into /tmp/LTL13954894217965427766.gal : 115 ms
[2024-05-25 16:15:25] [INFO ] Time to serialize properties into /tmp/LTL5253251559582649724.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13954894217965427766.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3489127967723258411.hoa' '-atoms' '/tmp/LTL5253251559582649724.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5253251559582649724.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3489127967723258411.hoa
Detected timeout of ITS tools.
[2024-05-25 16:15:41] [INFO ] Flatten gal took : 404 ms
[2024-05-25 16:15:41] [INFO ] Flatten gal took : 421 ms
[2024-05-25 16:15:41] [INFO ] Time to serialize gal into /tmp/LTL17658887006778371836.gal : 76 ms
[2024-05-25 16:15:41] [INFO ] Time to serialize properties into /tmp/LTL8981454728363328009.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17658887006778371836.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8981454728363328009.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("(Node27HasAskedItsLeafSetToRx1ToReplaceNode22<=Node25ThinksNode22ShouldBeNodeMasterToReplaceNode19)"))&&(X(X(("(Node6WantsToMan...362
Formula 0 simplified : G!"(Node27HasAskedItsLeafSetToRx1ToReplaceNode22<=Node25ThinksNode22ShouldBeNodeMasterToReplaceNode19)" | XX(!"(Node6WantsToManageTh...351
Detected timeout of ITS tools.
[2024-05-25 16:15:57] [INFO ] Flatten gal took : 436 ms
[2024-05-25 16:15:57] [INFO ] Applying decomposition
[2024-05-25 16:15:57] [INFO ] Flatten gal took : 411 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1270361922083122175.txt' '-o' '/tmp/graph1270361922083122175.bin' '-w' '/tmp/graph1270361922083122175.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1270361922083122175.bin' '-l' '-1' '-v' '-w' '/tmp/graph1270361922083122175.weights' '-q' '0' '-e' '0.001'
[2024-05-25 16:15:58] [INFO ] Decomposing Gal with order
[2024-05-25 16:15:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 16:16:03] [INFO ] Removed a total of 14485 redundant transitions.
[2024-05-25 16:16:03] [INFO ] Flatten gal took : 1999 ms
[2024-05-25 16:16:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 498 labels/synchronizations in 357 ms.
[2024-05-25 16:16:06] [INFO ] Time to serialize gal into /tmp/LTL3670077179455282718.gal : 134 ms
[2024-05-25 16:16:06] [INFO ] Time to serialize properties into /tmp/LTL12160130397718331680.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3670077179455282718.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12160130397718331680.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("(gu776.Node27HasAskedItsLeafSetToRx1ToReplaceNode22<=gu776.Node25ThinksNode22ShouldBeNodeMasterToReplaceNode19)"))&&(X(X(("(gi0...410
Formula 0 simplified : G!"(gu776.Node27HasAskedItsLeafSetToRx1ToReplaceNode22<=gu776.Node25ThinksNode22ShouldBeNodeMasterToReplaceNode19)" | XX(!"(gi0.gi0....399
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14315194362646436347
[2024-05-25 16:16:21] [INFO ] Built C files in 158ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14315194362646436347
Running compilation step : cd /tmp/ltsmin14315194362646436347;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14315194362646436347;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14315194362646436347;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S32C02-LTLCardinality-13 finished in 152033 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X((p1 U G(p2))))))'
Found a Lengthening insensitive property : MultiCrashLeafsetExtension-PT-S32C02-LTLCardinality-13
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), true, (NOT p2)]
Support contains 7 out of 8464 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 8464/8464 places, 15794/15794 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 8464 transition count 15789
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 8459 transition count 15789
Performed 133 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 133 Pre rules applied. Total rules applied 10 place count 8459 transition count 15656
Deduced a syphon composed of 133 places in 12 ms
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 266 rules applied. Total rules applied 276 place count 8326 transition count 15656
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 286 place count 8316 transition count 15643
Iterating global reduction 2 with 10 rules applied. Total rules applied 296 place count 8316 transition count 15643
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 296 place count 8316 transition count 15642
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 298 place count 8315 transition count 15642
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 305 place count 8308 transition count 15628
Iterating global reduction 2 with 7 rules applied. Total rules applied 312 place count 8308 transition count 15628
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 13 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 384 place count 8272 transition count 15592
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 388 place count 8268 transition count 15588
Iterating global reduction 2 with 4 rules applied. Total rules applied 392 place count 8268 transition count 15588
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 392 place count 8268 transition count 15587
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 394 place count 8267 transition count 15587
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 398 place count 8263 transition count 15579
Iterating global reduction 2 with 4 rules applied. Total rules applied 402 place count 8263 transition count 15579
Applied a total of 402 rules in 11644 ms. Remains 8263 /8464 variables (removed 201) and now considering 15579/15794 (removed 215) transitions.
[2024-05-25 16:16:36] [INFO ] Flow matrix only has 14523 transitions (discarded 1056 similar events)
// Phase 1: matrix 14523 rows 8263 cols
[2024-05-25 16:16:37] [INFO ] Computed 1293 invariants in 648 ms
[2024-05-25 16:16:44] [INFO ] Implicit Places using invariants in 8424 ms returned []
Implicit Place search using SMT only with invariants took 8431 ms to find 0 implicit places.
[2024-05-25 16:16:44] [INFO ] Flow matrix only has 14523 transitions (discarded 1056 similar events)
[2024-05-25 16:16:44] [INFO ] Invariant cache hit.
[2024-05-25 16:16:45] [INFO ] Dead Transitions using invariants and state equation in 739 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 8263/8464 places, 15579/15794 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 20816 ms. Remains : 8263/8464 places, 15579/15794 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C02-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s5836 s5252), p2:(AND (LEQ s3142 s604) (LEQ s1379 s4136)), p1:(GT 1 s2571)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 6404 reset in 2141 ms.
Product exploration explored 100000 steps with 6401 reset in 2192 ms.
Computed a total of 2280 stabilizing places and 3643 stable transitions
Computed a total of 2280 stabilizing places and 3643 stable transitions
Detected a total of 2280/8263 stabilizing places and 3643/15579 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
Knowledge based reduction with 6 factoid took 238 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Incomplete random walk after 10000 steps, including 641 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-25 16:16:50] [INFO ] Flow matrix only has 14523 transitions (discarded 1056 similar events)
[2024-05-25 16:16:50] [INFO ] Invariant cache hit.
[2024-05-25 16:16:51] [INFO ] After 1025ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 16:16:53] [INFO ] [Nat]Absence check using 65 positive place invariants in 155 ms returned sat
[2024-05-25 16:16:53] [INFO ] [Nat]Absence check using 65 positive and 1228 generalized place invariants in 499 ms returned sat
[2024-05-25 16:17:07] [INFO ] After 13298ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-25 16:17:07] [INFO ] State equation strengthened by 6055 read => feed constraints.
[2024-05-25 16:17:08] [INFO ] After 1725ms SMT Verify possible using 6055 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2024-05-25 16:17:23] [INFO ] Deduced a trap composed of 709 places in 14261 ms of which 16 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 16:17:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 16:17:23] [INFO ] After 31910ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 8263 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8263/8263 places, 15579/15579 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 8262 transition count 15578
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8262 transition count 15578
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 8261 transition count 15576
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 8261 transition count 15576
Free-agglomeration rule (complex) applied 576 times.
Iterating global reduction 0 with 576 rules applied. Total rules applied 580 place count 8261 transition count 15958
Reduce places removed 576 places and 0 transitions.
Iterating post reduction 0 with 576 rules applied. Total rules applied 1156 place count 7685 transition count 15958
Partial Free-agglomeration rule applied 66 times.
Drop transitions removed 66 transitions
Iterating global reduction 1 with 66 rules applied. Total rules applied 1222 place count 7685 transition count 15958
Applied a total of 1222 rules in 10432 ms. Remains 7685 /8263 variables (removed 578) and now considering 15958/15579 (removed -379) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10433 ms. Remains : 7685/8263 places, 15958/15579 transitions.
Incomplete random walk after 10000 steps, including 762 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 2) seen :0
Finished Best-First random walk after 1693 steps, including 11 resets, run visited all 2 properties in 10 ms. (steps per millisecond=169 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (F (NOT p2)), (F (AND (NOT p1) p2)), (F (NOT (AND p1 p2))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 7 factoid took 394 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Stuttering acceptance computed with spot in 209 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Support contains 5 out of 8263 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 8263/8263 places, 15579/15579 transitions.
Applied a total of 0 rules in 1845 ms. Remains 8263 /8263 variables (removed 0) and now considering 15579/15579 (removed 0) transitions.
[2024-05-25 16:17:37] [INFO ] Flow matrix only has 14523 transitions (discarded 1056 similar events)
[2024-05-25 16:17:37] [INFO ] Invariant cache hit.
[2024-05-25 16:17:38] [INFO ] Implicit Places using invariants in 757 ms returned []
Implicit Place search using SMT only with invariants took 758 ms to find 0 implicit places.
[2024-05-25 16:17:38] [INFO ] Flow matrix only has 14523 transitions (discarded 1056 similar events)
[2024-05-25 16:17:38] [INFO ] Invariant cache hit.
[2024-05-25 16:17:38] [INFO ] Dead Transitions using invariants and state equation in 747 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3353 ms. Remains : 8263/8263 places, 15579/15579 transitions.
Computed a total of 2280 stabilizing places and 3643 stable transitions
Computed a total of 2280 stabilizing places and 3643 stable transitions
Detected a total of 2280/8263 stabilizing places and 3643/15579 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p2), (X (X p2)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 300 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Incomplete random walk after 10000 steps, including 640 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 16:17:39] [INFO ] Flow matrix only has 14523 transitions (discarded 1056 similar events)
[2024-05-25 16:17:39] [INFO ] Invariant cache hit.
[2024-05-25 16:17:40] [INFO ] After 774ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 16:17:41] [INFO ] [Nat]Absence check using 65 positive place invariants in 152 ms returned sat
[2024-05-25 16:17:41] [INFO ] [Nat]Absence check using 65 positive and 1228 generalized place invariants in 498 ms returned sat
[2024-05-25 16:17:53] [INFO ] After 11402ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 16:17:53] [INFO ] State equation strengthened by 6055 read => feed constraints.
[2024-05-25 16:18:01] [INFO ] After 7655ms SMT Verify possible using 6055 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 16:18:15] [INFO ] Deduced a trap composed of 782 places in 13706 ms of which 8 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 16:18:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 16:18:15] [INFO ] After 34805ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 8263 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8263/8263 places, 15579/15579 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 8262 transition count 15578
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8262 transition count 15578
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 8261 transition count 15576
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 8261 transition count 15576
Free-agglomeration rule (complex) applied 577 times.
Iterating global reduction 0 with 577 rules applied. Total rules applied 581 place count 8261 transition count 15972
Reduce places removed 577 places and 0 transitions.
Iterating post reduction 0 with 577 rules applied. Total rules applied 1158 place count 7684 transition count 15972
Partial Free-agglomeration rule applied 66 times.
Drop transitions removed 66 transitions
Iterating global reduction 1 with 66 rules applied. Total rules applied 1224 place count 7684 transition count 15972
Applied a total of 1224 rules in 10443 ms. Remains 7684 /8263 variables (removed 579) and now considering 15972/15579 (removed -393) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10443 ms. Remains : 7684/8263 places, 15972/15579 transitions.
Finished random walk after 8347 steps, including 637 resets, run visited all 1 properties in 224 ms. (steps per millisecond=37 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p2), (X (X p2)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (X (X p1)), (F (NOT (AND p1 p2))), (F (NOT p1)), (F (NOT p2))]
Knowledge based reduction with 3 factoid took 303 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Stuttering acceptance computed with spot in 146 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Stuttering acceptance computed with spot in 169 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Product exploration explored 100000 steps with 6412 reset in 1702 ms.
Product exploration explored 100000 steps with 6406 reset in 1698 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 159 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Support contains 5 out of 8263 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8263/8263 places, 15579/15579 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 8262 transition count 15578
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8262 transition count 15578
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 8261 transition count 15576
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 8261 transition count 15576
Applied a total of 4 rules in 5991 ms. Remains 8261 /8263 variables (removed 2) and now considering 15576/15579 (removed 3) transitions.
[2024-05-25 16:18:36] [INFO ] Flow matrix only has 14520 transitions (discarded 1056 similar events)
// Phase 1: matrix 14520 rows 8261 cols
[2024-05-25 16:18:37] [INFO ] Computed 1293 invariants in 642 ms
[2024-05-25 16:18:47] [INFO ] Dead Transitions using invariants and state equation in 11063 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8261/8263 places, 15576/15579 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17057 ms. Remains : 8261/8263 places, 15576/15579 transitions.
Built C files in :
/tmp/ltsmin2120668814847590180
[2024-05-25 16:18:47] [INFO ] Built C files in 135ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2120668814847590180
Running compilation step : cd /tmp/ltsmin2120668814847590180;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2120668814847590180;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2120668814847590180;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 8263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8263/8263 places, 15579/15579 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 8262 transition count 15578
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8262 transition count 15578
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 8261 transition count 15576
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 8261 transition count 15576
Applied a total of 4 rules in 5559 ms. Remains 8261 /8263 variables (removed 2) and now considering 15576/15579 (removed 3) transitions.
[2024-05-25 16:18:56] [INFO ] Flow matrix only has 14520 transitions (discarded 1056 similar events)
[2024-05-25 16:18:56] [INFO ] Invariant cache hit.
[2024-05-25 16:18:57] [INFO ] Implicit Places using invariants in 739 ms returned []
Implicit Place search using SMT only with invariants took 740 ms to find 0 implicit places.
[2024-05-25 16:18:57] [INFO ] Flow matrix only has 14520 transitions (discarded 1056 similar events)
[2024-05-25 16:18:57] [INFO ] Invariant cache hit.
[2024-05-25 16:18:57] [INFO ] Dead Transitions using invariants and state equation in 757 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8261/8263 places, 15576/15579 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7057 ms. Remains : 8261/8263 places, 15576/15579 transitions.
Built C files in :
/tmp/ltsmin8598338756286819267
[2024-05-25 16:18:57] [INFO ] Built C files in 130ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8598338756286819267
Running compilation step : cd /tmp/ltsmin8598338756286819267;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8598338756286819267;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8598338756286819267;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 16:19:01] [INFO ] Flatten gal took : 443 ms
[2024-05-25 16:19:02] [INFO ] Flatten gal took : 433 ms
[2024-05-25 16:19:02] [INFO ] Time to serialize gal into /tmp/LTL14965463534668737257.gal : 94 ms
[2024-05-25 16:19:02] [INFO ] Time to serialize properties into /tmp/LTL9655077677218303200.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14965463534668737257.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15668233027217345400.hoa' '-atoms' '/tmp/LTL9655077677218303200.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL9655077677218303200.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15668233027217345400.hoa
Detected timeout of ITS tools.
[2024-05-25 16:19:17] [INFO ] Flatten gal took : 412 ms
[2024-05-25 16:19:18] [INFO ] Flatten gal took : 422 ms
[2024-05-25 16:19:18] [INFO ] Time to serialize gal into /tmp/LTL5212937757191821964.gal : 69 ms
[2024-05-25 16:19:18] [INFO ] Time to serialize properties into /tmp/LTL4679591815459062425.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5212937757191821964.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4679591815459062425.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((F("(Node27HasAskedItsLeafSetToRx1ToReplaceNode22<=Node25ThinksNode22ShouldBeNodeMasterToReplaceNode19)"))&&(X(X(("(Node6WantsToMan...362
Formula 0 simplified : G!"(Node27HasAskedItsLeafSetToRx1ToReplaceNode22<=Node25ThinksNode22ShouldBeNodeMasterToReplaceNode19)" | XX(!"(Node6WantsToManageTh...351
Detected timeout of ITS tools.
[2024-05-25 16:19:33] [INFO ] Flatten gal took : 417 ms
[2024-05-25 16:19:33] [INFO ] Applying decomposition
[2024-05-25 16:19:34] [INFO ] Flatten gal took : 430 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2061891685109987100.txt' '-o' '/tmp/graph2061891685109987100.bin' '-w' '/tmp/graph2061891685109987100.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2061891685109987100.bin' '-l' '-1' '-v' '-w' '/tmp/graph2061891685109987100.weights' '-q' '0' '-e' '0.001'
[2024-05-25 16:19:35] [INFO ] Decomposing Gal with order
[2024-05-25 16:19:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 16:19:39] [INFO ] Removed a total of 15364 redundant transitions.
[2024-05-25 16:19:39] [INFO ] Flatten gal took : 2583 ms
[2024-05-25 16:19:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 1267 labels/synchronizations in 441 ms.
[2024-05-25 16:19:41] [INFO ] Time to serialize gal into /tmp/LTL13653639104416824294.gal : 96 ms
[2024-05-25 16:19:41] [INFO ] Time to serialize properties into /tmp/LTL7405136328975777020.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13653639104416824294.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7405136328975777020.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("(gu725.Node27HasAskedItsLeafSetToRx1ToReplaceNode22<=gu725.Node25ThinksNode22ShouldBeNodeMasterToReplaceNode19)"))&&(X(X(("(gi0...406
Formula 0 simplified : G!"(gu725.Node27HasAskedItsLeafSetToRx1ToReplaceNode22<=gu725.Node25ThinksNode22ShouldBeNodeMasterToReplaceNode19)" | XX(!"(gi0.gu0....395
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16063925761670449066
[2024-05-25 16:19:56] [INFO ] Built C files in 103ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16063925761670449066
Running compilation step : cd /tmp/ltsmin16063925761670449066;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16063925761670449066;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16063925761670449066;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property MultiCrashLeafsetExtension-PT-S32C02-LTLCardinality-13 finished in 214964 ms.
[2024-05-25 16:19:59] [INFO ] Flatten gal took : 412 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10416940144735852832
[2024-05-25 16:20:00] [INFO ] Too many transitions (15794) to apply POR reductions. Disabling POR matrices.
[2024-05-25 16:20:00] [INFO ] Built C files in 112ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10416940144735852832
Running compilation step : cd /tmp/ltsmin10416940144735852832;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-25 16:20:00] [INFO ] Applying decomposition
[2024-05-25 16:20:00] [INFO ] Flatten gal took : 433 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph436920480399177152.txt' '-o' '/tmp/graph436920480399177152.bin' '-w' '/tmp/graph436920480399177152.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph436920480399177152.bin' '-l' '-1' '-v' '-w' '/tmp/graph436920480399177152.weights' '-q' '0' '-e' '0.001'
[2024-05-25 16:20:01] [INFO ] Decomposing Gal with order
[2024-05-25 16:20:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 16:20:04] [INFO ] Removed a total of 13775 redundant transitions.
[2024-05-25 16:20:05] [INFO ] Flatten gal took : 1569 ms
[2024-05-25 16:20:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 1794 labels/synchronizations in 358 ms.
[2024-05-25 16:20:07] [INFO ] Time to serialize gal into /tmp/LTLCardinality2757770554513267319.gal : 90 ms
[2024-05-25 16:20:07] [INFO ] Time to serialize properties into /tmp/LTLCardinality15644199255189995750.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2757770554513267319.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15644199255189995750.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !(((F("(gu712.Node27HasAskedItsLeafSetToRx1ToReplaceNode22<=gu712.Node25ThinksNode22ShouldBeNodeMasterToReplaceNode19)"))&&(X(X(("(gi0...410
Formula 0 simplified : G!"(gu712.Node27HasAskedItsLeafSetToRx1ToReplaceNode22<=gu712.Node25ThinksNode22ShouldBeNodeMasterToReplaceNode19)" | XX(!"(gi0.gi0....399
Compilation finished in 149616 ms.
Running link step : cd /tmp/ltsmin10416940144735852832;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 135 ms.
Running LTSmin : cd /tmp/ltsmin10416940144735852832;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true))&&X(X(((LTLAPp1==true) U []((LTLAPp2==true))))))' '--buchi-type=spotba'
LTSmin run took 618094 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C02-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1344883 ms.

BK_STOP 1716654769389

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is MultiCrashLeafsetExtension-PT-S32C02, 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 r263-tall-171654372000092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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