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-167813690800750.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-060, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690800750
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 23M
-rw-r--r-- 1 mcc users 9.2K Feb 26 00:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 00:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 00:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 00:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K 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 22K Feb 26 01:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 180K Feb 26 01:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 26 01:02 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 22M 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-060-ReachabilityCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-060-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678379464423

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-060
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-09 16:31:05] [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 16:31:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 16:31:06] [INFO ] Load time of PNML (sax parser for PT used): 535 ms
[2023-03-09 16:31:06] [INFO ] Transformed 7924 places.
[2023-03-09 16:31:06] [INFO ] Transformed 21960 transitions.
[2023-03-09 16:31:06] [INFO ] Parsed PT model containing 7924 places and 21960 transitions and 58800 arcs in 688 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 6 resets, run finished after 941 ms. (steps per millisecond=10 ) properties (out of 16) seen :2
FORMULA CANInsertWithFailure-PT-060-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-060-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 14) 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 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 14) 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 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 14) 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 14) 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 14) 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 14) seen :0
[2023-03-09 16:31:08] [INFO ] Flatten gal took : 830 ms
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) 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 14) 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 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 21960 rows 7924 cols
[2023-03-09 16:31:08] [INFO ] Flatten gal took : 499 ms
[2023-03-09 16:31:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13924026790619840998.gal : 131 ms
[2023-03-09 16:31:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12410509103256243229.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/ReachabilityCardinality13924026790619840998.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12410509103256243229.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 ...330
[2023-03-09 16:31:10] [INFO ] Computed 63 place invariants in 2582 ms
Loading property file /tmp/ReachabilityCardinality12410509103256243229.prop.
[2023-03-09 16:31:13] [INFO ] After 2745ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-09 16:31:16] [INFO ] [Nat]Absence check using 61 positive place invariants in 160 ms returned sat
[2023-03-09 16:31:16] [INFO ] [Nat]Absence check using 61 positive and 2 generalized place invariants in 143 ms returned sat
[2023-03-09 16:31:38] [INFO ] After 20365ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-09 16:31:38] [INFO ] State equation strengthened by 7140 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 16:31:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 16:31:38] [INFO ] After 25284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
Fused 14 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 129 ms.
Support contains 372 out of 7924 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7924/7924 places, 21960/21960 transitions.
Graph (complete) has 29701 edges and 7924 vertex of which 7923 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.49 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 356 transitions
Trivial Post-agglo rules discarded 356 transitions
Performed 356 trivial Post agglomeration. Transition count delta: 356
Iterating post reduction 0 with 356 rules applied. Total rules applied 357 place count 7923 transition count 21604
Reduce places removed 356 places and 0 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 1 with 379 rules applied. Total rules applied 736 place count 7567 transition count 21581
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 759 place count 7544 transition count 21581
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 759 place count 7544 transition count 21572
Deduced a syphon composed of 9 places in 25 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 777 place count 7535 transition count 21572
Performed 3201 Post agglomeration using F-continuation condition.Transition count delta: 3201
Deduced a syphon composed of 3201 places in 25 ms
Reduce places removed 3201 places and 0 transitions.
Iterating global reduction 3 with 6402 rules applied. Total rules applied 7179 place count 4334 transition count 18371
Drop transitions removed 3104 transitions
Redundant transition composition rules discarded 3104 transitions
Iterating global reduction 3 with 3104 rules applied. Total rules applied 10283 place count 4334 transition count 15267
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 10291 place count 4334 transition count 15259
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 10299 place count 4326 transition count 15259
Partial Free-agglomeration rule applied 3879 times.
Drop transitions removed 3879 transitions
Iterating global reduction 4 with 3879 rules applied. Total rules applied 14178 place count 4326 transition count 15259
Partial Free-agglomeration rule applied 411 times.
Drop transitions removed 411 transitions
Iterating global reduction 4 with 411 rules applied. Total rules applied 14589 place count 4326 transition count 15259
Applied a total of 14589 rules in 10587 ms. Remains 4326 /7924 variables (removed 3598) and now considering 15259/21960 (removed 6701) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10605 ms. Remains : 4326/7924 places, 15259/21960 transitions.
Incomplete random walk after 10000 steps, including 29 resets, run finished after 700 ms. (steps per millisecond=14 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 14) seen :1
FORMULA CANInsertWithFailure-PT-060-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 101166 steps, run timeout after 3005 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 101166 steps, saw 95414 distinct states, run finished after 3008 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 15259 rows 4326 cols
[2023-03-09 16:31:55] [INFO ] Computed 62 place invariants in 734 ms
[2023-03-09 16:31:56] [INFO ] After 1535ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-09 16:31:58] [INFO ] [Nat]Absence check using 60 positive place invariants in 81 ms returned sat
[2023-03-09 16:31:58] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 92 ms returned sat
[2023-03-09 16:32:21] [INFO ] After 21864ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-09 16:32:21] [INFO ] State equation strengthened by 12851 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 16:32:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 16:32:21] [INFO ] After 25057ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
Parikh walk visited 0 properties in 1569 ms.
Support contains 350 out of 4326 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4326/4326 places, 15259/15259 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 4326 transition count 15258
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4325 transition count 15258
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 22 place count 4315 transition count 15248
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 4315 transition count 15247
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 4315 transition count 15246
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 4314 transition count 15246
Partial Free-agglomeration rule applied 75 times.
Drop transitions removed 75 transitions
Iterating global reduction 3 with 75 rules applied. Total rules applied 100 place count 4314 transition count 15246
Applied a total of 100 rules in 3932 ms. Remains 4314 /4326 variables (removed 12) and now considering 15246/15259 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3932 ms. Remains : 4314/4326 places, 15246/15259 transitions.
Incomplete random walk after 10000 steps, including 28 resets, run finished after 728 ms. (steps per millisecond=13 ) properties (out of 13) seen :1
FORMULA CANInsertWithFailure-PT-060-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) 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 :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 66 ms. (steps per millisecond=151 ) 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 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 54 ms. (steps per millisecond=185 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 59049 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 59049 steps, saw 51052 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 15246 rows 4314 cols
[2023-03-09 16:32:32] [INFO ] Computed 62 place invariants in 972 ms
[2023-03-09 16:32:34] [INFO ] After 1380ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-09 16:32:35] [INFO ] [Nat]Absence check using 60 positive place invariants in 57 ms returned sat
[2023-03-09 16:32:35] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 69 ms returned sat
[2023-03-09 16:32:51] [INFO ] After 15647ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-09 16:32:52] [INFO ] State equation strengthened by 12876 read => feed constraints.
[2023-03-09 16:32:59] [INFO ] After 7364ms SMT Verify possible using 12876 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-09 16:32:59] [INFO ] After 7366ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-09 16:32:59] [INFO ] After 25058ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 1131 ms.
Support contains 338 out of 4314 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4314/4314 places, 15246/15246 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 4309 transition count 15241
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 17 place count 4309 transition count 15241
Applied a total of 17 rules in 1737 ms. Remains 4309 /4314 variables (removed 5) and now considering 15241/15246 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1738 ms. Remains : 4309/4314 places, 15241/15246 transitions.
Incomplete random walk after 10000 steps, including 29 resets, run finished after 423 ms. (steps per millisecond=23 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 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 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 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 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 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 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 20 ms. (steps per millisecond=500 ) 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
Interrupted probabilistic random walk after 64014 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 64014 steps, saw 51977 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 15241 rows 4309 cols
[2023-03-09 16:33:06] [INFO ] Computed 62 place invariants in 880 ms
[2023-03-09 16:33:08] [INFO ] After 1385ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-09 16:33:09] [INFO ] [Nat]Absence check using 60 positive place invariants in 60 ms returned sat
[2023-03-09 16:33:09] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 65 ms returned sat
[2023-03-09 16:33:24] [INFO ] After 13772ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-09 16:33:24] [INFO ] State equation strengthened by 12892 read => feed constraints.
[2023-03-09 16:33:33] [INFO ] After 8983ms SMT Verify possible using 12892 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-09 16:33:33] [INFO ] After 8985ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-09 16:33:33] [INFO ] After 25057ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
FORMULA CANInsertWithFailure-PT-060-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 3
Parikh walk visited 1 properties in 919 ms.
Support contains 334 out of 4309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4309/4309 places, 15241/15241 transitions.
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :5 after 7
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 4307 transition count 15239
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :7 after 9
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :9 after 11
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 4307 transition count 15239
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :11 after 13
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :13 after 17
Applied a total of 7 rules in 1660 ms. Remains 4307 /4309 variables (removed 2) and now considering 15239/15241 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1662 ms. Remains : 4307/4309 places, 15239/15241 transitions.
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :17 after 23
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :23 after 35
Incomplete random walk after 10000 steps, including 28 resets, run finished after 413 ms. (steps per millisecond=24 ) properties (out of 11) seen :2
FORMULA CANInsertWithFailure-PT-060-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-060-ReachabilityCardinality-12 FALSE 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 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 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 22 ms. (steps per millisecond=454 ) 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 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :35 after 57
// Phase 1: matrix 15239 rows 4307 cols
[2023-03-09 16:33:37] [INFO ] Computed 62 place invariants in 945 ms
[2023-03-09 16:33:39] [INFO ] After 1495ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-09 16:33:40] [INFO ] [Nat]Absence check using 60 positive place invariants in 51 ms returned sat
[2023-03-09 16:33:40] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 68 ms returned sat
SDD proceeding with computation,14 properties remain. new max is 4096
SDD size :57 after 115
SDD proceeding with computation,14 properties remain. new max is 8192
SDD size :115 after 132
SDD proceeding with computation,14 properties remain. new max is 16384
SDD size :132 after 162
[2023-03-09 16:33:58] [INFO ] After 17512ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-09 16:33:58] [INFO ] State equation strengthened by 13014 read => feed constraints.
[2023-03-09 16:34:04] [INFO ] After 5685ms SMT Verify possible using 13014 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-09 16:34:04] [INFO ] After 5687ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-09 16:34:04] [INFO ] After 25053ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
FORMULA CANInsertWithFailure-PT-060-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 605 ms.
Support contains 208 out of 4307 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4307/4307 places, 15239/15239 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 4307 transition count 15236
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 4304 transition count 15235
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 4303 transition count 15235
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 4 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 130 place count 4242 transition count 15174
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 132 place count 4242 transition count 15172
Partial Free-agglomeration rule applied 63 times.
Drop transitions removed 63 transitions
Iterating global reduction 3 with 63 rules applied. Total rules applied 195 place count 4242 transition count 15172
Applied a total of 195 rules in 2486 ms. Remains 4242 /4307 variables (removed 65) and now considering 15172/15239 (removed 67) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2486 ms. Remains : 4242/4307 places, 15172/15239 transitions.
Incomplete random walk after 10000 steps, including 30 resets, run finished after 379 ms. (steps per millisecond=26 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 71003 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 71003 steps, saw 54629 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 15172 rows 4242 cols
[2023-03-09 16:34:11] [INFO ] Computed 62 place invariants in 669 ms
[2023-03-09 16:34:12] [INFO ] After 1067ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-09 16:34:14] [INFO ] [Nat]Absence check using 60 positive place invariants in 83 ms returned sat
[2023-03-09 16:34:14] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 77 ms returned sat
SDD proceeding with computation,14 properties remain. new max is 32768
SDD size :162 after 6552
SDD proceeding with computation,14 properties remain. new max is 65536
SDD size :6552 after 7650
[2023-03-09 16:34:26] [INFO ] After 11671ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-09 16:34:26] [INFO ] State equation strengthened by 13592 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.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:644)
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 16:34:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 16:34:37] [INFO ] After 25078ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 460 ms.
Support contains 208 out of 4242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4242/4242 places, 15172/15172 transitions.
Applied a total of 0 rules in 714 ms. Remains 4242 /4242 variables (removed 0) and now considering 15172/15172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 715 ms. Remains : 4242/4242 places, 15172/15172 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4242/4242 places, 15172/15172 transitions.
Applied a total of 0 rules in 702 ms. Remains 4242 /4242 variables (removed 0) and now considering 15172/15172 (removed 0) transitions.
[2023-03-09 16:34:39] [INFO ] Invariant cache hit.
[2023-03-09 16:34:42] [INFO ] Implicit Places using invariants in 2778 ms returned []
Implicit Place search using SMT only with invariants took 2785 ms to find 0 implicit places.
[2023-03-09 16:34:42] [INFO ] Invariant cache hit.
[2023-03-09 16:34:50] [INFO ] Dead Transitions using invariants and state equation in 8351 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11843 ms. Remains : 4242/4242 places, 15172/15172 transitions.
Graph (trivial) has 12955 edges and 4242 vertex of which 2902 / 4242 are part of one of the 2 SCC in 13 ms
Free SCC test removed 2900 places
Drop transitions removed 7684 transitions
Ensure Unique test removed 3347 transitions
Reduce isomorphic transitions removed 11031 transitions.
Graph (complete) has 4533 edges and 1342 vertex of which 1184 are kept as prefixes of interest. Removing 158 places using SCC suffix rule.1 ms
Discarding 158 places :
Also discarding 46 output transitions
Drop transitions removed 46 transitions
Drop transitions removed 499 transitions
Reduce isomorphic transitions removed 499 transitions.
Iterating post reduction 0 with 499 rules applied. Total rules applied 501 place count 1184 transition count 3596
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 501 place count 1184 transition count 3591
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 511 place count 1179 transition count 3591
Discarding 595 places :
Symmetric choice reduction at 1 with 595 rule applications. Total rules 1106 place count 584 transition count 2183
Iterating global reduction 1 with 595 rules applied. Total rules applied 1701 place count 584 transition count 2183
Ensure Unique test removed 467 transitions
Reduce isomorphic transitions removed 467 transitions.
Iterating post reduction 1 with 467 rules applied. Total rules applied 2168 place count 584 transition count 1716
Discarding 84 places :
Symmetric choice reduction at 2 with 84 rule applications. Total rules 2252 place count 500 transition count 1548
Iterating global reduction 2 with 84 rules applied. Total rules applied 2336 place count 500 transition count 1548
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 2 with 84 rules applied. Total rules applied 2420 place count 500 transition count 1464
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2422 place count 499 transition count 1463
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 2424 place count 498 transition count 1462
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2425 place count 498 transition count 1461
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 4 with 28 rules applied. Total rules applied 2453 place count 498 transition count 1433
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 2454 place count 498 transition count 1432
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2455 place count 497 transition count 1432
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 2459 place count 495 transition count 1430
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 2461 place count 495 transition count 1428
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 2462 place count 495 transition count 1427
Free-agglomeration rule applied 189 times with reduction of 11 identical transitions.
Iterating global reduction 7 with 189 rules applied. Total rules applied 2651 place count 495 transition count 1227
Reduce places removed 189 places and 0 transitions.
Ensure Unique test removed 241 transitions
Reduce isomorphic transitions removed 241 transitions.
Iterating post reduction 7 with 430 rules applied. Total rules applied 3081 place count 306 transition count 986
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 8 with 26 rules applied. Total rules applied 3107 place count 306 transition count 960
Partial Free-agglomeration rule applied 122 times.
Drop transitions removed 122 transitions
Iterating global reduction 8 with 122 rules applied. Total rules applied 3229 place count 306 transition count 960
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 3231 place count 306 transition count 958
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 3233 place count 304 transition count 955
Iterating global reduction 9 with 2 rules applied. Total rules applied 3235 place count 304 transition count 955
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 3236 place count 304 transition count 954
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 3237 place count 304 transition count 954
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 10 with 5 rules applied. Total rules applied 3242 place count 299 transition count 949
Applied a total of 3242 rules in 942 ms. Remains 299 /4242 variables (removed 3943) and now considering 949/15172 (removed 14223) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 949 rows 299 cols
[2023-03-09 16:34:51] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-09 16:34:52] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-09 16:34:52] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-09 16:34:52] [INFO ] After 490ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-09 16:34:52] [INFO ] After 835ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 285 ms.
[2023-03-09 16:34:53] [INFO ] After 1223ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2023-03-09 16:34:53] [INFO ] Flatten gal took : 15 ms
[2023-03-09 16:34:53] [INFO ] Flatten gal took : 15 ms
[2023-03-09 16:34:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8927649713375467693.gal : 3 ms
[2023-03-09 16:34:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality824136777129586425.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/ReachabilityCardinality8927649713375467693.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality824136777129586425.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 ...327
Loading property file /tmp/ReachabilityCardinality824136777129586425.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 10
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :10 after 13
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :13 after 109
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :109 after 197
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :197 after 291
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :291 after 1042
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :1042 after 5369
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :5369 after 48179
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :48179 after 749808
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :749808 after 7.94103e+06
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :7.94103e+06 after 6.81609e+07
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :6.81609e+07 after 7.91974e+07
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :7.91974e+07 after 3.90351e+09
Detected timeout of ITS tools.
[2023-03-09 16:35:08] [INFO ] Flatten gal took : 33 ms
[2023-03-09 16:35:08] [INFO ] Applying decomposition
[2023-03-09 16:35:08] [INFO ] Flatten gal took : 27 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/graph4323656961606675674.txt' '-o' '/tmp/graph4323656961606675674.bin' '-w' '/tmp/graph4323656961606675674.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4323656961606675674.bin' '-l' '-1' '-v' '-w' '/tmp/graph4323656961606675674.weights' '-q' '0' '-e' '0.001'
[2023-03-09 16:35:08] [INFO ] Decomposing Gal with order
[2023-03-09 16:35:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 16:35:08] [INFO ] Removed a total of 656 redundant transitions.
[2023-03-09 16:35:08] [INFO ] Flatten gal took : 114 ms
[2023-03-09 16:35:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 115 labels/synchronizations in 16 ms.
[2023-03-09 16:35:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1463354752436870665.gal : 7 ms
[2023-03-09 16:35:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10576663413143257585.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/ReachabilityCardinality1463354752436870665.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10576663413143257585.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/ReachabilityCardinality10576663413143257585.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :9 after 13
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :13 after 108
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :108 after 118
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :118 after 287
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :287 after 2082
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :2082 after 9487
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :9487 after 81110
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :81110 after 734306
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :734306 after 1.03135e+07
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16424886268583515655
[2023-03-09 16:35:24] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16424886268583515655
Running compilation step : cd /tmp/ltsmin16424886268583515655;'/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 1340 ms.
Running link step : cd /tmp/ltsmin16424886268583515655;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin16424886268583515655;'/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' 'CANInsertWithFailurePT060ReachabilityCardinality00==true'
LTSmin run took 2586 ms.
Found Violation
Running LTSmin : cd /tmp/ltsmin16424886268583515655;'/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' 'CANInsertWithFailurePT060ReachabilityCardinality02==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 16:35:39] [INFO ] Flatten gal took : 475 ms
[2023-03-09 16:35:39] [INFO ] Applying decomposition
[2023-03-09 16:35:40] [INFO ] Flatten gal took : 431 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/graph2447104170261806918.txt' '-o' '/tmp/graph2447104170261806918.bin' '-w' '/tmp/graph2447104170261806918.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2447104170261806918.bin' '-l' '-1' '-v' '-w' '/tmp/graph2447104170261806918.weights' '-q' '0' '-e' '0.001'
[2023-03-09 16:35:41] [INFO ] Decomposing Gal with order
[2023-03-09 16:35:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 16:35:43] [INFO ] Removed a total of 11297 redundant transitions.
[2023-03-09 16:35:44] [INFO ] Flatten gal took : 1498 ms
[2023-03-09 16:35:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 6904 labels/synchronizations in 1208 ms.
[2023-03-09 16:35:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9572037826978430128.gal : 103 ms
[2023-03-09 16:35:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8942853513923905823.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/ReachabilityCardinality9572037826978430128.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8942853513923905823.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/ReachabilityCardinality8942853513923905823.prop.
SDD proceeding with computation,14 properties remain. new max is 131072
SDD size :7650 after 381748
SDD proceeding with computation,14 properties remain. new max is 262144
SDD size :381748 after 386600
SDD proceeding with computation,14 properties remain. new max is 524288
SDD size :386600 after 403156
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :8 after 15
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :15 after 25
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :25 after 39
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :39 after 74
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :74 after 81
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :81 after 93
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :93 after 111
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :111 after 174
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :174 after 181
SDD proceeding with computation,14 properties remain. new max is 1048576
SDD size :403156 after 440858
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :181 after 7194
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :7194 after 7835
SDD proceeding with computation,8 properties remain. new max is 32768
SDD size :7835 after 9614
SDD proceeding with computation,8 properties remain. new max is 65536
SDD size :9614 after 12188
ITS-tools command line returned an error code 137
SDD proceeding with computation,8 properties remain. new max is 131072
SDD size :12188 after 481368
Detected timeout of ITS tools.
[2023-03-09 17:05:50] [INFO ] Flatten gal took : 1711 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin221956576817107388
[2023-03-09 17:05:50] [INFO ] Too many transitions (15172) to apply POR reductions. Disabling POR matrices.
[2023-03-09 17:05:55] [INFO ] Applying decomposition
[2023-03-09 17:05:55] [INFO ] Built C files in 4662ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin221956576817107388
Running compilation step : cd /tmp/ltsmin221956576817107388;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '90' '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 17:05:55] [INFO ] Flatten gal took : 866 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/graph14346407980096214810.txt' '-o' '/tmp/graph14346407980096214810.bin' '-w' '/tmp/graph14346407980096214810.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14346407980096214810.bin' '-l' '-1' '-v' '-w' '/tmp/graph14346407980096214810.weights' '-q' '0' '-e' '0.001'
[2023-03-09 17:05:58] [INFO ] Decomposing Gal with order
[2023-03-09 17:05:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 17:05:59] [INFO ] Removed a total of 12862 redundant transitions.
[2023-03-09 17:05:59] [INFO ] Flatten gal took : 1312 ms
[2023-03-09 17:06:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 6362 labels/synchronizations in 1607 ms.
[2023-03-09 17:06:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6891518921163849199.gal : 124 ms
[2023-03-09 17:06:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8367647749046436451.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/ReachabilityCardinality6891518921163849199.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8367647749046436451.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/ReachabilityCardinality8367647749046436451.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 4
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/ltsmin221956576817107388;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '90' '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 90 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin221956576817107388;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '90' '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 90 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,8 properties remain. new max is 8
SDD size :4 after 1030
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :1030 after 1031
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :1031 after 1033
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :1033 after 1035
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :1035 after 1036
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :1036 after 1039
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :1039 after 1041
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :1041 after 1046
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :1046 after 1069
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :1069 after 1150
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :1150 after 1318
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :1318 after 1630
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 5610660 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16062388 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-060"
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-060, 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-167813690800750"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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