Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 50M
-rw-r--r-- 1 mcc users 9.2K Feb 26 01:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 01:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 00:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 00:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 01:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 26 01:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 26 01:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 49M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678383084034

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-090
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-09 17:31:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 17:31:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 17:31:26] [INFO ] Load time of PNML (sax parser for PT used): 934 ms
[2023-03-09 17:31:26] [INFO ] Transformed 17284 places.
[2023-03-09 17:31:26] [INFO ] Transformed 49140 transitions.
[2023-03-09 17:31:26] [INFO ] Parsed PT model containing 17284 places and 49140 transitions and 131400 arcs in 1204 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 40 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 4 resets, run finished after 1099 ms. (steps per millisecond=9 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
[2023-03-09 17:31:29] [INFO ] Flatten gal took : 1459 ms
[2023-03-09 17:31:30] [INFO ] Flatten gal took : 1058 ms
[2023-03-09 17:31:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1405890584537849495.gal : 372 ms
[2023-03-09 17:31:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16684850129990067966.prop : 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.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1405890584537849495.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16684850129990067966.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Interrupted probabilistic random walk after 69886 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 69886 steps, saw 68869 distinct states, run finished after 3003 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 49140 rows 17284 cols
Loading property file /tmp/ReachabilityCardinality16684850129990067966.prop.
[2023-03-09 17:31:45] [INFO ] Computed 93 place invariants in 13910 ms
[2023-03-09 17:31:52] [INFO ] After 6467ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-09 17:31:58] [INFO ] [Nat]Absence check using 91 positive place invariants in 282 ms returned sat
[2023-03-09 17:31:59] [INFO ] [Nat]Absence check using 91 positive and 2 generalized place invariants in 509 ms returned sat
[2023-03-09 17:32:17] [INFO ] After 13723ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-09 17:32:17] [INFO ] State equation strengthened by 16110 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-09 17:32:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 17:32:17] [INFO ] After 25272ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:16
Fused 16 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 242 out of 17284 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17284/17284 places, 49140/49140 transitions.
Graph (complete) has 66151 edges and 17284 vertex of which 17283 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.50 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 585 transitions
Trivial Post-agglo rules discarded 585 transitions
Performed 585 trivial Post agglomeration. Transition count delta: 585
Iterating post reduction 0 with 585 rules applied. Total rules applied 586 place count 17283 transition count 48555
Reduce places removed 585 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 1 with 600 rules applied. Total rules applied 1186 place count 16698 transition count 48540
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 1201 place count 16683 transition count 48540
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 1201 place count 16683 transition count 48531
Deduced a syphon composed of 9 places in 16 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 1219 place count 16674 transition count 48531
Performed 7462 Post agglomeration using F-continuation condition.Transition count delta: 7462
Deduced a syphon composed of 7462 places in 26 ms
Reduce places removed 7462 places and 0 transitions.
Iterating global reduction 3 with 14924 rules applied. Total rules applied 16143 place count 9212 transition count 41069
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 16153 place count 9212 transition count 41059
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 16163 place count 9202 transition count 41059
Partial Free-agglomeration rule applied 8765 times.
Drop transitions removed 8765 transitions
Iterating global reduction 4 with 8765 rules applied. Total rules applied 24928 place count 9202 transition count 41059
Partial Free-agglomeration rule applied 560 times.
Drop transitions removed 560 transitions
Iterating global reduction 4 with 560 rules applied. Total rules applied 25488 place count 9202 transition count 41059
Applied a total of 25488 rules in 23489 ms. Remains 9202 /17284 variables (removed 8082) and now considering 41059/49140 (removed 8081) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23496 ms. Remains : 9202/17284 places, 41059/49140 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 830 ms. (steps per millisecond=12 ) properties (out of 16) seen :1
FORMULA CANInsertWithFailure-PT-090-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 88487 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{0=1}
Probabilistic random walk after 88487 steps, saw 85694 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :1
FORMULA CANInsertWithFailure-PT-090-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 14 properties.
[2023-03-09 17:32:44] [INFO ] Flow matrix only has 40962 transitions (discarded 97 similar events)
// Phase 1: matrix 40962 rows 9202 cols
[2023-03-09 17:32:49] [INFO ] Computed 92 place invariants in 4103 ms
[2023-03-09 17:32:52] [INFO ] After 3506ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-09 17:32:56] [INFO ] [Nat]Absence check using 90 positive place invariants in 141 ms returned sat
[2023-03-09 17:32:56] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 187 ms returned sat
[2023-03-09 17:33:17] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 194 out of 9202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9202/9202 places, 41059/41059 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 9202 transition count 41058
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 9201 transition count 41057
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 9200 transition count 41057
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 11 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 50 place count 9177 transition count 41034
Partial Free-agglomeration rule applied 383 times.
Drop transitions removed 383 transitions
Iterating global reduction 3 with 383 rules applied. Total rules applied 433 place count 9177 transition count 41034
Partial Free-agglomeration rule applied 263 times.
Drop transitions removed 263 transitions
Iterating global reduction 3 with 263 rules applied. Total rules applied 696 place count 9177 transition count 41034
Applied a total of 696 rules in 12183 ms. Remains 9177 /9202 variables (removed 25) and now considering 41034/41059 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12183 ms. Remains : 9177/9202 places, 41034/41059 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 988 ms. (steps per millisecond=10 ) properties (out of 14) seen :2
FORMULA CANInsertWithFailure-PT-090-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-090-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-09 17:33:31] [INFO ] Flow matrix only has 40957 transitions (discarded 77 similar events)
// Phase 1: matrix 40957 rows 9177 cols
[2023-03-09 17:33:35] [INFO ] Computed 92 place invariants in 3805 ms
[2023-03-09 17:33:37] [INFO ] After 2820ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-09 17:33:40] [INFO ] [Nat]Absence check using 90 positive place invariants in 164 ms returned sat
[2023-03-09 17:33:40] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 184 ms returned sat
[2023-03-09 17:34:02] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 131 out of 9177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9177/9177 places, 41034/41034 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 9177 transition count 41032
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 9175 transition count 41032
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 12 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 68 place count 9143 transition count 41000
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 9143 transition count 40999
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 9142 transition count 40999
Partial Free-agglomeration rule applied 31 times.
Drop transitions removed 31 transitions
Iterating global reduction 3 with 31 rules applied. Total rules applied 101 place count 9142 transition count 40999
Applied a total of 101 rules in 12341 ms. Remains 9142 /9177 variables (removed 35) and now considering 40999/41034 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12341 ms. Remains : 9142/9177 places, 40999/41034 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 681 ms. (steps per millisecond=14 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :1
FORMULA CANInsertWithFailure-PT-090-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 92488 steps, run timeout after 3002 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 92488 steps, saw 89789 distinct states, run finished after 3002 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 11 properties.
[2023-03-09 17:34:19] [INFO ] Flow matrix only has 40946 transitions (discarded 53 similar events)
// Phase 1: matrix 40946 rows 9142 cols
[2023-03-09 17:34:23] [INFO ] Computed 92 place invariants in 3961 ms
[2023-03-09 17:34:26] [INFO ] After 2792ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-09 17:34:28] [INFO ] [Nat]Absence check using 90 positive place invariants in 137 ms returned sat
[2023-03-09 17:34:29] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 185 ms returned sat
[2023-03-09 17:34:51] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 127 out of 9142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9142/9142 places, 40999/40999 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 9141 transition count 40998
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 9141 transition count 40998
Applied a total of 5 rules in 8751 ms. Remains 9141 /9142 variables (removed 1) and now considering 40998/40999 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8753 ms. Remains : 9141/9142 places, 40998/40999 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 779 ms. (steps per millisecond=12 ) properties (out of 11) seen :1
FORMULA CANInsertWithFailure-PT-090-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 87269 steps, run timeout after 3002 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 87269 steps, saw 84767 distinct states, run finished after 3003 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 10 properties.
[2023-03-09 17:35:04] [INFO ] Flow matrix only has 40948 transitions (discarded 50 similar events)
// Phase 1: matrix 40948 rows 9141 cols
[2023-03-09 17:35:07] [INFO ] Computed 92 place invariants in 3495 ms
[2023-03-09 17:35:09] [INFO ] After 2430ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-09 17:35:12] [INFO ] [Nat]Absence check using 90 positive place invariants in 125 ms returned sat
[2023-03-09 17:35:12] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 187 ms returned sat
[2023-03-09 17:35:34] [INFO ] After 20574ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-09 17:35:35] [INFO ] State equation strengthened by 39362 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-09 17:35:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 17:35:35] [INFO ] After 25560ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 125 out of 9141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9141/9141 places, 40998/40998 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 9141 transition count 40998
Applied a total of 2 rules in 6164 ms. Remains 9141 /9141 variables (removed 0) and now considering 40998/40998 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6165 ms. Remains : 9141/9141 places, 40998/40998 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 625 ms. (steps per millisecond=16 ) properties (out of 10) seen :1
FORMULA CANInsertWithFailure-PT-090-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-09 17:35:42] [INFO ] Flow matrix only has 40949 transitions (discarded 49 similar events)
// Phase 1: matrix 40949 rows 9141 cols
[2023-03-09 17:35:46] [INFO ] Computed 92 place invariants in 3396 ms
[2023-03-09 17:35:48] [INFO ] After 2261ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-09 17:35:50] [INFO ] [Nat]Absence check using 90 positive place invariants in 97 ms returned sat
[2023-03-09 17:35:50] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 182 ms returned sat
[2023-03-09 17:36:13] [INFO ] After 20956ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-09 17:36:13] [INFO ] State equation strengthened by 39365 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-09 17:36:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 17:36:13] [INFO ] After 25355ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 122 out of 9141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9141/9141 places, 40998/40998 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 9140 transition count 40997
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 9140 transition count 40997
Applied a total of 4 rules in 8326 ms. Remains 9140 /9141 variables (removed 1) and now considering 40997/40998 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8326 ms. Remains : 9140/9141 places, 40997/40998 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 469 ms. (steps per millisecond=21 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 109574 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 109574 steps, saw 105597 distinct states, run finished after 3002 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 9 properties.
[2023-03-09 17:36:25] [INFO ] Flow matrix only has 40950 transitions (discarded 47 similar events)
// Phase 1: matrix 40950 rows 9140 cols
[2023-03-09 17:36:29] [INFO ] Computed 92 place invariants in 3574 ms
[2023-03-09 17:36:31] [INFO ] After 2244ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-09 17:36:33] [INFO ] [Nat]Absence check using 90 positive place invariants in 126 ms returned sat
[2023-03-09 17:36:34] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 183 ms returned sat
[2023-03-09 17:36:56] [INFO ] After 25014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 122 out of 9140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9140/9140 places, 40997/40997 transitions.
Applied a total of 0 rules in 2951 ms. Remains 9140 /9140 variables (removed 0) and now considering 40997/40997 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2951 ms. Remains : 9140/9140 places, 40997/40997 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9140/9140 places, 40997/40997 transitions.
Applied a total of 0 rules in 2919 ms. Remains 9140 /9140 variables (removed 0) and now considering 40997/40997 (removed 0) transitions.
[2023-03-09 17:37:02] [INFO ] Flow matrix only has 40950 transitions (discarded 47 similar events)
[2023-03-09 17:37:02] [INFO ] Invariant cache hit.
[2023-03-09 17:37:09] [INFO ] Implicit Places using invariants in 7511 ms returned []
Implicit Place search using SMT only with invariants took 7515 ms to find 0 implicit places.
[2023-03-09 17:37:09] [INFO ] Flow matrix only has 40950 transitions (discarded 47 similar events)
[2023-03-09 17:37:09] [INFO ] Invariant cache hit.
[2023-03-09 17:37:10] [INFO ] Dead Transitions using invariants and state equation in 869 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11311 ms. Remains : 9140/9140 places, 40997/40997 transitions.
Graph (trivial) has 38372 edges and 9140 vertex of which 7836 / 9140 are part of one of the 2 SCC in 21 ms
Free SCC test removed 7834 places
Drop transitions removed 28841 transitions
Ensure Unique test removed 8052 transitions
Reduce isomorphic transitions removed 36893 transitions.
Graph (complete) has 4846 edges and 1306 vertex of which 1050 are kept as prefixes of interest. Removing 256 places using SCC suffix rule.1 ms
Discarding 256 places :
Also discarding 81 output transitions
Drop transitions removed 81 transitions
Drop transitions removed 782 transitions
Reduce isomorphic transitions removed 782 transitions.
Iterating post reduction 0 with 782 rules applied. Total rules applied 784 place count 1050 transition count 3241
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 784 place count 1050 transition count 3238
Deduced a syphon composed of 3 places in 11 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 790 place count 1047 transition count 3238
Discarding 651 places :
Symmetric choice reduction at 1 with 651 rule applications. Total rules 1441 place count 396 transition count 1534
Iterating global reduction 1 with 651 rules applied. Total rules applied 2092 place count 396 transition count 1534
Ensure Unique test removed 401 transitions
Reduce isomorphic transitions removed 401 transitions.
Iterating post reduction 1 with 401 rules applied. Total rules applied 2493 place count 396 transition count 1133
Discarding 160 places :
Symmetric choice reduction at 2 with 160 rule applications. Total rules 2653 place count 236 transition count 813
Iterating global reduction 2 with 160 rules applied. Total rules applied 2813 place count 236 transition count 813
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Iterating post reduction 2 with 160 rules applied. Total rules applied 2973 place count 236 transition count 653
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2975 place count 235 transition count 652
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 2979 place count 233 transition count 657
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2980 place count 233 transition count 656
Drop transitions removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 4 with 46 rules applied. Total rules applied 3026 place count 233 transition count 610
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 3027 place count 233 transition count 609
Reduce places removed 1 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 5 with 11 rules applied. Total rules applied 3038 place count 232 transition count 599
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 3049 place count 222 transition count 598
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3049 place count 222 transition count 597
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 3051 place count 221 transition count 597
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 3073 place count 210 transition count 586
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 3077 place count 210 transition count 582
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 3080 place count 210 transition count 579
Free-agglomeration rule applied 30 times with reduction of 1 identical transitions.
Iterating global reduction 8 with 30 rules applied. Total rules applied 3110 place count 210 transition count 548
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 8 with 70 rules applied. Total rules applied 3180 place count 180 transition count 508
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 3185 place count 180 transition count 503
Partial Free-agglomeration rule applied 21 times.
Drop transitions removed 21 transitions
Iterating global reduction 9 with 21 rules applied. Total rules applied 3206 place count 180 transition count 503
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 3213 place count 180 transition count 496
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 3214 place count 179 transition count 495
Iterating global reduction 10 with 1 rules applied. Total rules applied 3215 place count 179 transition count 495
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 10 with 3 rules applied. Total rules applied 3218 place count 176 transition count 492
Applied a total of 3218 rules in 1439 ms. Remains 176 /9140 variables (removed 8964) and now considering 492/40997 (removed 40505) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 492 rows 176 cols
[2023-03-09 17:37:12] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 17:37:12] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-09 17:37:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-09 17:37:12] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-09 17:37:12] [INFO ] After 319ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 128 ms.
[2023-03-09 17:37:13] [INFO ] After 514ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
[2023-03-09 17:37:13] [INFO ] Flatten gal took : 9 ms
[2023-03-09 17:37:13] [INFO ] Flatten gal took : 8 ms
[2023-03-09 17:37:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3505187369703138839.gal : 2 ms
[2023-03-09 17:37:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17165422564538163273.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3505187369703138839.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17165422564538163273.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality17165422564538163273.prop.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :4 after 9
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :9 after 95
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :95 after 177
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :177 after 1680
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :1680 after 14266
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :14266 after 134140
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :134140 after 446184
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :446184 after 1.39757e+07
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :1.39757e+07 after 1.75499e+08
Detected timeout of ITS tools.
[2023-03-09 17:37:28] [INFO ] Flatten gal took : 7 ms
[2023-03-09 17:37:28] [INFO ] Applying decomposition
[2023-03-09 17:37:28] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5049252100421357354.txt' '-o' '/tmp/graph5049252100421357354.bin' '-w' '/tmp/graph5049252100421357354.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5049252100421357354.bin' '-l' '-1' '-v' '-w' '/tmp/graph5049252100421357354.weights' '-q' '0' '-e' '0.001'
[2023-03-09 17:37:28] [INFO ] Decomposing Gal with order
[2023-03-09 17:37:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 17:37:28] [INFO ] Removed a total of 226 redundant transitions.
[2023-03-09 17:37:28] [INFO ] Flatten gal took : 85 ms
[2023-03-09 17:37:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 93 labels/synchronizations in 8 ms.
[2023-03-09 17:37:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7362166177426214657.gal : 4 ms
[2023-03-09 17:37:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17596935355070370399.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7362166177426214657.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17596935355070370399.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality17596935355070370399.prop.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :4 after 16
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :16 after 85
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :85 after 320
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :320 after 1080
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :1080 after 12627
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :12627 after 43526
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :43526 after 329048
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :329048 after 5.76886e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5371865130162250183
[2023-03-09 17:37:43] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5371865130162250183
Running compilation step : cd /tmp/ltsmin5371865130162250183;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 823 ms.
Running link step : cd /tmp/ltsmin5371865130162250183;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin5371865130162250183;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'CANInsertWithFailurePT090ReachabilityCardinality01==true'
LTSmin run took 6456 ms.
Found Violation
Running LTSmin : cd /tmp/ltsmin5371865130162250183;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'CANInsertWithFailurePT090ReachabilityCardinality03==true'
LTSmin run took 6809 ms.
Found Violation
Running LTSmin : cd /tmp/ltsmin5371865130162250183;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'CANInsertWithFailurePT090ReachabilityCardinality04==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-09 17:37:59] [INFO ] Flatten gal took : 1209 ms
[2023-03-09 17:37:59] [INFO ] Applying decomposition
[2023-03-09 17:38:00] [INFO ] Flatten gal took : 883 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12427651199581253984.txt' '-o' '/tmp/graph12427651199581253984.bin' '-w' '/tmp/graph12427651199581253984.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12427651199581253984.bin' '-l' '-1' '-v' '-w' '/tmp/graph12427651199581253984.weights' '-q' '0' '-e' '0.001'
[2023-03-09 17:38:03] [INFO ] Decomposing Gal with order
[2023-03-09 17:38:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 17:38:10] [INFO ] Removed a total of 25270 redundant transitions.
[2023-03-09 17:38:11] [INFO ] Flatten gal took : 4346 ms
[2023-03-09 17:38:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 16250 labels/synchronizations in 4932 ms.
[2023-03-09 17:38:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9019108382786124404.gal : 166 ms
[2023-03-09 17:38:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3188908725809564277.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9019108382786124404.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3188908725809564277.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality3188908725809564277.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 56
Detected timeout of ITS tools.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 3
Detected timeout of ITS tools.
[2023-03-09 18:08:22] [INFO ] Flatten gal took : 910 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13430320954819466682
[2023-03-09 18:08:22] [INFO ] Too many transitions (40997) to apply POR reductions. Disabling POR matrices.
[2023-03-09 18:08:23] [INFO ] Built C files in 623ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13430320954819466682
Running compilation step : cd /tmp/ltsmin13430320954819466682;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '80' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-09 18:08:23] [INFO ] Applying decomposition
[2023-03-09 18:08:24] [INFO ] Flatten gal took : 964 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4992512879801673349.txt' '-o' '/tmp/graph4992512879801673349.bin' '-w' '/tmp/graph4992512879801673349.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4992512879801673349.bin' '-l' '-1' '-v' '-w' '/tmp/graph4992512879801673349.weights' '-q' '0' '-e' '0.001'
[2023-03-09 18:08:25] [INFO ] Decomposing Gal with order
[2023-03-09 18:08:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 18:08:30] [INFO ] Removed a total of 48203 redundant transitions.
[2023-03-09 18:08:31] [INFO ] Flatten gal took : 3701 ms
[2023-03-09 18:08:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 33293 labels/synchronizations in 6183 ms.
[2023-03-09 18:08:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3109119400823117607.gal : 196 ms
[2023-03-09 18:08:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1598893596053823571.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3109119400823117607.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1598893596053823571.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality1598893596053823571.prop.
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/ltsmin13430320954819466682;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '80' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 80 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13430320954819466682;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '80' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 80 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)
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :8 after 9
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :9 after 10
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :10 after 15
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :15 after 39
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :39 after 47
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :47 after 51
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :51 after 73
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :73 after 111
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :111 after 119
SDD proceeding with computation,9 properties remain. new max is 4096
SDD size :119 after 123
SDD proceeding with computation,9 properties remain. new max is 8192
SDD size :123 after 194
SDD proceeding with computation,9 properties remain. new max is 16384
SDD size :194 after 333
SDD proceeding with computation,9 properties remain. new max is 32768
SDD size :333 after 555
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 6718656 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16016132 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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="CANInsertWithFailure-PT-090"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is CANInsertWithFailure-PT-090, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r037-tajo-167813690800774"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-090.tgz
mv CANInsertWithFailure-PT-090 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;