Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r453-smll-167912645500502.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is StigmergyCommit-PT-08b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r453-smll-167912645500502
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 39M
-rw-r--r-- 1 mcc users 6.4K Feb 26 11:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 11:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 11:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 11:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 11:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Feb 26 11:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 11:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 11:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 38M Mar 5 18:23 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 StigmergyCommit-PT-08b-ReachabilityCardinality-00
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-01
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-02
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-03
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-04
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-05
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-06
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-07
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-08
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-09
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-10
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-11
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-12
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-13
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-14
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679371471114

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=StigmergyCommit-PT-08b
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-21 04:04:34] [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-21 04:04:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 04:04:36] [INFO ] Load time of PNML (sax parser for PT used): 2118 ms
[2023-03-21 04:04:36] [INFO ] Transformed 2746 places.
[2023-03-21 04:04:36] [INFO ] Transformed 42776 transitions.
[2023-03-21 04:04:36] [INFO ] Found NUPN structural information;
[2023-03-21 04:04:36] [INFO ] Parsed PT model containing 2746 places and 42776 transitions and 723933 arcs in 2523 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 59 resets, run finished after 1368 ms. (steps per millisecond=7 ) properties (out of 15) seen :3
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 42776 rows 2746 cols
[2023-03-21 04:04:42] [INFO ] Computed 10 place invariants in 1753 ms
[2023-03-21 04:04:44] [INFO ] After 2204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-21 04:04:45] [INFO ] Flatten gal took : 6185 ms
[2023-03-21 04:04:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 47 ms returned sat
[2023-03-21 04:04:50] [INFO ] Flatten gal took : 5087 ms
[2023-03-21 04:04:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7501577857611123215.gal : 771 ms
[2023-03-21 04:04:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12730597769268947.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/ReachabilityCardinality7501577857611123215.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12730597769268947.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 ...326
[2023-03-21 04:05:09] [INFO ] After 25034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 164 out of 2746 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2746/2746 places, 42776/42776 transitions.
Graph (trivial) has 2425 edges and 2746 vertex of which 142 / 2746 are part of one of the 23 SCC in 37 ms
Free SCC test removed 119 places
Drop transitions removed 151 transitions
Reduce isomorphic transitions removed 151 transitions.
Graph (complete) has 4721 edges and 2627 vertex of which 2611 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.211 ms
Discarding 16 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 1734 transitions
Trivial Post-agglo rules discarded 1734 transitions
Performed 1734 trivial Post agglomeration. Transition count delta: 1734
Iterating post reduction 0 with 1742 rules applied. Total rules applied 1744 place count 2611 transition count 40875
Reduce places removed 1734 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 1763 rules applied. Total rules applied 3507 place count 877 transition count 40846
Reduce places removed 11 places and 0 transitions.
Performed 108 Post agglomeration using F-continuation condition.Transition count delta: 108
Iterating post reduction 2 with 119 rules applied. Total rules applied 3626 place count 866 transition count 40738
Reduce places removed 108 places and 0 transitions.
Iterating post reduction 3 with 108 rules applied. Total rules applied 3734 place count 758 transition count 40738
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 105 Pre rules applied. Total rules applied 3734 place count 758 transition count 40633
Deduced a syphon composed of 105 places in 49 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 4 with 210 rules applied. Total rules applied 3944 place count 653 transition count 40633
Discarding 81 places :
Symmetric choice reduction at 4 with 81 rule applications. Total rules 4025 place count 572 transition count 40552
Iterating global reduction 4 with 81 rules applied. Total rules applied 4106 place count 572 transition count 40552
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 4 with 3 rules applied. Total rules applied 4109 place count 572 transition count 40549
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4110 place count 571 transition count 40549
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 4110 place count 571 transition count 40547
Deduced a syphon composed of 2 places in 40 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 4114 place count 569 transition count 40547
Discarding 34 places :
Symmetric choice reduction at 6 with 34 rule applications. Total rules 4148 place count 535 transition count 3065
Iterating global reduction 6 with 34 rules applied. Total rules applied 4182 place count 535 transition count 3065
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 4188 place count 535 transition count 3059
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 4193 place count 530 transition count 3054
Iterating global reduction 7 with 5 rules applied. Total rules applied 4198 place count 530 transition count 3054
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4199 place count 529 transition count 3053
Iterating global reduction 7 with 1 rules applied. Total rules applied 4200 place count 529 transition count 3053
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 4 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 7 with 80 rules applied. Total rules applied 4280 place count 489 transition count 3013
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4281 place count 489 transition count 3012
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 4287 place count 483 transition count 3006
Iterating global reduction 8 with 6 rules applied. Total rules applied 4293 place count 483 transition count 3006
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 4296 place count 480 transition count 3003
Iterating global reduction 8 with 3 rules applied. Total rules applied 4299 place count 480 transition count 3003
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 4301 place count 478 transition count 3001
Iterating global reduction 8 with 2 rules applied. Total rules applied 4303 place count 478 transition count 3001
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 4315 place count 472 transition count 3019
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 4318 place count 472 transition count 3016
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 4321 place count 472 transition count 3013
Free-agglomeration rule applied 87 times.
Iterating global reduction 9 with 87 rules applied. Total rules applied 4408 place count 472 transition count 2926
Reduce places removed 87 places and 0 transitions.
Iterating post reduction 9 with 87 rules applied. Total rules applied 4495 place count 385 transition count 2926
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 4498 place count 382 transition count 2923
Iterating global reduction 10 with 3 rules applied. Total rules applied 4501 place count 382 transition count 2923
Drop transitions removed 525 transitions
Redundant transition composition rules discarded 525 transitions
Iterating global reduction 10 with 525 rules applied. Total rules applied 5026 place count 382 transition count 2398
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 10 with 8 rules applied. Total rules applied 5034 place count 382 transition count 2398
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 5039 place count 382 transition count 2393
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 5041 place count 382 transition count 2393
Applied a total of 5041 rules in 12707 ms. Remains 382 /2746 variables (removed 2364) and now considering 2393/42776 (removed 40383) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12711 ms. Remains : 382/2746 places, 2393/42776 transitions.
Incomplete random walk after 10000 steps, including 148 resets, run finished after 542 ms. (steps per millisecond=18 ) properties (out of 12) seen :3
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2393 rows 382 cols
[2023-03-21 04:05:23] [INFO ] Computed 10 place invariants in 43 ms
[2023-03-21 04:05:23] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-21 04:05:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2023-03-21 04:05:25] [INFO ] After 1929ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-21 04:05:26] [INFO ] State equation strengthened by 1479 read => feed constraints.
[2023-03-21 04:05:29] [INFO ] After 3431ms SMT Verify possible using 1479 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-21 04:05:31] [INFO ] Deduced a trap composed of 40 places in 1851 ms of which 19 ms to minimize.
[2023-03-21 04:05:32] [INFO ] Deduced a trap composed of 50 places in 1318 ms of which 1 ms to minimize.
[2023-03-21 04:05:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3449 ms
[2023-03-21 04:05:34] [INFO ] Deduced a trap composed of 51 places in 1331 ms of which 2 ms to minimize.
[2023-03-21 04:05:35] [INFO ] Deduced a trap composed of 53 places in 1018 ms of which 1 ms to minimize.
[2023-03-21 04:05:36] [INFO ] Deduced a trap composed of 45 places in 1135 ms of which 2 ms to minimize.
[2023-03-21 04:05:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3816 ms
[2023-03-21 04:05:38] [INFO ] Deduced a trap composed of 56 places in 1263 ms of which 1 ms to minimize.
[2023-03-21 04:05:39] [INFO ] Deduced a trap composed of 45 places in 1107 ms of which 0 ms to minimize.
Loading property file /tmp/ReachabilityCardinality12730597769268947.prop.
[2023-03-21 04:05:40] [INFO ] Deduced a trap composed of 55 places in 1221 ms of which 0 ms to minimize.
[2023-03-21 04:05:42] [INFO ] Deduced a trap composed of 66 places in 1200 ms of which 1 ms to minimize.
[2023-03-21 04:05:43] [INFO ] Deduced a trap composed of 58 places in 1047 ms of which 0 ms to minimize.
[2023-03-21 04:05:44] [INFO ] Deduced a trap composed of 68 places in 1017 ms of which 1 ms to minimize.
[2023-03-21 04:05:45] [INFO ] Deduced a trap composed of 61 places in 1052 ms of which 1 ms to minimize.
[2023-03-21 04:05:46] [INFO ] Deduced a trap composed of 58 places in 990 ms of which 1 ms to minimize.
[2023-03-21 04:05:47] [INFO ] Deduced a trap composed of 47 places in 1129 ms of which 2 ms to minimize.
[2023-03-21 04:05:49] [INFO ] Deduced a trap composed of 51 places in 1076 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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-21 04:05:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 04:05:49] [INFO ] After 25402ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 113 ms.
Support contains 122 out of 382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 2393/2393 transitions.
Graph (trivial) has 87 edges and 382 vertex of which 2 / 382 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 381 transition count 2359
Reduce places removed 32 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 40 rules applied. Total rules applied 73 place count 349 transition count 2351
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 81 place count 341 transition count 2351
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 81 place count 341 transition count 2346
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 91 place count 336 transition count 2346
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 94 place count 333 transition count 2343
Iterating global reduction 3 with 3 rules applied. Total rules applied 97 place count 333 transition count 2343
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 98 place count 332 transition count 2342
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 332 transition count 2342
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 119 place count 322 transition count 2332
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 122 place count 322 transition count 2329
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 130 place count 314 transition count 2321
Iterating global reduction 4 with 8 rules applied. Total rules applied 138 place count 314 transition count 2321
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 147 place count 314 transition count 2312
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 150 place count 311 transition count 2309
Iterating global reduction 5 with 3 rules applied. Total rules applied 153 place count 311 transition count 2309
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 157 place count 311 transition count 2305
Free-agglomeration rule applied 11 times.
Iterating global reduction 5 with 11 rules applied. Total rules applied 168 place count 311 transition count 2294
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 180 place count 300 transition count 2293
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 183 place count 300 transition count 2290
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 184 place count 300 transition count 2290
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 185 place count 300 transition count 2289
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 186 place count 300 transition count 2289
Applied a total of 186 rules in 2989 ms. Remains 300 /382 variables (removed 82) and now considering 2289/2393 (removed 104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2991 ms. Remains : 300/382 places, 2289/2393 transitions.
Incomplete random walk after 10000 steps, including 166 resets, run finished after 432 ms. (steps per millisecond=23 ) properties (out of 8) seen :2
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2289 rows 300 cols
[2023-03-21 04:05:52] [INFO ] Computed 10 place invariants in 23 ms
[2023-03-21 04:05:53] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-21 04:05:53] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-21 04:05:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-21 04:05:55] [INFO ] After 1783ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-21 04:05:55] [INFO ] State equation strengthened by 1717 read => feed constraints.
[2023-03-21 04:05:58] [INFO ] After 3315ms SMT Verify possible using 1717 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-21 04:05:59] [INFO ] Deduced a trap composed of 33 places in 1032 ms of which 1 ms to minimize.
[2023-03-21 04:06:01] [INFO ] Deduced a trap composed of 60 places in 1190 ms of which 0 ms to minimize.
[2023-03-21 04:06:02] [INFO ] Deduced a trap composed of 50 places in 1240 ms of which 1 ms to minimize.
[2023-03-21 04:06:03] [INFO ] Deduced a trap composed of 34 places in 922 ms of which 1 ms to minimize.
[2023-03-21 04:06:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 4839 ms
[2023-03-21 04:06:05] [INFO ] Deduced a trap composed of 57 places in 1189 ms of which 0 ms to minimize.
[2023-03-21 04:06:06] [INFO ] Deduced a trap composed of 37 places in 1015 ms of which 0 ms to minimize.
[2023-03-21 04:06:07] [INFO ] Deduced a trap composed of 51 places in 1057 ms of which 1 ms to minimize.
[2023-03-21 04:06:08] [INFO ] Deduced a trap composed of 60 places in 1165 ms of which 0 ms to minimize.
[2023-03-21 04:06:09] [INFO ] Deduced a trap composed of 55 places in 1196 ms of which 0 ms to minimize.
[2023-03-21 04:06:11] [INFO ] Deduced a trap composed of 55 places in 1174 ms of which 1 ms to minimize.
[2023-03-21 04:06:12] [INFO ] Deduced a trap composed of 55 places in 896 ms of which 0 ms to minimize.
[2023-03-21 04:06:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 8289 ms
[2023-03-21 04:06:13] [INFO ] Deduced a trap composed of 46 places in 1421 ms of which 2 ms to minimize.
[2023-03-21 04:06:15] [INFO ] Deduced a trap composed of 48 places in 1318 ms of which 1 ms to minimize.
[2023-03-21 04:06:16] [INFO ] Deduced a trap composed of 47 places in 1264 ms of which 1 ms to minimize.
[2023-03-21 04:06:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 4270 ms
[2023-03-21 04:06:18] [INFO ] Deduced a trap composed of 60 places in 1315 ms of which 1 ms to minimize.
[2023-03-21 04:06:20] [INFO ] Deduced a trap composed of 2 places in 1972 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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-21 04:06:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 04:06:20] [INFO ] After 26994ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 73 ms.
Support contains 35 out of 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 2289/2289 transitions.
Graph (trivial) has 182 edges and 300 vertex of which 18 / 300 are part of one of the 8 SCC in 4 ms
Free SCC test removed 10 places
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 1045 edges and 290 vertex of which 289 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 75 rules applied. Total rules applied 77 place count 289 transition count 2195
Reduce places removed 74 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 1 with 79 rules applied. Total rules applied 156 place count 215 transition count 2190
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 5 rules applied. Total rules applied 161 place count 214 transition count 2186
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 165 place count 210 transition count 2186
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 165 place count 210 transition count 2177
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 183 place count 201 transition count 2177
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 197 place count 187 transition count 1908
Iterating global reduction 4 with 14 rules applied. Total rules applied 211 place count 187 transition count 1908
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 212 place count 187 transition count 1907
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 219 place count 180 transition count 1899
Iterating global reduction 5 with 7 rules applied. Total rules applied 226 place count 180 transition count 1899
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 227 place count 180 transition count 1898
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 230 place count 177 transition count 1895
Iterating global reduction 6 with 3 rules applied. Total rules applied 233 place count 177 transition count 1895
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 234 place count 177 transition count 1894
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 235 place count 176 transition count 1893
Iterating global reduction 7 with 1 rules applied. Total rules applied 236 place count 176 transition count 1893
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 270 place count 159 transition count 1876
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 283 place count 159 transition count 1863
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 299 place count 143 transition count 1847
Iterating global reduction 8 with 16 rules applied. Total rules applied 315 place count 143 transition count 1847
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 316 place count 143 transition count 1846
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 322 place count 137 transition count 1840
Iterating global reduction 9 with 6 rules applied. Total rules applied 328 place count 137 transition count 1840
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 329 place count 137 transition count 1839
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 331 place count 135 transition count 1837
Iterating global reduction 10 with 2 rules applied. Total rules applied 333 place count 135 transition count 1837
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 338 place count 135 transition count 1832
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 340 place count 134 transition count 1838
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 343 place count 134 transition count 1835
Free-agglomeration rule applied 22 times.
Iterating global reduction 11 with 22 rules applied. Total rules applied 365 place count 134 transition count 1813
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 25 rules applied. Total rules applied 390 place count 112 transition count 1810
Renaming transitions due to excessive name length > 1024 char.
Drop transitions removed 388 transitions
Redundant transition composition rules discarded 388 transitions
Iterating global reduction 12 with 388 rules applied. Total rules applied 778 place count 112 transition count 1422
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 12 with 5 rules applied. Total rules applied 783 place count 112 transition count 1422
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 785 place count 112 transition count 1420
Applied a total of 785 rules in 2316 ms. Remains 112 /300 variables (removed 188) and now considering 1420/2289 (removed 869) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2316 ms. Remains : 112/300 places, 1420/2289 transitions.
Incomplete random walk after 10000 steps, including 302 resets, run finished after 409 ms. (steps per millisecond=24 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 354143 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :{}
Probabilistic random walk after 354143 steps, saw 55361 distinct states, run finished after 3003 ms. (steps per millisecond=117 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1420 rows 112 cols
[2023-03-21 04:06:26] [INFO ] Computed 10 place invariants in 9 ms
[2023-03-21 04:06:26] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-21 04:06:26] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 04:06:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-21 04:06:27] [INFO ] After 847ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 04:06:27] [INFO ] State equation strengthened by 1312 read => feed constraints.
[2023-03-21 04:06:28] [INFO ] After 1078ms SMT Verify possible using 1312 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 04:06:29] [INFO ] Deduced a trap composed of 16 places in 686 ms of which 1 ms to minimize.
[2023-03-21 04:06:29] [INFO ] Deduced a trap composed of 11 places in 673 ms of which 1 ms to minimize.
[2023-03-21 04:06:30] [INFO ] Deduced a trap composed of 19 places in 701 ms of which 1 ms to minimize.
[2023-03-21 04:06:31] [INFO ] Deduced a trap composed of 13 places in 565 ms of which 6 ms to minimize.
[2023-03-21 04:06:31] [INFO ] Deduced a trap composed of 13 places in 516 ms of which 1 ms to minimize.
[2023-03-21 04:06:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3476 ms
[2023-03-21 04:06:32] [INFO ] After 5014ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 319 ms.
[2023-03-21 04:06:32] [INFO ] After 6363ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 31 ms.
Support contains 35 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 1420/1420 transitions.
Applied a total of 0 rules in 228 ms. Remains 112 /112 variables (removed 0) and now considering 1420/1420 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 231 ms. Remains : 112/112 places, 1420/1420 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 1420/1420 transitions.
Applied a total of 0 rules in 228 ms. Remains 112 /112 variables (removed 0) and now considering 1420/1420 (removed 0) transitions.
[2023-03-21 04:06:33] [INFO ] Invariant cache hit.
[2023-03-21 04:06:33] [INFO ] Implicit Places using invariants in 335 ms returned [111]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 341 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 111/112 places, 1420/1420 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 111 transition count 1415
Reduce places removed 5 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 9 rules applied. Total rules applied 14 place count 106 transition count 1411
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 18 place count 102 transition count 1411
Performed 22 Post agglomeration using F-continuation condition with reduction of 1160 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 62 place count 80 transition count 229
Drop transitions removed 5 transitions
Ensure Unique test removed 93 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 3 with 98 rules applied. Total rules applied 160 place count 80 transition count 131
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 170 place count 75 transition count 126
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 174 place count 73 transition count 142
Drop transitions removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 4 with 25 rules applied. Total rules applied 199 place count 73 transition count 117
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 202 place count 73 transition count 114
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 205 place count 70 transition count 114
Applied a total of 205 rules in 56 ms. Remains 70 /111 variables (removed 41) and now considering 114/1420 (removed 1306) transitions.
// Phase 1: matrix 114 rows 70 cols
[2023-03-21 04:06:33] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-21 04:06:33] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-21 04:06:33] [INFO ] Invariant cache hit.
[2023-03-21 04:06:33] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-21 04:06:33] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 70/112 places, 114/1420 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 814 ms. Remains : 70/112 places, 114/1420 transitions.
Finished random walk after 4242 steps, including 227 resets, run visited all 4 properties in 16 ms. (steps per millisecond=265 )
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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)
All properties solved without resorting to model-checking.
Total runtime 119544 ms.

BK_STOP 1679371595058

--------------------
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="StigmergyCommit-PT-08b"
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 StigmergyCommit-PT-08b, 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 r453-smll-167912645500502"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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